What's the difference between traveling salesman and chinese traveling?

graph path traveling-salesman chinese-postman
alansiqueira27 picture alansiqueira27 · Dec 14, 2010 · Viewed 15.6k times · Source

What's the Difference between traveling-salesman problem and chinese postman problem? For me both wants go to a destination, and then back.

Answer

Xodarap picture Xodarap · Dec 14, 2010

Graphs are made of edges and vertices. CPP requires a visit to all edges. TSP requires a visit to all vertices.

Related questions

Dijkstra algorithm with min-priority queue

I'm trying to implement the dijkstra algorithm with priority queue, but I can't understand how it works. I read many guide on the web but I can't understand this algorithm at all. My questions are: What is the priority for …

Read More
How to get the path between 2 nodes using Breadth-First Search?

I am trying to find a path between two nodes in a graph, where the edges are unweighted. I am using a Breadth First Search, which stops when it finds the target, in order to find the existence of a …

Read More
Understanding the minimax/maximin paths (Floyd-Warshall)

I've implemented the Floyd-Warshall-Algorithm to solve the All-pairs shortest path problem. Now I found out I can also compute the minimax or maximin path with easy modifications. But I don't understand what the result means (what a minimax path is). …

Read More