| 赋权多阶段有向图最短路的求法 |
| |
| 引用本文： | 吴雨荣,李步军.赋权多阶段有向图最短路的求法[J].淮北煤炭师范学院学报(自然科学版),2007,28(4):23-26. |
| |
| 作者姓名： | 吴雨荣 李步军 |
| |
| 作者单位： | 1. 连云港师范高等专科学校数学系,江苏,连云港,222006
2. 淮海工学院数理科学系,江苏,连云港,222005 |
| |
| 摘 要： | 多阶段有向图是常见的一种有向图,许多运输、工程、管理等实际问题能转化为有向图最短路问题进行求解,尤其赋权多阶段有向图对解决该类实际问题更具有重要意义.研究了赋权多阶段有向图的最短路问题,从图上逆序标号法、表上作业法和动态规划法不同的角度对文中实例给出了赋权多阶段有向图最短路求解方法。
|
| 关 键 词： | 多阶段 有向图 赋权多阶段有向图 最短路 |
| 文章编号： | 1672-7177（2007）04-0023-04 |
| 收稿时间： | 2007-05-28 |
| 修稿时间： | 2007年5月28日 |
Several Solutions to the Shortest Path Problem of Multi-Stage Weighted Directed Graph |
| |
| WU Yu-rong,LI Bu-jun.Several Solutions to the Shortest Path Problem of Multi-Stage Weighted Directed Graph[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),2007,28(4):23-26. |
| |
| Authors: | WU Yu-rong LI Bu-jun |
| |
| Abstract: | Multi-stage weighted directed graph is popular in application.There are many practical issues such as transport,engineering,management can be solved by transforming into the shortest path problem.In particular,shortest path problem of the multi-tage weighted directed graph is more significance in solving such practical problems.In this paper,we study the shortest path problem of the multi-stage weighted directed graph and several solutions to it are presented by using an example from different perspective that is reverse labeling method on the graph,the tabular method and dynamic programming. |
| |
| Keywords: | multi-stage directed graph multi-stage weighted directed graph shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
