This diagram represents the graph after the second step of the maximum flow algorithm. The edge [1, 2] is not selected because node 2 is already matched, so the edge [0, 3] is selected instead.
Bipartite Graph Example – Step 3
—
by
—
by
This diagram represents the graph after the second step of the maximum flow algorithm. The edge [1, 2] is not selected because node 2 is already matched, so the edge [0, 3] is selected instead.