Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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