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 125 / 140 1500
Chores 3 72 / 84 1600
Brewing potion 7 28 / 32 1900
Selling potion 19 / 24 2000
Build the board 16 / 43 2100