Let G be a connected digraph with capacity constraints b and c, where b(e) is always positive and c(e) = ∞ for all edges e. Show that G has a feasible circulation if and only if it is strongly connected. Moreover, give a criterion for the existence of a feasible flow if we also specify a source s and a sink t. Hint: Use Exercise 8.5.3.
Our customer support team is here to answer your questions. Ask us anything!
👋 How can we help with you?