## 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.

Last updated: 1994-12-07

### Nearby terms:

Direct Connection ♦ **directed acyclic graph** ♦ directed graph ♦ Directed Oc

Try this search on Wikipedia, OneLook, Google

## directed graph

(digraph) A graph with one-way edges.

See also directed acyclic graph.

Last updated: 1994-11-11

### Nearby terms:

directed acyclic graph ♦ **directed graph** ♦ Directed Oc ♦ directed set

Try this search on Wikipedia, OneLook, Google

## Directed Oc

<*language*>

(Doc) A language related to Oc.

["Programming Language Doc and Its Self-Description, or 'X=X Is Considered Harmful'", M. Hirata, Proc 3rd Conf Japan Soc Soft Sci Tech, pp. 69-72, 1986].

Last updated: 1999-10-08

### Nearby terms:

directed graph ♦ **Directed Oc** ♦ directed set ♦ Direct Inward Dialing

Try this search on Wikipedia, OneLook, Google

## directed set

<*theory*>

A set X is directed under some relation, <= (less than or equal), if it is non-empty 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.

Last updated: 1994-11-11

### Nearby terms:

Directed Oc ♦ **directed set** ♦ Direct Inward Dialing ♦ directional coupler

Try this search on Wikipedia, OneLook, Google