Approach to the shortest path in route network

The algorithm for the shortest path is a study hotspot in geographical information system, computer science and etc. Based on the theories of network analysis and topology, a new method of spatial data structure for the algorithm which is suitable for with Dijkstras optimizing method and combined with the characteristics of route network so that it realized a way of speed resolving and updating the shortest path between any two crunodes of route network in the environment of electronic maps.