Apr 12, 2020
4 min read
Minimum Spanning Tree Algorithm
What is Spanning Tree?
A Spanning tree is a subset of an undirected Graph that has connected all the vertices by minimum number of edges. If all the vertices are connected in a graph, then there will be at least one spanning tree present in the graph. In a graph, there can be more than one spanning trees.
Properties:
· A spanning tree does not create a cycle
· Any vertex can be reached by any other vertex
Example:
