Struct TaskGraph 

pub struct TaskGraph { /* private fields */ }

Global task graph with cycle detection (P2-9).

Tracks parent task → child task delegation edges. TaskGraph::link refuses any edge that would close a cycle (a delegation loop that could otherwise run forever), and TaskGraph::is_acyclic validates the whole graph via a topological sweep.

Implementations

impl TaskGraph

pub fn new() -> Self

An empty graph.

pub fn link(&mut self, parent: &str, child: &str) -> Result<(), ScaleError>

Record a parent → child delegation edge.

Returns ScaleError::CycleDetected if the edge would form a cycle (including a self-link), leaving the graph unchanged.

pub fn would_cycle(&self, parent: &str, child: &str) -> bool

Whether adding parent → child would create a cycle — true when child is already an ancestor of parent.

pub fn is_acyclic(&self) -> bool

Whether the whole graph is acyclic (Kahn’s algorithm).

Trait Implementations

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.