5 QUESTIONS
Q1 1 / 5 medium
Max Flow (Edmonds-Karp)
Given a directed graph with edge capacities, find the maximum flow from source s to sink t.
What is the key idea behind max flow algorithms?
Given a directed graph with edge capacities, find the maximum flow from source s to sink t.
What is the key idea behind max flow algorithms?