Edmonds-Karp algorithm
Description: The Edmonds-Karp algorithm is a graph algorithm for finding a maximum flow in a network, using breadth-first search to select augmenting paths.
Primary topic: Complexity and Algorithms in Graphs (58%)
Related topic: Complexity and Algorithms in Graphs (58%)
Wikidata ID: wiki/Q1302658
OpenAlex ID: keywords/edmonds-karp-algorithm
