| Preferred Name |
Directed Acyclic Graph |
| ID |
http://ncicb.nci.nih.gov/xml/owl/EVS/Thesaurus.owl#C45803 |
| code |
C45803 |
| DEFINITION |
A graph whose edges are ordered pairs of vertices or nodes and which contains no path that starts and ends at the same vertex. |
| FULL_SYN |
DAG |
| label |
Directed Acyclic Graph |
| Legacy_Concept_Name |
Directed_Acyclic_Graph |
| Preferred_Name |
Directed Acyclic Graph |
| prefixIRI |
C45803 |
| prefLabel |
Directed Acyclic Graph |
| Semantic_Type |
Manufactured Object |
| UMLS_CUI |
C1706232 |
| subClassOf |
| Delete | Mapping To | Ontology | Source |
|---|---|---|---|
| http://semanticscience.org/resource/SIO_001332 | Semanticscience Integrated Ontology | LOOM |