Show In Network G With All Cij 1

Show that in a network G with all cij = 1, the maximum flow equals the number of edge-disjoint paths s → t.

Posted in Uncategorized