← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

) = Σv∈V (f ↑ f′)(v, u). ▪ Augmenting paths Given a flow network G = (V, E) and a flow f,

an augmenting path p is a simple path from s to t in the residual network Gf. By the definition of the residual network, the flow on an edge (u, v) of an augmenting path may increase by up to cf (u, v) without

violating the capacity constraint on whichever of (u, v) and (v, u) belongs to the origin

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea