P6: Enumeration of all cycles in a directed graph

P6: Enumeration of all cycles in a directed graph

Input:

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

Output:

All cycles in $G$.

Complexity:

$O((|V|\cdot |E|)(C+1))$ total time and $O(|V| + |E|)$ space.

Comment:

$C$ is the number of cycles included in $G$.

Reference:

[Tarjan1973] (Bibtex)