BGL: Finding all simple cycles in an undirected graph
Hello, I am looking for a way to find all simple cycles in an undirected graph. I need it to reconstruct a 3D mesh from a graph containing the mesh vertices and edges. Any hints? Cheers, Torsten
Hint: you can start finding strongly connected components.
Could you hint a bit more specific how to do this for undirected graphs? Torsten Am 23.12.2007 um 09:43 schrieb Michał Nowotka:
Hint: you can start finding strongly connected components. _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
You can read about strongly connected components here: http://en.wikipedia.org/wiki/Strongly_connected_component If I understand your problem correctly this is exactly what you are looking for. And now how to find SCC using BGL (with example): http://www.boost.org/libs/graph/doc/strong_components.html Cheers, Michał Nowotka
participants (2)
-
Michał Nowotka -
Torsten Sadowski