|
Dijkstra 最短路径算法的一种高效率实现*
|
| |
关键词 最短路径算法；网络分析；地理信息系统
分类号 p208；o22
an efficient implementation of shortest path algorithm
based on dijkstra algorithm
yue yang gong jianya
(national laboratory for information engineering in surveying, mapping and remote sensing，
wtusm, 129 luoyu road, wuhan, china, 430079)
abstract with the development of geographic information science and the wide use of gis software, more and more needs are required to the network analyses. as the key of network analyses, computing the shortest paths over a network is an important problem that scholars facus on. start with the data structure during its computation process and combined with f.benjamin zhans evaluation of a set of 15 shortest path algorithms, this paper presents an efficient method of realize the shortest path algorithm which is based on dijkstra algorithm. result shows that this method performs well in practice.
|
|
|
|
|
教育论文中心