Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

$O(V)$ auxiliary words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1957

Reference

https://ieeexplore.ieee.org/document/6773228

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