| 带单一限制条件的单源多权最短路径算法及其实现 |
| |
| 引用本文： | 冯德民,谢娟英. 带单一限制条件的单源多权最短路径算法及其实现[J]. 西南师范大学学报(自然科学版), 2000, 25(3): 242-246 |
| |
| 作者姓名： | 冯德民 谢娟英 |
| |
| 作者单位： | 陕西师范大学计算机系,西安,710062 |
| |
| 摘 要： | 带限制条件的单源多权最短路径比一般网络中的最短路径有更加广泛的 ，给出了仅带单一限制条件的单源多权最短路径的算法及其实现，最后给出了算法分析。
|
| 关 键 词： | 权 最短路径 算法 限制条件 有向图 数学模型 |
An algorithm of the shortest path from an initial node to the other vertices with single restriction and multiple weights |
| |
| FENG De-min,XIE Juan-ying. An algorithm of the shortest path from an initial node to the other vertices with single restriction and multiple weights[J]. Journal of southwest china normal university(natural science edition), 2000, 25(3): 242-246 |
| |
| Authors: | FENG De-min XIE Juan-ying |
| |
| Abstract: | The problem of the shortest path form an initial node to the other vertice s with single restriction and multiple weights is more practical than the one wi th single weight. This paper proposes an effective algorithm to deal with it. Th e time and space complexity of the algorithm also has been discussed. |
| |
| Keywords: | restriction weight shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《西南师范大学学报(自然科学版)》下载全文 |
