基于MapX的Dijkstra算法在城市交通查询中的实现

Realization of Dijkstra Algorithm on Urban Traffic Query Base on MapX

首先介绍了城市交通的重要性,接着进一步阐述了Dijkstra算法及其实现在城市交通中的应用占有的重要地位。从GIS中网络最短路径算法的实际情况出发,基于MapX以及网络拓扑结构的表示与建立,以及Dijkstra算法搜索技术的实现入手,最终实现了Dijkstra最短路径算法与其在城市交通查询中的应用。本文就以经典的最短路径算法——Dijkstra算法为原理,基于MapX在VisualBasic平台对其算法研究、验证,最终得出该算法的可行性。

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.