Implementation of Shortest Path Algorithm Based on Database Middle-ware & GIS
Chao Zhang · Jisuanji gongcheng · 2005
In GIS, it is necessary to optimize the analysis function of the shortest path as the hinge of spatial network analysis, which includes shortest path analysis, resource allocation and isochrone, and so on. Here derived from the traditional calculating method, ie. Dijkstra algorithm, the query about shortest path is based on relationship database. This technique not only solves the problem of spatial data sharing but also improve the efficiency of computer system.