- A directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling). ← Wikipedia
- Related terms: Forest · Knowledge Graph · Open Graph Protocol · Cyclomatic complexity
- Previous term: Direct Web Remoting
- Next term: Directionality
- Random term: FOFT (webglossary.info/random 🎲)