1. Introduction to Network Flow

Here we setup the language of a flow network, identify what we are looking for, examine a natural greedy approach that doesn't work, and fix it so we get to the Ford-Fulkerson algorithm. By making some specific choices in this algorithm we obtain the Edmonds-Karp algorithm.

The module is split into three segments:

  • Introduction to the maxflow problem
  • Algorithms for maxflow
  • Implementing Edmonds-Karp

Other sources to learn about maxflow: