Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph built from tasks.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create an empty graph.

pub fn from_collection(collection: &TaskCollection) -> Self

Build a graph from a task collection.

pub fn from_tasks(tasks: Vec<&Task>) -> Self

Build a graph from a list of tasks.

pub fn add_task(&mut self, id: TaskId)

Add a task to the graph.

pub fn add_dependency(&mut self, from: &str, to: &str)

Add a dependency edge (from must complete before to).

pub fn has_cycles(&self) -> bool

Check if the graph has cycles.

pub fn find_cycles(&self) -> Vec<Vec<TaskId>>

Find all cycles in the graph. Returns a list of cycles, where each cycle is a list of task IDs.

pub fn topological_order(&self) -> Option<Vec<TaskId>>

Get topological order of tasks. Returns None if there are cycles.

pub fn dependencies(&self, task_id: &str) -> Vec<TaskId>

Get tasks that this task depends on (direct).

pub fn dependents(&self, task_id: &str) -> Vec<TaskId>

Get tasks that depend on this task (direct).

pub fn parallel_groups(&self) -> Vec<Vec<TaskId>>

Get parallel work groups (generations). Tasks in the same group have no dependencies on each other.

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

Get critical path (longest path through graph). Returns the sequence of tasks on the critical path.

pub fn weighted_critical_path<F>(&self, weight_fn: F) -> Vec<TaskId>

where F: Fn(&str) -> f64,

Get weighted critical path (path with highest cumulative weight). Takes a weight function that maps task IDs to their weight.

pub fn bottlenecks(&self) -> Vec<(TaskId, usize)>

Get bottleneck tasks (high betweenness centrality). Returns tasks sorted by how many paths they’re on.

pub fn to_dot(&self) -> String

Export graph in DOT format for visualization.

Trait Implementations

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.