Hello community, i am going to start learning flows and matching.Can you all suggest some good resources maybe some lectures , pdfs ,ppts , some well written blogs.What all topics and standard algorithms should i be familiar to solve questions on these topics.
Rating changes for last rounds are temporarily rolled back. They will be returned soon.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Radewoosh | 3611 |
| 2 | jiangly | 3597 |
| 3 | Benq | 3593 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3570 |
| 6 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3487 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/24/2024 10:02:08 (i2).
Desktop version, switch to mobile version.
Supported by
Maximum Flow: Section 1
Maximum Flow: Section 2
Maximum Flow: Augmenting Path Algorithms Comparison
Minimum Cost Flow: Part One – Key Concepts
Minimum Cost Flow: Part Two – Algorithms
Minimum Cost Flow: Part Three – Applications
Hopcroft–Karp algorithm
Max Flow/Min Cut Visualization
Unweighted Bipartite Graph Matching Visualization