|
Boost Users : |
From: Daniele Carlucci (dax_at_[hidden])
Date: 2004-07-27 16:01:00
>>typedef adjacency_list<listS, vecS, undirectedS...
>>and
>>typedef adjacency_list<vecS, vecS, undirectedS...
>>
>>
>
>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?
Thanks
Daniele
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net