原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
theorem shows that the Ford-Fulkerson method cannot produce a solution with this problem.
Theorem 24.10 (Integrality theorem) If the capacity function c takes on only integer values, then the maximum flow f produced by the Ford-Fulkerson method has the property that |f| is an integer. Moreover, for all
vertices u and v, the value of f (u, v) is an integer. Proof Exercise 24.3-2 asks you to
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea