Because the Hamiltonian path problem is NP-complete, this reduction shows that the decision version of the longest path problem is NP-hard.
The decision version of the longest path problem is NP-hard. This reduction shows this. The Hamiltonian path problem is NP-complete.