Algorithm of Critical Path Based on Dynamic Programming

Directed acyclic graph (abbreviated as DAG) is an effective way to describe a project, such as planning process, construction work, production process and program flow etc., while critical path is used to estimate the shortest time to complete the whole project. AOE network refers to a directed graph in which vertex stands for events, directed edge for activities, weights on the edge of the cost are the said activities. In this paper the algorithm of solving the critical paths based on the philosophy of dynamic programming is presented, and the analysis and research on the algorithm is also furnished.