ScholarLens Back to search
2009•Journal of Changzhou Institute of TechnologyRequires access

To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm

Wenning Wang

Open publisher page 2 citations

Abstract

The shortest path algorithm is applied in many fields.The normal Floyed shortest path algorithm is supposed to deal with the shortest path between every two dots.Based on the analyzing of Floyed shortest path algorithm,the article presents the optimal algorithm of Floyed shortest path algorithm that can give the first Rth shortest path between every two dots.And also,the article demonstrates some improvement,which can be used to make the algorithm quicker,particularly when it deals with the sparse graph.

About this research paper

What this paper is about

The shortest path algorithm is applied in many fields.The normal Floyed shortest path algorithm is supposed to deal with the shortest path between every two dots.Based on the analyzing of Floyed shortest path algorithm,the article presents the optimal algorithm of Floyed shortest path algorithm that can give the first Rth shortest path between every two dots.And also,the article demonstrates some improvement,which can be used to make the algorithm quicker,particularly when it deals with the sparse graph.

Why it matters

OpenAlex reports 2 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 algorithm is applied in many fields.The normal Floyed shortest path algorithm is supposed to deal with the shortest path between every two dots.Based on the analyzing of Floyed shortest path algorithm,the article presents the optimal algorithm of Floyed shortest path algorithm that can give the first Rth shortest path between every two dots.And also,the article demonstrates some improvement,which can be used to make the algorithm quicker,particularly when it deals with the sparse graph.

Key concepts: Shortest path problem, Yen's algorithm, K shortest path routing, Shortest Path Faster Algorithm, Constrained Shortest Path First, Widest path problem, Euclidean shortest path, Longest path problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm — Research Paper | ScholarLens