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

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

 An Efficient Vertical Handoff Technique for TwoTier Heterogeneous Networks 

 Integration of cellular networks and Wireless local area networks (WLANs) will be very useful for development of fourth generation communication technologies. The integration of two or more networks would be done b...

 An Overview of Privacy and Security in SNS

 The use of Social Networking web sites and applications is rising day by day, many users are not properly informed of the risks associated with using these sites and application. User should understand these risks...

 Artificial Intelligent Bionic Devices and Robotic Controls

 Functionality and design of a bionic robot arm consisting of three joints driven by elastic and compliant actuators derived from biologically inspired principles are presented. In the first design standa...

Results Concerning Acyclic Chromatic Numbers of Graphs

The acyclic chromatic numbers of standard graphs and of their tensor products are evaluated.

 Methodology for Artificial Immune Systems and Immune Pathology

 Artificial immune system (AIS) mimics the superior properties of biological immune system and provides an effective method in intelligent computing and intelligent system designing. But the disease-causing mechanis...

Download PDF file
  • EP ID EP131608
  • DOI -
  • Views 113
  • Downloads 0

How To Cite

Vaibhavi Patel, Prof. Chitra Baggar (2014). A Survey Paper of Bellman-Ford Algorithm and Dijkstra Algorithm for Finding Shortest Path in GIS Application. International Journal of P2P Network Trends and Technology(IJPTT), 5(1), 1-4. https://europub.co.uk/articles/-A-131608