A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
-
Updated
Oct 21, 2019 - Kotlin
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
Add a description, image, and links to the kuhn-munkres topic page so that developers can more easily learn about it.
To associate your repository with the kuhn-munkres topic, visit your repo's landing page and select "manage topics."