Abstract: Equilibrium network flows are not necessarily unique, and this nature creates difficulties in the sensitivity analysis of network related phenomena. In this paper, a minimum distance approach is proposed for the sensitivity analysis of equilibrium network flow. With this method, the solution space of paths is transformed into a set of solution spaces of path sections, in which the sensitivity is then discussed. Thus, the problem of nonuniqueness can be avoided.