ScholarLens Back to search
2002•Unpublished venueRequires access

Algorithm and its application of N shortest paths problem

Chai Deng-feng, Dengrong Zhang

Open publisher page 23 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Yen's algorithm, K shortest path routing, Shortest path problem, Shortest Path Faster Algorithm, Dijkstra's algorithm, Floyd–Warshall algorithm, Pathfinding, Euclidean shortest path

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Algorithm and its application of N shortest paths problem — Research Paper | ScholarLens