Solve the min cost flow problem using both NetworkX and Linear Programming package PuLP - View it on GitHub