- Category:
- Data structs
- Tags:
-
[PDF]
- File Size:
- 117kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- lxb
Description: Critical path is usually calculated based on the topological sort of. This algorithm designed some unique data structure, algorithm running throughout the process, find the starting point (source) to the resumption point (end point) the critical path of the process (stack, the stack, etc. operations) actually only one set , does not require the topological sort algorithm time complexity is O (n+ e), the algorithm is more efficient than traditional
To Search:
File list (Check if you may need any files):
求解关键路径的新算法.pdf
Download