Source: wikibot/edmond-ogston-model
= Edmond–Ogston model
{wiki=Edmond–Ogston_model}
The Edmonds–Karp algorithm is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network. It uses a breadth-first search (BFS) approach to find augmenting paths in the residual graph, which helps to ensure that the maximum flow is computed in polynomial time.