Improve Time Complexity for MCF and Assignment Problem

[bqi343]

It is mentioned that MCF and the assignment problem can be solved in O(mn + Fm*log n) time and O(n^3) time, respectively, but the provided code uses SPFA, which does not run in these time complexities. Here are some implementations that do run in the desired time complexities:

• MCF
• Hungarian

[adamant-pwn]

Hi, thanks for pointing that out! There is actually a separate article on the original e-maxx about Hungarian algorithm. I'd be happy to accept a pull request that changes the algorithm, but using your code directly is complicated, as it depends on various macros and is generally not very well structured for algorithm exposition, I'd say :(