P73: Enumeration of all spanning tree in a graph

P73: Enumeration of all spanning tree in a graph

Input:

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

Output:

All spanning tree of $G$.

Complexity:

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

Comment:

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

Reference:

[Kapoor1991] (Bibtex)