A New Algorithmic Approach to Finding Minimum Spanning Tree

Spanning tree of a graph is formed when each and every vertex of a graph are connected having no cycles in them and therefore minimum spanning tree as its name refers, is the tree with the smallest possible length among all spanning trees. Calculating minimum spanning tree of a graph has always been a common problem throughout ages. A number of efficient algorithms has been already developed for this problem. In this paper a different approach has been proposed where we profusely used sets and disjoint sets union data structure for reducing the number of edges under consideration while determining minimum spanning tree of a graph.