Hamiltonian Cycle Search

Backtracking search for a Hamiltonian cycle — a path visiting every vertex exactly once and returning to start. Watch the algorithm explore and backtrack in real time.

Current path
Solution found
Dead end / backtrack
Unvisited
Select a graph and press Start