To determine the level graph, we set the source to level 1, its successors to level 2, and so on.
The blocking flow is the maximum flow that can pass through a given path.
Dinic’s algorithm is as follows:
Building the level graph:
To find an increasing path, find the limiting arc:
Back to step 3 and 4:
And so on until you no longer find an increasing path: