原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
by the flow fp in Figure 24.4(b), and Figure 24.4(d) shows the ensuing residual network.
Corollary 24.3 Let G = (V, E) be a flow network, let f be a flow in G, and let p be an augmenting path in Gf. Let fp be defined as in equation (24.7), and suppose that f is augmented by fp. Then the function f ↑ f
p is a flow in G with value |f ↑ fp| = |f| + |fp| > |f|. Proof Immediate from Lemmas 24.1
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea