Network flow problems model resources moving through systems. Think water through pipes, data through networks, or cars through roads. Each path has a limit on how much can flow through it. In this section, I'll teach you how to represent flow networks as graphs, compute the maximum flow from a source to a sink, and identify bottlenecks. You will solve problems where finding the maximum flow reveals the answer. The algorithms are different from shortest path or MST.
Instead of distances or costs, you track capacity and flow.
