# A calculus of the absurd

#### 24.2 Hamiltonian paths

##### 24.2.1 The Hamiltonian path problem

The Hamiltonian path problem is this: in a graph we want to find a path which visits every vertex once.