Chen, Y., 2020. Application of improved Dijkstra algorithm in coastal tourism route planning. In: Gong, D.; Zhang, M., and Liu, R. (eds.), Advances in Coastal Research: Engineering, Industry, Economy, and Sustainable Development. Journal of Coastal Research, Special Issue No. 106, pp. 251–254. Coconut Creek (Florida), ISSN 0749-0208.

With the development of computer science and geographic information science, there are more and more applications for GIS. Shortest path analysis is a key issue in GIS geographic network analysis. One of the classical algorithms for calculating the shortest path is the Dijkstra algorithm, which is used in many projects to solve the shortest path problem. However, when the traditional Dijkstra algorithm solves the shortest path between nodes, a large number of nodes outside the identified nodes are calculated, which affects the speed of the algorithm. The Dijkstra algorithm is a classical algorithm for solving the shortest path in the embedded GIS system. By analyzing the Dijkstra algorithm, changing the storage structure, and examining graphing methods, the binary ordering tree algorithm based on the rectangular restricted area reduces the memory storage space. Shortening the query time requires optimizing the shortest path calculation process; the actual data test also shows the effectiveness of the algorithm.

This content is only available as a PDF.
You do not currently have access to this content.