Content deleted Content added
Changing short description from "a combinatorial optimization algorithm that solves the assignment problem in polynomial time" to "Combinatorial optimization algorithm that solves the assignment problem in polynomial time" (Shortdesc helper) |
Added Julia implementation |
||
Line 242:
=== Implementations ===
Note that not all of these satisfy the <math>O(n^3)</math> time complexity, even if they claim so. Some may contain errors, implement the slower <math>O(n^4)</math> algorithm, or have other inefficiencies. In the worst case, a code example linked from Wikipedia could later be modified to include exploit code. Verification and benchmarking is necessary when using such code examples from unknown authors.
*[https://github.com/george-mcdonald/Hungarian-algorithm/blob/main/Julia%20Implementation_of_hungarain%20Algorithm.jl Julia implementation]
* [https://github.com/maandree/hungarian-algorithm-n3/blob/master/hungarian.c C implementation claiming <math>O(n^3)</math> time complexity]
* [https://github.com/KevinStern/software-and-algorithms/blob/master/src/main/java/blogspot/software_and_algorithms/stern_library/optimization/HungarianAlgorithm.java Java implementation claiming <math>O(n^3)</math> time complexity]
| |||