The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.