Hamiltonian path
id:
hamiltonian-path-189-8137739
title:
Hamiltonian path
text:
In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle 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. The computational problems of determining whether such paths and cycles exist i
brand slug:
wiki
category slug:
encyclopedia
description:
Path in a graph that visits each vertex exactly once
original url:
https://en.wikipedia.org/wiki/Hamiltonian_path
date created:
2003-06-12T05:07:28Z
date modified:
2024-09-09T10:54:44Z
main entity:
{"identifier":"Q273037","url":"https://www.wikidata.org/entity/Q273037"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/be/Hamiltonian.png","width":786,"height":554}
fields total:
13
integrity:
16