Hi,

I'm just having difficulities seeing the difference between the Shortest Path Problem, The Chinese Postman problem and the Travelling Sales man Problem.

I see they all wish to find the shortest path, and that the Chinese postman can use an egde more then once..but other then that I'm kind of confusd..

Thanks