Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Ford-Fulkerson algorithm

Theory

Step by step

Report a typo

Put the steps of the Ford-Fulkerson algorithm in correct order:

Put the items in the correct order
Find any augmenting path
Update the flows of the edges of the network
Initialize the current flows of the edges with 0
___

Create a free account to access the full topic