Effective Searching Shortest Path In Graph Using Prim’s Algorithm
 |
International Journal of Computer & Organization Trends (IJCOT) | 
|
| © 2013 by IJCOT Journal | ||
| Volume-3 Issue-4 |
||
| Year of Publication : 2013 | ||
| Authors : D.Kalpanadevi |
Citation
D.Kalpanadevi . "Effective Searching Shortest Path In Graph Using Prim’s Algorithm" . International Journal of Computer & organization Trends (IJCOT), V3(4):34-37 Jul - Aug 2013, ISSN 2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.
Abstract
Prims algorithm is studied the shortest path problem in the greedy method which is used to select a subset of the edge such that spanning tree is formed and the weight of the edges is minimal. There are various shortest path methods available. An algorithm is designed based on which, a new method in greedy method is proposed which is more effective and efficient than other well-known method. At each stage of the undirected graph it make a decision that appear to be best at the time, also made at one stage is not changed in a later stage, so each decision should assure feasibility.
References
[1]. G P Raja Sekhar, Design & Analysis of Algorithms Department of Mathematics, II T Kharagpur.
[2]. V.Sundaresan,K.S Subramanian, and K.Ganesan, Discrete Mathematics, A.R Publication 2002.
[3].Abuja’farMhammadibnMusaal-khwarizmi, Design and analysis of Algorithm, http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/prim.htm
[4]. Sangam Jain Professor: Partha Bhowmik, Prim`s Algorithm ,Department of Computer Science and Engineering IIT Kharagpur, August 21, 2008.
Keywords
spanning tree, edge, greedy, shortest path.