PATH FINDING: A* OR DIJKSTRA’S?
Abhishek Goyal, Prateek Mogha, Rishabh Luthra, Neeti Sangwan · International Journal in IT & Engineering · 2014
It is well known that computing shortest paths over a network is an important task in many network and transportation related analyses. Choosing an adequate algorithm from the numerous algorithms reported in the literature is a critical step in many applications involving real road networks. In a recent study, a set of two shortest path algorithms that run fastest on real road networks has been identified. These two algorithms are: 1) the A* algorithm, 2) the Dijkstra's algorithm. As a sequel to that study, this paper reviews and summarizes these two algorithms, and demonstrates the data structures and procedures related to the algorithms.