Illustrate Prims algorithm to determine the minimum spanning

Illustrate Prim\'s algorithm to determine the minimum spanning tree. Draw the minimum spanning tree and

Solution

A spanning tree of a graph is just a subgraph that contains all the vertices and is a tree. A graph may have many spanning trees; for instance the complete graph on four vertices

has sixteen spanning trees: