WOLFRAM|DEMONSTRATIONS PROJECT

Chinese Postman Problem

​
number of vertices
5
6
7
8
semi-Eulerian
non-Eulerian
A possible route: {AD,DB,BD,DE,EC,CB,BA}
Total distance: 63 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.