Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for managing step execution order.

Implementations

impl DependencyGraph

pub fn new(steps: Vec<DependentStep>) -> Result<DependencyGraph, String>

Create a new dependency graph from a list of steps.

Validates the graph for cycles and missing dependencies.

pub fn ready_steps(&self) -> Vec<&DependentStep>

Get all steps that are currently ready to execute.

pub fn ready_step_ids(&self) -> Vec<&str>

Get the IDs of ready steps.

pub fn has_ready_steps(&self) -> bool

Check if there are any steps ready to execute.

pub fn is_complete(&self) -> bool

Check if all steps are complete.

pub fn has_failed(&self) -> bool

Check if any step has failed.

pub fn take_ready_step(&mut self) -> Option<&DependentStep>

Take the next ready step for execution.

Returns None if no steps are ready.

pub fn take_ready_steps(&mut self, max: usize) -> Vec<String>

Take multiple ready steps for parallel execution.

Returns up to max steps that are ready and parallel-safe together.

pub fn complete(&mut self, step_id: &str, result: StepResult)

Mark a step as complete and update the graph.

This removes the step from dependencies of waiting steps, potentially making them ready.

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

Get topological sort order of steps.

Returns step IDs in an order where dependencies come before dependents.

pub fn max_parallelism(&self) -> usize

Calculate the maximum parallelism possible in this graph.

This is the maximum number of steps that could run concurrently in an ideal execution.

pub fn get_step(&self, id: &str) -> Option<&DependentStep>

Get a step by ID.

pub fn get_result(&self, id: &str) -> Option<&StepResult>

Get the result for a step.

pub fn results(&self) -> &HashMap<String, StepResult>

Get all results.

pub fn step_count(&self) -> usize

Get count of steps.

pub fn completed_count(&self) -> usize

Get count of completed steps.

pub fn failed_count(&self) -> usize

Get count of failed steps.

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<(), Error>

Formats the value using the given formatter.