原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
24.7(b), the flow then has value 2. Figure 24.7(c) shows the resulting residual network.
If the algorithm continues alternately choosing the augmenting paths s → u → v → t and s → v → u → t, it performs a total of 2,000,000 augmentations, increasing the flow value by only 1 unit in each. The Edmonds-Karp
algorithm In the example of Figure 24.7, the algorithm never chooses the augmenting path
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea