Question

Any network must have flow between sources and sink equal to capacity of:

• A. Cut
• B. Minimal cut
• C. Both cut and minimal cut
• D. Either cut or minimal cut

Answer 1

Answer:

B. Minimal cut

The maximal flow in a network between a source and a sink is equal to the minimal cut capacity of all cuts separating the source and sink. Therefore, in any network, the flow between sources and sink must be equal to the capacity of the minimal cut. This is described by the Max Flow-Min Cut Theorem.