Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Directed dependency graph with one node per source file.

Nodes carry the file path (relative to the repository root). Edges are directed from the importing file to the imported file.

Examples

use sdivi_graph::dependency_graph::{DependencyGraph, build_dependency_graph_from_edges};

let dg = build_dependency_graph_from_edges(
    &["src/lib.rs".to_string(), "src/models.rs".to_string()],
    &[(0, 1)],
);
assert_eq!(dg.node_count(), 2);
assert_eq!(dg.edge_count(), 1);

Implementations

impl DependencyGraph

pub fn node_count(&self) -> usize

Number of nodes (source files) in the graph.

pub fn edge_count(&self) -> usize

Number of directed edges in the graph.

pub fn node_path(&self, idx: usize) -> Option<&Path>

Returns the file path for node index idx.

pub fn node_for_path(&self, path: &Path) -> Option<usize>

Returns the node index for path, or None if not present.

pub fn edges_as_pairs(&self) -> Vec<(usize, usize)>

Returns all directed edges as (from_idx, to_idx) pairs.

pub fn neighbors(&self, idx: usize) -> Vec<usize>

Returns the neighbors of node idx (nodes that idx imports from).

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.