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
- The is a Directed Acyclic Graph. are nodes and are the directed lines that connect them. All lead from a more specific to a more general , so a cycle would be a logical error (e.g. if "rubella virus" is a type of "virus" and "virus" is a type of "microorganism", then "microorganism" cannot be a type of "rubella virus").

Caption label |
---|
CapId | illustrative-example-directed-acyclic-graph- |
---|
CapType | Figure |
---|
|
Illustrative Example - Directed Acyclic Graph |
Alternatives