# Directed Acyclic Graph

> 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.

Record: `architecture:directed-acyclic-graph`
Kind: constraint
Layer: [Causality Core](https://banes-lab.com/records/layer/causality-core.md)
Severity: contextual
Scope: dependency graph, workflow, build
Aliases: Directed Dependencies
Canonical: https://banes-lab.com/ontology#architecture-directed-acyclic-graph

Listed in [Architecture principles](https://banes-lab.com/api/records/architecture.md), after [Dependency Graph](https://banes-lab.com/records/architecture/dependency-graph.md) and before [Vector Clocks](https://banes-lab.com/records/architecture/vector-clocks.md).

## Repair

- Refactored by: Invert Dependency, Extract Interface, Split Module
- Detected by: [cycle detection](https://banes-lab.com/records/lexicon/cycle-detection.md)
- Violated by: dependency cycle
- Measured by: cycle count
- Enforced by: graph checks

## Reinforces

- [Layering](https://banes-lab.com/records/lexicon/layering.md)
- [Build Order](https://banes-lab.com/records/lexicon/build-order.md)

## Enables

- [Topological Ordering](https://banes-lab.com/records/lexicon/topological-ordering.md)

## Conflicts with

- [Circular Dependency](https://banes-lab.com/records/architecture/circular-dependency.md)

## In tension with

- [Bidirectional Collaboration](https://banes-lab.com/records/lexicon/bidirectional-collaboration.md)

## Tensions

- [Directed Acyclic Graph (DAG) / Bidirectional Collaboration](https://banes-lab.com/records/tension/bidirectional-collaboration-directed-acyclic-graph-dag.md)

## Contracts

- [Checklist Creation Kernel](https://banes-lab.com/records/algorithms/checklist-creation-kernel.md)

## Severity

- [contextual](https://banes-lab.com/records/vocabulary/severity-contextual.md)

## Category

- [Causality / Ordering / Distributed Time](https://banes-lab.com/records/architecture-category/causality-ordering-distributed-time.md)

## Enforced by

- [rules/eslint/closure-no-import-cycles.eslint.rule.ts](https://banes-lab.com/source/governance/rules/eslint/closure-no-import-cycles.eslint.rule.ts.md)
- [runtime/entrypoints/coverage.entrypoint.ts](https://banes-lab.com/source/build/runtime/entrypoints/coverage.entrypoint.ts.md)

## Linked from

- [Node design](https://banes-lab.com/pag/guide/node-design.md)
- [Orchestration as declared structure](https://banes-lab.com/pag/orchestration/declared-structure.md)
- [The plan is a graph](https://banes-lab.com/disciplined-methodology/plan/the-flat-checklist.md)
- [Counting copies](https://banes-lab.com/disciplined-methodology/verify/counting-copies.md)
- [The board and the venue](https://banes-lab.com/disciplined-methodology/collaborate/the-board-and-the-venue.md)
- [A system is a graph](https://banes-lab.com/software-architecture/model/a-system-is-a-graph.md)
- [Anti-patterns](https://banes-lab.com/ontology/principles/architecture-category-anti-patterns.md)
- [Causality / Ordering / Distributed Time](https://banes-lab.com/ontology/lexicon/lexicon-category-causality-ordering-distributed-time.md)
- [Checklist creation](https://banes-lab.com/ontology/algorithms/algorithms-domain-checklist-creation.md)
- [Severity levels](https://banes-lab.com/ontology/schema/the-vocabulary-severity.md)
- [The resolutions](https://banes-lab.com/ontology/schema/the-resolutions.md)

## Evidence in the code

- [rules/eslint/closure-no-import-cycles.eslint.rule.ts](https://banes-lab.com/source/governance/rules/eslint/closure-no-import-cycles.eslint.rule.ts.md)