catflap.org Online Dictionary Query |
From The Free On-line Dictionary of Computing (27 SEP 03) : [ foldoc ]
directed acyclic graph
(DAG) A directed graph containing no cycles. This means
that if there is a route from node A to node B then there is
no way back.
(1994-12-07)
From English Wiktionary: All languages (2023-07-27) : [ dictinfo.com:wikt-en-ALL-2023-07-27 ]
directed acyclic graph
n.
(lb en graph theory computer science) A finite directed graph that
contains no directed cycles.
From English Wiktionary: English language only (2023-07-27) : [ dictinfo.com:wikt-en-en-2023-07-27 ]
directed acyclic graph
n.
(lb en graph theory computer science) A finite directed graph that
contains no directed cycles.
From English Wiktionary: Western, Greek, and Slavonic languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western_Greek_Slavonic-2023-07-27 ]
directed acyclic graph
n.
(lb en graph theory computer science) A finite directed graph that
contains no directed cycles.
From English Wiktionary: Western languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western-2023-07-27 ]
directed acyclic graph
n.
(lb en graph theory computer science) A finite directed graph that
contains no directed cycles.