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 whatever means it is accomplished, the prime business of a play is to arouse the passions of its audience so that by the route of passion may be opened up new relationships between a man and men, and between men and Man. Drama is akin to the other inventions of man in that it ought to help us to know more, and not merely to spend our feelings.”
—Arthur Miller (b. 1915)
“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 of the novelist who wishes to write about a man’s encounter with God is how he shall make the experience—which is both natural and supernatural—understandable, and credible, to his reader. In any age this would be a problem, but in our own, it is a well- nigh insurmountable one. Today’s audience is one in which religious feeling has become, if not atrophied, at least vaporous and sentimental.”
—Flannery O’Connor (1925–1964)