← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

22 第22章 单源最短路径

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

Hence, u.d = δ(s, u), and by the upper-bound property, this value never changes again. ▪

Corollary 22.7 After Dijkstra’s algorithm is run on a weighted, directed graph G = (V, E) with nonnegative weight function w and source vertex s, the predecessor subgraph Gπ is a shortest-paths tree rooted at s. Proof

Immediate from Theorem 22.6 and the predecessor-subgraph property. ▪ Analysis How fast is

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea