Edmonds–Karp algorithm
= Edmonds–Karp algorithm
{wiki=Edmonds–Karp_algorithm}
The Edmonds-Karp algorithm is an efficient implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network. It uses breadth-first search (BFS) to find augmenting paths in the network, which makes it run in polynomial time. \#\#\# Key Features: 1. **Flow Network**: A flow network consists of nodes (vertices) connected by directed edges, each with a specified capacity.