Route Inspection (Chinese Postman)

The Chinese Postman ProblemSign up

be able to solve the route inspection problem for a connected graph by identifying odd-degree vertices, pairing them optimally and adding repeated edges to produce a minimum-weight closed walk traversing every edge