hungarian-algorithm
hungarian-algorithm copied to clipboard
mayorx
(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.
`time consuming of size` makes no sense. Should it be maybe `time consumed for size` ?
``` kbriggs@Z230-work:~/Downloads/hungarian-algorithm-master> python3 demo.py Traceback (most recent call last): File "demo.py", line 24, in matcher = KMMatcher([ File "/home/kbriggs/Downloads/hungarian-algorithm-master/km_matcher.py", line 21, in __init__ self.xy = -np.ones((self.n,), dtype=np.int) File "/home/kbriggs/.local/lib/python3.8/site-packages/numpy/__init__.py", line...