P214: Enumeration of all the minimum spanning trees in a graph

P214: Enumeration of all the minimum spanning trees in a graph

Input:

An weighted graph $G = (V, E)$.

Output:

All the minimum spanning trees in $G$.

Complexity:

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

Comment:

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

Reference:

[Yamada2010] (Bibtex)