| 最短路径算法的改进及其实现方法 |
| |
| 引用本文： | 龚洁辉,白玲,高健美.最短路径算法的改进及其实现方法[J].测绘学院学报,1998(2). |
| |
| 作者姓名： | 龚洁辉 白玲 高健美 |
| |
| 作者单位： | 解放军测绘学院!郑州450052(龚洁辉，白玲)，郑州市民用建筑设计研究所!450000(高健美) |
| |
| 摘 要： | 最短路径分析是 GIS最基本的网络分析功能。Dijkstra算法是目前公认的较好的最短路径算法。文中从节约存储空间 ,提高运算速度出发 ,在 Dijkstra算法基础上 ,对相关边算法进行改进 ,提出邻接结点算法 ,并给出算法的面向对象的实现方法
|
| 关 键 词： | 最短路径 Dijkstra算法 相关边算法 邻接结点算法 |
Improvement of Algorithm of Shortest Route and the Object Oriented Practicing Method |
| |
| Gong Jiehui,Bai Ling,Gao Jianmei.Improvement of Algorithm of Shortest Route and the Object Oriented Practicing Method[J].Journal of Institute of Surveying and Mapping,1998(2). |
| |
| Authors: | Gong Jiehui Bai Ling Gao Jianmei |
| |
| Institution: | Gong Jiehui Bai Ling Gao Jianmei |
| |
| Abstract: | Shortest route analysis is the fundamental network analysis function 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 algorithm of relative edges is improved, and the algorithm of adjacent nodes is put forward. The object oriented practicing method is also given here. |
| |
| Keywords: | Shortest route The algorithm of Dijkstra The algorithm of relative edges The algorithm of adjacent nodes |
| 本文献已被 CNKI 等数据库收录！ |
