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 namesedges: 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_moduleandto_modulefrom edges are used directly as node labels (they should already contain clean package names from scan.rs)