Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Revision as of 08:54, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(E \log V)$

Space Complexity

$O(V)$ auxiliary words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1926

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Borůvka%27s_algorithm_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46953"