P393: Enumeration of all simple paths in a graph

P393: Enumeration of all simple paths in a graph

Input:

A graph $G$.

Output:

All simple paths in $G$.

Complexity:

Comment:

Reference:

[Ponstein1966] (Bibtex)