Step 1: | First initialize the flow f to ‘0’ for each edge. |
Step 2: | do. |
Step 3: | . |
Step 4: |
|
Step 5: |
|
Step 6: | while. |
Step 7: | do while there exists an augmenting path p from s to t in the residual network of capacity at least 1. |
Step 8: | do. |
Step 9: | for each edge (u, v) in p. |
Step 10: | do. |
Step 11: | . |
Step 12: | . |
Step 13: | return f. |