Application of Modified Dijkstra Algorithm in GIS Route Planning
Yushu Liu · Computer and Modernization · 2004
The shortest path algorithm is a hotspot in the field of Computer Science and geographic information science.This paper discusses a modified Dijkstra algorithm.According to the start point,routing point and target point that the user gives we can plan route in the traffic network graph in GIS,and build the shortest path which satisfies some restrictions with the algorithm.Actual application shows that the modified Dijkstra algorithm is feasible in enhancing the efficiency in network system spatial analysing.