Home > Archives > IJSRST1841021 IJSRST-Library

Review of a Connected Graph Using Prim's Algorithm to Find a Minimum Spanning Tree

Authors(2) :-G. Kousika, Naveen L

The spanning tree T of an undirected graph G is a sub graph that is a tree, which Includes all of the vertices of G, with minimum possible number of edges .A minimum spanning tree is a subset of the edges of a connected edge weight undirected graph that connects all the vertices together without any cycles and with the minimum possible total edge weight. This paper highlights the concepts of minimum spanning tree using Primís algorithm and also includes a graphical representation of the algorithm.
G. Kousika, Naveen L
Connected Graph, Minimum Spanning Tree, Prim’s algorithm, Kruskal’s algorithm, travelling sales man problem.
  1. Review and analysis of minimum spanning tree using prim’s algorithm. Jogamohan Medak Assistant Professor, North Lakhimpur College (Autonomous), North lakhimpur, Assam – India.
  2. Minimum spanning tree. Available at https://en.wikipedia.org/wiki/Minimum_spanning_tree.
  3. Prims Algorithm: Greedy Technique. Available at https://www.youtube.com/watch?v=kuNfKbyOnDs&t=529s.
  4. Kairanbay, M., Jani, H. M. (2013). A Review and Evaluations of Shortest Path Algorithms. International journal of scientific & technology research volume 2, issue 6.
Publication Details
  Published in : Volume 4 | Issue 10 | September-October 2018
  Date of Publication : 2018-09-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 110-117
Manuscript Number : IJSRST1841021
Publisher : Technoscience Academy
PRINT ISSN : 2395-6011
ONLINE ISSN : 2395-602X
Cite This Article :
G. Kousika, Naveen L, "Review of a Connected Graph Using Prim's Algorithm to Find a Minimum Spanning Tree", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 4, Issue 10, pp.110-117, September-October-2018
URL : http://ijsrst.com/IJSRST1841021