ID NAME QUALITY USERS ACC % DIFFICULTY C I

#hamiltonian-circuit

The problem involves a Hamiltonian circuit (Hamiltonian cycle), that is a graph cycle through a graph that visits each node exactly once

https://en.wikipedia.org/wiki/Hamiltonian_path https://en.wikipedia.org/wiki/Hamiltonian_path_problem http://mathworld.wolfram.com/HamiltonianCycle.html