摘要
随着城市化水平的提高,人们在道路选择问题上可能需要考虑的并非仅仅是"空间距离"的最短,还有"时间最短",本文应用Dijkstra算法解决城市中出行交通道路选择的问题,对距离最短和时间最短路径分别进行讨论,用VB语言实现算法,并且在电子地图上绘制出所求出的路径,以便人们更直接地观看到结果,基本上解决了道路选择问题。
Along with urbanized level enhancing, the people possibly need to consider not only ＂the space length＂ shortest in the path choice question, but also ＂the time to be shortest＂ . This article applied Dijkstra algorithm to solve the issue of urban trip road choice by discussing separately the shortest distance and the shortest time path, using VB language to implement the algorithm, and drawing the path in the E-map to watch the resuhs directly.
出处
《测绘科学》
CSCD
北大核心
2010年第4期169-170,150,共3页
Science of Surveying and Mapping
基金
国家科技攻关项目(2002BA901A28)
