The snow ploughing problem solved by a graph theory algorithm

An algorithm to trace the itinerary of a snow ploughing truck that respects street priorities is developed. It is based on the notion of an Eulerian circuit in a directed graph, the existence of which is guaranteed due to the nature of the snow ploughing problem. The algorithm can be easily programmed in an interactive form on a micro-computer. The computer output presents the truck itinerary, each street given with its priority and the cumulative percentage of the street length with the same priority already ploughed with respect to the total length for that priority.