原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
n a straightforward implementation of FORD-FULKERSON executes the while loop of lines 3–8
at most |f*| times, since the flow value increases by at least 1 unit in each iteration. A good implementation should perform the work done within the while loop efficiently. It should represent the flow network G =
(V, E) with the right data structure and find an augmenting path by a linear-time algorit
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea