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:
“A route differs from a road not only because it is solely intended for vehicles, but also because it is merely a line that connects one point with another. A route has no meaning in itself; its meaning derives entirely from the two points that it connects. A road is a tribute to space. Every stretch of road has meaning in itself and invites us to stop. A route is the triumphant devaluation of space, which thanks to it has been reduced to a mere obstacle to human movement and a waste of time.”
—Milan Kundera (b. 1929)
“Thus the orb he roamed
With narrow search, and with inspection deep
Considered every creature, which of all
Most opportune might serve his wiles, and found
The serpent subtlest beast of all the field.”
—John Milton (1608–1674)
“The problem for the King is just how strict
The lack of liberty, the squeeze of the law
And discipline should be in school and state....”
—Robert Frost (1874–1963)