Struct WorkflowDag 

pub struct WorkflowDag { /* private fields */ }

Workflow DAG structure.

Implementations

impl WorkflowDag

pub fn new() -> Self

Create a new empty workflow DAG.

pub fn add_task(&mut self, task: TaskNode) -> Result<NodeIndex>

Add a task to the DAG.

pub fn add_dependency( &mut self, from_task_id: &str, to_task_id: &str, edge: TaskEdge, ) -> Result<()>

Add a dependency edge between two tasks.

pub fn get_task(&self, task_id: &str) -> Option<&TaskNode>

Get a task by ID.

pub fn get_task_mut(&mut self, task_id: &str) -> Option<&mut TaskNode>

Get a task by ID (mutable).

pub fn get_dependencies(&self, task_id: &str) -> Vec<String>

Get task dependencies (tasks that must complete before this task).

pub fn get_dependents(&self, task_id: &str) -> Vec<String>

Get task dependents (tasks that depend on this task).

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

Validate the DAG structure.

pub fn tasks(&self) -> Vec<&TaskNode>

Get all tasks in the DAG.

pub fn task_count(&self) -> usize

Get the number of tasks in the DAG.

pub fn dependency_count(&self) -> usize

Get the number of dependencies in the DAG.

pub fn root_tasks(&self) -> Vec<&TaskNode>

Get root tasks (tasks with no dependencies).

pub fn leaf_tasks(&self) -> Vec<&TaskNode>

Get leaf tasks (tasks with no dependents).

pub fn edges(&self) -> Vec<(&str, &str, &TaskEdge)>

Get all edges in the DAG as (from_task_id, to_task_id, edge_data) tuples.

This method is useful for visualization and serialization purposes. Returns edges in the order they are stored in the graph.

pub fn edge_pairs(&self) -> Vec<(String, String)>

Get all edges with their edge types as (from_task_id, to_task_id, edge_type) tuples.

A simplified version of edges() that only returns edge types.

pub fn get_dependencies_with_edges( &self, task_id: &str, ) -> Vec<(String, &TaskEdge)>

Get task dependencies along with their edge data.

Returns a vector of (dependency_task_id, edge_data) tuples for the given task. Dependencies are tasks that must complete before the specified task can start.

pub fn get_dependents_with_edges( &self, task_id: &str, ) -> Vec<(String, &TaskEdge)>

Get task dependents along with their edge data.

Returns a vector of (dependent_task_id, edge_data) tuples for the given task. Dependents are tasks that wait for the specified task to complete.

pub fn get_edge_between( &self, from_task_id: &str, to_task_id: &str, ) -> Option<&TaskEdge>

Get the edge data between two specific tasks, if it exists.

Returns None if either task does not exist or no edge connects them.

pub fn has_dependency(&self, from_task_id: &str, to_task_id: &str) -> bool

Check if a dependency exists between two tasks.

Returns true if from_task_id has a direct edge to to_task_id.

pub fn has_dependencies(&self, task_id: &str) -> bool

Check if a task has any dependencies (incoming edges).

pub fn has_dependents(&self, task_id: &str) -> bool

Check if a task has any dependents (outgoing edges).

pub fn in_degree(&self, task_id: &str) -> usize

Get the in-degree of a task (number of dependencies).

pub fn out_degree(&self, task_id: &str) -> usize

Get the out-degree of a task (number of dependents).

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

Get all task IDs in the DAG.

pub fn contains_task(&self, task_id: &str) -> bool

Check if a task exists in the DAG.

pub fn remove_task(&mut self, task_id: &str) -> Option<TaskNode>

Remove a task from the DAG along with all its edges.

Returns the removed task, or None if the task did not exist.

pub fn edges_by_type(&self, edge_type: EdgeType) -> Vec<(&str, &str, &TaskEdge)>

Get edges filtered by edge type.

pub fn subgraph(&self, task_ids: &[&str]) -> WorkflowDag

Get a subgraph containing only the specified tasks and edges between them.

Tasks not present in the original DAG are silently ignored.

pub fn transitive_dependencies(&self, task_id: &str) -> Vec<String>

Compute the transitive closure of dependencies for a task.

Returns all tasks that must complete (directly or transitively) before the given task can execute.

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

Compute the transitive closure of dependents for a task.

Returns all tasks that (directly or transitively) depend on the given task.

pub fn summary(&self) -> DagSummary

Get summary statistics about the DAG structure.

Trait Implementations

impl Clone for WorkflowDag

fn clone(&self) -> WorkflowDag

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WorkflowDag

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

Formats the value using the given formatter.

impl Default for WorkflowDag

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for WorkflowDag

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for WorkflowDag

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

where __S: Serializer,

Serialize this value into the given Serde serializer.