How can I find the number of Hamiltonian cycles in a complete undirected graph?

Question

Can someone explain how to find the number of Hamiltonian cycles in a complete undirected graph?

Wikipedia says that the formula is (n-1)!/2, but when I cal

Answer 1

In answer to your Google Code Jam comment, see this SO question