Dinitz's algorithm

Dinitz's algorithm --- алгоритм Диница.

This is the algorithm for finding maximum flows in undirected graphs that repeatedly augments the current flow by a blocking flow in the graph induced by the residual arcs on shortest paths from [math]\displaystyle{ s }[/math] to [math]\displaystyle{ t }[/math]. It is known that Dinitz's algorithm terminates in [math]\displaystyle{ \min(n^{2/3}m^{1/2}) }[/math] iterations.