Consider the "opposite" to the max-flow problem, which is to minimize the divergence out of s over all capacity-feasible flow vectors having zero divergence for all nodes other than s and t.
(a) Show how to solve this problem by first finding a feasible solution, and by then using a max-flow algorithm.
(b) Derive an analog to the max-flow/min-cut theorem.