The Chinese Postman Problem in a Directed Network: Street SweepingPlan a route for a street-s ... would disconnect the graph)Ⅱ. Solving proceduresIf and Euler tour exists, it is optimal route otherwise ... - Add “artificial” edges, parallel to the existing edges, which turn all odd-degree nodes into even