Application Of Dijkstra Algorithm In MAPGIS To Broaden And Realize Function

With the popularity of computer science and the development of geographic information, GIS are increasingly extensive and in-depth application because of their powerful features. Network of GIS analysis is hot and difficult, and the shortest path is the most basic analysis of GIS network and the most critical problem in many areas in which it is with a direct application. People has never interrupted the study of algorithms on the shortest path issue. With continuously improvement of computer data structure and algorithm it makes the effective integration of the new shortest path algorithm to continue to emerge. Dijkstra algorithm is the theoretical basis to resolve the shortest path issue in the majority systems. Dijkstra algorithm has the advantage of the simple design process and high universality. In this paper, the purpose of the study is the combination realization of two above.MAPGIS software is the most popular geography information system software in our country. It has powerful functions and widespread application. But there is not direct path searching function in MAPGIS. Routine land information systems are equipped with setting point and measuring distance these functions,which are the natural conditions for path selection function. Dijkstra algorithm which is of the best property among similar algorithms and derivable algorithms can finish this function properly.In this sense, this study is of practical meaning.In the process of research, through adding new attributes in MAPGIS point document and line documents, it constitutes the basis of Dijkstra algorithm. Point ID. Path's starting point ID and finishing point ID are transferring parameters of DIJ algorithm function,through which the path calculated by DIJ algorithm function can be displayed on the graph; Distance between points. The distance between points is the fundamental data. Usually there will not be only one path which comprise at least one distance. By the algorithm function it filters the paths and reachs the shortest path. After initialization, the results displayed on the interface is corresponding with MAPGIS editorial content. Graph interface displayed with the application of Dijkstra algorithm it can find the shortest path between two nodes chosed.By research and test, the program makes effect in practical application. It can achieve the shortest path between the two chosed nodes exactly which combine MAPGIS and DIJ algorithm successfully, illustrating the rationality and feasibility of this study. After deep analyzing the relation between the program and the work of land science, it proves that the potential of this program's application in land science sphere is available.