Search



Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

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 
    Gloss
    Spacetrue
    tSNOMED CT
     
    Gloss
    tsubtype hierarchy
     is a Directed Acyclic Graph
    Gloss
    tSNOMED CT concepts
     are nodes and 
    Gloss
    tsubtype relationships
     are the directed lines that connect them. All 
    Gloss
    tsubtype relationships
     lead from a more specific 
    Gloss
    tconcept
     to a more general 
    Gloss
    tconcept
    , 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
CapIdillustrative-example-directed-acyclic-graph-
CapTypeFigure
Illustrative Example - Directed Acyclic Graph 


Alternatives

  • DAG

Related Links