High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

A Review on Minimum Spanning Tree Algorithms


M. K Salitha , Musaliar College of Engineering and Technology; Merin Mary Philip, Musaliar College of Engineering and Technology


Minimum Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm


The spanning tree is subset of a graph, which consists of all its vertices covered with minimum number of edges. A spanning tree does not contain cycle. A minimum spanning tree of an edge weighted graph is a spanning tree with the smallest possible weight than every other spanning tree for the same graph. Kruskal’s algorithm and Prim’s algorithm are the two widely used algorithms to obtain the minimum spanning tree of a graph. This paper aims at reviewing the construction of minimum spanning tree using Prim’s algorithm and Kruskal’s algorithm.

Other Details

Paper ID: IJSRDV7I110297
Published in: Volume : 7, Issue : 11
Publication Date: 01/02/2020
Page(s): 351-353

Article Preview

Download Article