Struct Graph 

pub struct Graph { /* private fields */ }

The main graph structure representing a DAG

Implementations

impl Graph

pub fn new() -> Self

Create a new empty graph

pub fn with_strict_edges() -> Self

Create a new graph with strict edge mapping enabled When enabled, edges must be explicitly added with add_edge() When disabled (default), edges are automatically created based on node order

pub fn set_strict_edge_mapping(&mut self, strict: bool)

Set strict edge mapping mode

pub fn add(&mut self, node: Node) -> Result<()>

Add a node to the graph

pub fn add_node(&mut self, node: Node) -> Result<()>

👎Deprecated since 0.2.0: Use add instead

Alias for add() for backward compatibility

pub fn add_edge(&mut self, edge: Edge) -> Result<()>

Add an edge to the graph

pub fn get_node(&self, node_id: &str) -> Result<&Node>

Get a node by ID

pub fn get_node_mut(&mut self, node_id: &str) -> Result<&mut Node>

Get a mutable reference to a node by ID

pub fn validate(&self) -> Result<()>

Validate the graph (check for cycles)

pub fn topological_order(&self) -> Result<Vec<NodeId>>

Get a topological ordering of the nodes

pub fn nodes(&self) -> Vec<&Node>

Get all nodes in the graph

pub fn edges(&self) -> Vec<&Edge>

Get all edges in the graph

pub fn node_count(&self) -> usize

Get the number of nodes

pub fn edge_count(&self) -> usize

Get the number of edges

pub fn incoming_edges(&self, node_id: &str) -> Result<Vec<&Edge>>

Get incoming edges for a node

pub fn outgoing_edges(&self, node_id: &str) -> Result<Vec<&Edge>>

Get outgoing edges for a node

pub fn auto_connect(&mut self) -> Result<usize>

Automatically connect nodes based on matching port names This enables implicit edge mapping without explicit add_edge() calls

Matching Strategy

• Connects output ports to input ports with the same name
• Only creates edges if the port names match exactly
• Respects topological ordering to avoid cycles

Returns

The number of edges created

pub fn with_auto_connect(self) -> Result<Self>

Build a graph with strict mode disabled - uses implicit edge mapping This is a convenience method that calls auto_connect() after all nodes are added

pub fn create_branch(&mut self, name: impl Into<String>) -> Result<&mut Graph>

Create a new branch (subgraph) with the given name

pub fn get_branch(&self, name: &str) -> Result<&Graph>

Get a reference to a branch by name

pub fn get_branch_mut(&mut self, name: &str) -> Result<&mut Graph>

Get a mutable reference to a branch by name

pub fn branch_names(&self) -> Vec<String>

Get all branch names

pub fn has_branch(&self, name: &str) -> bool

Check if a branch exists

pub fn merge( &mut self, node_id: impl Into<NodeId>, config: MergeConfig, ) -> Result<()>

Create a merge node that combines outputs from multiple branches

The merge node will collect outputs from the specified branches and combine them using the provided merge function (or collect into a list by default).

pub fn create_variants(&mut self, config: VariantConfig) -> Result<Vec<String>>

Create variant branches for config sweeps

This creates multiple isolated branches, each with a different parameter value. Variants can be used for hyperparameter sweeps, A/B testing, or any scenario where you want to run the same computation with different inputs.

Returns the names of the created variant branches.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for Graph

fn default() -> Self

Returns the “default value” for a type.