P300: Enumeration of all spanning trees in a directed graph

P300: Enumeration of all spanning trees in a directed graph

Input:

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

Output:

All spanning trees in $G$.

Complexity:

INCORRECT: $O(N \log |V| + |V|^2\alpha(V, V) + |V||E|)$

Comment:

$\alpha$: the inverse Ackermann's function. [KR2000] gives this result is wrong.

Reference:

[Hariharan1995] (Bibtex)