Struct TemporalDag 

pub struct TemporalDag { /* private fields */ }

Directed acyclic graph over lagged (VariableId, Lag) nodes.

Implementations

impl TemporalDag

pub fn empty() -> Self

Empty temporal DAG.

pub fn node_count(&self) -> usize

Node count.

pub fn is_empty(&self) -> bool

Whether empty.

pub fn nodes(&self) -> &[NodeRef]

Nodes in dense order.

pub fn add_node(&mut self, node: NodeRef) -> Result<DenseNodeId, GraphError>

Add a lagged node.

Errors

Non-lagged node refs or capacity overflow.

pub fn add_lagged( &mut self, variable: VariableId, lag: Lag, ) -> Result<DenseNodeId, GraphError>

Convenience: add variable at lag.

Errors

Capacity overflow.

pub fn insert_directed( &mut self, from: DenseNodeId, to: DenseNodeId, ) -> Result<(), GraphError>

Insert directed edge with temporal rules.

Contemporaneous self-edges are rejected. A self-loop on a single dense node is always a GraphError::Cycle; lagged self-influence is modeled as an edge between two distinct nodes (e.g. X@t-1 -> X@t).

from’s lag must be greater than or equal to to’s lag: larger Lag values sit further in the past (Lag::CONTEMPORANEOUS is the present), so an edge is only valid running from the past (or same time) toward the present. An edge whose source is nearer the present than its target would point from the future into the past and is rejected.

Errors

Unknown nodes, duplicates, cycles, contemporaneous self-edges, or edges that point from the future into the past.

pub fn children(&self, id: DenseNodeId) -> &[DenseNodeId]

Children.

pub fn edges(&self) -> impl Iterator<Item = MarkedEdge> + '_

Iterate directed edges as marked edges.

pub fn reaches(&self, from: DenseNodeId, to: DenseNodeId) -> bool

Reachability.

pub fn reaches_with( &self, from: DenseNodeId, to: DenseNodeId, ws: &mut GraphWorkspace, ) -> bool

Reachability with a reusable workspace.

pub fn temporal_key(&self, id: DenseNodeId) -> Option<TemporalNodeKey>

Map dense id to a serializable TemporalNodeKey.

impl TemporalDag

pub fn unfold_lazy( &self, indexer: TemporalIndexer, ) -> Result<LazyUnfoldedTemporalGraph, GraphError>

Lazy unfold over a finite indexer window .

Errors

Unknown/non-lagged template nodes.

pub fn unfold( &self, indexer: TemporalIndexer, ) -> Result<UnfoldedTemporalGraph, GraphError>

Eager unfold into a static Dag (materialises the full window).

Errors

Unknown/non-lagged nodes, indexer issues, or cycle insertion.

Trait Implementations

impl Clone for TemporalDag

fn clone(&self) -> TemporalDag

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TemporalDag

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.