HungarianAlgorithm.greedyMatch

Find a valid matching by greedily selecting among zero-cost matchings. This is a heuristic to jump-start the augmentation algorithm.

struct HungarianAlgorithm(T)
pure nothrow
void
greedyMatch
()

Meta