Past exam of the computer science course of the University of Oxford / 2019 / Algorithms / 1 / b

Sum net outflow over all vertices in the source side $S$. An internal directed edge occurs once positively and once negatively, so it cancels. All internal vertices have zero net outflow by flow conservation, and the sink is outside $S$. ThereforeThe second sum is nonnegative, while every term in the first satisfies its capacity constraint. Consequently,This is direct accounting from flow conservation; it does not invoke the max-flow min-cut theorem.