Note

CS Degree Day 56

CS Degree in 100 Days

04 Aug'25

Overview

The max-flow min-cut theorem is beautiful. The maximum flow from source to sink equals the minimum cut capacity.

I find myself returning to these moments where the answer to a problem turns out to be equivalent to the answer to a completely different-looking probleml.

What I did today?

Completed max-flow min-cut proof
Lecture 22: Applications - bipartite matching
Review for exam

Back to notes Return home