Search

 This Document

 All Library Documents



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

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).

Notes

Figure 1: Illustrative Example - Directed Acyclic Graph


Alternatives

  • DAG

Related Links


Feedback
  • No labels