Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.
Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
Start Free
Earn up to 16% annual interest with Nexo.
Access competitive interest rates on your digital assets.
Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform.
Geographic restrictions, eligibility, and terms apply.
An Ada implementation of the Hungarian Algorithm to minimize cost
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.
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.