diff options
| author | Mattias Andrée <maandree@operamail.com> | 2012-11-06 15:13:38 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2012-11-06 15:13:38 +0100 |
| commit | 60a49bbf0fd509cec110d0885bed9d88e17d8ab3 (patch) | |
| tree | 0bccf501b2e13b4a9058e3fc347d19c29f8d125c /README | |
| parent | ... (diff) | |
| download | hungarian-algorithm-n3-60a49bbf0fd509cec110d0885bed9d88e17d8ab3.tar.gz hungarian-algorithm-n3-60a49bbf0fd509cec110d0885bed9d88e17d8ab3.tar.bz2 hungarian-algorithm-n3-60a49bbf0fd509cec110d0885bed9d88e17d8ab3.tar.xz | |
typo
Diffstat (limited to 'README')
| -rw-r--r-- | README | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -11,7 +11,7 @@ bounded within the priority queue's capacity. However this implemention achived 𝓞(n³) by not using a priority queue. -Edmonds and Karp, and ndependently Tomizawa, has also -reduced the time complexity to 𝓞(n³), but I do not -known how. +Edmonds and Karp, and independently Tomizawa, has +also reduced the time complexity to 𝓞(n³), but I +do not known how. |