The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them.
Features
- Ada implementation is essentially an algorithmic description
- Correctly working example tested on thousands of cases
License
GNU General Public License version 3.0 (GPLv3)Follow HungarianAlgorithm
You Might Also Like
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of HungarianAlgorithm!