A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application

Download Now
Provided by: International Journal of P2P Network Trends and Technology(IJPTT)
Topic: Networking
Format: PDF
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.
Download Now

Find By Topic