P15: Enumeration of all spanning trees in a graph

P15: Enumeration of all spanning trees in a graph

Input:

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

Output:

All spanning trees included in $G$.

Complexity:

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

Comment:

$N$ = number of spanning trees in $G$.

Reference:

[Shioura1997] (Bibtex)