P8: Enumeration of all cycles in a planar graph

P8: Enumeration of all cycles in a planar graph

Input:

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

Output:

All cycles in $G$.

Complexity:

$O(|V|(C+1))$ total time and $O(|V|)$ space.

Comment:

$C$ is the number of cycles included in $G$.

Reference:

[Syso1981] (Bibtex)