What is the running time of Dinic's blocking flow algorithm?
O(V^2E)
O(VE^2)
O(V^3)
O(E max |f|)
(A) O(V^2E)
Explanation:
The running time of Dinic's blocking flow algorithm is O(V²E). The running time of Ford-Fulkerson algorithm is O(E max |f|).
