Expand description
Dependency graph construction with petgraph.
Builds a directed graph (DiGraph<String, u32>) from parsed dependency edges.
Nodes are module/package names; edges represent import relationships with weights.
Edge weights reflect coupling intensity (number of import statements).
Self-edges and duplicate edges are automatically filtered (weights are summed).
Functionsยง
- build_
graph - Builds a directed dependency graph from node and edge lists.