Struct TaskGraph 

pub struct TaskGraph {
    pub steps: HashMap<String, TaskStep>,
    pub edges: Vec<(String, String)>,
}

Directed acyclic graph of task steps.

Fields

steps: HashMap<String, TaskStep>

edges: Vec<(String, String)>

Implementations

impl TaskGraph

pub fn from_steps(steps: Vec<TaskStep>) -> Result<Self, GraphError>

Create a new graph from a list of steps. Edges are derived from each step’s depends_on field.

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

Validate that the graph has no cycles (topological sort).

pub fn ready_steps(&self, succeeded: &HashSet<String>) -> Vec<String>

Return step IDs that are ready to execute (all dependencies satisfied).

succeeded must contain only steps that completed successfully — passing in the broader “terminal” set would let a failed step’s dependents fire against missing artifacts. The orchestrator marks dependents of a failed step as Skipped separately.

Result is sorted by topological order index so plans run in the order the decomposer intended, not in HashMap iteration order.

pub fn transitive_dependents(&self, step_id: &str) -> Vec<String>

Return all steps that transitively depend on step_id (excluding step_id itself). Used by the orchestrator to mark dependents Skipped when an upstream step fails.

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

Topological sort — returns step IDs in execution order.

Order is deterministic: ties (independent steps with the same in-degree) break by step id. Without this, two unrelated no-dep steps would execute in HashMap iteration order, which meant a “Step 1 / Step 2” plan could run in reverse on a given run.

pub fn add_steps(&mut self, new_steps: Vec<TaskStep>) -> Result<(), GraphError>

Splice additional steps into an existing graph. Used by the replan-on-failure loop — after an initial step fails, the orchestrator asks the decomposer for a corrective sub-plan and inserts the resulting steps so the execution loop can pick them up on the next iteration. Each new step’s depends_on may reference either an existing step id or another new step.

pub fn rollback_order(&self, from_step: &str) -> Vec<RollbackAction>

Reverse topological order — for rollback.

Trait Implementations

impl Clone for TaskGraph

fn clone(&self) -> TaskGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TaskGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TaskGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for TaskGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.