Design and development of novice conceptual approach for minimum spanning tree

Efficient routing problem exists from several years. Spanning tree plays very important role to design routing algorithms efficiently. To obtain the minimum cost a minimum spanning tree is formed from the given graph. Greedy technique plays important role to generate minimum spanning tree. Several approaches exists to solve minimum spanning tree but in this paper a new methodology is designed and developed to find minimum spanning tree using subtraction and remainder procedure. This procedure also uses Greedy approach. The main objective is to present a new way to find minimum spanning tree. An example is also given to understand the procedure in efficient way.