What's the difference between travelling salesman problem (TSP) and Chinese postman problem (CPP)?
For me, both wants go to a destination, and then back.
Graphs are made of edges and vertices. CPP requires a visit to all edges. TSP requires a visit to all vertices.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With