Hello Bernhard, adding edges works exactly the same with lists as with vectors. But a vertex descriptor is no longer an int but an void*. This can complicate some things. If I understand BGL right, the property maps are taken automatically care of. You should call clear_vertex before remove_vertex. I ran into trouble with "dangling" edges. Cheers, Torsten Am 29.03.2008 um 00:22 schrieb Bernhard Lippmann:
-->http://lists.boost.org/boost-users/2008/03/34808.php
Hello Aaron,
you assumption is corrrect, I used a vecS:
typedef adjacency_list<listS, vecS, undirectedS, // Vertex properties property <vertex_name_t, std::string >, // Edge properties property <edge_weight_t, float, property <edge_index_t, std::size_t, property <edge_name_t, std::string >>>> TGraph;
I may change now to typedef adjacency_list<listS, listS, .....>, is there any sample code how to add_edges for listS and how to update the property maps, once I removed a single vertex or more ....
Best
Bernhard