In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.
Alan Goldman of the U.S. National Bureau of Standards first coined the name 'Chinese Postman Problem' for this problem, as it was originally studied by the Chinese mathematician Mei-Ku Kuan in 1962.
Read more about Route Inspection Problem: Eulerian Paths and Circuits, T-joins, Solution, Variants
Famous quotes containing the words route, inspection and/or problem:
“The route through childhood is shaped by many forces, and it differs for each of us. Our biological inheritance, the temperament with which we are born, the care we receive, our family relationships, the place where we grow up, the schools we attend, the culture in which we participate, and the historical period in which we live—all these affect the paths we take through childhood and condition the remainder of our lives.”
—Robert H. Wozniak (20th century)
“We had an inspection today of the brigade. The Twenty-third was pronounced the crack regiment in appearance, ... [but] I could see only six to ten in a company of the old men. They all smiled as I rode by. But as I passed away I couldn’t help dropping a few natural tears. I felt as I did when I saw them mustered in at Camp Chase.”
—Rutherford Birchard Hayes (1822–1893)
“Congress seems drugged and inert most of the time. ...Its idea of meeting a problem is to hold hearings or, in extreme cases, to appoint a commission.”
—Shirley Chisholm (b. 1924)