Develop a class implementation for the mincost-flow problem that is based on the reduction to the transportation problem described in Exercise 22.148.
Exercise 22.148
Show that the mincost-maxflow problem reduces to the transportation problem with just V extra vertices and edges by using a construction similar to the one used in the proof of Property 22.16.