原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
atisfies the difference constraint xj − xi ≤ w(vi, vj) that corresponds to edge (vi, vj).
Now we show that if the constraint graph contains a negative-weight cycle, then the system of difference constraints has no feasible solution. Without loss of generality, let the negative-weight cycle be c = 〈v1, v2,
… , vk〉, where v1 = vk. (The vertex v0 cannot be on cycle c, because it has no entering e
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea