Hello all,
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).
I've tried to port the Network X code to Graph-Tool, but there are
un-matching parallels in the data structures of both tools. e.g.
Graph-Tool prefers to label with property maps. Since I've only begun using
Graph-Tool a short while ago, this task is difficult for me.
Any help would be appreciated, many thanks in advance.