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 40 / 51 1500
Chores 3 19 / 27 1600
Brewing potion 7 4 / 6 1900
Selling potion 2 / 5 2000
Build the board 1 / 7 2100