P117: Enumeration of all bases of a graphic matroid in a graph

P117: Enumeration of all bases of a graphic matroid in a graph

Input:

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

Output:

All bases of a graphic matroid in $G$.

Complexity:

$O(|V| + |E| + N)$ total time and $O(|V| + |E|)$ space.

Comment:

$N$ is the number of solutions. If $G$ is connected, any base is a spanning tree.

Reference:

[Uno1998] (Bibtex)