Traveling salesman problem ia a problem in graph theory. This problem can be solved by enumurating all possible Hamilton circuit. Then we calculate the length of rute of each circuit, and then we choose the shortest ...