Algorithm for finding the critical paths based on dynamic programming
基于动态规划思想求解关键路径的算法

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.