Abstract: Research on the application of GIS navigation system is the shortest path search efficiency. hhe electronic navigation system has high demand for the shortest path search efficiency. With urban development, traffic lines increase, and the traditional Dijkstra algorithm based on GIS navigation system can not adapt to the increasingly complex traffic lines. The shortest path search efficiency is too low. Considering the GIS spatial distribution characteristics, this paper proposed the improvement Dijkstra algorithm to solve the shortest path search problem in GIS navigation. The improved algorithm not only avoids the case that traditional Dijkstra algorithm traverses the search by node, but also according to priority narrow search direction features range, greatly reduces the workload search, and through the change of the storage of data structure search node improves the shortest path search efficiency. Experiment indicates that compared with the traditional method the improved algorithm can effectively improve the shortest path algorithm of the search efficiency, and satisfy the shortest path search efficiency requirements of the electronic navigation system, and obtaines satisfactory results.

Key words: Shortest path, Search efficiency, Direction is preferred