Graph Theory37 sections · 1633 units
Open in Course

When to Use Flow

(Recognizing flow problems)

Use max flow when the problem involves:

1.1. Moving resources through a network.

2.2. Matching or assignment (bipartite matching).

3.3. Finding bottlenecks (min-cut).

4.4. Edge-disjoint or vertex-disjoint paths.

Keywords: maximum throughput, minimum bottleneck, matching, assignment, network capacity. If you see these, think flow. The modeling step is often the hardest part. Practice recognizing these patterns.