P110: Enumeration of all spanning trees

P110: Enumeration of all spanning trees

Input:

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

Output:

All spanning trees in $G$.

Complexity:

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

Comment:

$N$ is the number of spanning trees in $G$.

Reference:

[Shioura1995] (Bibtex)