P102: Enumeration of all spanning trees in a graph

P102: Enumeration of all spanning trees in a graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

$O(|E|)$ time per spanning tree with $O(|E|)$ space.

Comment:

Reference:

[Read1975] (Bibtex)