P104: Enumeration of all cycles in a directed graph

P104: Enumeration of all cycles in a directed graph

Input:

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

Output:

All cycles in $G$.

Complexity:

$O(|E|)$ time per cycle with $O(|E|)$ space.

Comment:

Reference:

[Read1975] (Bibtex)