11514

# Chinese Postman Problem

The Chinese postman problem asks for the shortest route that covers all the edges in a graph, starting and ending at the same vertex. The route may repeat some edges. The total distance traversed is the sum of the lengths of all the edges in the route. There are many possibilities, which can be generated using random graphs or other techniques.

### DETAILS

To determine the shortest path:
1. Find the degree of each vertex. If there is a pair of vertices of odd degree, the graph is semi-Eulerian. If there are more than two vertices of odd degree, the graph is non-Eulerian.
2. Create additional paths using pairs of vertices of odd degree.
3. Determine the minimum of these additional paths.
4. Trace a possible route starting and ending at a particular vertex.
5. Calculate the total distance traveled.
There may be more than one possible route.
Reference
[1] Wikipedia. "Route Inspection problem." (Aug 8, 2016) en.wikipedia.org/wiki/Route_inspection_problem.

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.
 © 2018 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS
 Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX Download or upgrade to Mathematica Player 7EX I already have Mathematica Player or Mathematica 7+