A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Herbert Weinblatt · Journal of the ACM · 1972
In many applications of directed graph theory, it is desired to obtain a list of the simple cycles of the graph.In this paper, a new search algorithm for finding the simple cycles of any finite directed graph is presented, and the validity of the algorithm is proven.The algorithm has been implemented experimentally in Snobol3, and tests indicate that the algorithm is reasonably fast.(The simple cycles of a 193 vertex graph were obtained in 6.8 seconds on an IBM 7094 computer.