The Hungarian Algorithm

The Hungarian algorithm is used to solve the following problem:

Given n > 0 workers, n tasks, and the cost matrix C whose member C(i, j) >= 0 represents the cost of assigning the i-th worker to the j-th task, find an assignment of workers to tasks with minimal total cost.

It does so in O(n³) time. This project is an implementation of the Hungarian Algorithm in C++. Our only dependency is Eigen (for sparse matrices).

Directory structure

Directory	Description
visual_studio/	Solution files (VS 2017).
include/	Headers.
sources/	*.cpp sources.
libraries/	3rd party dependencies.
documentation/	Doxygen configuration.
tests/	Test project files.
benchmarks/	Benchmark project files.