dsa2 min read
Prim's Algorithm — MST via Min-Heap Greedy Expansion
Build the minimum spanning tree using Prim's algorithm: start from any vertex, greedily expand by always adding the minimum-weight crossing edge using a min-heap.
Read →
Prim
2 articles
dsa1 min read
Minimum Cost to Connect All Points — Prim's on Complete Graph
Connect all n points with minimum total Manhattan distance cost. Models the problem as a complete graph MST and applies optimised Prim's without building all O(n²) edges explicitly.
Read →