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

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Direct-Access Storage Device « Direct Client to Client Protocol « Direct Connection « directed acyclic graph » directed graph » Directed Oc » directed set