| 有负权时有向图全路径算法研究 |
| |
| 引用本文： | 高市,姜虹.有负权时有向图全路径算法研究[J].长春大学学报,2009,19(6):22-23. |
| |
| 作者姓名： | 高市 姜虹 |
| |
| 作者单位： | 长春大学管理学院;吉林大学公共卫生学院; |
| |
| 基金项目： | 吉林省教育厅科研项目(吉教科文合字[2006]36号) |
| |
| 摘 要： | 有向图有负权路径求解问题比较常见,但求所有可达路径的算法却见之甚少。本文在以前提出的一种有向图无负权所有可达路径搜索算法的基础上,提出一种先将有负权问题转换成无负权问题,进而用无负权算法求解之的方法。
|
| 关 键 词： | 最短路径 全路径 算法 有负权有向图 |
A research on the algorithms of all paths for directed graphs with negative weights |
| |
| GAO Shi,JIANG Hong.A research on the algorithms of all paths for directed graphs with negative weights[J].Journal of Changchun University,2009,19(6):22-23. |
| |
| Authors: | GAO Shi JIANG Hong |
| |
| Institution: | 1.College of Management;Changchun University;Changchun 130022;China;2.College of Common Health;Jilin University;Changchun 130021;China |
| |
| Abstract: | The solution to paths of directed graphs with negative weights is a common problem,but the algorithm for all feasible paths is limited.This paper gives a method of converting directed graphs with negative weights to directed graphs without negative weights,so as to get a solution to the algorithm with negative weights. |
| |
| Keywords: | shortest path all paths algorithm directed graph with negative weights |
| 本文献已被 CNKI 维普 等数据库收录！ |
