Implement a class that finds mincost maxflows in distribution networks with negative costs. Use your solution to Exercise 22.105 (which assumes that costs are all nonnegative).
Exercise 22.105
Expand your class for feasible flows from Exercise 22.74 to include costs. Use a Network Min Cost object to solve the mincost-feasible-flow problem.
Exercise 22.74
Develop a class for feasible-flow problems that includes methods allowing clients to set supply-demand values and to check that flow values are properly related at each vertex.