Struct DagGraph 

pub struct DagGraph { /* private fields */ }

Internal DAG representation using adjacency lists.

Implementations

impl DagGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_task(&mut self, id: TaskId, task: Box<dyn DagTask>) -> Result<()>

Add a task to the graph.

pub fn add_dep(&mut self, dependent: &TaskId, dependency: &TaskId) -> Result<()>

Add a dependency edge: dependent cannot start until dependency succeeds.

pub fn set_concurrency_group(&mut self, name: &str, max_concurrent: usize)

Set a concurrency group with a limit.

pub fn assign_group(&mut self, task_id: &TaskId, group: &str)

Assign a task to a concurrency group.

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

Validate the graph: check for cycles using Kahn’s algorithm.

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

Return task IDs with zero dependencies (roots/starting points).

pub fn topo_sort(&self) -> Result<Vec<TaskId>>

Return a topological ordering of task IDs.

pub fn take_task(&mut self, id: &TaskId) -> Option<Box<dyn DagTask>>

Take a task out of the graph (for dispatching to a worker thread).

pub fn len(&self) -> usize

Number of tasks.

pub fn is_empty(&self) -> bool

Whether the graph is empty.