In the 1960s, Kwan Mei-Ko, a Chinese mathematician, discovered the Chinese Postman Problem (CPP). The CPP arose from a dilemma faced by Chinese postmen delivering mail in the city. The postmen wanted to travel along every road in a city to deliver letters covering the least possible distance. The problem at hand was how to find the shortest walk to touch every edge or every location at least once. Within graph theory, a Euler cycle in a connected graph resembles the CPP.
Describe in detail a real life example of the CPP. This would include any situation in which there are various points that must be touched in a path, and the goal is to touch each path using the shortest distance possible.
Your initial posting should be 250-500 words and must be submitted by midnight Thursdayof this week