Use max flow when the problem involves:
Moving resources through a network.
Matching or assignment (bipartite matching).
Finding bottlenecks (min-cut).
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.