The CPostman03.lng Model

Chinese Postman problem

View the model
Download the model

Find the shortest path that covers all arcs
in a network at least once;
Euler first described this problem in terms of traversing
the bridges of Koenigsberg. Kwan Mei-Ko first gave an
explicit method for solving the undirected version;


Routing | Tour | Chinese postman | Euler | Koenigsberg bridge | Kwan Mei-Ko |