Prim's Algorithm Visualizer

Unvisited

Considering

In MST

Speed 1x

Step 0/0

Ready to start...

Pseudocode

Prim(Graph, start):
 ∀u: key[u]=∞, parent[u]=null
 key[start] = 0
 MST = {}
 while MST not full:
 u = minKey(not in MST)
 MST.add(u)
 for v in neighbors(u):
 if v∉MST ∧ w(u,v)<key[v]:
 key[v] = w(u,v)
 parent[v] = u

Priority Queue

Node	Key	Parent	MST

Complexity

Time (Matrix)

O(V²)

Space

O(V)

With Binary Heap + Adj List: O(E log V)