The core concept: blocking a road is like removing an edge. The minimum number of edges to disconnect source from sink is the min-cut. Since each edge has capacity , the max flow equals the number of edge-disjoint paths from source to sink.
The min-cut is the smallest set of edges whose removal blocks all paths. Max flow finds the number. The residual graph finds the actual edges. This connection between flow and connectivity is useful.