%0 Journal Article
%T Algorithm for finding the critical paths based on dynamic programming<br>基于动态规划思想求解关键路径的算法
%A LIU Fang
%A WANG Ling
%A <br>刘芳
%A 王玲
%J 计算机应用
%D 2006
%I 
%X 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.
%K critical path
%K Algorithm
%K dynamic programming
%K breadth-first search
%K priority queue<br>关键路径
%K 算法
%K 动态规划
%K 广度优先搜索
%K 优先队列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=DDCE91089F0E512C&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=73D5C50A0486CB41&eid=70628C01DA910FB5&journal_id=1001-9081&journal_name=计算机应用&referenced_num=4&reference_num=3