Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Efficient dependency graph representation optimized for PageRank computation

Implementations

impl DependencyGraph

Graph construction and manipulation operations

pub fn new() -> Self

Create a new empty dependency graph

pub fn with_capacity(capacity: usize) -> Self

Create with initial capacity hint for performance optimization

pub fn add_node(&mut self, node_id: NodeId) -> Result<()>

Add a node to the graph (can exist without edges)

pub fn add_node_with_metadata( &mut self, node_id: NodeId, metadata: NodeMetadata, ) -> Result<()>

Add a node with metadata

pub fn add_edge(&mut self, from_node: NodeId, to_node: NodeId) -> Result<()>

Add an import edge: from_file imports to_file

pub fn add_edges(&mut self, edges: &[(NodeId, NodeId)]) -> Result<()>

Add multiple edges efficiently (batch operation)

pub fn remove_node(&mut self, node_id: &NodeId) -> Result<bool>

Remove a node and all its edges

pub fn remove_edge( &mut self, from_node: &NodeId, to_node: &NodeId, ) -> Result<bool>

Remove an edge between two nodes

pub fn contains_node(&self, node_id: &NodeId) -> bool

Check if a node exists in the graph

pub fn contains_edge(&self, from_node: &NodeId, to_node: &NodeId) -> bool

Check if an edge exists between two nodes

pub fn node_count(&self) -> usize

Get the number of nodes in the graph

pub fn edge_count(&self) -> usize

Get the total number of edges in the graph

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

Get all nodes in the graph

pub fn edges(&self) -> impl Iterator<Item = (&NodeId, &NodeId)>

Get all edges in the graph as (from, to) pairs

impl DependencyGraph

Degree and neighbor query operations

pub fn in_degree(&self, node_id: &NodeId) -> usize

Get in-degree of a node (number of files that import this node)

pub fn out_degree(&self, node_id: &NodeId) -> usize

Get out-degree of a node (number of files this node imports)

pub fn degree(&self, node_id: &NodeId) -> usize

Get total degree of a node (in + out)

pub fn outgoing_neighbors(&self, node_id: &NodeId) -> Option<&BTreeSet<NodeId>>

Get nodes that this node imports (outgoing edges)

pub fn incoming_neighbors(&self, node_id: &NodeId) -> Option<&BTreeSet<NodeId>>

Get nodes that import this node (incoming edges) - important for PageRank

pub fn all_neighbors(&self, node_id: &NodeId) -> HashSet<&NodeId>

Get both incoming and outgoing neighbors

pub fn get_degree_info(&self, node_id: &NodeId) -> Option<DegreeInfo>

Get degree information for a node

impl DependencyGraph

Node metadata and information queries

pub fn node_metadata(&self, node_id: &NodeId) -> Option<&NodeMetadata>

Get metadata for a node

pub fn set_node_metadata( &mut self, node_id: NodeId, metadata: NodeMetadata, ) -> Result<()>

Set metadata for a node

pub fn entrypoint_nodes(&self) -> Vec<&NodeId>

Get all entrypoint nodes

pub fn test_nodes(&self) -> Vec<&NodeId>

Get all test nodes

pub fn nodes_by_language(&self, language: &str) -> Vec<&NodeId>

Get nodes by language

impl DependencyGraph

Specialized operations for PageRank computation

pub fn pagerank_iterator( &self, ) -> impl Iterator<Item = (&NodeId, Option<&BTreeSet<NodeId>>)>

Get all nodes with their reverse edge neighbors (for PageRank iteration)

pub fn dangling_nodes(&self) -> Vec<&NodeId>

Get dangling nodes (nodes with no outgoing edges)

pub fn estimate_scc_count(&self) -> usize

Get strongly connected components (simplified estimation for statistics)

pub fn is_strongly_connected(&self) -> bool

Check if the graph is strongly connected (simplified check)

impl DependencyGraph

Concurrent graph operations for performance

pub fn into_concurrent(self) -> ConcurrentDependencyGraph

Create a thread-safe concurrent graph for parallel operations

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() -> Self

Returns the “default value” for a type.