Our final look into graphs in this course (although definitely not in DACS since 620 and 630 will involve us heavily with more of the same, increasing the richness) brings us to a transport problem that we model with network flows, throwing in an optimization problem (Modules 2, 3, 5) onto the graph (Modules 4, 5, 9 – 11).