Given a max flow input instance and a flow, identify the capacity of edges, flow along edges, and residual capacity.
Identify whether the flow is valid, and if not, explain which constraint is not satisfied.
Example problem
Exercise 1.
On the above graph, which of the following flows are valid?
If invalid, indicate which constraint is violated and why.
Part a:
Part b:
Part c:
Sample solution
Sample solution.
Part a: valid.
Part b: invalid. The flow constraint at $w$ is violated: the total flow in is 3, but the total flow out is 5.
Part c: invalid. The capacity constraint on $(v,t)$ is violated: $c(v,t) = 2$, but $f(v,t) = 4$.
To pass, a solution must give a correct answer for all three parts. For b and c, it must correctly identify a violated constraint and correctly say why it is violated.
The numerical rubric for this problem is:
4 (Pass, Near-Perfect): correct, clear, concise.
3 (Pass, Proficient): correct, possibly not fully clear or concise. Perhaps a correct answer but with a minor arithmetic mistake.
2 (Fail, Progress): may be incorrect on one or more of the parts. May give a much too verbose solution, or explanations may contain major mistakes.
1 (Fail, Wrong Track): Does not appear to be applying correct definitions.