Struct DependencyResolver 

pub struct DependencyResolver { /* private fields */ }

Resolves a set of TaskDependency edges into a topologically-sorted execution order, detecting cycles.

Implementations

impl DependencyResolver

pub fn new() -> Self

Creates a new empty resolver.

pub fn add(&mut self, dep: TaskDependency)

Adds a dependency edge.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn edges(&self) -> &[TaskDependency]

Returns all registered edges.

pub fn all_tasks(&self) -> HashSet<String>

Collects the set of all task IDs referenced in the edges.

pub fn predecessors(&self, task_id: &str) -> Vec<String>

Returns the direct predecessors (hard deps only) of a given task.

pub fn successors(&self, task_id: &str) -> Vec<String>

Returns the direct successors (hard deps only) of a given task.

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

Performs a Kahn-style topological sort on hard dependencies.

Returns Ok(order) if the graph is a DAG, or Err(()) if a cycle is detected.

pub fn clear(&mut self)

Clears all edges.

Trait Implementations

impl Clone for DependencyResolver

fn clone(&self) -> DependencyResolver

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DependencyResolver

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for DependencyResolver

fn default() -> DependencyResolver

Returns the “default value” for a type.