✳flâneur — a map of the web's best reading

Hamiltonian path

en.wikipedia.org · 2,555 words · saved by 1 readers

In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. Determining whether such paths and cycles exist in graphs (the Hamiltonian path problem and Hamiltonian cycle problem) are NP-complete.

Hamiltonian path - Wikipedia Jump to content From Wikipedia, the free encyclopedia Path in a graph that visits each vertex exactly once This article is about the nature of Hamiltonian paths. For the question of the existence of a Hamiltonian path or cycle in a given graph, see Hamiltonian path problem . A Hamiltonian cycle around a network of six vertices Examples of Hamiltonian cycles on a square grid graph 8x8 In the mathematical field of graph theory , a Hamiltonian path (or traceable path ) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cyc

Explore this link on the map →

related reading