HungarianAlgorithm.computeInitialFeasibleSolution

Compute an initial feasible solution by assigning zero labels to the workers and by assigning to each job a label equal to the minimum cost among its incident edges.

struct HungarianAlgorithm(T)
pure nothrow
void
computeInitialFeasibleSolution
()

Meta