| 赋权有向图最短路问题的新解法--前趋法 |
| |
| 引用本文： | 安凯,郑亚林,邱祖廉. 赋权有向图最短路问题的新解法--前趋法[J]. 河北师范大学学报(自然科学版), 2000, 24(1): 23-24 |
| |
| 作者姓名： | 安凯 郑亚林 邱祖廉 |
| |
| 作者单位： | 西安交通大学自动控制系,陕西西安,710049;西安交通大学自动控制系,陕西西安,710049;西安交通大学自动控制系,陕西西安,710049 |
| |
| 基金项目： | 陕西省科技厅资助项目,98-SL08, |
| |
| 摘 要： | Dijkstra算法被公认为解决最短路问题的最好算法,但它的缺陷之一是不能解决存在负权的最短路问题.一种解决这类问题的新方法--前趋法可弥补Dijkstra算法的这一缺陷.实例表明、前趋法是一种解决存在负权的最短路问题的行之有效的简便算法.
|
| 关 键 词： | 赋权有向图 最短路问题 Dijkstra算法 前趋法 |
| 文章编号： | 1000-5854(200u)01-0023-02 |
| 修稿时间： | 1999-06-20 |
A New Algorithm Solution to the Shortest Path Problem of Weighting Directed Graph-Method of Forward Graph |
| |
| AN Kai,ZHENG Ya-lin,QIU Zu-lian. A New Algorithm Solution to the Shortest Path Problem of Weighting Directed Graph-Method of Forward Graph[J]. Journal of Hebei Normal University, 2000, 24(1): 23-24 |
| |
| Authors: | AN Kai ZHENG Ya-lin QIU Zu-lian |
| |
| Affiliation: | AN Kai, ZHENG Ya-lin,QIU Zu-lian(Department of Automation Control ,Xian Jiaotong University,Xian 710049 ,China) |
| |
| Abstract: | Dijkstra's algorithm of solving the shortest path problem of weighted directed graph is still regarded as the best one. However its weakness is that it can not be used to solve the shortest path problem with some negative weights. A new algorithm,called method of forward graph,can take as a saving method. |
| |
| Keywords: | weighted directed graph the shortest path problem Dijkstra's algorithm method of forward graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
