摘要
关键路径通常是在拓扑排序的基础上求得的,本文提出了一种新的求关键路径的算法,该算法数据结构形式简单直观,且易于实现。用C语言设计了相应的程序验证了此算法的有效性。
Critical paths are usually obtained by topological collating,A new algorithm for finding critical paths has been put forward.Data structure of the algorithm is simple and easily implement.The algorithm is proved by C programme.
出处
《计算机应用与软件》
CSCD
北大核心
2005年第6期97-99,共3页
Computer Applications and Software
