Enumerating Cycles of a Directed Graph

An elementary cycle in a directed graph is a sequence of vertices in the graph such that for , there exists an edge from to , as well as one from to , and that no vertex appears more than once in the sequence. Two elementary cycles are distinct if one is not a cyclic permutation of the other.

Note that Mathematica 7 does not have a native circuit finding method.

Reference

[1] D. B. Johnson, "Finding All the Elementary Circuits of a Directed Graph," SIAM Journal of Computing, 4(1), 1975 pp. 77–84. http://dutta.csc.ncsu.edu/csc791_spring07/wrap/circuits_johnson.pdf.