DEFINITION
Let G=(V,E,W) be any weighted graph. Then a spanning tree whose cost is minimum is called minimum spanning tree. The cost of the spanning tree is defined as the sum of the costs of the edges in that tree.
The two method's used are
1. Prim's Algorithm2. Kruskal's Algorithm
