Maximum flow and minimum cut problems | Combinatorics Class Notes