Research And Realization Of Path Analysis Method In Two Dimension GIS

With the rapid development of science and technology, especially those of the computer, the network and communication has already permeated in traffic field progressively. Network of GIS analysis is hot and difficult, and the shortest pathis the most basic analysis of GIS network and the most critical problem in many areasin which it is with a direct application. 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.This paper discusses basic theory of GIS, including its data model, data structure and data constitution. In instance of Mapinfo, narrates space topologic relationship of GIS, and expatiates module technology and method of secondary-developed GIS.Based on the classical Dijkstra algorithm, according to the actual road conditions,and using the adjacency list as the road network stored structure, in order to reducing search times when finding the shortest path to the next one, realize shortest path queries based on the improved algorithm of the Dijkstra.The algorithm of Dijkstra is a node-centric query which inquiry the node to node'shortest path, while in the GIS, the real need is inquirying the specific features to a features'shortest path. This paper, achieve the query of the specific features to a features'shortest path based on projected the features onto a node, and realize the query of the real-time dynamic shortest path.