hungarian-algorithm-n3
hungarian-algorithm-n3 copied to clipboard
[Complete] š(nĀ³) implementation of the Hungarian algorithm
Results
2
hungarian-algorithm-n3 issues
Sort by
recently updated
recently updated
newest added
The function uses a single allocation for three separate array. One array of c times BitSetLimb, and two arrays of (c+1) times size_t. When the starting address of this->next is...
Unlikely most of Hungarian algorithms, this implementation do not assume that the matrix related to the problem is square or equal number of e.g. workers and tasks. To terminate progress,...