Module graph 

Graph trait hierarchy and typed graph contracts.

Graphs are fully typed and monomorphized. Node/edge counts are const generics; there is no runtime-length collection in the hot path.

Key traits:

• GraphApi — top-level entry point; step + occupancy sampling.
• ScopedGraphApi (std) — concurrent variant with scoped worker threads.
• GraphNodeAccess<I> / GraphEdgeAccess<E> — compile-time indexed access.
• GraphNodeTypes<I, IN, OUT> — per-node payload and queue type associations.
• GraphNodeContextBuilder<I, IN, OUT> — factory for StepContext.

Submodules:

• validate — GraphValidator and GraphDescBuf for descriptor validation.
• bench — test graphs (bench / test feature).

Modules

bench

(Work)bench test Graph implementations.

validate

Graph validation interface.

Traits

GraphApi

Unified runtime-facing graph API.

GraphEdgeAccess

Provides indexed access to a graph edge.

GraphNodeAccess

Provides indexed access to a graph node.

GraphNodeContextBuilder

Builder for per-node execution contexts.

GraphNodeTypes

Defines per-node compile-time types and arity.

ScopedGraphApi

Extension trait for graphs that support concurrent execution via scoped threads.

Type Aliases

EdgeOccupancyBuf

Opaque, runtime-owned buffer of edge occupancy snapshots.