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

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