P473: Enumeration all spanning trees in a graph

P473: Enumeration all spanning trees in a graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

Comment:

Reference:

[Piekarski1965] (Bibtex)