diff options
| -rw-r--r-- | README | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -2,13 +2,13 @@ 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 +The Hungarian algorithm solves the minmum bipartite +matching 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 +However this implemention achives 𝓞(n³) by not using a priority queue. Edmonds and Karp, and independently Tomizawa, has |