原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
to perform all the tasks, even if as many tasks as possible are performed simultaneously.
You can find a critical path by either negating the edge weights and running DAG-SHORTEST-PATHS, or running DAG-SHORTEST-PATHS, but replacing “∞” by “−∞” in line 2 of INITIALIZE-SINGLE-SOURCE and “>” by “<” in the RELAX procedure.
Figure 22.5 The execution of the algorithm for shortest paths in a directed acyclic graph
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea