P1: Enumeration of all spanning trees in a graph

P1: Enumeration of all spanning trees in a graph

Input:

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

Output:

All spanning trees of $G$.

Complexity:

Comment:

In this paper, 'trees' indicate 'spanning trees'.

Reference:

[Minty1965] (Bibtex)