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:
“By a route obscure and lonely,
Haunted by ill angels only,
Where an eidolon, named Night,
On a black throne reigns upright,
I have reached these lands but newly
From an ultimate dim Thule—
From a wild weird clime that lieth, sublime,
Out of space—out of time.”
—Edgar Allan Poe (1809–1849)
“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)
“The problem is that we attempt to solve the simplest questions cleverly, thereby rendering them unusually complex. One should seek the simple solution.”
—Anton Pavlovich Chekhov (1860–1904)