Abstract
Using Dijkstra algorithm for searching shortest path problem is an important content of the application of GIS. Dijkstra algorithm can not find all the shortest paths. The article based on the Dijkstra algorithm, added some data structure and proposed an algorithm that calculate all the shortest path of one vertex to others, the algorithm data structure is relatively simple, while effectiveness of the algorithm is verified by an example. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Na, Z. (2013). An improved algorithm of the shortest path search problem in GIS field. In Advances in Intelligent Systems and Computing (Vol. 181 AISC, pp. 1035–1039). Springer Verlag. https://doi.org/10.1007/978-3-642-31698-2_146
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
