Prim's Algorithm
Grow MST from a start vertex using priority queue for lightest edge.
graphsmstgreedyUpdated 2025-09-01
Complexity
- Adj list + heap O(E log V)
Invariant
- Cut property ensures minimality
Grow MST from a start vertex using priority queue for lightest edge.