Skip to content

Minimum Spanning Tree

For this a weighted graph is required. Minimum spanning tree of a graph is set of all the edges which connect all the vertices of the graph with the minimum total weight. The aim is to find a minimum spanning tree. There can be multiple minimum spanning tree for a graph.