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 81 / 94 1500
Chores 3 39 / 51 1600
Brewing potion 7 14 / 16 1900
Selling potion 8 / 12 2000
Build the board 5 / 23 2100