Redirected from Hamiltonian path problem
It is a special case of the traveling salesman problem, obtained by setting the distance between two cities to unity if they are adjacent and infinity otherwise. Like the traveling salesman problem, the Hamiltonian cycle problem is NPcomplete.
The requirement that the path start and end at the same vertex distinguishes it from the Hamiltonian path problem.
The problem is named after Sir William Rowan Hamilton. External links
Search Encyclopedia

Featured Article
