Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(ElogV)$

Space Complexity

$O(E)$ words

(https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tarjan_(directed,_general)_(Directed_(Optimum_Branchings),_General_MST_Minimum_Spanning_Tree_(MST))&oldid=45081"