P84: Enumeration of all spanning trees in a graph in non-decreasing order

P84: Enumeration of all spanning trees in a graph in non-decreasing order

Input:

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

Output:

All spanning trees in $G$ in non-decreasing order.

Complexity:

$O(|V| + |E| + \tau|V|)$ time and $O(\tau|V| + |E|)$ space.

Comment:

Using breadth first manner.

Reference:

[Matsui1997] (Bibtex)