Maximum-Flow Minimum-Cut Theorem

• Removing arcs (D,C) and (A,NY) cuts off SF from NY.

• The set of arcs{(D,C), (A,NY)} is an s-t cut with capacity 2+7=9.

• The value of a maximum s-t flow = the capacity of a minimum s-t cut.

Previous slide

Back to first slide

View graphic version