P444: Enumeration of all cycles in a directed graph.

P444: Enumeration of all cycles in a directed graph.

Input:

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

Output:

All cycles in $G$.

Complexity:

$O(|V| + |E|)$ time per solution.

Comment:

Reference:

[Loizou1982] (Bibtex)