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 120 / 135 1500
Chores 3 69 / 81 1600
Brewing potion 7 27 / 31 1900
Selling potion 16 / 21 2000
Build the board 15 / 41 2100