Struct ReferenceGraph 

pub struct ReferenceGraph {
    pub model: String,
    pub vertices: IndexMap<String, ReferenceVertex>,
    pub edges: Vec<ReferenceEdge>,
    /* private fields */
}

The resolved reference DAG for one model — the partition pass’s input.

Edges point from a vertex to a vertex it depends on, so a bottom-up (topological_order) walk visits each vertex after its dependencies — the order class(n) = max(class(inputs)) propagation needs.

Fields

model: String

vertices: IndexMap<String, ReferenceVertex>

edges: Vec<ReferenceEdge>

Implementations

impl ReferenceGraph

pub fn dependencies(&self, key: &str) -> Vec<String>

Vertices key references / depends on (its out-neighbours).

pub fn dependents(&self, key: &str) -> Vec<String>

Vertices that reference / depend on key (its in-neighbours).

pub fn edges_of_kind(&self, kind: EdgeKind) -> Vec<&ReferenceEdge>

All edges of a given kind, in insertion order.

pub fn detect_cycle(&self) -> Option<Vec<String>>

Return a reference cycle as a vertex-key path ([v, …, v]), or None.

Three-colour DFS over the dependency edges, deterministic (sorted vertices, sorted neighbours).

pub fn topological_order(&self) -> Result<Vec<String>, ReferenceResolutionError>

Bottom-up order (dependencies before dependents).

Errors with ReferenceResolutionError::ReferenceCycle if the graph is cyclic — a cycle among reference edges is an out-of-scope implicit/iterative solve (RFC §6.1 “Acyclicity”).

Trait Implementations

impl Clone for ReferenceGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReferenceGraph

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

Formats the value using the given formatter.

impl Default for ReferenceGraph

fn default() -> Self

Returns the “default value” for a type.