Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

A directed dependency graph for analyzing execution order.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create an empty dependency graph.

pub fn add_node(&mut self, node: DepNode)

Add a node to the graph.

pub fn add_edge(&mut self, from: DepNodeId, to: DepNodeId) -> bool

Add a dependency edge: from must complete before to.

Returns true if the edge was newly added.

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn edge_count(&self) -> usize

Number of edges in the graph.

pub fn dependencies_of(&self, id: DepNodeId) -> Vec<DepNodeId>

Get the direct dependencies (predecessors) of a node.

pub fn dependents_of(&self, id: DepNodeId) -> Vec<DepNodeId>

Get the direct dependents (successors) of a node.

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

Find root nodes (no dependencies).

pub fn leaves(&self) -> Vec<DepNodeId>

Find leaf nodes (no dependents).

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

Compute topological ordering using Kahn’s algorithm.

Returns None if the graph has a cycle.

pub fn transitive_dependencies(&self, id: DepNodeId) -> HashSet<DepNodeId>

Compute all transitive dependencies of a node.

pub fn compute_depths(&self) -> HashMap<DepNodeId, u32>

Compute the depth of each node (longest path from a root).

pub fn parallel_levels(&self) -> Vec<Vec<DepNodeId>>

Group nodes into parallelizable levels.

Nodes at the same level have no inter-dependencies and can run concurrently.

pub fn critical_path(&self) -> (Vec<DepNodeId>, f64)

Compute the critical path (longest weighted path through the graph).

Trait Implementations

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> DependencyGraph

Returns the “default value” for a type.