In this video, we will see how to Find the Number of Hamiltonian cycle in C++. 

Below is the list of approaches that we will cover in this section:

1. Using iteration
2. Using recursion

What is a Hamiltonian Cycle?
It is a closed walk such that each vertex is visited at most once except the initial vertex and it is not necessary to visit all the edges.

To identify the number of cycle present in the graph we can apply this formula: (N-1) ! / 2, to obtain our required answer.