This Document

 All Library Documents

 Other Documents
Skip to end of metadata
Go to start of metadata

This is an abbreviation for directed acyclic graph.

directed acyclic graph

A set of nodes connected to one another by lines (edges) in which each connection has a specified direction such that no route that follows the direction of the connections enters a loop (cycle).


Figure 1: Illustrative Example - Directed Acyclic Graph


  • DAG

Related Links

  • No labels