Main Article Content
Abstract
The spanning tree is a combination of edges and vertices in such a way so that graph does not hold any cycle. For one graph G, it is possible to have more than one spanning trees. The minimum spanning tree in a graph is a subgroup of same graph that associates all vertices with absolute possible maximum edge weight. Different algorithms are used for generating the minimum spanning tree and one such algorithm is prim’s algorithm. The main objective in this paper is to show the comparisons of different methods that are used with prim’s algorithm for solving the problem of minimum spanning tree in various real world applications. This paper includes the concept of Prim technique for finding the maximum edge weight and the comparison of its different variants with respect to various usage applications.