See directed acyclic graph on Wiktionary
{
"forms": [
{
"form": "directed acyclic graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "directed acyclic graph (plural directed acyclic graphs)",
"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": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Czech translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Italian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"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"
}
],
"examples": [
{
"text": "1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, LNCS 903, page 121,\nA subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. […] Directed acyclic graphs are widely used in different areas of computer science."
},
{
"ref": "2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574:",
"text": "In studying these properties, a distinction is made between directed acyclic graphs with directed edges and simple acyclic graphs with undirected edges.[…]A directed acyclic graph G#x3D;(V#x3B;R) is asymmetric and does not contain cycles.",
"type": "quote"
},
{
"text": "2011, Michael Donders, Sara Miner More, Pavel Naumov, Information Flow on Directed Acyclic Graphs, Lev D. Beklemishev, Ruy de Queiroz (editors), Logic, Language, Information, and Computation: 18th International Workshop, Proceedings, Springer, LNAI 6642, page 95,\nA logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable."
}
],
"glosses": [
"A finite directed graph that contains no directed cycles."
],
"id": "en-directed_acyclic_graph-en-noun-XVBofR~8",
"links": [
[
"graph theory",
"graph theory"
],
[
"computer science",
"computer science"
],
[
"finite",
"finite"
],
[
"directed graph",
"directed graph"
],
[
"cycle",
"cycle"
]
],
"raw_glosses": [
"(graph theory, computer science) A finite directed graph that contains no directed cycles."
],
"synonyms": [
{
"word": "acyclic digraph"
},
{
"word": "acyclic directed graph"
},
{
"tags": [
"abbreviation",
"acronym",
"acronym"
],
"word": "DAG"
}
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "orientovaný acyklický graf"
},
{
"code": "de",
"lang": "German",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "gerichteter azyklischer Graph"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "grafo aciclico diretto"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "grafo aciclico orientato"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "digrafo aciclico"
}
]
}
],
"word": "directed acyclic graph"
}
{
"forms": [
{
"form": "directed acyclic graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "directed acyclic graph (plural directed acyclic graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Czech translations",
"Terms with German translations",
"Terms with Italian translations",
"en:Computer science",
"en:Graph theory"
],
"examples": [
{
"text": "1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, LNCS 903, page 121,\nA subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. […] Directed acyclic graphs are widely used in different areas of computer science."
},
{
"ref": "2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574:",
"text": "In studying these properties, a distinction is made between directed acyclic graphs with directed edges and simple acyclic graphs with undirected edges.[…]A directed acyclic graph G#x3D;(V#x3B;R) is asymmetric and does not contain cycles.",
"type": "quote"
},
{
"text": "2011, Michael Donders, Sara Miner More, Pavel Naumov, Information Flow on Directed Acyclic Graphs, Lev D. Beklemishev, Ruy de Queiroz (editors), Logic, Language, Information, and Computation: 18th International Workshop, Proceedings, Springer, LNAI 6642, page 95,\nA logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable."
}
],
"glosses": [
"A finite directed graph that contains no directed cycles."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"computer science",
"computer science"
],
[
"finite",
"finite"
],
[
"directed graph",
"directed graph"
],
[
"cycle",
"cycle"
]
],
"raw_glosses": [
"(graph theory, computer science) A finite directed graph that contains no directed cycles."
],
"synonyms": [
{
"word": "acyclic digraph"
},
{
"word": "acyclic directed graph"
},
{
"tags": [
"abbreviation",
"acronym",
"acronym"
],
"word": "DAG"
}
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "orientovaný acyklický graf"
},
{
"code": "de",
"lang": "German",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "gerichteter azyklischer Graph"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "grafo aciclico diretto"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "grafo aciclico orientato"
},
{
"code": "it",
"lang": "Italian",
"sense": "directed graph without cycles",
"tags": [
"masculine"
],
"word": "digrafo aciclico"
}
],
"word": "directed acyclic graph"
}
Download raw JSONL data for directed acyclic graph meaning in All languages combined (3.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.