原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
, the shortest-path weight δ(s, v) remains well defined, even if it has a negative value.
If the graph contains a negative-weight cycle reachable from s, however, shortest-path weights are not well defined. No path from s to a vertex on the cycle can be a shortest path—you can always find a path with lower
weight by following the proposed “shortest” path and then traversing the negative-weight
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea