An algorithm for finding the optimal Chinese Postman route
Step 1: List all odd verticies
Step 2: List all possible pairings of odd verticies
Step 3: For each pairing find the edges that connect the verticies with minimum weight
Step 4: Find the pairings such that the sum of the weights is minimised
Step 5: On the original graph add the edges that have been found in step 4
Step 6: The length of the optimal Chinese Postman route is the sum of all the edges added to the total found in step 4
Step 7: A route corresponding to this minimal weight can then be easily found
Comments
No comments have yet been made