# directed acyclic graph (DAG)

Definition Solmuista ja suunnatuista solmuja yhdistävistäkaarista koostuva syklitön verkko. Unifikaatiopohjaisetpiirrekielipit rakentuvat DAGien varaan.
Definition (en) a directed graph which has no cycles
Explanation (en) A graph consisting of nodes and directed arcs, where one node is the initial node and no path (i.e. single arc or a sequence of arcs) leads to the same node where the paths starts. In particular, DAGs are sometimes represented using small circles for nodes and arrows for arcs. One can also represent DAGs as sets of path equations.

## References

Lähdeviittaus tähän sivuun:
Tieteen termipankki 19.10.2019: Language Technology:directed-acyclic-graph. (Tarkka osoite: https://tieteentermipankki.fi/wiki/Language Technology:directed-acyclic-graph.)