maomao90's blog

[Tutorial] Maximum Flow and Minimum Cost Maximum Flow (to prove greedy)
By maomao90, history, 2 years ago, In English

I recently had to make slides to teach people about maximum flow and minimum cost maximum flow, so I thought it would be good if I share it with Codeforces as well. I think this will benefit everyone as the beginners can get a better understanding of the basics of maximum flow and minimum cost maximum flow in the first few slides and the more advanced people can look at the slides further on which explains how we can use minimum cost maximum flow to solve some greedy problems. Hope everyone will enjoy my slides!

Link to google slides

Please let me know in the comment if you see any mistakes or you want to suggest any improvements. Thank you!

  • Vote: I like it
  • +190
  • Vote: I do not like it

Comments Comments (6)
| Write comment?
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

your slide's ui is super clean and nice (carefully chosen fonts and minimal design which makes the slide easier to read)

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It's amazing! Which tool did you use to create the graphs?

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +73 Vote: I do not like it

    Its just google slide shapes lol. I spent a lot of time copying and pasting lines and circles 😩

    → Reply
»
2 years ago, # |
  Vote: I like it +41 Vote: I do not like it

Thank you. This is great learning material and huge work. Let's add it to EDU, ok?

→ Reply