Limited access

You are given a flow network with a maximum flow of $f$ and a minimum cut with a capacity of $c$.

A cut is a partition of the flow network such that each node in the network belongs to one of two distinct sets and the source and sink nodes belong to different sets. The capacity of the cut is the sum of the capacities of the edges that leave the set containing the source node and enter the set containing the sink node. The minimum cut is the cut with the smallest​ capacity in the network.

Which of the following statements are true?

A

$f$ is less than $c$.

B

$f$ is equal to $c$.

C

$f$ is greater than $c$.

D

It depends on the specific graph.

Select an assignment template