| 网络分层用于最短路问题的算法研究 |
| |
| 引用本文： | 付江缺,高井祥,段春燕,孙正明.网络分层用于最短路问题的算法研究[J].测绘科学,2009,34(3). |
| |
| 作者姓名： | 付江缺 高井祥 段春燕 孙正明 |
| |
| 作者单位： | 1. 中国矿业大学环境与测绘学院,江苏徐州,221008
2. 中国矿业大学理学院,江苏徐州,221008 |
| |
| 摘 要： | 提出了一种基于Dijkstra方法的网络分层算法,实现了两点间节点数最少条件下最短通路的求取,并与传统Dijkstra算法进行了比较,得到了一些有益的结论。
|
| 关 键 词： | 邻接矩阵 最短网络层 Dijkstra算法 |
Research on application of network-delaminating in shortest path problem |
| |
| FU Jiang-que,GAO Jing-xiang,DUAN Chun-yan,SUN Zheng-ming.Research on application of network-delaminating in shortest path problem[J].Science of Surveying and Mapping,2009,34(3). |
| |
| Authors: | FU Jiang-que GAO Jing-xiang DUAN Chun-yan SUN Zheng-ming |
| |
| Abstract: | Method of network-delameinating based on dijkstra is proposed in this paper and problem of shortest path between two targets with minimal nodes is successfully resolved.Some useful conclusions were obtained by comparison with traditional dijkstra algorithm. |
| |
| Keywords: | adjacent matrix shortest network layer Dijkstra algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
