You are here: irt.org | 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)
Nearby terms: Direct-Access Storage Device « Direct Client to Client Protocol « Direct Connection « directed acyclic graph » directed graph » Directed Oc » directed set
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL