原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
ow from one vertex to another must be nonnegative and must not exceed the given capacity.
Flow conservation: For all u ∈ V − {s, t}, we require The total flow into a vertex other than the source or sink must equal the total flow out of that vertex—informally, “flow in equals flow out.” When (u, v) ∉ E,
there can be no flow from u to v, and f (u, v) = 0. We call the nonnegative quantity f (u
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea