P52: Enumeration of all spanning trees in a graph

P52: Enumeration of all spanning trees in a graph

Input:

A graph $G = (V, E)$ and an integer $k$.

Output:

The all spanning trees in $G$ in order.

Complexity:

$O(N|V|)$ total time and $O(N + |E|)$ space, $N$ is the number of spanning trees in $G$.

Comment:

Reference:

[Gabow1977] (Bibtex)