Introduction of Minimum Spanning Tree
A tree is a graph with the following properties:
Given a connected undirected graph, a spanning tree of that graph is a subgraph that is a tree and joined all vertices. A single graph can have many spanning trees.
For the above-connected graph. There can be multiple spanning Trees like
Properties of Spanning Tree:
Addition of even one single edge results in the spanning tree losing its property of Acyclicity and elimination of one single edge results in its losing the property of connectivity.
Minimum Spanning Tree:
Minimum Spanning Tree is a Spanning Tree which has minimum total cost. If we have a linked undirected graph with a weight (or cost) combine with each edge. Then the cost of spanning tree would be the sum of the cost of its edges.