原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
prove this theorem, though, we must first explore the notion of a cut of a flow network.
A cut (S, T) of flow network G = (V, E) is a partition of V into S and T = V − S such that s ∈ S and t ∈ T. (This definition is similar to the definition of “cut” that we used for minimum spanning trees in Chapter 21
, except that here we are cutting a directed graph rather than an undirected graph, and we
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea