Chinese postman problem
= Chinese postman problem
{wiki=Chinese_postman_problem}
The Chinese Postman Problem (CPP), also known as the Route Inspection Problem, is a classic problem in graph theory. It involves finding the shortest path or circuit that traverses every edge of a given graph at least once. The goal is to minimize the total distance traveled, effectively allowing the "postman" to deliver mail along the edges of the graph without unnecessary repetition.