P471: Enumeration of all spanning trees in a graph

P471: Enumeration of all spanning trees in a graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

Comment:

This paper shows an equation for computing the set of spanning trees in $G$.

Reference:

[Percival1953] (Bibtex)