原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
denotes the shortest-path distance from u to v in Gf, where each edge has unit distance.
Lemma 24.7 If the Edmonds-Karp algorithm is run on a flow network G = (V, E) with source s and sink t, then for all vertices v ∈ V − {s, t}, the shortest-path distance δf (s, v) in the residual network Gf
increases monotonically with each flow augmentation. Proof We’ll suppose that a flow augm
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea