International Journal of Science, Engineering and TechnologyAuthors: Sakshi, Aastha, Mansi, Prince Kumar Sharma
Abstract: The Shortest Path Problem (SPP) is an important part of graph theory with Network optimization with today’s system. The main objective of this research paper is to present a comprehensive analysis, ranging from classical algorithms to modern approaches. In this paper, we compared the Dijkstra, Bellman-Ford, Floyd-Warshall, Johnson's, and A (A-Star)* algorithms based on their theoretical complexity, time complexity, algorithms and real-world applications. Our research highlights that while Dijkstra's algorithm remains the main function for navigation systems, Bellman-Ford's algorithm works on graphs with negative weights. Additionally, we explore how the A* algorithm optimises the search space using heuristic functions, making it a better. Alternative to Artificial Intelligence and robotics. Through In this research analysis, we conclude that the efficiency of any The algorithm depends mainly on the network structure and specific constraints. This paper provides researchers and Developers with a clear roadmap for choosing the right algorithm for their shortest and fastest path.
DOI: http://doi.org/10.5281/zenodo.21772049
