 Hamiltonian paths and cycles

A **Hamiltonian path** is a specific type of path in a graph that visits each vertex exactly once. In other words, it is a trail in which every node (or vertex) of the graph is included exactly one time. A **Hamiltonian cycle** (or Hamiltonian circuit) is a special case of a Hamiltonian path where the path starts and ends at the same vertex, thus forming a closed loop that visits every vertex once.