KidZddlmZddlmZddlmZmZmZm Z m Z ddl m Z m Z  d ddZ d dd Z d dd Z d dd Z d dd Zy )z.MCP tool wrappers for graph analysis features.) annotations)Any)find_bridge_nodesfind_hub_nodesfind_knowledge_gapsfind_surprising_connectionsgenerate_suggested_questions) _get_store_validate_repo_rootc|t|}tt|}t||}|t |gddS)u[Find the most connected nodes in the codebase graph. Hub nodes have the highest total degree (in + out edges). These are architectural hotspots — changes to them have disproportionate blast radius. Args: repo_root: Repository root (auto-detected if empty). top_n: Number of top hubs to return (default 10). top_n)u1get_impact_radius — check blast radius of a hubu/query_graph callers_of — see what calls a hubu3get_bridge_nodes — find architectural chokepoints) hub_nodescountnext_tool_suggestions)r r strrlen) repo_rootrrootstorehubss r/home/jay/workspace/scripts/.codegraph-venv/lib/python3.12/site-packages/code_review_graph/tools/analysis_tools.pyget_hub_nodes_funcrsA y )D s4y !E %u -DT"  c|t|}tt|}t||}|t |gddS)aIFind architectural chokepoints via betweenness centrality. Bridge nodes sit on the shortest paths between many node pairs. If they break, multiple code regions lose connectivity. Args: repo_root: Repository root (auto-detected if empty). top_n: Number of top bridges to return (default 10). r)u+get_hub_nodes — find most connected nodesu(get_impact_radius — check blast radiusu.detect_changes — see if bridges are affected) bridge_nodesrr)r r rrr)rrrrbridgess rget_bridge_nodes_funcr -sA y )D s4y !EU3GW"  rc t|}tt|}t|}t d|j D}||t |dt |dt |dt |ddgddS) aIdentify structural weaknesses in the codebase. Finds: isolated nodes (disconnected), thin communities (< 3 members), untested hotspots (high-degree, no tests), and single-file communities. Args: repo_root: Repository root (auto-detected if empty). c32K|]}t|yw)N)r).0vs r z*get_knowledge_gaps_func..Xs.1A.sisolated_nodesthin_communitiesuntested_hotspotssingle_file_communities)r&r'r(r))u*refactor dead_code — find unused symbolsu(get_hub_nodes — find high-impact nodesu*get_suggested_questions — review prompts)gaps total_gapssummaryr)r r rrsumvaluesr)rrrr*totals rget_knowledge_gaps_funcr0Is y )D s4y !E u %D . . .E!$'7"89 #D);$< =!$T*=%>!?'*./(  "  rc|t|}tt|}t||}|t |gddS)a7Find unexpected architectural coupling in the codebase. Scores edges by surprise factors: cross-community, cross-language, peripheral-to-hub, cross-test-boundary. Args: repo_root: Repository root (auto-detected if empty). top_n: Number of top surprises to return (default 15). r)u1get_architecture_overview — community structureu-query_graph callers_of — trace the couplingu%get_bridge_nodes — find chokepoints)surprising_connectionsrr)r r rr r)rrrr surprisess rget_surprising_connections_funcr4lsA y )D s4y !E+E?I"+Y"  rc >t|}tt|}t|}gggd}|D]&}|j |dgj |(|t ||jDcic]\}}|t |c}}gddScc}}w)aAuto-generate review questions from graph analysis. Produces questions about: bridge nodes, untested hubs, surprising connections, thin communities, and untested hotspots. Args: repo_root: Repository root (auto-detected if empty). )highmediumlowpriority)u,get_knowledge_gaps — structural weaknessesu%detect_changes — risk-scored reviewu+get_architecture_overview — community map) questionsr by_priorityr)r r rr getappendritems)rrrr:r;qkr$s rget_suggested_questions_funcrAs y )D s4y !E,U3IB7K 5* r*11!45Y"-"3"3"5 !QAs1vI "   s:B N) )rrrintreturndict[str, Any])rB)rrrErF)rB)__doc__ __future__rtypingranalysisrrrr r _commonr r rr r0r4rArrrNs4"5 : :   H 8r