← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

yielding ▪ A corollary to Lemma 24.4 shows how cut capacities bound the value of a flow.

Corollary 24.5 The value of any flow f in a flow network G is bounded from above by the capacity of any cut of G. Proof Let (S, T) be any cut of G and let f be any flow. By Lemma 24.4 and the capacity constraint, ▪

Corollary 24.5 yields the immediate consequence that the value of a maximum flow in a net

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea