原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
ing time of FORD-FULKERSON depends on the augmenting path p and how it’s found in line 3.
If the edge capacities are irrational numbers, it’s possible to choose the augmenting path so that the algorithm never terminates: the value of the flow increases with successive augmentations, but never converges to
the maximum flow value. The good news is that if the algorithm finds the augmenting path
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea