原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
-FULKERSON takes O(E) time when it uses breadth-first search to find the augmenting path,
the total running time of the Edmonds-Karp algorithm is O(VE2). Exercises 24.2-1 Prove that the summations in equation (24.6) equal the summations on the right-hand side of equation (24.5). 24.2-2 In Figure 24.1(b)
, what is the net flow across the cut ({s, v2, v4}, {v1, v3, t})? What is the capacity of
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea