A spanning tree of a graph is just a subgraph that contains all the vertices and is a tree with no cycle. A graph may have many spanning trees.
A spanning tree of a graph with minimum cost is called ‘minimum cost spanning tree’.
Algorithms to find Minimum Cost Spanning Tree or Minimum Spanning Tree is :
1. Prim's Algorithm.
2. Kruskal's Algorithm
If you have any doubt then you can comment bellow or you can mail me.
Email: [email protected]
facebook: https://www.facebook.com/sourav.s.nag
Twitter: https://twitter.com/SRN9999
