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.
(19941207)
Nearby terms:
DirectAccess Storage Device « Direct Client to
Client Protocol « Direct Connection « directed
acyclic graph
» directed graph » Directed Oc » directed set
directed graph
(digraph) A graph with oneway edges.
See also directed acyclic graph.
(19941111)
Nearby terms:
Direct Client to Client Protocol « Direct Connection
« directed acyclic graph « directed graph »
Directed Oc » directed set » Direct Inward Dialing
Directed Oc
<language> (Doc) A language related to Oc.
["Programming Language Doc and Its SelfDescription, or 'X=X Is Considered
Harmful'", M. Hirata, Proc 3rd Conf Japan Soc Soft Sci Tech, pp. 6972, 1986].
(19991008)
Nearby terms:
Direct Connection « directed acyclic graph «
directed graph « Directed Oc » directed set »
Direct Inward Dialing » directional coupler
directed set
<theory> A set X is directed under some relation, <= (less than or
equal), if it is nonempty and if for any two elements x and y there exists an
element z such that x <= z and y <= z. I.e. all pairs have an upper bound.
(19941111)
Nearby terms:
directed acyclic graph « directed graph « Directed
Oc «
directed set » Direct Inward Dialing »
directional coupler » Directly Executable Test
Oriented Language
