DOIONLINE 
DOIONLINE Publish In |
International Journal of Advances in Electronics and Computer Science-IJAECS |
 Journal Home Volume Issue |
||||||||
Issue |
Volume-9,Issue-6 ( Jun, 2022 ) | |||||||||
Paper Title |
K-Simple Shortest Paths Algorithms | |||||||||
Author Name |
P.B.Niranjane, S.Y.Amdani | |||||||||
Affilition |
Department of Computer Science and Engineering, B.N. College of Engineering, India | |||||||||
Pages |
27-31 | |||||||||
Abstract |
Abstract - The generalization of the shortest path called multiple paths, or k-shortest path, finds k paths where the first path is shortest, and the remaining k-1 paths are in increasing lengths. K shortest path may be simple or non-simple. K Shortest Path problems are usually solved using Yen's algorithm, M-P algorithm, KSP-SPR, Heuristic search, A* algorithm, V-F algorithm, Lawlers Algorithm, etc. This paper provides the analysis and comparative study of some of the top k simple shortest path algorithms, which are very helpful in finding the multiple paths in road networks. Keywords - K shortest paths, Simple paths, Path finding, Deviation path, Spur path, Root path, Multiple path. | |||||||||
| View Paper | ||||||||||
