Boost Users :

Date view	Thread view	Subject view	Author view

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

Next message: Michał Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Previous message: Richard Turrin: "[Boost-users] [Serialization] BOOST_CLASS_EXPORT_GUID_1 macro issue (SVN Trunk)"
In reply to: Micha³ Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Next in thread: Michał Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Reply: Michał Nowotka: "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_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users

Next message: Michał Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Previous message: Richard Turrin: "[Boost-users] [Serialization] BOOST_CLASS_EXPORT_GUID_1 macro issue (SVN Trunk)"
In reply to: Micha³ Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Next in thread: Michał Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"
Reply: Michał Nowotka: "Re: [Boost-users] BGL: Finding all simple cycles in an undirected graph"

Date view	Thread view	Subject view	Author view

Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net