Module graph 

Typed, bidirectional, orphan-preserving knowledge graph over StrayMark documents.

Generalizes the CLI’s original audit_engine::build_traceability adjacency (forward-only, related-only, orphan-dropping) into the graph model of Loom Spec 001 §3: one node per document, typed edges derived from the frontmatter field that produced them, a resolved flag for dangling references, and bidirectional adjacency.

Determinism: nodes keep the input document order; edges keep declaration order (per document, fields in a fixed order; within a field, list order).

Structs

Edge

A directed, typed edge. source/target are node ids; an edge whose target id is not present in the corpus is kept with resolved: false (a dangling reference — a first-class signal, never silently dropped).

Graph

The typed, bidirectional document multigraph.

Node

One node per discovered document, carrying the metadata the visualization surfaces need (Spec 001 §3.1).

Thread

The highlight set for a node’s thread (Spec 001 §3.3): node ids plus edge indices into Graph::edges.

Enums

EdgeType

The frontmatter field an edge was derived from (Spec 001 §3.2).