27 Jul
2004
27 Jul
'04
9:04 p.m.
On Tuesday 27 July 2004 4:01 pm, Daniele Carlucci wrote:
typedef adjacency_list
In the first one, the edges outgoing from a vertex are stored in an std::list; in the second one, the edges outgoing from a vertex are stored in an std::vector. There's actually a good description of how to choose the right data structures here:
http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing -graph-type
Doug
Yes but you have descript me only the first element the second vecS what does it mean?
Same idea, but for the list (or vector) of vertices. It's all described in that link. Doug