原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
augmented at most |E| ln |f*| times, the flow is a maximum flow. 24-7 Global minimum cut
A global cut in an undirected graph G = (V, E) is a partition (see page 1156) of V into two nonempty sets V1 and V2. This definition is like the definition of cut that we have used in this chapter, except that we no longer have distinguished vertices s and t. Any edge (u, v) with u ∈ V1 and v ∈ V2 is said to cross the cut.
We can extend this definition of a cut to a multigraph G = (V, E) (see page 1167), and we
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea