A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application
Journal Title: International Journal of P2P Network Trends and Technology(IJPTT) - Year 2014, Vol 5, Issue 1
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.
Authors and Affiliations
Vaibhavi Patel , Prof. Chitra Baggar
Keywords
Related Articles
- EP ID EP131608
- DOI -
- Views 95
- Downloads 0
Low Power High Speed Two’s Complement Multiplier
To reduce the area of partial product array size and improve the speed which is generated by a radix-4 Modified Booth Encoded Multiplier is used. This reduction is possible without any increase in the delay of the...
Information at Your Fingertips Anywhere Anytime Anyway (A3) MCC – Survey
The cloud means total cost of ownership to build and maintain the datacenter infrastructure which includes both hard and soft related costs. An accurate comparison requires knowledge of all available over the life of the...
Mobile Ad-hoc Network Simulators, A Survey and Comparisons
Wireless communication technologies have been making growing interest in the past years, which has resulted in many proposals of their new applications. From indoor wireless local area networks to outdoor cellular mobile...
Results Concerning Acyclic Chromatic Numbers of Graphs
The acyclic chromatic numbers of standard graphs and of their tensor products are evaluated.