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

Notes

The SNOMED CT subtype hierarchy is a Directed Acyclic Graph. SNOMED CT concepts are nodes and subtype relationships are the directed lines that connect them. All subtype relationships lead from a more specific concept to a more general concept, 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").

Figure 1: Illustrative Example - Directed Acyclic Graph

Alternatives

DAG

Search

This is an abbreviation for directed acyclic graph.

directed acyclic graph

Notes

Alternatives

Related Links

Search

DAG

This is an abbreviation for directed acyclic graph.

directed acyclic graph

Notes

Alternatives

Related Links