Directed Acyclic Graph

DAG

Kind: constraint

Layer: Causality Core

Aliases: Directed Dependencies

Record: architecture:directed-acyclic-graph

Severity: contextual

Scope: dependency graph, workflow, build

Canonical: Ontology

A rule or precondition that every dependency points one way and the graph they form has no cycle, so its nodes can be put in topological order.

Listed in Architecture principles, after Dependency Graph and before Vector Clocks.

Reinforces

• Layering
• Build Order

Enables

• Topological Ordering

Conflicts with

• Circular Dependency

In tension with

• Bidirectional Collaboration

Tensions

• Directed Acyclic Graph (DAG) / Bidirectional Collaboration

Contracts

• Checklist Creation Kernel

Violated by

• Circular Dependency

Refactored by

• Invert Dependency
• Extract Interface
• Split Module

Severity

• contextual

Category

• Causality / Ordering / Distributed Time

Enforced by

• rules/eslint/closure-no-import-cycles.eslint.rule.ts
• runtime/entrypoints/coverage.entrypoint.ts

Linked from

• Node design
• Orchestration as declared structure
• The plan is a graph
• Counting copies
• The board and the venue
• A system is a graph
• Anti-patterns
• Causality / Ordering / Distributed Time
• Core Modular Design
• SOLID / Object-Oriented Design
• Checklist creation
• Severity levels
• The resolutions

in this codebase

• rules/eslint/closure-no-import-cycles.eslint.rule.ts