Re: [graph-tool] Simple Cycle Finder

On 17.10.2014 03:11, tanzairatier wrote:

I'm wondering if anyone can suggest a strategy for finding elementary cycles with Graph-Tool. I'm working also with Network X, and they have a function for this, called simple_cycles(G). That function essentially runs Tarjan's Algorithm to find all strongly connected components, and then detects cycles within each of those components (this approach is called Johnson's Algorithm).

Please open an issue for this at the website, and I'll implement the algorithm when I find some time.

Best, Tiago