原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
e. Argue that the inner while loop of lines 5–6 executes O(E) times for each value of K.
MAX-FLOW-BY-SCALING (G, s, t) 1 C = max {c(u, v) : (u, v) ∈ E} 2 initialize flow f to 0 3 K = 2⌊lg C⌋ 4 while K ≥ 1 5 while there exists an augmenting path p of capacity at least K 6 augment flow f along p 7 K = K/2 8 return f
f. Conclude that MAX-FLOW-BY-SCALING can be implemented so that it runs in O(E2 lg C) tim
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea