Citation :

Vaibhavi Patel , Prof.ChitraBaggar, "A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 1, pp. 21-23, 2014. Crossref, https://doi.org/10.14445/22492615/IJPTT-V5P401

Abstract

GIS application is very useful in transportation management. A Road network analysis is an important function of GIS, and the shortest path analysis is the key issue of network analyses. In Most of GIS application, Dijkstra algorithm is useful. . The functionality of Dijkstra`s original algorithm can be extended with a variety of modifications. This paper represents the survey of two different algorithms dijkstra algorithm and bellman-ford algorithm. The purpose of the paper is to select one best algorithm from the two and. This algorithm can be used in government sector, emergency system, Business sector etc.

Keywords

GIS, Optimal path, Dijkstra algorithm, Bellman-ford algorithm.

References

[1] DexiangXie, Haibo Zhu, Lin Yan, Si Yuan and JunqiaoZhang ” An improved Dijkstra algorithm in GIS application” Proceedings of 2010 Conference on Dependable Computing, 2010
[2] David M. Mount “Design and Analysis of Computer Algorithms” Department of Computer Science, 2012
[3] GeeksforGeeks “Dynamic Programming” A computer science portal for geeks http://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/
[4]DechuanKong ,Yunjuan Liang, Xiaoqin Ma, Lijun Zhang “Improvement and Realization of Dijkstra Algorithm in GIS of Depot
[5]Thippeswamy.K ,Hanumanthappa.J. , Dr.Manjaiah D.H. “A Study on Contrast and Comparison between Bellman-Ford algorithm and Dijkstra’s algorithm”.
[6] Wei Zhang ,Hao Chen , Chong Jiang , Lin Zhu,”Improvement And Experimental Evaluation Bellman-Ford Algorithm”,International Conference on Advanced Information and Communication Technology for Education (ICAICTE 2013),2013