Struct TaskGraph 

pub struct TaskGraph { /* private fields */ }

A directed acyclic graph of compute tasks.

Implementations

impl TaskGraph

pub fn new() -> Self

Create an empty task graph.

pub fn add_task(&mut self, task: ComputeTask)

Add a task to the graph. Replaces any existing task with the same name.

pub fn remove_task(&mut self, name: &str)

Remove a task by name.

pub fn len(&self) -> usize

Number of tasks.

pub fn is_empty(&self) -> bool

True when there are no tasks.

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

Topological sort using Kahn’s algorithm.

Returns Ok(order) where order is a valid execution order, or Err(cycle) naming one task involved in a cycle.

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

Compute the critical path (longest chain by estimated_ms).

Returns the list of task names on the critical path.

pub fn has_cycle(&self) -> bool

Check whether the graph contains a cycle.

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 Default for TaskGraph

fn default() -> TaskGraph

Returns the “default value” for a type.