Struct TaskGraph 

pub struct TaskGraph { /* private fields */ }

Task graph for dependency resolution and execution ordering.

This wraps cuenv_task_graph::TaskGraph with cuenv-core specific functionality for building graphs from TaskDefinition, TaskGroup, etc.

Implementations

impl TaskGraph

pub fn new() -> Self

Create a new empty task graph.

pub fn build_from_node( &mut self, name: &str, node: &TaskNode, all_tasks: &Tasks, ) -> Result<Vec<NodeIndex>>

Build a graph from a task node.

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

Add a single task to the graph.

pub fn add_dependency_edges(&mut self) -> Result<()>

Add dependency edges after all tasks have been added. This ensures proper cycle detection and missing dependency validation.

pub fn has_cycles(&self) -> bool

Check if the graph has cycles.

pub fn topological_sort(&self) -> Result<Vec<TaskGraphNode>>

Get topologically sorted list of tasks.

pub fn get_parallel_groups(&self) -> Result<Vec<Vec<TaskGraphNode>>>

Get all tasks that can run in parallel (no dependencies between them).

pub fn task_count(&self) -> usize

Get the number of tasks in the graph.

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

Check if a task exists in the graph.

pub fn build_complete_graph(&mut self, tasks: &Tasks) -> Result<()>

Build a complete graph from tasks with proper dependency resolution. This performs a two-pass build: first adding all nodes, then all edges.

pub fn build_for_task( &mut self, task_name: &str, all_tasks: &Tasks, ) -> Result<()>

Build graph for a specific task and all its transitive dependencies.

This uses the TaskResolver trait implementation for Tasks to handle nested paths and group expansion in a unified way.

Trait Implementations

impl Default for TaskGraph

fn default() -> Self

Returns the “default value” for a type.