Hamiltonian Cycle

A Hamiltonian Cycle is a path in a graph that visits every node exactly once and returns to the starting node. It is closely related to Travelling Salesman Problem, where the goal is to find the shortest possible Hamiltonian cycle. Hamiltonian cycles are useful in routing, scheduling, and circuit design.