Realization of Dijkstra Algorithm on Urban Traffic Query Base on MapX
Lou Zhen-fu · Geomatics & Spatial Information Technology · 2010
This article introduced the importance of urban traffic at first.Then,it elaborated the basic idea of the Dijkstra algorithm and its realization,that was very important in the application of city transportation.From the start of the actual situation of the network shortest path calculation in GIS,basing on the representation,the establishment of MapX and Network topological structure,as well as from the realization of the Dijkstra algorithm searching technology,Dijkstra shortest path calculation and its application in city transportation were realized.At last,the feasibility of the algorithm was found out,by taking a classical shortest path calculation-Dijkstra algorithm as principle,as well as studying and verifying the algorithm on the VisualBasic platform based on MapX.