P391: Enumeration of all spanning trees in a graph

P391: Enumeration of all spanning trees in a graph

Input:

A graph $G$.

Output:

All spanning trees in $G$.

Complexity:

Comment:

Reference:

[Hakimi1961] (Bibtex)