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 53 / 65 1500
Chores 3 26 / 36 1600
Brewing potion 7 6 / 8 1900
Selling potion 4 / 8 2000
Build the board 1 / 11 2100