The Hungarian algorithm solves the assignment problem. It was developed by Harold Kuhn and reworked by James Munkres, and so it is also known as the Kuhn-Munkres algorithm. Kuhn-Munkres is used inside assignment problem solver applications. An instance generator application creates an input file for the solver. A checker application verifies the solution computed by the solver. A bash script compiles and executes these apps.