Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
This is one of the special cases for Chinese Postman Problem.
I know the answer is (Cost of all Edges + Cost of shortest path between the odd degree vertices). How do I prove this?
I am trying to prove the solution to this UVA problem.
Required, but never shown