get_edge_bottlenecks
Finds architectural bottleneck edges in dependency graphs using betweenness centrality, bridge detection, and co-change weight. Helps prioritize edges to monitor and decouple during refactoring.
Instructions
Find architectural bottleneck edges in the import graph: edges sitting on many shortest paths (edge betweenness, Brandes), edges whose removal would disconnect the graph (bridges, Tarjan), and nodes that are single points of failure (articulation points). Score combines structural centrality with co-change weight (bottleneckScore = betweenness × (1 + coChangeWeight)). Use to identify edges to monitor during refactoring and to prioritize decoupling work. For general importance use get_pagerank instead. Read-only. Returns JSON: { edges: [{ sourceFile, targetFile, betweenness, coChangeWeight, bottleneckScore, isBridge }], articulationPoints: [...], stats }.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| top_n | No | Max ranked edges (default: 50; 0 = return all) | |
| min_score | No | Filter edges with bottleneckScore < min_score (default: 0) | |
| sampling | No | auto (default): √V source sampling for graphs >500 nodes; full: always compute exactly |