| 基于动态规划思想求解关键路径的算法 |
| |
| 引用本文： | 刘芳,王玲.基于动态规划思想求解关键路径的算法[J].计算机应用,2006,26(6):1440-1442. |
| |
| 作者姓名： | 刘芳 王玲 |
| |
| 作者单位： | 四川师范大学,计算机科学学院,四川,成都,610066 |
| |
| 摘 要： | 关键路径通常是在拓扑排序的基础上求得的。提出了一种利用图的广度优先搜索与动态规划算法相结合求解关键路径的新算法,该算法采用图的邻接表结构形式,不需要进行拓扑排序,较传统的算法具有较高的效率，同时具有较高的健壮性。
|
| 关 键 词： | 关键路径 算法 动态规划 广度优先搜索 优先队列 |
| 文章编号： | 1001-9081（2006）06-1440-03 |
| 收稿时间： | 2005-12-20 |
| 修稿时间： | 2005-12-20 |
Algorithm for finding the critical paths based on dynamic programming |
| |
| LIU Fang,WANG Ling.Algorithm for finding the critical paths based on dynamic programming[J].journal of Computer Applications,2006,26(6):1440-1442. |
| |
| Authors: | LIU Fang WANG Ling |
| |
| Affiliation: | College of Computer Science, Siehuan Normal University, Chengdu Sichuan 610066, China |
| |
| Abstract: | Critical paths are usually obtained by topological collating. A new algorithm for finding critical path by using dynamic programming and breadth-first search was put forward. The data structure of the algorithm is adjacency lists, and it doesnt need topological sorting. This algorithm with higher efficiency than traditional ones, and also with higher healthy. |
| |
| Keywords: | critical path Algorithm dynamic programming breadth-first search priority queue |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
