An Improved Algorithm of Dijkstra in GIS Field
Na Zhao · Computer Development & Applications · 2012
It is an important part of the application of GIS of using the Dijkstra algorithm to search shortest path problem.The Dijkstra algorithm can not find all the shortest paths.An improved algorithm is presented in this article,which combines Dijkstra algorithm with some data structure and all shortest path from one vertex to other vertex can be be found easily.And this improved algorithm did not increase the complexity of the original algorithm,so it has good research and practical value.