ford-fulkerson algorithm
the 
algorithm finds the flow function with the maximal total flow in a given flow network
algorithm finds the flow function with the maximal total flow in a given flow network
once the algorithm is done, in the network there would be a saturated s-t cut.
algorithm is done, in the network there would be a saturated s-t cut.the time complexity of this algorithm depends on the way we pick the flow augmenting paths
the time complexity is
the time complexity is