For the weighted Graph G=(V,E) the Spanning Tree G' = (V', E') is defined by the following rules
1. V' = V
2. E' is the subset of E with n-1 edges.
3. without any close path
The idea is to connect all the vertices with n-1 edges. A graph can have more than 1 spanning tree hence we will be interested in a spanning tree with minimum weight out of all spanning tree.
A weighted spanning tree with minimum cost is known as Minimum Spanning Tree.
Algorithms to calculate Minimum #SpanningTree are:
1. Prim's #Algorithm
2. #Kruskal's Algorithm
In this lecture get the details of Kruskal's Algorithm with example.
