Struct DepGraph 

pub struct DepGraph { /* private fields */ }

A name-level dependency graph rooted at the scanned project.

Implementations

impl DepGraph

pub fn new(root: impl Into<String>) -> Self

A graph rooted at the project named root (the first element of every chain).

pub fn add_edges<I, S>(&mut self, from: &str, tos: I)

where I: IntoIterator<Item = S>, S: Into<String>,

Record that from directly requires each name in tos.

pub fn is_empty(&self) -> bool

Whether the graph holds no edges (a flat lockfile with no resolvable tree).

pub fn chain_to(&self, target: &str) -> Vec<String>

A shortest chain of names [root, …, target] by which target is pulled into the project, via a multi-source-free BFS from the root. Empty when target is unreachable or the graph carries no edges — the honest “unknown provenance” fallback.

Trait Implementations

impl Clone for DepGraph

fn clone(&self) -> DepGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DepGraph

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

Formats the value using the given formatter.

impl Default for DepGraph

fn default() -> DepGraph

Returns the “default value” for a type.