P478: Enumeration of all spanning trees in a graph

P478: Enumeration of all spanning trees in a graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

Comment:

Reference:

[Bellert1962] (Bibtex)