Struct DependencyGraph 

pub struct DependencyGraph {
    pub nodes: Vec<GraphNode>,
    pub edges: Vec<GraphEdge>,
    pub topo_order: Vec<String>,
}

The dependency graph, constructed once during build() and immutable thereafter.

Fields

nodes: Vec<GraphNode>

All nodes indexed by record key.

edges: Vec<GraphEdge>

All edges (both internal and external).

topo_order: Vec<String>

Topological order of record keys (transforms come after their inputs).

Implementations

impl DependencyGraph

pub fn build_and_validate(record_infos: &[RecordGraphInfo]) -> DbResult<Self>

Construct and validate the dependency graph from registered records.

This builds a complete DependencyGraph with nodes, edges, and topological order. The graph is immutable after construction and can be used for introspection.

Arguments

• record_infos - Information about each registered record (origin, buffer, etc.)

Returns

• Ok(DependencyGraph) - The complete, validated graph
• Err(DbError::TransformInputNotFound) - If a transform references a missing record
• Err(DbError::CyclicDependency) - If the transform edges form a cycle

pub fn node(&self, key: &str) -> Option<&GraphNode>

Get a node by key

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

Get all nodes

pub fn edges(&self) -> &[GraphEdge]

Get all edges

pub fn topo_order(&self) -> &[String]

Get the topological order

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.