Bai Cui-mei
Abstract
This paper based on the Dijkstra algorithm,some data structures have been added,all the shortest paths from one node to all the other nodes can be derived intuitionistic by using the algorithm.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper based on the Dijkstra algorithm,some data structures have been added,all the shortest paths from one node to all the other nodes can be derived intuitionistic by using the algorithm.
Key concepts: Dijkstra's algorithm, Yen's algorithm, Algorithm, Shortest Path Faster Algorithm, Pathfinding, Floyd–Warshall algorithm, Suurballe's algorithm, K shortest path routing