Single source shortest path algorithm Dijkstra and Bellman-Ford Algorithms: A Comparative study

International Journal of Computer Science and Emerging Technologies

View Publication Info
 
 
Field Value
 
Title Single source shortest path algorithm Dijkstra and Bellman-Ford Algorithms: A Comparative study
 
Creator Abdul Manan, Syed Imran Ali Lakyari
 
Subject GIS (Geographic Information Systems), optimal path, Shortest Path Algorithm, Longest path problem, Reliable path problems
 
Description The “shortest path problem” is about finding a path between two vertices in a graph such that the total sum of the edges weights is minimum. Shortest-path problems are the most fundamental and the most commonly faced problems in the study of transportation and communication networks and In GIS Application [1, 2, and 5]. This is especially evident in the event that we sum up the class of “shortest path problems” to incorporate related problems, for example, the “longest-path problem”, the “most-reliable-path problems”, the “largest-capacity-path problem”, and various “routing problems”. Along these lines it isn't astounding that an enormous number of papers, reports, and expositions have been distributed regarding the matter of “shortest-path algorithms”. There have additionally seemed various astounding studies, review paper. There are many algorithms to find shortest path like Dijkstra, Bellman-ford, Floyd-Warshal, A*, Johnsons Algorithm, Viterbi Algorithm etc. In this paper we will discuss and examine Dijkstra and Bellman-ford algorithms and we will suggest by our study that in which situation which algorithm is best.
 
Publisher Shah Abdul Latif University, Khairpur
 
Date 2020-06-30
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
 
Format application/pdf
 
Identifier http://ijcet.salu.edu.pk/index.php/IJCET/article/view/48
 
Source International Journal of Computer Science and Emerging Technologies ; Vol 3 No 2 (2019): IJCET 3(2)- December 2019; 25-28
2522-3348
2522-3348
 
Language eng
 
Relation http://ijcet.salu.edu.pk/index.php/IJCET/article/view/48/46
 
Rights Copyright (c) 2020 International Journal of Computer Science and Emerging Technologies
https://creativecommons.org/licenses/by-nc/4.0
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library