Finding Hamiltonian Paths

Hamiltonian paths are paths that visit every node in a graph exactly once. They are named after the famous mathematician Hamilton. Hamiltonian paths are a special case of Hamiltonian cycles, which are cycles that visit every node in a graph exactly once.

Visit the following resources to learn more:

• Hamiltonian Path
• Hamiltonian Cycle | Backtracking-6
• Hamiltonian Paths and Cycles
• Hamiltonian Paths - Lecture 7