Hamiltonian path


Hamiltonian path

[‚ham·əl′tō·nē·ən ‚path] (mathematics) A path along the edges of a graph that traverses every vertex exactly once and terminates at its starting point. Also known as Hamiltonian circuit; Hamiltonian cycle.

Hamiltonian path

Hamiltonian problem