Title:
the-critical-path-of-a-graph
Download
Description: • Implement a project plan, if the entire project is divided into several steps, some steps can be implemented simultaneously, some process must be completed before the implementation of some other process, process an order relation between the directed graph representation available. A project completion time can be divided into: earliest completion time and the latest finish time. • Critical path algorithm works mainly through the various steps of calculating buffer time (namely: the latest finish time minus the earliest completion time difference), if certain processes buffering time is zero, these processes is the critical path, and buffer time is not zero step is not critical path.
To Search:
File list (Check if you may need any files):
计算有向图的关键路径.cpp
