Struct TaskGraph 

pub struct TaskGraph { /* private fields */ }

Task graph for dependency resolution and execution ordering

Implementations

impl TaskGraph

pub fn new() -> Self

Create a new empty task graph

pub fn build_from_definition( &mut self, name: &str, definition: &TaskDefinition, all_tasks: &Tasks, ) -> Result<Vec<NodeIndex>>

Build a graph from a task definition

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

Add a single task to the graph

pub fn has_cycles(&self) -> bool

Check if the graph has cycles

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

Get topologically sorted list of tasks

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

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

Trait Implementations

impl Default for TaskGraph

fn default() -> Self

Returns the “default value” for a type.