An improved Dijkstra algorithm in GIS application

Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. Dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.