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

From: Torsten Sadowski (tsadowski_at_[hidden])
Date: 2007-12-23 18:02:45

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_at_[hidden]
> http://listarchives.boost.org/mailman/listinfo.cgi/boost-users