Please tell the complexity of http://www.geeksforgeeks.org/maximum-bipartite-matching/ ?
And if we use directly Ford-Fulkerson Algorithm, will it be better?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
18:25:38
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
18:25:38
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 23:09:24 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
Maximum Bipartite Matching with Ford-Fulkerson takes O(VE) time. Using Dinic instead of Ford-Fulkerson (or Edmonds Karp for that matter; note that Edmonds Karp always find the shortest augmenting path instead of finding a random path), you can achieve a complexity of
.
Can you plz explain the complexity of the link I provided?
Secondly when and how Ford-Fulkerson Algorithm becomes better?
In the link, the bipartite matching is done using Ford-Fulkerson, so the complexity is O(VE).
I don't understand your second question.
A very good source to learn Max-Flow is CLRS. There's an entire chapter dedicated to network flows. You should read it.