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 55 / 66 1500
Chores 3 28 / 38 1600
Brewing potion 7 7 / 9 1900
Selling potion 5 / 9 2000
Build the board 2 / 12 2100