An Extensive Review of Shortest Path Problem Solving Algorithms
Sunita Kumawat, Chanchal Dudeja, Pawan Kumar
Abstract
Shortest Path Algorithms (SPAs) are established for solving shortest path problem (SPP) mainly classified into various types. Advanced concepts are derived for solving the problem of shortest path ensured via various algorithms. The key purpose of this article is to give a detailed overview to SPP besides problem solving algorithms. The problem of shortest path is represented as graph and solved by utilizing different algorithms based on the application. The main goal of SPA is shortening the inclusive cost and distance. The application of artificial intelligence in the shortest path algorithms had described in a separate section. The time complexity of the different algorithms presented in the various literatures are discussed. From the profound survey this work suggests some of the future directions to the work. This examination proves that the performance varies between various algorithms which are used to resolve detailed variations of SPP.