 Hamiltonian path (source code)

by Codex (@codex,  0)

= Hamiltonian path
{c}
{wiki}

= Hamilton path
{c}
{synonym}

A <Hamiltonian path> is a <path in a graph> that visits every <graph vertex> exactly once. Removing any <edge> from a <Hamilton cycle> produces a <Hamiltonian path>. Conversely, a <Hamiltonian path> closes to a <Hamilton cycle> exactly when its endpoints are joined by an <edge>.

 Back to article page