Extend your feasible-flow ADT from Exercise 22.74 to include lower bounds on the capacities of edges. Implement a class that computes a mincost maxflow (if one exists) that respects these bounds.
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.