What is a Min-Cut in a graph?

What is a Min-Cut in a graph?

Approach: Define a set of edges whose removal disconnects the source and sink.

A cut in a flow network that minimizes the total capacity of edges directed from the source partition to the sink partition. According to the Max-Flow Min-Cut theorem, the value of the max flow equals the capacity of the min cut.

Follow-up: Name an algorithm to find max flow.

Key concepts: max-flow min-cut theorem, capacity, residual graph.