| 最短路径问题的一种改进算法 |
| |
| 引用本文： | 王杰臣,杨得志,张伟.最短路径问题的一种改进算法[J].测绘学院学报,1999(4). |
| |
| 作者姓名： | 王杰臣 杨得志 张伟 |
| |
| 作者单位： | 南京师范大学!南京210093(王杰臣)，南京大学!南京210093(杨得志)，江苏省城乡规划设计研究院!南京210008(张伟) |
| |
| 摘 要： | 最短路径分析是ＧＩＳ最基本的网络分析功能。迪杰斯特拉算法是目前公认的较好的最短路径算法。文中从节约存储空间、提高运算速度出发， 在该算法的基础上， 采用点弧联合结构表达图， 提出节点的最大邻接深度概念及相邻节点低值传递方法， 实现最短路径的自动判断与提取， 并给出算法的实现方法。
|
| 关 键 词： | 最短路径 算法 地理信息系统 |
An Improvement Algorithm of Shortest Route Analysis |
| |
| Wang Jiechen,Yang Dezhi,Zhang Wei.An Improvement Algorithm of Shortest Route Analysis[J].Journal of Institute of Surveying and Mapping,1999(4). |
| |
| Authors: | Wang Jiechen Yang Dezhi Zhang Wei |
| |
| Institution: | Wang Jiechen Yang Dezhi Zhang Wei |
| |
| Abstract: | Shortest route analysis is the fundamental network analysis in GIS. The algorithm of Dijkstra is an acknowledged better algorithm of shortest route. In this paper, starting from the view of economizing in memory space and increasing operation speed, and based on the algorithm of Dijkstra, the united structure of point arc is used to express a graph, the concept of maximum adjacency depth and the method of low value spread between adjacent point are put forward. And the practicing method is also given here. |
| |
| Keywords: | Shortest route Algorithm GIS |
| 本文献已被 CNKI 等数据库收录！ |
