Wang XinHai
Abstract
A data structure for convenient finding and displaying the shortest path has been designed, and Dijkstra algorithm is mainly involved in studying the shortest path, improved it to realize all the shortest paths from one node to the other node can be found.
A significance statement is not available in the OpenAlex record.
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.
A data structure for convenient finding and displaying the shortest path has been designed, and Dijkstra algorithm is mainly involved in studying the shortest path, improved it to realize all the shortest paths from one node to the other node can be found.
Key concepts: Yen's algorithm, Shortest path problem, K shortest path routing, Shortest Path Faster Algorithm, Dijkstra's algorithm, Pathfinding, Constrained Shortest Path First, Node (physics)