Hi Guys, On Jul 12, 2005, at 8:25 AM, Douglas Gregor wrote:
The major problem here is that you shouldn't be dereferencing vertices(databaseGraph).second, because it is a past-the-end iterator. You could rewrite the loop as:
while (vertices(databaseGraph).first != vertices(databaseGraph).second) { b = *vertices(databaseGraph).first; clear_vertex(b, databaseGraph); remove_vertex(b, databaseGraph); }
But the above loop could also have problems due to vertex iterator invalidation caused by remove_vertex... it depends on the graph used.
Can you let me know what is the correct way of deleting all edges and vertices in a mutable property undirected graph.
The easy way is just "databaseGraph.clear()"
Yep. Cheers, Jeremy _______________________________________________ Jeremy Siek <jsiek@osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Candidate, Indiana University Bloomington C++ Booster (http://www.boost.org) _______________________________________________