← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

s follows. Let the source s and sink t be new vertices not in V, and let V′ = V ∪ {s, t}.

If the vertex partition of G is V = L ∪ R, the directed edges of G′ are the edges of E, directed from L to R, along with |V | new directed edges: E′ = {(s, u) : u ∈ L} ∪ {(u, v) : u ∈ L, v ∈ R, and (u, v) ∈ E} ∪ {(v, t) : v ∈ R}. To complete the construction, assign unit capacity to each edge in E′.

Since each vertex in V has at least one incident edge, |E| ≥ |V|/2. Thus, |E| ≤ |E′| = |E

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea