Prim's algorithm + binary heap (Undirected, 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(V)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == - == Reference ==")
Time Complexity
$O(ElogV)$
Space Complexity
$O(V)$ auxiliary? words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-