Wang Yi-jian
Abstract
The shortest path problem is a principal issue in the field of Geographic Information System (GIS). In this paper, the author introduces the basic concept of GIS, and does some analysis and research on the Dijkstra algorithm and A* algorithm, And describes the characteristics of their respective conditions.
OpenAlex reports 1 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.
The shortest path problem is a principal issue in the field of Geographic Information System (GIS). In this paper, the author introduces the basic concept of GIS, and does some analysis and research on the Dijkstra algorithm and A* algorithm, And describes the characteristics of their respective conditions.
Key concepts: Dijkstra's algorithm, Computer science, Shortest path problem, Pathfinding, Geographic information system, Yen's algorithm, Field (mathematics), Path (computing)