| 求带多个限制条件的单源多权最短路径算法 |
| |
| 引用本文： | 戴树贵,潘荫荣,胡幼华,孙强.求带多个限制条件的单源多权最短路径算法[J].计算机应用与软件,2004,21(12):78-81. |
| |
| 作者姓名： | 戴树贵 潘荫荣 胡幼华 孙强 |
| |
| 作者单位： | 1. 华东师范大学计算机科学与技术系,上海,200062;滁州师范专科学校数学与计算机科学系,滁州,239000
2. 华东师范大学计算机科学与技术系,上海,200062 |
| |
| 摘 要： | 带限制条件的多权最短路径问题具有广泛的应用。本文给出一个通过按字典序生成从源顶点到目标顶点的非支配路径的方法，求出满足限制条件的最短路径的算法，并且分析了算法的时间复杂度。
|
| 关 键 词： | 单源多权最短路径算法 时间复杂度 数学模型 计算机 |
AN ALGORITHM FOR THE MULTIPLE WEIGHTS SHORTEST-PATH PROBLEM WITH MULTIPLE CONSTRAINTS |
| |
| Dai Shugui , Pan Yinrong Hu Youhua Sun Qiang WTBX.AN ALGORITHM FOR THE MULTIPLE WEIGHTS SHORTEST-PATH PROBLEM WITH MULTIPLE CONSTRAINTS[J].Computer Applications and Software,2004,21(12):78-81. |
| |
| Authors: | Dai Shugui Pan Yinrong Hu Youhua Sun Qiang [WTBX] |
| |
| Affiliation: | Dai Shugui 1,2 Pan Yinrong 1 Hu Youhua 1 Sun Qiang 1 [WT6BX] 1 |
| |
| Abstract: | The shortest-path problem with constraints is widely practical.In this paper an algorithm of the nondominated path from the source point to the sink point at dictionary order is presented to get the shortest path with the constraints.The time complexity of the algorithm is also discussed. |
| |
| Keywords: | Shortest path Valuation function Nondominated path Time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
