Introduction - If you have any usage issues, please Google them yourself
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