Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Prim%27s_algorithm_%2B_binary_heap_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=45074"