GIS中最短路径的算法研究与仿真

最短路径是GIS应用中的主要问题之一。通过对GIS中最短路径理论和实现算法的分析和研究 ,该文对传统的Dijk stra算法和启发式搜索算法A 算法进行了详细的探讨 ,并说明了各自的特点及适用条件。在对一些最短路径算法测试结果总结的基础上 ,根据GIS中网络计算的实际情况 ,对搜索算法的数据结构和存储方式进行了优化。最后 ,利用MapObjects组件对国家基础地理信息系统 (NFGIS)中的公路数据文件进行了仿真分析 ,得出一些有益的结论。

Algorithms Research and Simulation of Shortest Path in GIS

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).