Negligence Minimum Spanning Tree Algorithm

Abstract

In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight(cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, weconsider a negligence algorithm to find a minimum spanning tree in another way. We report a comparison between our algorithm andKruskal's MST algorithm. We implemented some examples of the graphs to get the results in less time and more effectively.