Suppose a flow represents products transported between cities by trucks: let u-v on the edge be the amount transported from city u to city v in one day. Write a program that shows the truckers the...

Suppose a flow represents products transported between cities by trucks: let u-v on the edge be the amount transported from city u to city v in one day. Write a program that shows the truckers the daily incoming orders,telling them where to pick up and how much load to drop off.(I need Min Cost Max Flow algorithm in C++ ).