原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
) = Σ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