Boost logo

Boost Users :

From: Thomas Costa (oohrah_at_[hidden])
Date: 2004-07-27 15:50:39

The first one will use an instantiation of std::list as the storage
container for the out edge list of the graph and the second will use
std::vector. Hence the performance characteristics (in time and memory)
of various operations involving edges, like addition of edges, removal
of edges, etc. will vary between the two.

Look at
graph-type for more discussion of this.

On Jul 27, 2004, at 1:00 PM, Daniele Carlucci wrote:

> Hi,
> I'm a newby.
> Anyone can explain me the difference between:
> typedef adjacency_list<listS, vecS, undirectedS...
> and
> typedef adjacency_list<vecS, vecS, undirectedS...
> Thanks
> Daniele
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at