Abstract
In this survey we have compared five different path finding algorithms, namely, Dijkastra’s algorithm, A* Search, Greedy Best First Search, Breadth First Search and Depth First Search on the basis of the following criteria: Complexity: It refers to the rate at which the execution time grows with respect to the input size. Reliability: It refers to whether the algorithm is able to guarantee the shortest path. Weighted/unweighted: Some algorithms are not suited for weighted graphs and thus have a major limitation. Their respective advantages and disadvantages have also been discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Goldberg, A.V., Tarjan, R.E.: Expected performance of Dijkstra's shortest PathAlgorithm (1996)
Heusner, M., Keller, T., Helmert, M.: Best-case and worst-case behaviour of greedy best-first search (2018)
Cui, X., Shi, H.: A*-based Pathfinding in Modern Computer Games (2011)
Beamer, S., Asanović, K., Patterson, D.: Direction-optimizing breadth-first search (2013)
Reif, J.H.: Depth First Search is inherently sequential (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ashish, D.D.V.S., Munjal, S., Mani, M., Srivastava, S. (2021). Path Finding Algorithms. In: Hassanien, A.E., Bhattacharyya, S., Chakrabati, S., Bhattacharya, A., Dutta, S. (eds) Emerging Technologies in Data Mining and Information Security. Advances in Intelligent Systems and Computing, vol 1286. Springer, Singapore. https://doi.org/10.1007/978-981-15-9927-9_33
Download citation
DOI: https://doi.org/10.1007/978-981-15-9927-9_33
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-9926-2
Online ISBN: 978-981-15-9927-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)