The maximum number of edge-disjoint paths from source to sink equals the max flow when all edges have capacity . Each unit of flow corresponds to one path. Since capacities are , paths do not share edges. Similarly, the maximum number of vertex-disjoint paths (paths sharing no internal nodes) can be found using vertex capacities set to .
This connects flow to graph connectivity. The integer flow theorem guarantees paths are discrete.