c****r
发帖数: 185 | 1 It is called the Hungarian method, O(n^3)
You may find it in any textbook for combinatorial optimization | y***u
发帖数: 101 | 2 实际中的code一般都加上一些heuristics,应该更快,n^3 是worst-case
【在 c****r 的大作中提到】
: It is called the Hungarian method, O(n^3)
: You may find it in any textbook for combinatorial optimization
|
|
