[Tutorial] Maximum Flow and Minimum Cost Maximum Flow (to prove greedy)

Revision en1, by maomao90, 2022-12-20 05:30:41

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!

Tags maxflow, mcmf, greedy


  Rev. Lang. By When Δ Comment
en1 English maomao90 2022-12-20 05:30:41 833 Initial revision (published)