| 引用本文： |
-
周勤,周炳生.网络中λ阶短路径的构造原则及算法[J].广西科学院学报,2008,24(3):243-247,253. [点击复制]
- ZHOU Qin,ZHOU Bing-sheng.A Constructive Principle and Algorithm of λ Level Short Path in Network[J].Journal of Guangxi Academy of Sciences,2008,24(3):243-247,253. [点击复制]
|
|
| 摘要: |
| 分析由延长而产生的前导和后继路径阶的生成关系,获得λ阶短路径的构造原则,然后根据构造原则,修改最短路径D(Dijkstre)算法,提出λ阶短路径D算法,并用算例验证算法的可行性. |
| 关键词: 短路径 最短路径 原则 算法 |
| DOI： |
| 投稿时间：2007-12-06 |
| 基金项目: |
|
| A Constructive Principle and Algorithm of λ Level Short Path in Network |
|
ZHOU Qin1, ZHOU Bing-sheng2
|
| (1.Library, Jinling Institute of Technology, Nanjing, Jiangsu, 210009, China;2.Department of Information Management, Nanjing University, Nanjing, Jiangsu, 210008, China) |
| Abstract: |
| By analyzing the generative relation of leader path and successor path,the constructive principle of λ level short path is obtained.Then according to the constructive principle,the shortest path D algorithm(Dijkstre algorithm) is modified and D algorithm of λ level short path is propose.Finally,samples was used to prove the feasibility of algorithm. |
| Key words: short path shortest path principle algorithm |
