if costs are same then that max flow is also a min cost, but I don't know how to modify it to solve arbitrary costs in range O(1), if I have time I'll give a thought about it, but meanwhile maybe it's not bad if you try understand the hopcraft algorithm which is not very complicated and think about its modification to see if it works with min cost or not.