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 circuit. For a large n, many of Hamilton circuits
are examined. We discuss traveling salesman problem using dinamic programming to find
optimal solution.
