Hello everybody! Can anyone share his good implementation min cost max flow algorithm in some problem or give a link to any problem on cf containing this algorithm. I have seen only http://e-maxx.ru/algo/min_cost_flow this implementation but not sure about asymptotics of it. Maybe anyone write it with Ford Bellman algorithm or something else? Would be very grateful :)
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:25:41
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:25:41
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 22:09:20 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Dinic maxflow : https://github.com/ADJA/algos/blob/master/Graphs/Dinic.cpp
Ford-Fulkerson maxflow : https://github.com/ADJA/algos/blob/master/Graphs/FordFulkerson.cpp
Thank you! But it is simple max flow but not min-cost-max-flow :)
In the same repository there are mincost implementations using Dijkstra and Ford-Bellman.
I didn't notice it. Thank you!
https://sites.google.com/site/indy256/