Algorithms Research and Simulation of Shortest Path in GIS
Baobao Wang · Jisuanji fangzhen · 2005
The shortest path problem is a principal issue in the application of GIS. First, with the analysis and research on the shortest path theory and implementation algorithm, the paper explains elaborately the traditional Dijkstra algorithm and A* algorithm. On the basis of the test results of existing algorithms, it optimizes the data structure and memory mode to improve the computing efficiency with the characteristics of network computing in GIS. Finally, some beneficial results are gained with the simulation of the GIS data downloaded from the National Foundation Geographic Information System (NFGIS).