ICT Schools

Articles and Tutorials in a number of ICT Topic Areas

Computer Science 

Directed Acyclic Graph (DAG)

ictsch

What is the Dag algorithm?

A directed acyclic graph (DAG) is a directed graph that contains no cycles.

A DAG is a special kind of directed graph. 

Examples:

A rooted tree is a special kind of DAG. 

A DAG may be used to represent common subexpressions in an optimising compiler.