| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Dinic & Hopcroft–Karp
Hello everyone!
I have a couple of question related with Flows, I wish you can help me
Is Dinic the best algorithm know so far for calculating Max Flow?
Is Hopcroft–Karp the best algorithm known so far for calculating Bitartite Matching?
Could you please recommend me some references for those algorithms?
Thank you all.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
proletario | 2020-10-22 21:49:35 | 8 | ||
| en1 |
|
proletario | 2020-10-22 21:48:57 | 372 | Initial revision (published) |
