原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
says that the value of a maximum flow is in fact equal to the capacity of a minimum cut.
Theorem 24.6 (Max-flow min-cut theorem) If f is a flow in a flow network G = (V, E) with source s and sink t, then the following conditions are equivalent: f is a maximum flow in G. The residual network Gf contains no
augmenting paths. |f| = c(S, T) for some cut (S, T) of G. Proof (1) ⇒ (2): Suppose for th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea