Advanced30 min
Network Flow Problems
Max-flow/min-cut, transportation and assignment problems, and the Hungarian algorithm.
Assumes you know
Not yet written
This lesson is on the syllabus but has no text yet
The full curriculum is published up front so you can see the whole route and its dependencies. Lessons are being written in curriculum order.
What it will cover
- max flow
- min cut
- assignment
- Hungarian
- transportation