Publication Type : Conference Paper
Publisher : IEEE
Source : 2024 Global Conference on Communications and Information Technologies (GCCIT)
Url : https://doi.org/10.1109/gccit63234.2024.10862821
Campus : Coimbatore
School : School of Engineering
Department : Electrical and Electronics
Year : 2024
Abstract : This paper presents a comparative analysis of three widely used pathfinding algorithms: A*, Dijistra’s, and Breadth-First Search (BFS). We evaluate these algorithms based on their complexity, optimality, and efficiency in finding your shortest path in different scenarios. This paper compares all three algorithms looks at how fast and how well they work to find the shortest path.
Cite this Research Publication : Adithya S S, Harsh Jaishanker, Sai Ganesh S, Anand R, Comparative Analysis of A*, Dijkstra’s, and Breadth-First Search Algorithms: Evaluating Complexity, Optimality, and Efficiency in Shortest Pathfinding, 2024 Global Conference on Communications and Information Technologies (GCCIT), IEEE, 2024, https://doi.org/10.1109/gccit63234.2024.10862821
