← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

22 第22章 单源最短路径

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

ow that for any vertex v ∈ Vπ, the graph Gπ contains at most one simple path from s to v.

Suppose otherwise. That is, suppose that, as Figure 22.9 illustrates, Gπ contains two simple paths from s to some vertex v: p1, which we decompose into s ⇝ u ⇝ x → z ⇝ v, and p2, which we decompose into s ⇝ u ⇝ y → z

⇝ v, where x ≠ y (though u could be s and z could be v). But then, z.π = x and z.π = y, w

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea