Prim’s Algorithm

Constructs a minimum spanning tree by growing a tree from a starting vertex and adding edges of minimum weight.