P120: Enumeration of all directed spanning trees in a directed graph

P120: Enumeration of all directed spanning trees in a directed graph

Input:

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

Output:

All directed spanning trees in $G$.

Complexity:

$O(|E| \log |V| + |V| + N \log^2 |V|)$ total time and $O(|E| + |V|)$ space.

Comment:

$N$ is the number of directed spanning trees.

Reference:

[Uno1998a] (Bibtex)