The Maximum-Flow Problem and the Ford-Fulkerson Algorithm

In this chapter we are working on modeling transportation networks through graphs. These network models require capacities, source, and sink nodes. Capacities represent how much the edges can carry. Source nodes generate traffic and sink nodes absorb traffic (destination nodes). We also have to represent that traffic that is transmitted across edges.

Flow Networks Traffic across the graph is referred to as flow