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

From: Micha³ Nowotka (mmmnow_at_[hidden])
Date: 2007-12-23 18:27:00

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