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 109 / 124 1500
Chores 3 63 / 75 1600
Brewing potion 7 23 / 26 1900
Selling potion 14 / 19 2000
Build the board 13 / 36 2100