Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph

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