These are my notes on network flow. The max-flow min-cut theorem is proved at the end.