MINIMUM SPANNING TREE
What is Spanning Tree?
A spanning tree is a subset of Graph A, which has all the vertices covered with minimum possible number of edges. If there are ’n’ number of vertices than ‘n-1’ is the number of edges connected to form spanning tree. Spanning tree should not be in the form of cycle, it should be always disconnected.
A tree has one path joins any two vertices. A spanning tree of a graph is a tree that:
· Contains all the original graph’s vertices.
· Reaches out to (spans) all vertices.
· It is acyclic. In…