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

Authors

  • G. Kousika  MSc Mathematics, Department of Mathematics, Dr Sns Rajalakshmi Collage of Arts and Science, Coimbatore, Tamil Nadu, India
  • Naveen L  MSc, MPhil, Assistant Professor, Department of Mathematics, Dr Sns Rajalakshmi Collage of Arts and Science, Coimbatore, Tamil Nadu, India

Keywords:

Connected Graph, Minimum Spanning Tree, Prim’s algorithm, Kruskal’s algorithm, travelling sales man problem.

Abstract

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

References

  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.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2018-09-30

Issue

Volume 4, Issue 10, September-October-2018

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
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), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 4, Issue 10, pp.110-117, September-October-2018.