Who calls what, what a change reaches, and which layers were crossed to get there.
function-graph- Nodes and heuristic caller-to-callee edges as visualization-ready JSON, weighted by calls, fan-in/out, LOC, complexity, and MI.
cycles- Function-level strongly connected components with advisory cheapest-cut break suggestions and call-line evidence.
hubs- Outlier fan-out god functions, outlier fan-in blast-radius carriers, Henry-Kafura bottlenecks, and cross-module pull.
layers- Inferred Lakos levelization, entry points, module cycles, and skip-level calls with call-site evidence.
impact- Blast radius of the working-tree diff or a named function: transitive callers folded per depth, plus the reachable tests as a verification checklist.
graph-query- One canned traversal per run — callers, callees, neighborhood, or the shortest path between two symbols.