The problem is simple to state but difficult to solve. Given an annotated map of a city district and a database containing records that describe letter carrier routes, color the map to show a letter carrier's area. Complicating the problem is that a street has two sides, which may be served by separate carriers. The algorithm that I developed correctly colors complex maps, and it completes the coloring of even the largest map in a matter of minutes.