The Chinese postman problem is a mathematical problem of graph theory. It is also known as . Suppose there is a mailman who needs to deliver mail to a certain neighbourhood. The mailman is unwilling to walk far, so he wants to find the shortest route through the neighbourhood, that meets the following criteria: