Algorithm and its application of N shortest paths problem
Chai Deng-feng, Dengrong Zhang · 2002
The shortest path problem is one of the basic and classical problems of graph theory and is applied to many fields, such as GIS network analysis. Dijkstra's and Floyd's algorithms are two classical algorithms. While the shortest path indicates only the shortest one path, algorithms designed for it can only get one path. This paper brings forward the N shortest paths problem then designs an algorithm for it and analyzes its complexity. The algorithm is tested by experiment and applied to a traffic consultation system of Guangzhou city and proved to be efficient.