P412: Enumeration of all cycles in a finite undirected graph

P412: Enumeration of all cycles in a finite undirected graph

Input:

A finite undirected graph $G$.

Output:

All cycles in $G$.

Complexity:

Comment:

He claimed that J. T. Welch, Jr.'s algorithm is wrong.

Reference:

[Weinblatt1972] (Bibtex)