最大流问题：增广路径算法的比较之序

零零散散学算法系列最大流问题之序

最大流问题之增光路径算法的比较：/article/1391232.html

参考文献：

[1] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows:
Theory, Algorithms, and Applications.

[2] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Introduction to Algorithms.

[3] Ford, L. R., and D. R. Fulkerson. Maximal flow through a network.

[4] Norman Zadeh. Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows.

[5] _efer_. Algorithm Tutorial:
MaximumFlow.

[6] gladius. Algorithm Tutorial:
Introduction to graphs and their data structures: Section 1.

[7] gladius. Algorithm Tutorial:
Introduction to graphs and their data structures: Section 3.

[8] http://elib.zib.de/pub/mp-testdata/generators/index.html -- A number of generators for network flow problems.