WOLFRAM NOTEBOOK

Chinese Postman Problem

​
number of vertices
5
6
7
8
semi-Eulerian
non-Eulerian
A possible route: {AD,DE,EB,BD,DB,BC,CA}
Total distance: 69 meters.
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.

References

[1] Wikipedia. "Route Inspection problem." (Aug 8, 2016) en.wikipedia.org/wiki/Route_inspection_problem.

Permanent Citation

Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.