An implementation of the Hungarian algorithm for solving minimum-weight perfect matching in bipartite graphs, supporting both minimum and maximum weight modes.
-
Updated
May 23, 2025 - C++
An implementation of the Hungarian algorithm for solving minimum-weight perfect matching in bipartite graphs, supporting both minimum and maximum weight modes.
Fast heuristic for maximum weight matching on Euclidean graphs
Add a description, image, and links to the maximum-weight-matching topic page so that developers can more easily learn about it.
To associate your repository with the maximum-weight-matching topic, visit your repo's landing page and select "manage topics."