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	37 / 48	1500
	Chores 3	16 / 24	1600
	Brewing potion 7	4 / 6	1900
	Selling potion	2 / 5	2000
	Build the board	1 / 6	2100

Graph

Flow

Heuristic

Introduction to Heuristic

Dynamic Programming

Convex Hull Trick / Li Chao tree

Tree

Centroid Decomposition

Game Theory

Sprague - Grundy theorem