原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
e obtain the contradiction that 0 ≤ w(c) < 0. ▪ Solving systems of difference constraints
Theorem 22.9 suggests how to use the Bellman-Ford algorithm to solve a system of difference constraints. Because the constraint graph contains edges from the source vertex v0 to all other vertices, any negative-weight cycle in the constraint graph is reachable from v0. If the Bellman-Ford algorithm
returns TRUE, then the shortest-path weights give a feasible solution to the system. In F
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea