P489: Enumeration of all cycles in a graph

P489: Enumeration of all cycles in a graph

Input:

A graph $G= (V, E)$.

Output:

All cycles in $G$.

Complexity:

$O(|V|^2 \alpha)$ total time with $O(|V|)$ space.

Comment:

Use cycle vectors. Here, $\alpha$ is the number of solutions.

Reference:

[DOGRUSOZ1996] (Bibtex)