城市道路交通网中最短路径搜索算法设计及其实现

The Design and Realization of the Shortest Path in the Net of Urban Road Communications

交通网络中最短路径的搜索是地理信息科学与计算机科学等领域的研究热点。本文以石家庄市中心区域部分道路网为实践对象,结合道路网络的特点,在自定义节点-链拓扑结构表达路网的基础上,提出了一种适于最短路径算法的空间数据组织方式,运用迪杰斯特拉(Dijkstra)最短路径算法,以MapInfo的二次开发语言MapBasic为开发工具,在电子地图环境下实现了道路网络中任意两节点间最短路径的快速解算与刷新显示。

Searching for the shortest path in the net of urban communications is the research focus of geographical information and computer science. The paper, taking part of the road net in the centre of Shiji azhuang as a practical object, on the basis of expressing the road net by user-defined node-link topological configuration, presents a data organization that fits the search of the shortest path, and by using Dijkstra Arithmetic, with the exploitation utility of MapBasic, realizes the search and display of the shortest path between two nodes of the road net in the condition of vector map.