##
Greedy Algorithms | Set 5 (Prim’s Minimum Spanning Tree (MST))
November 18, 2012

We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree.