C Implementation of the Hungarian Method

Download libhungarian-v0.1.3.tgz (21.09.2015)

From homepage:

C-implementation of the Hungarian Method: finding the optimal assignment (assigning a set of jobs to a set of machines) in O(n^3), where n=max{#jobs, machines}. The implementation is a sligntly enhanced version of the implementation provided by the Stanford GraphBase. See also: Stanford GraphBase, Hungarian Method by Brian Gerkey.

From implementation file:

This file may be freely copied and distributed!