Articles in this series
Introduction Prim's algorithm is a greedy algorithm used to find the minimum spanning tree (MST) of a weighted undirected graph. A spanning tree of a...