To determine the level graph, we place the source at level 1, its successors at level 2, and so on.
The blocking flow is the maximum flow that can pass in a given path.
Dinic's algorithm is as follows:
Construction of the level graph:
Find an increasing path, find the limiting arc:
Return to step 3 and 4:
And so on until no longer finding an increasing path: