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:
“In the mountains the shortest route is from peak to peak, but for that you must have long legs. Aphorisms should be peaks: and those to whom they are spoken should be big and tall of stature.”
—Friedrich Nietzsche (1844–1900)
“Utopias are presented for our inspection as a critique of the human state. If they are to be treated as anything but trivial exercises of the imagination. I suggest there is a simple test we can apply.... We must forget the whole paraphernalia of social description, demonstration, expostulation, approbation, condemnation. We have to say to ourselves, “How would I myself live in this proposed society? How long would it be before I went stark staring mad?””
—William Golding (b. 1911)
“What happened at Hiroshima was not only that a scientific breakthrough ... had occurred and that a great part of the population of a city had been burned to death, but that the problem of the relation of the triumphs of modern science to the human purposes of man had been explicitly defined.”
—Archibald MacLeish (1892–1982)