Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

The dependency graph structure.

Implementations

impl DependencyGraph

pub fn new() -> Self

Creates a new empty dependency graph.

pub fn add_node(&mut self, node: DependencyNode) -> NodeIndex

Adds a node to the graph.

pub fn add_edge(&mut self, from: NodeIndex, to: NodeIndex, edge: DependencyEdge)

Adds an edge between two nodes.

pub fn get_node_by_name(&self, name: &str) -> Option<&DependencyNode>

Gets a node by name.

pub fn get_node_by_key(&self, key: &str) -> Option<&DependencyNode>

Gets a node by key (name@version).

pub fn get_node(&self, idx: NodeIndex) -> Option<&DependencyNode>

Gets a node by its index.

pub fn nodes(&self) -> impl Iterator<Item = &DependencyNode>

Returns all nodes in the graph.

pub fn node_count(&self) -> usize

Returns the number of nodes.

pub fn edge_count(&self) -> usize

Returns the number of edges.

pub fn has_cycle(&self) -> bool

Checks if the graph has cycles.

pub fn detect_cycle(&self) -> Option<Vec<String>>

Detects cycles and returns the cycle path if found.

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

Performs topological sort and returns nodes in order.

pub fn dependencies_of( &self, node_idx: NodeIndex, ) -> Vec<(&DependencyNode, &DependencyEdge)>

Returns all dependencies of a node.

pub fn dependents_of( &self, node_idx: NodeIndex, ) -> Vec<(&DependencyNode, &DependencyEdge)>

Returns all dependents of a node (reverse dependencies).

pub fn node_index(&self, name: &str) -> Option<NodeIndex>

Returns the node index for a given name.

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.