A High-efficiency Realization Way of the Shortest Path Search Problem in GIS Field
GIS领域最短路径搜索问题的一种高效实现

There are many researches and applications about the shortest path searching in GIS field at present. Algorithmic efficiency of the shortest path searching is problem which has came to front and need to be resolved in application. In this paper, Author analyzes the optimization means based on the Dijkstra's shortest path algortithm and brings forward his optimization schemes beeline optimizing Dijkstra's shortest path algortithm from two aspects optimization of algortithm and data storage configuration. At same time, author discusses necessary testifying and application conditions in this paper. This scheme was applied in China Main City Highway Information Searching System, and has got satisfied effects. This paper also offers concerned testing data about Beeline Optimizing Dijkstra's Shortest Path Algortithm.