From charlesreid1

Revision as of 20:19, 11 October 2017 by Admin (talk | contribs) (→‎Notes)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


A directed acyclic graph is a directed graph that does not contain cycles.

For notes on detecting cycles, see Graphs/Cycles. (Use depth first search - see Graphs/DFS).

Examples of DAGs:

  • All trees are DAGs (see Trees)
  • All git repositories are DAGs