← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

22 第22章 单源最短路径

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.727Z

nd so their shortest-path weights are ∞, even though they lie on a negative-weight cycle.

Some shortest-paths algorithms, such as Dijkstra’s algorithm, assume that all edge weights in the input graph are nonnegative, as in a road network. Others, such as the Bellman-Ford algorithm, allow negative-weight

edges in the input graph and produce a correct answer as long as no negative-weight cycle

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea