P106: Enumeration of all paths in a directed graph

P106: Enumeration of all paths in a directed graph

Input:

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

Output:

All paths in $G$.

Complexity:

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

Comment:

Reference:

[Read1975] (Bibtex)