Can anyone please suggest some resouces for learning Flow in Graphs (A-Z)? video resources if possible.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | awoo | 158 |
| 4 | cry | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/30/2024 18:25:48 (j2).
Desktop version, switch to mobile version.
Supported by
To be honest, the hardest part on tasks with flows is formulating the task into max flow/MCF/assignment/matching/etc. Most of the time the rest is just using Dinic in a blackbox.
https://www.youtube.com/watch?v=upMO57J2q58&list=PLrS21S1jm43igE57Ye_edwds_iL7ZOAG4&index=50 4th semester about flows.
There is also a contests for this topic: https://codeforces.me/group/dAhOSPf3oD/contest/432173