diff options
| -rw-r--r-- | README | 9 |
1 files changed, 9 insertions, 0 deletions
@@ -1,3 +1,12 @@ 𝓞(n³) implementation of the Hungarian algorithm, also known as the Hungarian method, Kuhn–Munkres algorithm or Munkres assignment. + +The Hungarian algorithm solved the minmum bipartite +match problem in 𝓞(n⁴). By implementing the priority +queue with a van Emde Boas tree the time can be +reduced to 𝓞(n³ log log n). The van Emde Boas tree +is possible to use because the elements values are +bounded within the priority queue's capacity. +However this implemention achived 𝓞(n³) by not using +a priority queue. |