Struct DepGraph 

pub struct DepGraph { /* private fields */ }

A resolved dependency graph. edges[i] holds the indices of the nodes that node i depends on (forward adjacency).

Implementations

impl DepGraph

pub fn new() -> Self

An empty graph.

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

Add a node, returning its index.

pub fn add_edge(&mut self, from: usize, to: usize)

Record that from depends on to.

pub fn nodes(&self) -> &[DepNode]

All nodes, in insertion order.

pub fn nodes_mut(&mut self) -> &mut [DepNode]

All nodes, mutably — used by lockfile parsers that only learn a node’s direct status after the whole file is read (e.g. bundler lists direct gems in a trailing DEPENDENCIES section).

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Whether the graph has no nodes.

pub fn direct_count(&self) -> usize

Number of direct dependencies.

pub fn blast_radii(&self) -> Vec<usize>

Blast radius of every node: the count of distinct other nodes that transitively depend on it. Computed for the whole graph in one pass (shared reverse adjacency).

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.