According to the maximum flow - minimum cut theorem, what is true?

The maximum flow - minimum cut theorem is a fundamental principle in network flow theory which states that in a flow network, the maximum amount of flow that can be sent from a source to a sink is equal to the capacity of the minimum cut that separates the source from the sink.

This means that when you identify the maximum flow achievable in a network, it directly corresponds to the capacity of the smallest set of edges that, if removed, would completely disconnect the source from the sink. This duality between flow and cut is what makes option C the correct choice.

In a flow network, the maximum flow represents the most efficient way to transmit data or resources from one point to another, while the minimum cut reflects the least capacity needed to sever that connection. Thus, the equality established in the theorem highlights a critical balance in understanding network flows.