Give random capacities C to the edges of the complete n-vertex graph. Consider the maximum flow Φ_n that can be simultaneously routed between each source–destination pair. We prove that Φ_n→ in probability where the limit constant depends on the distribution of C in a simple way, and that asymptotically one need use only 1- and 2-step routes. The proof uses a reduction to a random graph problem.