Analysis and Implementation of Shortest Path Algorithm Based on OpenStreetMap
Yinghu Zhang · Computer Technology and Development · 2013
With the rapid development of computer network and GIS technology,the shortest path problem plays an important role in transportation,city planning,logistics management,network communication,etc. Focus on describing how to use Dijkstra algorithm to calculate the shortest path between two connected nodes based on OSM. Firstly introduce the characteristics of OSM and data structure of road image feature. Secondly,extract road information by regular expression from OSM data file and store them in appropriate construction. Finally,form road topological diagram and takes the geographical distance as road weight,calculating the shortest path between two connected nodes by Dijkstra algorithm.