Enumeration of the Elementary Circuits of a Directed Graph

摘要

An algorithm to enumerate all the elementary circuits of a directed graph is presented. The algorithm uses backtracking with lookahead to avoid unnecessary work, and it has a time bound of 0((V+E)(C+1)) when applied to a graph with V vertices, E edges, and C elementary circuits. (Author)