原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
in G is a real-valued function f : V × V → ℝ that satisfies the following two properties:
Capacity constraint: For all u, v ∈ V, we require 0 ≤ f(u, v) ≤ c(u, v). The flow 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 to
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea