An implementation of the Hungarian algorithm for solving minimum-weight perfect matching in bipartite graphs, supporting both minimum and maximum weight modes.
benchmarking research graph-algorithms hungarian-algorithm advanced-algorithms minimum-weight-perfect-matching maximum-weight-matching
-
Updated
May 23, 2025 - C++