Directed acyclic graph
(DAG) A directed graph containing no cycles.
This means that if there is a route from node A to node B then there is no way back.
| < Previous Terms | Terms Containing directed acyclic graph | Next Terms > |
| DIP diplex Direct-Access Storage Device Direct Client to Client Protocol Direct Connection | DAG directed graph tree | directed graph Directed Oc directed set Direct Inward Dialing directional coupler |
