P370: Enumeration of all spanning trees in an undirected graph

P370: Enumeration of all spanning trees in an undirected graph

Input:

An undirected graph $G$.

Output:

All spanning trees in $G$.

Complexity:

Comment:

They analized Char's enumeration algorithm.

Reference:

[Jayakumar1984] (Bibtex)