Description:
Dinic method of maximum flow construction,
for O(n^3),
using pseudo-maximal flow construction by
Malhotra - Kumar - Maheshvari.
By Vitold Lipsky ( Combinatorics for programmers , 1988).
Written by: Amir Tulegenov, 2009
To Search:
File list (Check if you may need any files):
a.lin.pas
Download