← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

it an amount of additional flow equal to the edge’s capacity minus the flow on that edge.

If that value is positive, that edge goes into Gf with a “residual capacity” of cf (u, v) = c(u, v) − f (u, v). The only edges of G that belong to Gf are those that can admit more flow. Those edges (u, v)

whose flow equals their capacity have cf (u, v) = 0, and they do not belong to Gf. You mi

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea