Prim's algorithm is a greedy algorithm used to find the minimum spanning tree for a connected, undirected graph.

• Start with an arbitrary vertex and grow the tree by adding the shortest edge that connec...read more