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 61 / 72 1500
Chores 3 31 / 41 1600
Brewing potion 7 9 / 11 1900
Selling potion 7 / 11 2000
Build the board 4 / 16 2100