Struct InducedDag 

pub struct InducedDag { /* private fields */ }

The open DAG a compositional model induces (Lorenz & Tull, arXiv:2602.16612, Example 61): one vertex per node of the model’s grouping, one edge per wire leaving one node and entering another. Derived, never stored beside the model.

The graph is a plain adjacency set with the reachability queries the abstraction layer needs: parents and children for the structural precheck, blocked reachability for Definition 49’s α(X), plain reachability for the parallelisable test of §7.2, and a cycle test for build().

Implementations

impl InducedDag

pub fn new(n: usize) -> Self

An edgeless graph on n vertices.

pub fn add_edge(&mut self, a: usize, b: usize) -> &mut Self

Adds the edge a → b. Out-of-range endpoints are ignored, so a caller building from a validated model never sees a panic here.

pub fn num_vertices(&self) -> usize

The vertex count.

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

The edges, ascending.

pub fn num_edges(&self) -> usize

The edge count.

pub fn has_edge(&self, a: usize, b: usize) -> bool

Whether a → b is an edge.

pub fn parents(&self, v: usize) -> Vec<usize>

The parents of v, ascending.

pub fn children(&self, v: usize) -> Vec<usize>

The children of v, ascending.

pub fn reaches(&self, a: usize, b: usize) -> bool

Whether a directed path of at least one edge runs from a to b.

pub fn reaches_avoiding( &self, start: usize, targets: &BTreeSet<usize>, blocked: &BTreeSet<usize>, ) -> bool

Whether some vertex of targets is reached from start along a directed path none of whose vertices, start included, lies in blocked. A start in targets counts through the empty path, which is Definition 49’s π(X) ⊆ α(X).

pub fn has_cycle(&self) -> bool

Whether the graph has a directed cycle.

pub fn topological_order(&self) -> Option<Vec<usize>>

A topological order, or None if the graph has a cycle. Kahn’s algorithm, ties broken by ascending vertex.

Trait Implementations

impl Clone for InducedDag

fn clone(&self) -> InducedDag

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InducedDag

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

Formats the value using the given formatter.

impl Eq for InducedDag

impl PartialEq for InducedDag

fn eq(&self, other: &InducedDag) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for InducedDag