... given a graph with directed edges and a specified start vertex and end vertex, one says there is a Hamiltonian path if and only if there is a path that starts at the start vertex, ends at the end vertex and passes through each remaining vertex exactly once.
... ibinigay ng isang graph na may Directed mga gilid at isang tinukoy na simulan kaitaasan at huling kaitaasan, sabi ni isa doon ay isang Hamiltonian path at kung lamang kung mayroong isang landas na nagsisimula sa simula tugatog, dulo sa dulo kaitaasan at pumasa sa pamamagitan ng bawat natitirang kaitaasan eksaktong isang beses .