← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

In order to represent a possible decrease in the positive flow f (u, v) on an edge in G,

the residual network Gf contains an edge (v, u) with residual capacity cf (v, u) = f (u, v)—that is, an edge that can admit flow in the opposite direction to (u, v), at most canceling out the flow on (u, v

). These reverse edges in the residual network allow an algorithm to send back flow it has

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea