### 3.7.116. Hamiltonian

A constraint enforcing to cover a graph with one Hamiltonian circuit or cycle. This corresponds to finding a circuit (respectively a cycle) passing all the vertices exactly once of a given digraph (respectively undirected graph).