Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for managing transitive dependencies.

This graph tracks dependencies between resources and provides algorithms for cycle detection and topological ordering.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create a new empty dependency graph.

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

Add a dependency relationship to the graph.

from depends on to, meaning to must be installed before from.

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

Detect cycles in the dependency graph using DFS with colors.

Returns an error containing the cycle path if a cycle is detected.

pub fn topological_order(&self) -> Result<Vec<DependencyNode>>

Get the topological order for installation.

Returns nodes in an order where all dependencies come before their dependents. This ensures that resources are installed in the correct order.

pub fn get_transitive_deps( &self, node: &DependencyNode, ) -> HashSet<DependencyNode>

Get all transitive dependencies for a given node.

Returns a set of all nodes that the given node depends on, directly or indirectly.

pub fn get_direct_deps(&self, node: &DependencyNode) -> Vec<DependencyNode>

Get direct dependencies for a given node.

Returns only the immediate dependencies, not transitive ones.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn node_count(&self) -> usize

Get the total number of nodes in the graph.

pub fn edge_count(&self) -> usize

Get the total number of edges (dependencies) in the graph.

pub fn nodes(&self) -> Vec<DependencyNode>

Get all nodes in the graph.

pub fn to_tree_string(&self, root: &DependencyNode) -> String

Build a human-readable dependency tree representation.

Returns a string showing the dependency hierarchy.

Trait Implementations

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.