A Classical Approach for Generation of Minimum Spanning Tree

This paper intends to introduce some innovative concepts for generation of Minimum Spanning Tree (MST) of weighted graph G. We will also formulate a new circuit testing algorithm to find out circuits during generation of Minimum Spanning Tree of the graph, along with an attempt to optimize the execution time of the algorithms. The primary aim of this paper is to represent the minimum spanning tree algorithms in a simple and efficient manner.