Struct Dag 

pub struct Dag { /* private fields */ }

A directed acyclic graph of executable nodes.

Nodes are executed in topological order with maximum parallelism: all nodes whose dependencies are satisfied run concurrently. Use with_max_parallelism to limit how many nodes execute simultaneously.

Implementations

impl Dag

pub fn new() -> Self

Create an empty DAG.

pub fn with_max_parallelism(self, max: usize) -> Self

Set the maximum number of nodes that can execute concurrently.

pub const fn with_failure_policy(self, policy: FailurePolicy) -> Self

Set the failure handling policy.

pub fn add_node(self, node: impl DagNode) -> Self

Add a node to the DAG.

pub fn add_edge(self, from: &str, to: &str) -> AppResult<Self>

Add a directed edge from one node to another.

pub fn topological_sort(&self) -> AppResult<Vec<String>>

Topological sort using Kahn’s algorithm.

pub async fn execute( &self, cancel: CancellationToken, ) -> AppResult<HashMap<String, Value>>

Execute all nodes respecting dependency order with maximum parallelism.

pub async fn execute_with_inputs( &self, initial_inputs: HashMap<String, Value>, cancel: CancellationToken, ) -> AppResult<HashMap<String, Value>>

Execute with initial inputs provided to root nodes.

Trait Implementations

impl Default for Dag

fn default() -> Self

Returns the “default value” for a type.