--- Alejandro Aragon
Hello everyone. I'm trying to implement Fleury's algorithm to find an Eulerian path in a graph. Every time I erase an edge in the graph, I need to check how many connected components I have (because I can't erase an edge that is a "bridge"). Also, I was using in the beginning graphs with VertexList=VecS but it turns out that when you erase an edge all the vertex descriptors are invalidated.
Vertex descriptors should only be invalidated upon a remove_vertex call, not a remove_edge call.
Thus, I had to copy my graph to another one with VertexList=listS.
I was wondering if the connected components algorithm works with this type of graph. I'm having an error.
An adjacency_list with VertexList=listS does not automatically contain a vertex_index property map, as it would with VertexList=vecS. HTH, Cromwell D. Enage __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com