P68: Enumeration of all spanning trees in a directed graph

P68: Enumeration of all spanning trees in a directed graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

$O(|V| + |E| + |E|N)$ total time and $O(|V| + |E|)$ space.

Comment:

$N$ is the number of spanning trees in $G$.

Reference:

[Gabow1978] (Bibtex)