 Ford–Fulkerson algorithm

The Ford–Fulkerson algorithm is a method used to compute the maximum flow in a flow network. Developed by L.R. Ford, Jr. and D.R. Fulkerson in the 1950s, this algorithm is based on the concept of augmenting paths and works by iteratively increasing the flow in the network until no more augmenting paths can be found.