Route guidance is a traffic control which aims at achieving an optimum distribution of traffic over alternative routes in the network by recommending the best route from a certain origin to a desired destination. This paper describes a mathematical analysis of the route guidance problem. We characterize the route guidance problem as the problem of dynamic user equilibrium in which some characteristics of route choice vary over time and in which no individual can improve his own travel time by unilaterally changing routes. It is also shown that the route guidance problem can be formulated as the problem of discrete Minimum Principle and some numerical examples are given.