第08章网络流和匹配netwokflows.pptVIP

Network Flow Maximum Flow Chapter 8: Network Flow Outline and Reading Flow Networks Flow (§8.1.1) Cut (§8.1.2) Maximum flow Augmenting Path (§8.2.1) Maximum Flow and Minimum Cut (§8.2.1) Ford-Fulkerson’s Algorithm (§8.2.2-8.2.3) Sections §8.2.4-8.5 on Matching and Minimum Flow are optional. Flow Network A flow network (or just network) N consists of A weighted digraph G with nonnegative integer edge weights, where the weight of an edge e is called the capacity c(e) of e Two distinguished vertices, s and t of G, called the source and sink, respectively, such that s has no incoming edges and t