FEAT: add Hungarian in cluster matching strategy #82
Description
This strategy is a more accurate version of the Greedy strategy, but runs in O(n^3) (instead of O(n^2))
Metadata
Metadata
Assignees
Labels
No labels
{{ message }}
This strategy is a more accurate version of the Greedy strategy, but runs in O(n^3) (instead of O(n^2))