麻省理工大学算法导论lecture23.pdfVIP

Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 23 Prof. Charles E. Leiserson Recall from Lecture 22 ? Flow value: | f | = f (s, V). ? Cut: Any partition (S, T) of V such that s ∈ S and t ∈ T. ? Lemma. | f | = f (S, T) for any cut (S, T). ? Corollary. | f | ≤ c(S, T) for any cut (S, T). ? Residual graph: The graph Gf = (V, Ef ) with strictly positive residual capacities cf (u, v) = c(u, v) – f (u, v) 0. ? Augmenting path: Any path from s to t in Gf . ? Residual capacity of an augmenting path: c f ( p) = min {c f (u,v)}. (u,v)∈p ? 2001 by Charles E. Leiserson Introduction to Algorithms Day 40 L23.2 Max-flow, min-cut theorem Theorem. The following are equivalent: 1. | f | = c(S, T) for some cut (S, T). 2. f is a maximum flow. 3. f admits no augmenting paths. Proof. (1) ? (2): Since | f | ≤ c(S, T) for any cut (S, T) (by the corollary from Lecture 22), the assumption that | f | = c(S, T) implies that f is a maximum flow. (2) ? (3): If there were an augmenting path, the flow value could be increased, contradicting the maximality of f. ? 2001 by Charles E. Leiserson Introduction to Algorithms Day 40 L23.3 Proof (continued) (3) ? (1): Suppose that f admits no augmenting paths. Define S = {v ∈ V : there exists a path in Gf from s to v}, and let T = V – S. Observe that s ∈ S and t ∈ T, and thus (S, T) is a cut. Consider any vertices u ∈ S and v ∈ T. ss uu vv path in Gf ST We must have cf (u, v) = 0, since if cf (u, v) 0, then v ∈ S, not v ∈ T as assumed. Thus, f (u, v) = c(u, v), since cf (u, v) = c(u, v) – f (u, v). Summing over all u ∈ S and v ∈ T yields f (S, T) = c(S, T), and since | f | = f (S, T), the theorem follows. ? 2001 by Charles E. Leiserson Introduction to Algorithms Day 40 L23.4 Ford-Fulkerson max-flow algorithm Algorithm: f [u, v] ← 0 for a