原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
g path in the residual network. Suppose instead that the Ford-Fulkerson algorithm chooses
a widest augmenting path: an augmenting path with the greatest residual capacity. Assume that G = (V, E) is a flow network with source s and sink t, that all capacities are integer, and that the largest
capacity is C. In this problem, you will show that choosing a widest augmenting path resu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea