See polytree in All languages combined, or Wiktionary
Download JSON data for polytree meaning in English (1.6kB)
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "poly",
"3": "tree"
},
"expansion": "poly- + tree",
"name": "prefix"
}
],
"etymology_text": "poly- + tree",
"forms": [
{
"form": "polytrees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "polytree (plural polytrees)",
"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 terms prefixed with poly-",
"parents": [],
"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 graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
],
"id": "en-polytree-en-noun-OB0CG7NF",
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"undirected",
"undirected"
],
[
"path",
"path"
],
[
"vertices",
"vertices"
],
[
"directed",
"directed"
],
[
"acyclic",
"acyclic"
],
[
"cycles",
"cycles"
]
],
"raw_glosses": [
"(graph theory) a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "polytree"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "poly",
"3": "tree"
},
"expansion": "poly- + tree",
"name": "prefix"
}
],
"etymology_text": "poly- + tree",
"forms": [
{
"form": "polytrees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "polytree (plural polytrees)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with poly-",
"en:Graph theory"
],
"glosses": [
"a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"graph",
"graph"
],
[
"undirected",
"undirected"
],
[
"path",
"path"
],
[
"vertices",
"vertices"
],
[
"directed",
"directed"
],
[
"acyclic",
"acyclic"
],
[
"cycles",
"cycles"
]
],
"raw_glosses": [
"(graph theory) a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "polytree"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 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.