Another way to think of this problem is find a feasible flow in a complete graph that satisfy all vertex demands and using minimum number of edges.