Module Flow

Flow

**Frequency: 1/10** Quite an interesting way to solve some certain optimization problems.

Resources

- [CP Algorithms: Maximum flow - Ford-Fulkerson and Edmonds-Karp](https://cp-algorithms.com/graph/edmonds_karp.html)

Problems

Maximum Flow 146 / 163 1500
Chores 3 86 / 97 1600
Brewing potion 7 37 / 41 1900
Selling potion 24 / 27 2000
Build the board 17 / 47 2100