Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Directed acyclic graph of package dependencies.

Uses compact u32 indices internally for better memory efficiency and cache performance. Public API maintains String-based interface for compatibility.

Implementations

impl DependencyGraph

pub fn new(packages: Vec<Package>) -> Result<Self>

Creates a new dependency graph from a list of packages.

Errors

Returns an error if circular dependencies are detected.

pub fn get_package(&self, name: &str) -> Option<&Package>

Retrieves a package by name.

pub fn topological_order(&self) -> Vec<String>

Returns packages in topological order (dependencies before dependents).

This is cached during graph construction for fast access.

pub fn dependency_levels(&self) -> Vec<Vec<String>>

Returns dependency levels for parallel execution.

Each level contains packages that can be executed in parallel.

pub fn dependencies(&self, package_name: &str) -> Result<Vec<String>>

Returns direct dependencies of a package.

Errors

Returns an error if the package is not found in the graph.

pub fn dependents(&self, package_name: &str) -> Result<Vec<String>>

Returns direct dependents of a package (packages that depend on it).

Errors

Returns an error if the package is not found in the graph.

pub fn all_dependents(&self, package_name: &str) -> Result<HashSet<String>>

Returns all transitive dependents of a package.

This includes both direct and indirect dependents (packages that depend on packages that depend on this package, etc.).

Results are cached for performance.

Errors

Returns an error if the package is not found in the graph.

pub fn affected_packages( &self, changed_packages: &[String], ) -> Result<HashSet<String>>

Returns all packages affected by changes to the given packages.

This includes the changed packages themselves and all their transitive dependents.

Uses parallel BFS for better performance on large graphs.

Errors

Returns an error if any of the changed packages are not found in the graph.

pub fn all_packages(&self) -> Vec<&Package>

Returns all packages in the graph.

pub fn save_to_file(&self, path: impl AsRef<Path>) -> Result<()>

Serializes the graph to a file for fast loading.

pub fn load_from_file(path: impl AsRef<Path>) -> Result<Self>

Loads a graph from a previously saved file.

pub fn update_incremental(&mut self, changes: GraphChange) -> Result<()>

Updates the graph incrementally based on detected changes.

This is much faster than rebuilding the entire graph when only a few packages have changed.

Errors

Returns an error if any package operations fail or circular dependencies are detected.

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DependencyGraph

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

Formats the value using the given formatter.