← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

d by The intuition behind this definition follows the definition of the residual network.

The flow on (u, v) increases by f ′(u, v), but decreases by f ′(v, u) because pushing flow on the reverse edge in the residual network signifies decreasing the flow in the original network.

Pushing flow on the reverse edge in the residual network is also known as cancellation. F

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea