![Travelling Salesman](/sites/default/files/styles/medium/public/thumbnails/content-id-2325-icon.png?itok=2DGI64UE)
problem
Travelling Salesman
A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start.
How many Hamiltonian circuits can you find in these graphs?