Skip to main content

build_graph

Function build_graph 

Source
pub fn build_graph(
    _nodes: &HashSet<String>,
    edges: &[DependencyEdge],
) -> DiGraph<String, ()>
Expand description

Builds a directed dependency graph from node and edge lists.

§Parameters

  • nodes: Set of unique module/package names
  • edges: Dependency edges between modules

§Returns

petgraph DiGraph<String, ()> — nodes are package names, edges are dependencies.

§Behavior

  • One node is created for each unique package name
  • from_module and to_module from edges are used directly as node labels (they should already contain clean package names from scan.rs)