See Hamiltonian path in All languages combined, or Wiktionary
Download JSON data for Hamiltonian path meaning in English (2.6kB)
{
"etymology_text": "Named after William Rowan Hamilton (1805-1865), Irish mathematician.",
"forms": [
{
"form": "Hamiltonian paths",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Hamiltonian path (plural Hamiltonian paths)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A path through a graph which visits each vertex exactly once."
],
"hyponyms": [
{
"word": "Hamiltonian cycle"
}
],
"id": "en-Hamiltonian_path-en-noun-ICWTJCqC",
"links": [
[
"graph theory",
"graph theory"
],
[
"path",
"path"
],
[
"graph",
"graph"
],
[
"vertex",
"vertex"
]
],
"raw_glosses": [
"(graph theory) A path through a graph which visits each vertex exactly once."
],
"related": [
{
"word": "travelling salesman problem"
}
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"translations": [
{
"code": "nl",
"lang": "Dutch",
"sense": "path which visits each vertex exactly once",
"tags": [
"neuter"
],
"word": "Hamiltonpad"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "path which visits each vertex exactly once",
"word": "Hamiltonin polku"
},
{
"code": "fr",
"lang": "French",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "chemin hamiltonien"
},
{
"code": "de",
"lang": "German",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "Hamilton-Pfad"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "path which visits each vertex exactly once",
"word": "Hamilton-út"
},
{
"code": "it",
"lang": "Italian",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "cammino hamiltoniano"
},
{
"code": "pl",
"lang": "Polish",
"sense": "path which visits each vertex exactly once",
"tags": [
"feminine"
],
"word": "ścieżka hamiltonowska"
}
],
"wikipedia": [
"Hamiltonian path"
]
}
],
"word": "Hamiltonian path"
}
{
"etymology_text": "Named after William Rowan Hamilton (1805-1865), Irish mathematician.",
"forms": [
{
"form": "Hamiltonian paths",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Hamiltonian path (plural Hamiltonian paths)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "travelling salesman problem"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with non-redundant non-automated sortkeys",
"en:Graph theory"
],
"glosses": [
"A path through a graph which visits each vertex exactly once."
],
"hyponyms": [
{
"word": "Hamiltonian cycle"
}
],
"links": [
[
"graph theory",
"graph theory"
],
[
"path",
"path"
],
[
"graph",
"graph"
],
[
"vertex",
"vertex"
]
],
"raw_glosses": [
"(graph theory) A path through a graph which visits each vertex exactly once."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Hamiltonian path"
]
}
],
"translations": [
{
"code": "nl",
"lang": "Dutch",
"sense": "path which visits each vertex exactly once",
"tags": [
"neuter"
],
"word": "Hamiltonpad"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "path which visits each vertex exactly once",
"word": "Hamiltonin polku"
},
{
"code": "fr",
"lang": "French",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "chemin hamiltonien"
},
{
"code": "de",
"lang": "German",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "Hamilton-Pfad"
},
{
"code": "hu",
"lang": "Hungarian",
"sense": "path which visits each vertex exactly once",
"word": "Hamilton-út"
},
{
"code": "it",
"lang": "Italian",
"sense": "path which visits each vertex exactly once",
"tags": [
"masculine"
],
"word": "cammino hamiltoniano"
},
{
"code": "pl",
"lang": "Polish",
"sense": "path which visits each vertex exactly once",
"tags": [
"feminine"
],
"word": "ścieżka hamiltonowska"
}
],
"word": "Hamiltonian path"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-03 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.