P392: Enumeration of all simple cycles in a graph

P392: Enumeration of all simple cycles in a graph

Input:

A graph $G$.

Output:

All simple cycles in $G$.

Complexity:

Comment:

Reference:

[Ponstein1966] (Bibtex)