The graph represents a salesman’s area of activity with the
shops that the salesman must visit each day. What route around the
shops has the minimum total distance?
A Hamiltonian circuit (named after the Irish mathematician Sir
William Rowan Hamilton) is a continuous path in a graph that
through each of the vertices exactly once and returns to
How many Hamiltonian circuits can you find in these graphs?
Here is another classic problem. A salesman lives in
city A and he
has to visit the cities B, C and D. The distances
cities are: AB = 120, AC=140, AD=180, BC=70, BD=100,
the shortest round trip from A through the other