What is the definition of Directed acyclic graph? | Dictionary.net

DIRECTED ACYCLIC GRAPH

\da͡ɪɹˈɛktɪd ɐkˈa͡ɪklɪk ɡɹˈaf], \da‍ɪɹˈɛktɪd ɐkˈa‍ɪklɪk ɡɹˈaf], \d_aɪ_ɹ_ˈɛ_k_t_ɪ_d ɐ_k_ˈaɪ_k_l_ɪ_k ɡ_ɹ_ˈa_f]\

Definitions of DIRECTED ACYCLIC GRAPH

1985 - The Free On-line Dictionary of Computing

Sort: Oldest first

(DAG) A directed graph containing no cycles. This meansthat if there is a route from node A to node B then there isno way back.

1985 - The Free On-line Dictionary of Computing
By Denis Howe

Word of the day

Oxysulphide

A ternary compound of oxygen and sulphur.

View More

Nearby Words