An implementation of the Hungarian Algorithm in C++
-
Updated
Dec 11, 2018 - C++
An implementation of the Hungarian Algorithm in C++
A Java implementation of the Kuhn–Munkres assignment algorithm (Hungarian Algorithm)
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
AGT course project on maximum matching in bipartite and general graphs
A python program to solve assignment problem by the Kuhn–Munkres algorithm (The Hungarian Method).
A C++ demo for Hungarian algorithm (Kuhn-Munkres algorithm).
(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.
A implementartion of the Kuhn–Munkres algorithm or Munkres assignment algorithm, also known as the Hungarian Method. This implementation it's entirely in PyTorch
Fully functional Hungarian Algorithm implementation in Ada
Pathfinding library for rust
[Undergraduate Independent Study] Optimizing Waiting Times for Seoul Taxi Service for the Disabled Using Multi Attribute Weight Model
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."