原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
ex on cycle c has a finite shortest-path weight, which means that it is reachable from s.
We’ll examine the shortest-path estimates on cycle c immediately before the call RELAX(vk−1, vk, w) and show that c is a negative-weight cycle, thereby contradicting the assumption that G contains no
negative-weight cycles that are reachable from the source. Just before the call, we have
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea