I have used the combinatorica package, but the extract cycle in this package only gives a maximal list of edge-disjoint cycles in graph. And i need to detect all the cycles not only edge-disjoint one .. Anyone has any idea how to accomplish this?
Is there any other way to find all possible lists of edges which make up a cycle in a graph without/with using the combinatorical package?
Thanks in advanced :)