Ford-Fulkerson Algorithm
The Ford-Fulkerson Algorithm is a method used to find the maximum flow in a flow network. It works by repeatedly searching for paths from the source to the sink that can accommodate more flow, known as augmenting paths. The algorithm increases the flow along these paths until no more augmenting paths can be found.
This algorithm relies on the concept of residual capacity, which represents the remaining capacity of edges after accounting for current flow. The Edmonds-Karp Algorithm is a specific implementation of the Ford-Fulkerson method that uses breadth-first search to find augmenting paths efficiently.