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 75 / 87 1500
Chores 3 36 / 48 1600
Brewing potion 7 12 / 14 1900
Selling potion 8 / 12 2000
Build the board 5 / 21 2100