ScholarLens Back to search
2011•Journal of Jilin Teachers Institute of Engineering and TechnologyRequires access

A New Shortest-path Discovery Algorithm

Yicheng Yu

Open publisher page 0 citations

Abstract

The Dijkstra algorithm is improved by changing the data structures and the way of updating paths in this paper.The results show that the algorithm can find all shortest-paths between any two nodes.

About this research paper

What this paper is about

The Dijkstra algorithm is improved by changing the data structures and the way of updating paths in this paper.The results show that the algorithm can find all shortest-paths between any two nodes.

Why it matters

A significance statement is not available in the OpenAlex record.

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 Dijkstra algorithm is improved by changing the data structures and the way of updating paths in this paper.The results show that the algorithm can find all shortest-paths between any two nodes.

Key concepts: Yen's algorithm, Shortest Path Faster Algorithm, Dijkstra's algorithm, K shortest path routing, Shortest path problem, Algorithm, Path (computing), Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Shortest-path Discovery Algorithm — Research Paper | ScholarLens