Python, Min-cost Max-flow, and a Loose End

There was this particular weighted matching problem that I needed to solve some time ago. I reduce the whole thing to min-cost flow, similar to what one would do for a normal max matching. My C++ implementation would give me the answer almost instantly on a synthesized small input and in a few minutes on my actual data. But in Python, it was much, much slower. This article explores why.