The traditional solution for the assignment problem is the Hungarian method - it's complexity is O(V^4) or O(V^3) if using Edmonds method.

However, it can also be reduced to a min cost max flow problem and solved in O(n^3) (by keeping all edges positive and using Dijkstra shortest path).

Why would one use Hungarian method over the flow method?