Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Directed acyclic graph of crate dependencies.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_node(&mut self, name: &str)

Insert a node (no-op if it already exists).

pub fn add_edge(&mut self, from: &str, depends_on: &str)

Add a directed edge from → depends_on.

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

All node names.

pub fn dependencies_of(&self, node: &str) -> Vec<&str>

Direct dependencies of node.

pub fn dependents_of(&self, node: &str) -> Vec<&str>

Reverse lookup: who depends on node.

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

Topological sort. Returns Err with a cycle on failure.

pub fn transitive_deps(&self, node: &str) -> HashSet<String>

Transitive closure of dependencies for node.

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.

impl Default for DependencyGraph

fn default() -> DependencyGraph

Returns the “default value” for a type.