Hamilton Path And Circuit

Hamilton path HAMILTON CIRCUIT
- visit every vertex once - visit every vertex once

with no repeats with no repeats
- not have to start at and - must start and end at the

end at the same time same vertex because it is
circuit

HAMILTON PATH
AND CIRCUIT

example Hamiltonian circuits are named example
for William Rowan Hamilton who

studied them in the 1800's

example

Relationship between Hamilton path and the travelling salesman problem

example 2

example 1

For the traveling salesman problem the
salesman has to visit all the clients and he

also wants to make this journey with the
least time/distance and come back to the

starting point. So we need to find the
shortest route that visits to each client

and returns to the origin point