2007•Journal of Yibin UniversityRequires access

Realization of the Shortest Path's Algorithm in Data Structure

Yang Cao

Abstract

The shortest path's algorithm is in a great variety of which the famous ones including Dijkstra Algorithm,Ford Algorithm,Floyd Algorithm,Moore Algorithm,A* Algorithm and Value of K Algorithm.Even in the same algorithm,the realizing ways are different.This article introduces the design of the shortest path of Dijkstra and the realization of programming the language of Visual C++.All the shortest paths from one node to all other nodes can be derived quickly by using the algorithm.

About this research paper

What this paper is about

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

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