kirograph 0.17.0 → 0.20.0

package/dist/graph/communities.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/graph/communities.ts"],
+  "sourcesContent": ["/**\n * Community Detection via Leiden Algorithm\n *\n * Clusters related code into communities based on edge connectivity.\n * Oversized communities (>25% of graph) are recursively split with higher resolution.\n *\n * Leiden improves on Louvain by adding a refinement phase between the local-move phase\n * and the aggregation phase. The refinement sub-partitions each community into\n * well-connected sub-communities, guaranteeing that every community in the final\n * partition is internally connected. This prevents the \"disconnected community\"\n * artefact that Louvain is known to produce.\n */\n\nimport type { GraphDatabase } from '../db/database';\n\nexport interface Community {\n  id: number;\n  label: string;\n  memberCount: number;\n  members: Array<{ id: string; name: string; kind: string; filePath: string }>;\n  dominantDirectory: string;\n  dominantLanguage: string;\n  interCommunityEdges: number;\n}\n\nexport interface CommunityResult {\n  communities: Community[];\n  modularity: number;\n  totalNodes: number;\n  totalEdges: number;\n  /** Algorithm used to detect communities. */\n  algorithm: 'leiden';\n}\n\ninterface LouvainNode {\n  id: string;\n  community: number;\n  degree: number;\n}\n\n/**\n * Build an undirected weighted adjacency from the edges table.\n * Weight = number of edges between two nodes (calls + imports + references).\n * Excludes 'contains' edges as they're structural, not semantic.\n */\nfunction buildAdjacency(db: GraphDatabase): { nodes: Map<string, LouvainNode>; adj: Map<string, Map<string, number>>; totalWeight: number } {\n  const rawDb = db.getRawDb();\n\n  const edges = rawDb.all(\n    `SELECT source, target FROM edges WHERE kind != 'contains'`\n  ) as Array<{ source: string; target: string }>;\n\n  const nodes = new Map<string, LouvainNode>();\n  const adj = new Map<string, Map<string, number>>();\n  let totalWeight = 0;\n\n  for (const e of edges) {\n    // Ensure both nodes exist\n    if (!nodes.has(e.source)) nodes.set(e.source, { id: e.source, community: 0, degree: 0 });\n    if (!nodes.has(e.target)) nodes.set(e.target, { id: e.target, community: 0, degree: 0 });\n\n    // Undirected: add weight in both directions\n    if (!adj.has(e.source)) adj.set(e.source, new Map());\n    if (!adj.has(e.target)) adj.set(e.target, new Map());\n\n    const w1 = adj.get(e.source)!.get(e.target) ?? 0;\n    adj.get(e.source)!.set(e.target, w1 + 1);\n\n    const w2 = adj.get(e.target)!.get(e.source) ?? 0;\n    adj.get(e.target)!.set(e.source, w2 + 1);\n\n    nodes.get(e.source)!.degree += 1;\n    nodes.get(e.target)!.degree += 1;\n    totalWeight += 1;\n  }\n\n  return { nodes, adj, totalWeight };\n}\n\n/**\n * Leiden/Louvain Phase 1 \u2014 local moving.\n *\n * For each node, try moving it to the neighbouring community that yields the\n * largest positive modularity gain. Repeats until no improvement is found or\n * `maxIterations` is reached.\n */\nfunction localMovePhase(\n  nodes: Map<string, LouvainNode>,\n  adj: Map<string, Map<string, number>>,\n  totalWeight: number,\n  resolution: number = 1.0,\n): boolean {\n  if (totalWeight === 0) return false;\n\n  const m2 = 2 * totalWeight;\n  let improved = false;\n  let changed = true;\n  let iterations = 0;\n  const maxIterations = 20;\n\n  // Community totals: sum of degrees of nodes in each community\n  const communityDegree = new Map<number, number>();\n  for (const node of nodes.values()) {\n    communityDegree.set(node.community, (communityDegree.get(node.community) ?? 0) + node.degree);\n  }\n\n  while (changed && iterations < maxIterations) {\n    changed = false;\n    iterations++;\n\n    for (const node of nodes.values()) {\n      const currentCommunity = node.community;\n      const ki = node.degree;\n\n      // Calculate edges to each neighbouring community\n      const neighborCommunities = new Map<number, number>();\n      const neighbors = adj.get(node.id);\n      if (!neighbors) continue;\n\n      for (const [neighborId, weight] of neighbors) {\n        const neighborNode = nodes.get(neighborId);\n        if (!neighborNode) continue;\n        const nc = neighborNode.community;\n        neighborCommunities.set(nc, (neighborCommunities.get(nc) ?? 0) + weight);\n      }\n\n      // Remove node from its current community\n      communityDegree.set(currentCommunity, (communityDegree.get(currentCommunity) ?? 0) - ki);\n\n      // Find best community\n      let bestCommunity = currentCommunity;\n      let bestGain = 0;\n\n      const kiIn = neighborCommunities.get(currentCommunity) ?? 0;\n      const sigmaCurrentWithout = communityDegree.get(currentCommunity) ?? 0;\n\n      for (const [community, edgesToCommunity] of neighborCommunities) {\n        if (community === currentCommunity) continue;\n\n        const sigmaCommunity = communityDegree.get(community) ?? 0;\n\n        // Modularity gain formula\n        const gain = resolution * (edgesToCommunity - kiIn) / m2\n          - resolution * ki * (sigmaCommunity - sigmaCurrentWithout) / (m2 * m2) * 2;\n\n        if (gain > bestGain) {\n          bestGain = gain;\n          bestCommunity = community;\n        }\n      }\n\n      // Move node to best community\n      if (bestCommunity !== currentCommunity) {\n        node.community = bestCommunity;\n        communityDegree.set(bestCommunity, (communityDegree.get(bestCommunity) ?? 0) + ki);\n        changed = true;\n        improved = true;\n      } else {\n        communityDegree.set(currentCommunity, (communityDegree.get(currentCommunity) ?? 0) + ki);\n      }\n    }\n  }\n\n  return improved;\n}\n\n/**\n * Leiden Phase 2 \u2014 refinement.\n *\n * For each community produced by the local-move phase, attempt to split it into\n * smaller, well-connected sub-communities. This prevents the disconnected-community\n * artefact that plain Louvain can produce.\n *\n * The procedure:\n *   1. Collect the nodes that belong to community C.\n *   2. Start with every node in its own singleton sub-community.\n *   3. For each node, consider merging its singleton into an adjacent\n *      sub-community (within C) if the merge yields a positive modularity gain\n *      AND the resulting sub-community remains well-connected (internal edges \u2265\n *      a connectivity threshold derived from the sub-community's total degree).\n *   4. Write the refined sub-community ids back into a new partition map.\n *\n * Returns a map from original node id \u2192 refined community id.\n */\nfunction refinementPhase(\n  nodes: Map<string, LouvainNode>,\n  adj: Map<string, Map<string, number>>,\n  totalWeight: number,\n  resolution: number = 1.0,\n): Map<string, number> {\n  // Group nodes by their current (post-local-move) community\n  const communityGroups = new Map<number, string[]>();\n  for (const node of nodes.values()) {\n    if (!communityGroups.has(node.community)) communityGroups.set(node.community, []);\n    communityGroups.get(node.community)!.push(node.id);\n  }\n\n  const m2 = 2 * totalWeight;\n  // Output: node id \u2192 refined community id\n  const refined = new Map<string, number>();\n\n  // Use a globally incrementing id so refined sub-communities never collide\n  let nextSubId = 0;\n  // Initialise: reserve unique ids based on current community ids to avoid\n  // collisions even before we start assigning new ones\n  for (const cId of communityGroups.keys()) {\n    if (cId >= nextSubId) nextSubId = cId + 1;\n  }\n\n  for (const [, members] of communityGroups) {\n    if (members.length === 1) {\n      // Singleton community \u2014 nothing to refine\n      refined.set(members[0], nextSubId++);\n      continue;\n    }\n\n    const memberSet = new Set(members);\n\n    // Phase 2a: start with each node in its own singleton sub-community\n    const subCommunity = new Map<string, number>(); // node id \u2192 sub-community id\n    const subCommunityNodes = new Map<number, Set<string>>(); // sub-community id \u2192 node ids\n    // Internal edge weight for each sub-community\n    const subInternalEdges = new Map<number, number>();\n    // Total degree for each sub-community (within the full graph, not just sub-graph)\n    const subDegree = new Map<number, number>();\n\n    for (const mId of members) {\n      const sid = nextSubId++;\n      subCommunity.set(mId, sid);\n      subCommunityNodes.set(sid, new Set([mId]));\n      subInternalEdges.set(sid, 0);\n      subDegree.set(sid, nodes.get(mId)!.degree);\n    }\n\n    // Phase 2b: iteratively merge singletons into well-connected sub-communities\n    // We only allow merging a node if it is currently a singleton (size 1)\n    // \u2014 this keeps the procedure efficient and follows the Leiden paper's spirit.\n    let mergedAny = true;\n    let subIterations = 0;\n    const maxSubIterations = 10;\n\n    while (mergedAny && subIterations < maxSubIterations) {\n      mergedAny = false;\n      subIterations++;\n\n      for (const mId of members) {\n        const currentSid = subCommunity.get(mId)!;\n        // Only try to move nodes that are still singletons\n        if (subCommunityNodes.get(currentSid)!.size !== 1) continue;\n\n        const ki = nodes.get(mId)!.degree;\n        const neighbors = adj.get(mId);\n        if (!neighbors) continue;\n\n        // Count edges from this node to each sub-community (within the same community C)\n        const edgesToSub = new Map<number, number>();\n        for (const [nId, w] of neighbors) {\n          if (!memberSet.has(nId)) continue;\n          const nSid = subCommunity.get(nId)!;\n          if (nSid === currentSid) continue;\n          edgesToSub.set(nSid, (edgesToSub.get(nSid) ?? 0) + w);\n        }\n\n        if (edgesToSub.size === 0) continue;\n\n        let bestSid = currentSid;\n        let bestGain = 0;\n\n        for (const [candidateSid, edgesToCandidate] of edgesToSub) {\n          const sigmaCandidate = subDegree.get(candidateSid) ?? 0;\n\n          // Modularity gain of merging this singleton into candidateSid\n          const gain = resolution * edgesToCandidate / m2\n            - resolution * ki * sigmaCandidate / (m2 * m2) * 2;\n\n          if (gain <= bestGain) continue;\n\n          // Well-connectedness check:\n          // After the merge the sub-community's internal edges would be\n          // (current internal edges of candidate) + (edges from mId to candidate).\n          // The threshold is:  internalEdges >= \u03B3 * (degree_sum * (degree_sum - ki)) / (2m)\n          // We use a relaxed form: internal edges must be positive (at least one edge\n          // into the sub-community), which is already guaranteed by edgesToCandidate > 0.\n          // Additionally enforce that the density ratio doesn't drop below a floor.\n          const newInternalEdges = (subInternalEdges.get(candidateSid) ?? 0) + edgesToCandidate;\n          const newDegreeSum = sigmaCandidate + ki;\n          // Connectivity threshold: internal edge weight >= resolution * newDegreeSum / (2m)\n          const threshold = resolution * newDegreeSum / m2;\n          if (newInternalEdges < threshold) continue;\n\n          bestGain = gain;\n          bestSid = candidateSid;\n        }\n\n        if (bestSid !== currentSid) {\n          // Perform the merge\n          subCommunityNodes.get(currentSid)!.delete(mId);\n          subCommunityNodes.get(bestSid)!.add(mId);\n          subCommunity.set(mId, bestSid);\n\n          const edgesAdded = edgesToSub.get(bestSid) ?? 0;\n          subInternalEdges.set(bestSid, (subInternalEdges.get(bestSid) ?? 0) + edgesAdded);\n          subDegree.set(bestSid, (subDegree.get(bestSid) ?? 0) + ki);\n\n          mergedAny = true;\n        }\n      }\n    }\n\n    // Write refined assignments into the output map\n    for (const mId of members) {\n      refined.set(mId, subCommunity.get(mId)!);\n    }\n  }\n\n  return refined;\n}\n\n/**\n * Calculate modularity of the current partition.\n */\nfunction calculateModularity(\n  nodes: Map<string, LouvainNode>,\n  adj: Map<string, Map<string, number>>,\n  totalWeight: number,\n): number {\n  if (totalWeight === 0) return 0;\n\n  const m2 = 2 * totalWeight;\n  let q = 0;\n\n  for (const [nodeId, node] of nodes) {\n    const neighbors = adj.get(nodeId);\n    if (!neighbors) continue;\n\n    for (const [neighborId, weight] of neighbors) {\n      const neighborNode = nodes.get(neighborId);\n      if (!neighborNode) continue;\n\n      if (node.community === neighborNode.community) {\n        q += weight - (node.degree * neighborNode.degree) / m2;\n      }\n    }\n  }\n\n  return q / m2;\n}\n\n/**\n * Run community detection on the graph using the Leiden algorithm.\n */\nexport function detectCommunities(db: GraphDatabase, opts?: { resolution?: number; maxCommunityPct?: number }): CommunityResult {\n  const resolution = opts?.resolution ?? 1.0;\n  const maxCommunityPct = opts?.maxCommunityPct ?? 0.25;\n\n  const { nodes, adj, totalWeight } = buildAdjacency(db);\n\n  if (nodes.size === 0) {\n    return { communities: [], modularity: 0, totalNodes: 0, totalEdges: 0, algorithm: 'leiden' };\n  }\n\n  // Initialize: each node in its own community\n  let communityId = 0;\n  for (const node of nodes.values()) {\n    node.community = communityId++;\n  }\n\n  // --- Leiden: local-move phase ---\n  localMovePhase(nodes, adj, totalWeight, resolution);\n\n  // --- Leiden: refinement phase ---\n  // Sub-partition each community into well-connected sub-communities, then apply\n  // the refined assignments back to the nodes map before aggregation.\n  const refinedPartition = refinementPhase(nodes, adj, totalWeight, resolution);\n  for (const [nodeId, refinedCommunityId] of refinedPartition) {\n    nodes.get(nodeId)!.community = refinedCommunityId;\n  }\n\n  // Auto-split oversized communities\n  const communityMembers = new Map<number, string[]>();\n  for (const node of nodes.values()) {\n    if (!communityMembers.has(node.community)) communityMembers.set(node.community, []);\n    communityMembers.get(node.community)!.push(node.id);\n  }\n\n  const maxSize = Math.floor(nodes.size * maxCommunityPct);\n  for (const [cId, members] of communityMembers) {\n    if (members.length > maxSize) {\n      // Re-run with higher resolution on this subgraph\n      const subNodes = new Map<string, LouvainNode>();\n      let subCommunityId = communityId;\n      for (const mId of members) {\n        const original = nodes.get(mId)!;\n        subNodes.set(mId, { ...original, community: subCommunityId++ });\n      }\n      communityId = subCommunityId;\n\n      // Build sub-adjacency\n      const subAdj = new Map<string, Map<string, number>>();\n      let subWeight = 0;\n      for (const mId of members) {\n        const neighbors = adj.get(mId);\n        if (!neighbors) continue;\n        for (const [nId, w] of neighbors) {\n          if (subNodes.has(nId)) {\n            if (!subAdj.has(mId)) subAdj.set(mId, new Map());\n            subAdj.get(mId)!.set(nId, w);\n            subWeight += w;\n          }\n        }\n      }\n\n      // Leiden on the sub-graph: local move + refinement\n      localMovePhase(subNodes, subAdj, subWeight / 2, resolution * 2);\n      const subRefined = refinementPhase(subNodes, subAdj, subWeight / 2, resolution * 2);\n      for (const [mId, rId] of subRefined) {\n        subNodes.get(mId)!.community = rId;\n      }\n\n      // Apply sub-community assignments back\n      for (const [mId, subNode] of subNodes) {\n        nodes.get(mId)!.community = subNode.community;\n      }\n    }\n  }\n\n  // Build result\n  const rawDb = db.getRawDb();\n  const finalCommunities = new Map<number, Array<{ id: string; name: string; kind: string; filePath: string }>>();\n\n  for (const node of nodes.values()) {\n    if (!finalCommunities.has(node.community)) finalCommunities.set(node.community, []);\n    const nodeInfo = rawDb.get(\n      'SELECT name, kind, file_path as filePath FROM nodes WHERE id = ?',\n      [node.id]\n    ) as any;\n    if (nodeInfo) {\n      finalCommunities.get(node.community)!.push({\n        id: node.id,\n        name: nodeInfo.name,\n        kind: nodeInfo.kind,\n        filePath: nodeInfo.filePath,\n      });\n    }\n  }\n\n  // Calculate inter-community edges\n  const interEdges = new Map<number, number>();\n  for (const [nodeId, node] of nodes) {\n    const neighbors = adj.get(nodeId);\n    if (!neighbors) continue;\n    for (const [neighborId] of neighbors) {\n      const neighborNode = nodes.get(neighborId);\n      if (neighborNode && neighborNode.community !== node.community) {\n        interEdges.set(node.community, (interEdges.get(node.community) ?? 0) + 1);\n      }\n    }\n  }\n\n  // Build community objects\n  const communities: Community[] = [];\n  let idx = 0;\n  for (const [cId, members] of finalCommunities) {\n    if (members.length === 0) continue;\n\n    // Dominant directory\n    const dirCounts = new Map<string, number>();\n    const langCounts = new Map<string, number>();\n    for (const m of members) {\n      const dir = m.filePath.split('/').slice(0, 2).join('/');\n      dirCounts.set(dir, (dirCounts.get(dir) ?? 0) + 1);\n      const ext = m.filePath.split('.').pop() ?? '';\n      langCounts.set(ext, (langCounts.get(ext) ?? 0) + 1);\n    }\n\n    const dominantDirectory = [...dirCounts.entries()].sort((a, b) => b[1] - a[1])[0]?.[0] ?? '';\n    const dominantLanguage = [...langCounts.entries()].sort((a, b) => b[1] - a[1])[0]?.[0] ?? '';\n\n    // Generate label from dominant directory or top symbol\n    const label = dominantDirectory || members[0]?.name || `community-${idx}`;\n\n    communities.push({\n      id: idx++,\n      label,\n      memberCount: members.length,\n      members: members.slice(0, 30), // Cap for output size\n      dominantDirectory,\n      dominantLanguage,\n      interCommunityEdges: interEdges.get(cId) ?? 0,\n    });\n  }\n\n  // Sort by size descending\n  communities.sort((a, b) => b.memberCount - a.memberCount);\n\n  const modularity = calculateModularity(nodes, adj, totalWeight);\n\n  return {\n    communities,\n    modularity,\n    totalNodes: nodes.size,\n    totalEdges: totalWeight,\n    algorithm: 'leiden',\n  };\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AA6CA,SAAS,eAAe,IAAoH;AAC1I,QAAM,QAAQ,GAAG,SAAS;AAE1B,QAAM,QAAQ,MAAM;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,QAAQ,oBAAI,IAAyB;AAC3C,QAAM,MAAM,oBAAI,IAAiC;AACjD,MAAI,cAAc;AAElB,aAAW,KAAK,OAAO;AAErB,QAAI,CAAC,MAAM,IAAI,EAAE,MAAM,EAAG,OAAM,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,WAAW,GAAG,QAAQ,EAAE,CAAC;AACvF,QAAI,CAAC,MAAM,IAAI,EAAE,MAAM,EAAG,OAAM,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,WAAW,GAAG,QAAQ,EAAE,CAAC;AAGvF,QAAI,CAAC,IAAI,IAAI,EAAE,MAAM,EAAG,KAAI,IAAI,EAAE,QAAQ,oBAAI,IAAI,CAAC;AACnD,QAAI,CAAC,IAAI,IAAI,EAAE,MAAM,EAAG,KAAI,IAAI,EAAE,QAAQ,oBAAI,IAAI,CAAC;AAEnD,UAAM,KAAK,IAAI,IAAI,EAAE,MAAM,EAAG,IAAI,EAAE,MAAM,KAAK;AAC/C,QAAI,IAAI,EAAE,MAAM,EAAG,IAAI,EAAE,QAAQ,KAAK,CAAC;AAEvC,UAAM,KAAK,IAAI,IAAI,EAAE,MAAM,EAAG,IAAI,EAAE,MAAM,KAAK;AAC/C,QAAI,IAAI,EAAE,MAAM,EAAG,IAAI,EAAE,QAAQ,KAAK,CAAC;AAEvC,UAAM,IAAI,EAAE,MAAM,EAAG,UAAU;AAC/B,UAAM,IAAI,EAAE,MAAM,EAAG,UAAU;AAC/B,mBAAe;AAAA,EACjB;AAEA,SAAO,EAAE,OAAO,KAAK,YAAY;AACnC;AASA,SAAS,eACP,OACA,KACA,aACA,aAAqB,GACZ;AACT,MAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAM,KAAK,IAAI;AACf,MAAI,WAAW;AACf,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,QAAM,gBAAgB;AAGtB,QAAM,kBAAkB,oBAAI,IAAoB;AAChD,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,oBAAgB,IAAI,KAAK,YAAY,gBAAgB,IAAI,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM;AAAA,EAC9F;AAEA,SAAO,WAAW,aAAa,eAAe;AAC5C,cAAU;AACV;AAEA,eAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,YAAM,mBAAmB,KAAK;AAC9B,YAAM,KAAK,KAAK;AAGhB,YAAM,sBAAsB,oBAAI,IAAoB;AACpD,YAAM,YAAY,IAAI,IAAI,KAAK,EAAE;AACjC,UAAI,CAAC,UAAW;AAEhB,iBAAW,CAAC,YAAY,MAAM,KAAK,WAAW;AAC5C,cAAM,eAAe,MAAM,IAAI,UAAU;AACzC,YAAI,CAAC,aAAc;AACnB,cAAM,KAAK,aAAa;AACxB,4BAAoB,IAAI,KAAK,oBAAoB,IAAI,EAAE,KAAK,KAAK,MAAM;AAAA,MACzE;AAGA,sBAAgB,IAAI,mBAAmB,gBAAgB,IAAI,gBAAgB,KAAK,KAAK,EAAE;AAGvF,UAAI,gBAAgB;AACpB,UAAI,WAAW;AAEf,YAAM,OAAO,oBAAoB,IAAI,gBAAgB,KAAK;AAC1D,YAAM,sBAAsB,gBAAgB,IAAI,gBAAgB,KAAK;AAErE,iBAAW,CAAC,WAAW,gBAAgB,KAAK,qBAAqB;AAC/D,YAAI,cAAc,iBAAkB;AAEpC,cAAM,iBAAiB,gBAAgB,IAAI,SAAS,KAAK;AAGzD,cAAM,OAAO,cAAc,mBAAmB,QAAQ,KAClD,aAAa,MAAM,iBAAiB,wBAAwB,KAAK,MAAM;AAE3E,YAAI,OAAO,UAAU;AACnB,qBAAW;AACX,0BAAgB;AAAA,QAClB;AAAA,MACF;AAGA,UAAI,kBAAkB,kBAAkB;AACtC,aAAK,YAAY;AACjB,wBAAgB,IAAI,gBAAgB,gBAAgB,IAAI,aAAa,KAAK,KAAK,EAAE;AACjF,kBAAU;AACV,mBAAW;AAAA,MACb,OAAO;AACL,wBAAgB,IAAI,mBAAmB,gBAAgB,IAAI,gBAAgB,KAAK,KAAK,EAAE;AAAA,MACzF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAoBA,SAAS,gBACP,OACA,KACA,aACA,aAAqB,GACA;AAErB,QAAM,kBAAkB,oBAAI,IAAsB;AAClD,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,QAAI,CAAC,gBAAgB,IAAI,KAAK,SAAS,EAAG,iBAAgB,IAAI,KAAK,WAAW,CAAC,CAAC;AAChF,oBAAgB,IAAI,KAAK,SAAS,EAAG,KAAK,KAAK,EAAE;AAAA,EACnD;AAEA,QAAM,KAAK,IAAI;AAEf,QAAM,UAAU,oBAAI,IAAoB;AAGxC,MAAI,YAAY;AAGhB,aAAW,OAAO,gBAAgB,KAAK,GAAG;AACxC,QAAI,OAAO,UAAW,aAAY,MAAM;AAAA,EAC1C;AAEA,aAAW,CAAC,EAAE,OAAO,KAAK,iBAAiB;AACzC,QAAI,QAAQ,WAAW,GAAG;AAExB,cAAQ,IAAI,QAAQ,CAAC,GAAG,WAAW;AACnC;AAAA,IACF;AAEA,UAAM,YAAY,IAAI,IAAI,OAAO;AAGjC,UAAM,eAAe,oBAAI,IAAoB;AAC7C,UAAM,oBAAoB,oBAAI,IAAyB;AAEvD,UAAM,mBAAmB,oBAAI,IAAoB;AAEjD,UAAM,YAAY,oBAAI,IAAoB;AAE1C,eAAW,OAAO,SAAS;AACzB,YAAM,MAAM;AACZ,mBAAa,IAAI,KAAK,GAAG;AACzB,wBAAkB,IAAI,KAAK,oBAAI,IAAI,CAAC,GAAG,CAAC,CAAC;AACzC,uBAAiB,IAAI,KAAK,CAAC;AAC3B,gBAAU,IAAI,KAAK,MAAM,IAAI,GAAG,EAAG,MAAM;AAAA,IAC3C;AAKA,QAAI,YAAY;AAChB,QAAI,gBAAgB;AACpB,UAAM,mBAAmB;AAEzB,WAAO,aAAa,gBAAgB,kBAAkB;AACpD,kBAAY;AACZ;AAEA,iBAAW,OAAO,SAAS;AACzB,cAAM,aAAa,aAAa,IAAI,GAAG;AAEvC,YAAI,kBAAkB,IAAI,UAAU,EAAG,SAAS,EAAG;AAEnD,cAAM,KAAK,MAAM,IAAI,GAAG,EAAG;AAC3B,cAAM,YAAY,IAAI,IAAI,GAAG;AAC7B,YAAI,CAAC,UAAW;AAGhB,cAAM,aAAa,oBAAI,IAAoB;AAC3C,mBAAW,CAAC,KAAK,CAAC,KAAK,WAAW;AAChC,cAAI,CAAC,UAAU,IAAI,GAAG,EAAG;AACzB,gBAAM,OAAO,aAAa,IAAI,GAAG;AACjC,cAAI,SAAS,WAAY;AACzB,qBAAW,IAAI,OAAO,WAAW,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,QACtD;AAEA,YAAI,WAAW,SAAS,EAAG;AAE3B,YAAI,UAAU;AACd,YAAI,WAAW;AAEf,mBAAW,CAAC,cAAc,gBAAgB,KAAK,YAAY;AACzD,gBAAM,iBAAiB,UAAU,IAAI,YAAY,KAAK;AAGtD,gBAAM,OAAO,aAAa,mBAAmB,KACzC,aAAa,KAAK,kBAAkB,KAAK,MAAM;AAEnD,cAAI,QAAQ,SAAU;AAStB,gBAAM,oBAAoB,iBAAiB,IAAI,YAAY,KAAK,KAAK;AACrE,gBAAM,eAAe,iBAAiB;AAEtC,gBAAM,YAAY,aAAa,eAAe;AAC9C,cAAI,mBAAmB,UAAW;AAElC,qBAAW;AACX,oBAAU;AAAA,QACZ;AAEA,YAAI,YAAY,YAAY;AAE1B,4BAAkB,IAAI,UAAU,EAAG,OAAO,GAAG;AAC7C,4BAAkB,IAAI,OAAO,EAAG,IAAI,GAAG;AACvC,uBAAa,IAAI,KAAK,OAAO;AAE7B,gBAAM,aAAa,WAAW,IAAI,OAAO,KAAK;AAC9C,2BAAiB,IAAI,UAAU,iBAAiB,IAAI,OAAO,KAAK,KAAK,UAAU;AAC/E,oBAAU,IAAI,UAAU,UAAU,IAAI,OAAO,KAAK,KAAK,EAAE;AAEzD,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,SAAS;AACzB,cAAQ,IAAI,KAAK,aAAa,IAAI,GAAG,CAAE;AAAA,IACzC;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,oBACP,OACA,KACA,aACQ;AACR,MAAI,gBAAgB,EAAG,QAAO;AAE9B,QAAM,KAAK,IAAI;AACf,MAAI,IAAI;AAER,aAAW,CAAC,QAAQ,IAAI,KAAK,OAAO;AAClC,UAAM,YAAY,IAAI,IAAI,MAAM;AAChC,QAAI,CAAC,UAAW;AAEhB,eAAW,CAAC,YAAY,MAAM,KAAK,WAAW;AAC5C,YAAM,eAAe,MAAM,IAAI,UAAU;AACzC,UAAI,CAAC,aAAc;AAEnB,UAAI,KAAK,cAAc,aAAa,WAAW;AAC7C,aAAK,SAAU,KAAK,SAAS,aAAa,SAAU;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,IAAI;AACb;AAKO,SAAS,kBAAkB,IAAmB,MAA2E;AAC9H,QAAM,aAAa,MAAM,cAAc;AACvC,QAAM,kBAAkB,MAAM,mBAAmB;AAEjD,QAAM,EAAE,OAAO,KAAK,YAAY,IAAI,eAAe,EAAE;AAErD,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,aAAa,CAAC,GAAG,YAAY,GAAG,YAAY,GAAG,YAAY,GAAG,WAAW,SAAS;AAAA,EAC7F;AAGA,MAAI,cAAc;AAClB,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,SAAK,YAAY;AAAA,EACnB;AAGA,iBAAe,OAAO,KAAK,aAAa,UAAU;AAKlD,QAAM,mBAAmB,gBAAgB,OAAO,KAAK,aAAa,UAAU;AAC5E,aAAW,CAAC,QAAQ,kBAAkB,KAAK,kBAAkB;AAC3D,UAAM,IAAI,MAAM,EAAG,YAAY;AAAA,EACjC;AAGA,QAAM,mBAAmB,oBAAI,IAAsB;AACnD,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,QAAI,CAAC,iBAAiB,IAAI,KAAK,SAAS,EAAG,kBAAiB,IAAI,KAAK,WAAW,CAAC,CAAC;AAClF,qBAAiB,IAAI,KAAK,SAAS,EAAG,KAAK,KAAK,EAAE;AAAA,EACpD;AAEA,QAAM,UAAU,KAAK,MAAM,MAAM,OAAO,eAAe;AACvD,aAAW,CAAC,KAAK,OAAO,KAAK,kBAAkB;AAC7C,QAAI,QAAQ,SAAS,SAAS;AAE5B,YAAM,WAAW,oBAAI,IAAyB;AAC9C,UAAI,iBAAiB;AACrB,iBAAW,OAAO,SAAS;AACzB,cAAM,WAAW,MAAM,IAAI,GAAG;AAC9B,iBAAS,IAAI,KAAK,EAAE,GAAG,UAAU,WAAW,iBAAiB,CAAC;AAAA,MAChE;AACA,oBAAc;AAGd,YAAM,SAAS,oBAAI,IAAiC;AACpD,UAAI,YAAY;AAChB,iBAAW,OAAO,SAAS;AACzB,cAAM,YAAY,IAAI,IAAI,GAAG;AAC7B,YAAI,CAAC,UAAW;AAChB,mBAAW,CAAC,KAAK,CAAC,KAAK,WAAW;AAChC,cAAI,SAAS,IAAI,GAAG,GAAG;AACrB,gBAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,oBAAI,IAAI,CAAC;AAC/C,mBAAO,IAAI,GAAG,EAAG,IAAI,KAAK,CAAC;AAC3B,yBAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAGA,qBAAe,UAAU,QAAQ,YAAY,GAAG,aAAa,CAAC;AAC9D,YAAM,aAAa,gBAAgB,UAAU,QAAQ,YAAY,GAAG,aAAa,CAAC;AAClF,iBAAW,CAAC,KAAK,GAAG,KAAK,YAAY;AACnC,iBAAS,IAAI,GAAG,EAAG,YAAY;AAAA,MACjC;AAGA,iBAAW,CAAC,KAAK,OAAO,KAAK,UAAU;AACrC,cAAM,IAAI,GAAG,EAAG,YAAY,QAAQ;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAGA,QAAM,QAAQ,GAAG,SAAS;AAC1B,QAAM,mBAAmB,oBAAI,IAAiF;AAE9G,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,QAAI,CAAC,iBAAiB,IAAI,KAAK,SAAS,EAAG,kBAAiB,IAAI,KAAK,WAAW,CAAC,CAAC;AAClF,UAAM,WAAW,MAAM;AAAA,MACrB;AAAA,MACA,CAAC,KAAK,EAAE;AAAA,IACV;AACA,QAAI,UAAU;AACZ,uBAAiB,IAAI,KAAK,SAAS,EAAG,KAAK;AAAA,QACzC,IAAI,KAAK;AAAA,QACT,MAAM,SAAS;AAAA,QACf,MAAM,SAAS;AAAA,QACf,UAAU,SAAS;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,aAAa,oBAAI,IAAoB;AAC3C,aAAW,CAAC,QAAQ,IAAI,KAAK,OAAO;AAClC,UAAM,YAAY,IAAI,IAAI,MAAM;AAChC,QAAI,CAAC,UAAW;AAChB,eAAW,CAAC,UAAU,KAAK,WAAW;AACpC,YAAM,eAAe,MAAM,IAAI,UAAU;AACzC,UAAI,gBAAgB,aAAa,cAAc,KAAK,WAAW;AAC7D,mBAAW,IAAI,KAAK,YAAY,WAAW,IAAI,KAAK,SAAS,KAAK,KAAK,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,EACF;AAGA,QAAM,cAA2B,CAAC;AAClC,MAAI,MAAM;AACV,aAAW,CAAC,KAAK,OAAO,KAAK,kBAAkB;AAC7C,QAAI,QAAQ,WAAW,EAAG;AAG1B,UAAM,YAAY,oBAAI,IAAoB;AAC1C,UAAM,aAAa,oBAAI,IAAoB;AAC3C,eAAW,KAAK,SAAS;AACvB,YAAM,MAAM,EAAE,SAAS,MAAM,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;AACtD,gBAAU,IAAI,MAAM,UAAU,IAAI,GAAG,KAAK,KAAK,CAAC;AAChD,YAAM,MAAM,EAAE,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC3C,iBAAW,IAAI,MAAM,WAAW,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,IACpD;AAEA,UAAM,oBAAoB,CAAC,GAAG,UAAU,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK;AAC1F,UAAM,mBAAmB,CAAC,GAAG,WAAW,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK;AAG1F,UAAM,QAAQ,qBAAqB,QAAQ,CAAC,GAAG,QAAQ,aAAa,GAAG;AAEvE,gBAAY,KAAK;AAAA,MACf,IAAI;AAAA,MACJ;AAAA,MACA,aAAa,QAAQ;AAAA,MACrB,SAAS,QAAQ,MAAM,GAAG,EAAE;AAAA;AAAA,MAC5B;AAAA,MACA;AAAA,MACA,qBAAqB,WAAW,IAAI,GAAG,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAGA,cAAY,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAExD,QAAM,aAAa,oBAAoB,OAAO,KAAK,WAAW;AAE9D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,IACZ,WAAW;AAAA,EACb;AACF;",
+  "names": []
+}

package/dist/graph/flows.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Execution Flow Tracing
+ *
+ * Traces call chains from entry points (functions with no incoming call edges,
+ * route handlers, main functions) through the graph, sorted by criticality.
+ */
+import type { GraphDatabase } from '../db/database';
+export interface FlowHop {
+    symbol: string;
+    kind: string;
+    filePath: string;
+    line: number;
+    edgeKind?: string;
+    confidence?: string;
+}
+export interface ExecutionFlow {
+    entryPoint: string;
+    entryPointKind: string;
+    entryPointFile: string;
+    criticality: number;
+    hops: FlowHop[];
+}
+/**
+ * Detect entry points: symbols that are likely execution starting points.
+ * - Route nodes
+ * - Functions with zero incoming call edges
+ * - Symbols matching known entry patterns (main, handler, controller, etc.)
+ */
+export declare function detectEntryPoints(db: GraphDatabase, limit?: number): Array<{
+    id: string;
+    name: string;
+    kind: string;
+    filePath: string;
+    line: number;
+}>;
+/**
+ * Trace a single execution flow from an entry point forward through call edges.
+ * Returns the chain of hops with criticality scoring.
+ */
+export declare function traceFlow(db: GraphDatabase, entryPointId: string, maxDepth?: number): FlowHop[];
+/**
+ * Compute criticality score for a flow based on:
+ * - Length (longer flows = more critical paths)
+ * - Fan-out of hops (more downstream = higher criticality)
+ * - Whether it touches I/O-like patterns (db, http, file)
+ */
+export declare function scoreCriticality(hops: FlowHop[]): number;
+/**
+ * Get execution flows from all detected entry points.
+ */
+export declare function getExecutionFlows(db: GraphDatabase, opts?: {
+    maxFlows?: number;
+    maxDepth?: number;
+}): ExecutionFlow[];
+//# sourceMappingURL=flows.d.ts.map

package/dist/graph/flows.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flows.d.ts","sourceRoot":"","sources":["../../src/graph/flows.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,OAAO,EAAE,CAAC;CACjB;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,SAAK,GAAG,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CA6ClJ;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,OAAO,EAAE,CA8C3F;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,CAUxD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,aAAa,EAAE,CAwBrH"}

package/dist/graph/flows.js

@@ -0,0 +1,138 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var flows_exports = {};
+__export(flows_exports, {
+  detectEntryPoints: () => detectEntryPoints,
+  getExecutionFlows: () => getExecutionFlows,
+  scoreCriticality: () => scoreCriticality,
+  traceFlow: () => traceFlow
+});
+module.exports = __toCommonJS(flows_exports);
+function detectEntryPoints(db, limit = 20) {
+  const rawDb = db.getRawDb();
+  const routes = rawDb.all(
+    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE kind = 'route' LIMIT ?`,
+    [limit]
+  );
+  const roots = rawDb.all(
+    `SELECT n.id, n.name, n.kind, n.file_path as filePath, n.start_line as line
+     FROM nodes n
+     WHERE n.kind IN ('function', 'method')
+       AND n.is_exported = 1
+       AND NOT EXISTS (
+         SELECT 1 FROM edges e WHERE e.target = n.id AND e.kind = 'calls'
+       )
+     ORDER BY (SELECT COUNT(*) FROM edges e2 WHERE e2.source = n.id) DESC
+     LIMIT ?`,
+    [limit]
+  );
+  const patterns = rawDb.all(
+    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes
+     WHERE (lower(name) LIKE '%handler%' OR lower(name) LIKE '%controller%'
+       OR lower(name) = 'main' OR lower(name) LIKE '%middleware%'
+       OR lower(name) LIKE '%endpoint%')
+       AND kind IN ('function', 'method', 'class')
+     LIMIT ?`,
+    [limit]
+  );
+  const seen = /* @__PURE__ */ new Set();
+  const results = [];
+  for (const entry of [...routes, ...roots, ...patterns]) {
+    if (!seen.has(entry.id)) {
+      seen.add(entry.id);
+      results.push(entry);
+    }
+  }
+  return results.slice(0, limit);
+}
+function traceFlow(db, entryPointId, maxDepth = 10) {
+  const rawDb = db.getRawDb();
+  const hops = [];
+  const visited = /* @__PURE__ */ new Set();
+  function walk(nodeId, depth) {
+    if (depth >= maxDepth || visited.has(nodeId)) return;
+    visited.add(nodeId);
+    const node = rawDb.get(
+      "SELECT name, kind, file_path as filePath, start_line as line FROM nodes WHERE id = ?",
+      [nodeId]
+    );
+    if (!node) return;
+    const edgeInfo = depth === 0 ? void 0 : rawDb.get(
+      `SELECT kind, confidence FROM edges WHERE target = ? AND source IN (${[...visited].map(() => "?").join(",")}) LIMIT 1`,
+      [nodeId, ...[...visited]]
+    );
+    hops.push({
+      symbol: node.name,
+      kind: node.kind,
+      filePath: node.filePath,
+      line: node.line,
+      edgeKind: edgeInfo?.kind,
+      confidence: edgeInfo?.confidence
+    });
+    const callees = rawDb.all(
+      `SELECT e.target, e.kind as edgeKind, e.confidence
+       FROM edges e
+       WHERE e.source = ? AND e.kind = 'calls'
+       ORDER BY (SELECT COUNT(*) FROM edges e2 WHERE e2.source = e.target) DESC
+       LIMIT 5`,
+      [nodeId]
+    );
+    for (const callee of callees) {
+      walk(callee.target, depth + 1);
+    }
+  }
+  walk(entryPointId, 0);
+  return hops;
+}
+function scoreCriticality(hops) {
+  if (hops.length === 0) return 0;
+  const lengthScore = Math.min(hops.length / 10, 1);
+  const ioPatterns = /db|database|query|http|fetch|request|file|write|read|socket|stream/i;
+  const touchesIO = hops.some((h) => ioPatterns.test(h.symbol));
+  const ioScore = touchesIO ? 0.3 : 0;
+  return Math.min(lengthScore * 0.7 + ioScore, 1);
+}
+function getExecutionFlows(db, opts) {
+  const maxFlows = opts?.maxFlows ?? 15;
+  const maxDepth = opts?.maxDepth ?? 10;
+  const entryPoints = detectEntryPoints(db, maxFlows * 2);
+  const flows = [];
+  for (const ep of entryPoints) {
+    const hops = traceFlow(db, ep.id, maxDepth);
+    if (hops.length < 2) continue;
+    const criticality = scoreCriticality(hops);
+    flows.push({
+      entryPoint: ep.name,
+      entryPointKind: ep.kind,
+      entryPointFile: ep.filePath,
+      criticality,
+      hops
+    });
+  }
+  flows.sort((a, b) => b.criticality - a.criticality);
+  return flows.slice(0, maxFlows);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  detectEntryPoints,
+  getExecutionFlows,
+  scoreCriticality,
+  traceFlow
+});
+//# sourceMappingURL=flows.js.map

package/dist/graph/flows.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/graph/flows.ts"],
+  "sourcesContent": ["/**\n * Execution Flow Tracing\n *\n * Traces call chains from entry points (functions with no incoming call edges,\n * route handlers, main functions) through the graph, sorted by criticality.\n */\n\nimport type { GraphDatabase } from '../db/database';\n\nexport interface FlowHop {\n  symbol: string;\n  kind: string;\n  filePath: string;\n  line: number;\n  edgeKind?: string;\n  confidence?: string;\n}\n\nexport interface ExecutionFlow {\n  entryPoint: string;\n  entryPointKind: string;\n  entryPointFile: string;\n  criticality: number;\n  hops: FlowHop[];\n}\n\n/**\n * Detect entry points: symbols that are likely execution starting points.\n * - Route nodes\n * - Functions with zero incoming call edges\n * - Symbols matching known entry patterns (main, handler, controller, etc.)\n */\nexport function detectEntryPoints(db: GraphDatabase, limit = 20): Array<{ id: string; name: string; kind: string; filePath: string; line: number }> {\n  const rawDb = db.getRawDb();\n\n  // 1. Route nodes are always entry points\n  const routes = rawDb.all(\n    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE kind = 'route' LIMIT ?`,\n    [limit]\n  ) as any[];\n\n  // 2. Functions/methods with no incoming call edges (graph roots)\n  const roots = rawDb.all(\n    `SELECT n.id, n.name, n.kind, n.file_path as filePath, n.start_line as line\n     FROM nodes n\n     WHERE n.kind IN ('function', 'method')\n       AND n.is_exported = 1\n       AND NOT EXISTS (\n         SELECT 1 FROM edges e WHERE e.target = n.id AND e.kind = 'calls'\n       )\n     ORDER BY (SELECT COUNT(*) FROM edges e2 WHERE e2.source = n.id) DESC\n     LIMIT ?`,\n    [limit]\n  ) as any[];\n\n  // 3. Known entry point patterns\n  const patterns = rawDb.all(\n    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes\n     WHERE (lower(name) LIKE '%handler%' OR lower(name) LIKE '%controller%'\n       OR lower(name) = 'main' OR lower(name) LIKE '%middleware%'\n       OR lower(name) LIKE '%endpoint%')\n       AND kind IN ('function', 'method', 'class')\n     LIMIT ?`,\n    [limit]\n  ) as any[];\n\n  // Deduplicate by id\n  const seen = new Set<string>();\n  const results: Array<{ id: string; name: string; kind: string; filePath: string; line: number }> = [];\n  for (const entry of [...routes, ...roots, ...patterns]) {\n    if (!seen.has(entry.id)) {\n      seen.add(entry.id);\n      results.push(entry);\n    }\n  }\n\n  return results.slice(0, limit);\n}\n\n/**\n * Trace a single execution flow from an entry point forward through call edges.\n * Returns the chain of hops with criticality scoring.\n */\nexport function traceFlow(db: GraphDatabase, entryPointId: string, maxDepth = 10): FlowHop[] {\n  const rawDb = db.getRawDb();\n  const hops: FlowHop[] = [];\n  const visited = new Set<string>();\n\n  function walk(nodeId: string, depth: number): void {\n    if (depth >= maxDepth || visited.has(nodeId)) return;\n    visited.add(nodeId);\n\n    const node = rawDb.get(\n      'SELECT name, kind, file_path as filePath, start_line as line FROM nodes WHERE id = ?',\n      [nodeId]\n    ) as any;\n    if (!node) return;\n\n    const edgeInfo = depth === 0 ? undefined : rawDb.get(\n      `SELECT kind, confidence FROM edges WHERE target = ? AND source IN (${[...visited].map(() => '?').join(',')}) LIMIT 1`,\n      [nodeId, ...[...visited]]\n    ) as any;\n\n    hops.push({\n      symbol: node.name,\n      kind: node.kind,\n      filePath: node.filePath,\n      line: node.line,\n      edgeKind: edgeInfo?.kind,\n      confidence: edgeInfo?.confidence,\n    });\n\n    // Follow outgoing call edges, ordered by target's fan-out (criticality)\n    const callees = rawDb.all(\n      `SELECT e.target, e.kind as edgeKind, e.confidence\n       FROM edges e\n       WHERE e.source = ? AND e.kind = 'calls'\n       ORDER BY (SELECT COUNT(*) FROM edges e2 WHERE e2.source = e.target) DESC\n       LIMIT 5`,\n      [nodeId]\n    ) as any[];\n\n    for (const callee of callees) {\n      walk(callee.target, depth + 1);\n    }\n  }\n\n  walk(entryPointId, 0);\n  return hops;\n}\n\n/**\n * Compute criticality score for a flow based on:\n * - Length (longer flows = more critical paths)\n * - Fan-out of hops (more downstream = higher criticality)\n * - Whether it touches I/O-like patterns (db, http, file)\n */\nexport function scoreCriticality(hops: FlowHop[]): number {\n  if (hops.length === 0) return 0;\n\n  const lengthScore = Math.min(hops.length / 10, 1.0); // normalize to 0-1\n\n  const ioPatterns = /db|database|query|http|fetch|request|file|write|read|socket|stream/i;\n  const touchesIO = hops.some(h => ioPatterns.test(h.symbol));\n  const ioScore = touchesIO ? 0.3 : 0;\n\n  return Math.min(lengthScore * 0.7 + ioScore, 1.0);\n}\n\n/**\n * Get execution flows from all detected entry points.\n */\nexport function getExecutionFlows(db: GraphDatabase, opts?: { maxFlows?: number; maxDepth?: number }): ExecutionFlow[] {\n  const maxFlows = opts?.maxFlows ?? 15;\n  const maxDepth = opts?.maxDepth ?? 10;\n\n  const entryPoints = detectEntryPoints(db, maxFlows * 2);\n  const flows: ExecutionFlow[] = [];\n\n  for (const ep of entryPoints) {\n    const hops = traceFlow(db, ep.id, maxDepth);\n    if (hops.length < 2) continue; // Skip trivial flows (single node)\n\n    const criticality = scoreCriticality(hops);\n    flows.push({\n      entryPoint: ep.name,\n      entryPointKind: ep.kind,\n      entryPointFile: ep.filePath,\n      criticality,\n      hops,\n    });\n  }\n\n  // Sort by criticality descending\n  flows.sort((a, b) => b.criticality - a.criticality);\n  return flows.slice(0, maxFlows);\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgCO,SAAS,kBAAkB,IAAmB,QAAQ,IAAuF;AAClJ,QAAM,QAAQ,GAAG,SAAS;AAG1B,QAAM,SAAS,MAAM;AAAA,IACnB;AAAA,IACA,CAAC,KAAK;AAAA,EACR;AAGA,QAAM,QAAQ,MAAM;AAAA,IAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,CAAC,KAAK;AAAA,EACR;AAGA,QAAM,WAAW,MAAM;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,CAAC,KAAK;AAAA,EACR;AAGA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,UAA6F,CAAC;AACpG,aAAW,SAAS,CAAC,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,GAAG;AACtD,QAAI,CAAC,KAAK,IAAI,MAAM,EAAE,GAAG;AACvB,WAAK,IAAI,MAAM,EAAE;AACjB,cAAQ,KAAK,KAAK;AAAA,IACpB;AAAA,EACF;AAEA,SAAO,QAAQ,MAAM,GAAG,KAAK;AAC/B;AAMO,SAAS,UAAU,IAAmB,cAAsB,WAAW,IAAe;AAC3F,QAAM,QAAQ,GAAG,SAAS;AAC1B,QAAM,OAAkB,CAAC;AACzB,QAAM,UAAU,oBAAI,IAAY;AAEhC,WAAS,KAAK,QAAgB,OAAqB;AACjD,QAAI,SAAS,YAAY,QAAQ,IAAI,MAAM,EAAG;AAC9C,YAAQ,IAAI,MAAM;AAElB,UAAM,OAAO,MAAM;AAAA,MACjB;AAAA,MACA,CAAC,MAAM;AAAA,IACT;AACA,QAAI,CAAC,KAAM;AAEX,UAAM,WAAW,UAAU,IAAI,SAAY,MAAM;AAAA,MAC/C,sEAAsE,CAAC,GAAG,OAAO,EAAE,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,CAAC;AAAA,MAC3G,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC;AAAA,IAC1B;AAEA,SAAK,KAAK;AAAA,MACR,QAAQ,KAAK;AAAA,MACb,MAAM,KAAK;AAAA,MACX,UAAU,KAAK;AAAA,MACf,MAAM,KAAK;AAAA,MACX,UAAU,UAAU;AAAA,MACpB,YAAY,UAAU;AAAA,IACxB,CAAC;AAGD,UAAM,UAAU,MAAM;AAAA,MACpB;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,CAAC,MAAM;AAAA,IACT;AAEA,eAAW,UAAU,SAAS;AAC5B,WAAK,OAAO,QAAQ,QAAQ,CAAC;AAAA,IAC/B;AAAA,EACF;AAEA,OAAK,cAAc,CAAC;AACpB,SAAO;AACT;AAQO,SAAS,iBAAiB,MAAyB;AACxD,MAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAM,cAAc,KAAK,IAAI,KAAK,SAAS,IAAI,CAAG;AAElD,QAAM,aAAa;AACnB,QAAM,YAAY,KAAK,KAAK,OAAK,WAAW,KAAK,EAAE,MAAM,CAAC;AAC1D,QAAM,UAAU,YAAY,MAAM;AAElC,SAAO,KAAK,IAAI,cAAc,MAAM,SAAS,CAAG;AAClD;AAKO,SAAS,kBAAkB,IAAmB,MAAkE;AACrH,QAAM,WAAW,MAAM,YAAY;AACnC,QAAM,WAAW,MAAM,YAAY;AAEnC,QAAM,cAAc,kBAAkB,IAAI,WAAW,CAAC;AACtD,QAAM,QAAyB,CAAC;AAEhC,aAAW,MAAM,aAAa;AAC5B,UAAM,OAAO,UAAU,IAAI,GAAG,IAAI,QAAQ;AAC1C,QAAI,KAAK,SAAS,EAAG;AAErB,UAAM,cAAc,iBAAiB,IAAI;AACzC,UAAM,KAAK;AAAA,MACT,YAAY,GAAG;AAAA,MACf,gBAAgB,GAAG;AAAA,MACnB,gBAAgB,GAAG;AAAA,MACnB;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAGA,QAAM,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;AAClD,SAAO,MAAM,MAAM,GAAG,QAAQ;AAChC;",
+  "names": []
+}

package/dist/graph/refactor.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Refactoring Tools
+ *
+ * - rename: Preview all locations that reference a symbol (rename preview)
+ * - suggest: Community-driven refactoring suggestions
+ */
+import type { GraphDatabase } from '../db/database';
+export interface RenameLocation {
+    filePath: string;
+    line: number;
+    column?: number;
+    context: string;
+    edgeKind: string;
+}
+export interface RenamePreview {
+    symbol: string;
+    kind: string;
+    filePath: string;
+    line: number;
+    references: RenameLocation[];
+    totalReferences: number;
+}
+export interface RefactorSuggestion {
+    type: 'move' | 'split' | 'extract' | 'group';
+    description: string;
+    symbols: string[];
+    rationale: string;
+    priority: 'high' | 'medium' | 'low';
+}
+/**
+ * Generate a rename preview: find all locations that reference a symbol.
+ * This shows what would need to change if the symbol is renamed.
+ */
+export declare function renamePreview(db: GraphDatabase, symbolName: string): RenamePreview | null;
+/**
+ * Generate refactoring suggestions based on graph structure.
+ * Looks for:
+ * - Symbols that are far from their most-connected peers (move candidates)
+ * - Files with too many symbols in different "clusters" (split candidates)
+ * - Groups of related symbols scattered across files (group candidates)
+ */
+export declare function suggestRefactorings(db: GraphDatabase, limit?: number): RefactorSuggestion[];
+//# sourceMappingURL=refactor.d.ts.map

package/dist/graph/refactor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refactor.d.ts","sourceRoot":"","sources":["../../src/graph/refactor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,cAAc,EAAE,CAAC;IAC7B,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO,CAAC;IAC7C,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;CACrC;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,EAAE,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAqEzF;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,SAAK,GAAG,kBAAkB,EAAE,CA6EvF"}

package/dist/graph/refactor.js

@@ -0,0 +1,155 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var refactor_exports = {};
+__export(refactor_exports, {
+  renamePreview: () => renamePreview,
+  suggestRefactorings: () => suggestRefactorings
+});
+module.exports = __toCommonJS(refactor_exports);
+function renamePreview(db, symbolName) {
+  const rawDb = db.getRawDb();
+  const target = rawDb.get(
+    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE name = ? LIMIT 1`,
+    [symbolName]
+  );
+  if (!target) {
+    const qualified = rawDb.get(
+      `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE qualified_name LIKE ? LIMIT 1`,
+      [`%${symbolName}`]
+    );
+    if (!qualified) return null;
+    Object.assign(target, qualified);
+  }
+  const incomingEdges = rawDb.all(
+    `SELECT e.source, e.kind, e.line, e.column, n.name as sourceName, n.file_path as sourceFile, n.start_line as sourceLine
+     FROM edges e
+     JOIN nodes n ON n.id = e.source
+     WHERE e.target = ?
+     ORDER BY n.file_path, e.line`,
+    [target.id]
+  );
+  const outgoingEdges = rawDb.all(
+    `SELECT e.target, e.kind, e.line, e.column, n.name as targetName, n.file_path as targetFile
+     FROM edges e
+     JOIN nodes n ON n.id = e.target
+     WHERE e.source = ? AND e.kind IN ('imports', 'exports')`,
+    [target.id]
+  );
+  const references = [];
+  for (const edge of incomingEdges) {
+    references.push({
+      filePath: edge.sourceFile,
+      line: edge.line ?? edge.sourceLine,
+      column: edge.column ?? void 0,
+      context: edge.sourceName,
+      edgeKind: edge.kind
+    });
+  }
+  for (const edge of outgoingEdges) {
+    references.push({
+      filePath: edge.targetFile,
+      line: edge.line ?? 0,
+      column: edge.column ?? void 0,
+      context: edge.targetName,
+      edgeKind: edge.kind
+    });
+  }
+  return {
+    symbol: target.name,
+    kind: target.kind,
+    filePath: target.filePath,
+    line: target.line,
+    references,
+    totalReferences: references.length
+  };
+}
+function suggestRefactorings(db, limit = 10) {
+  const rawDb = db.getRawDb();
+  const suggestions = [];
+  const crossDirEdges = rawDb.all(
+    `SELECT
+       n1.file_path as sourceFile,
+       n2.file_path as targetFile,
+       COUNT(*) as edgeCount
+     FROM edges e
+     JOIN nodes n1 ON n1.id = e.source
+     JOIN nodes n2 ON n2.id = e.target
+     WHERE e.kind = 'calls'
+       AND n1.file_path != n2.file_path
+     GROUP BY n1.file_path, n2.file_path
+     HAVING edgeCount >= 5
+     ORDER BY edgeCount DESC
+     LIMIT 20`
+  );
+  for (const row of crossDirEdges.slice(0, 5)) {
+    const sourceDir = row.sourceFile.split("/").slice(0, -1).join("/");
+    const targetDir = row.targetFile.split("/").slice(0, -1).join("/");
+    if (sourceDir !== targetDir) {
+      suggestions.push({
+        type: "move",
+        description: `\`${row.sourceFile}\` has ${row.edgeCount} calls to \`${row.targetFile}\` \u2014 consider co-locating related code`,
+        symbols: [row.sourceFile, row.targetFile],
+        rationale: `High cross-directory coupling (${row.edgeCount} call edges) suggests these files belong together`,
+        priority: row.edgeCount >= 10 ? "high" : "medium"
+      });
+    }
+  }
+  const largeFiles = rawDb.all(
+    `SELECT file_path, COUNT(*) as symbolCount
+     FROM nodes
+     WHERE kind IN ('function', 'method', 'class')
+     GROUP BY file_path
+     HAVING symbolCount >= 15
+     ORDER BY symbolCount DESC
+     LIMIT 10`
+  );
+  for (const file of largeFiles.slice(0, 3)) {
+    suggestions.push({
+      type: "split",
+      description: `\`${file.file_path}\` has ${file.symbolCount} functions/classes \u2014 consider splitting into focused modules`,
+      symbols: [file.file_path],
+      rationale: `Files with many symbols often handle multiple responsibilities`,
+      priority: file.symbolCount >= 30 ? "high" : "medium"
+    });
+  }
+  const deadExports = rawDb.all(
+    `SELECT n.name, n.kind, n.file_path as filePath
+     FROM nodes n
+     WHERE n.is_exported = 1
+       AND n.kind IN ('function', 'method', 'class')
+       AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.target = n.id AND e.kind = 'calls')
+     LIMIT 10`
+  );
+  if (deadExports.length >= 3) {
+    suggestions.push({
+      type: "extract",
+      description: `${deadExports.length} exported symbols have no callers \u2014 consider removing exports or the symbols themselves`,
+      symbols: deadExports.slice(0, 5).map((d) => `${d.kind} \`${d.name}\` in ${d.filePath}`),
+      rationale: `Exported symbols with no callers are dead API surface \u2014 they add maintenance burden without value`,
+      priority: deadExports.length >= 8 ? "high" : "low"
+    });
+  }
+  return suggestions.slice(0, limit);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  renamePreview,
+  suggestRefactorings
+});
+//# sourceMappingURL=refactor.js.map

package/dist/graph/refactor.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/graph/refactor.ts"],
+  "sourcesContent": ["/**\n * Refactoring Tools\n *\n * - rename: Preview all locations that reference a symbol (rename preview)\n * - suggest: Community-driven refactoring suggestions\n */\n\nimport type { GraphDatabase } from '../db/database';\n\nexport interface RenameLocation {\n  filePath: string;\n  line: number;\n  column?: number;\n  context: string; // The referencing symbol's name\n  edgeKind: string;\n}\n\nexport interface RenamePreview {\n  symbol: string;\n  kind: string;\n  filePath: string;\n  line: number;\n  references: RenameLocation[];\n  totalReferences: number;\n}\n\nexport interface RefactorSuggestion {\n  type: 'move' | 'split' | 'extract' | 'group';\n  description: string;\n  symbols: string[];\n  rationale: string;\n  priority: 'high' | 'medium' | 'low';\n}\n\n/**\n * Generate a rename preview: find all locations that reference a symbol.\n * This shows what would need to change if the symbol is renamed.\n */\nexport function renamePreview(db: GraphDatabase, symbolName: string): RenamePreview | null {\n  const rawDb = db.getRawDb();\n\n  // Find the target symbol\n  const target = rawDb.get(\n    `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE name = ? LIMIT 1`,\n    [symbolName]\n  ) as any;\n\n  if (!target) {\n    // Try qualified name\n    const qualified = rawDb.get(\n      `SELECT id, name, kind, file_path as filePath, start_line as line FROM nodes WHERE qualified_name LIKE ? LIMIT 1`,\n      [`%${symbolName}`]\n    ) as any;\n    if (!qualified) return null;\n    Object.assign(target, qualified);\n  }\n\n  // Find all edges pointing TO this symbol (references, calls, imports)\n  const incomingEdges = rawDb.all(\n    `SELECT e.source, e.kind, e.line, e.column, n.name as sourceName, n.file_path as sourceFile, n.start_line as sourceLine\n     FROM edges e\n     JOIN nodes n ON n.id = e.source\n     WHERE e.target = ?\n     ORDER BY n.file_path, e.line`,\n    [target.id]\n  ) as any[];\n\n  // Find all edges FROM this symbol (for completeness \u2014 shows what it calls)\n  const outgoingEdges = rawDb.all(\n    `SELECT e.target, e.kind, e.line, e.column, n.name as targetName, n.file_path as targetFile\n     FROM edges e\n     JOIN nodes n ON n.id = e.target\n     WHERE e.source = ? AND e.kind IN ('imports', 'exports')`,\n    [target.id]\n  ) as any[];\n\n  const references: RenameLocation[] = [];\n\n  for (const edge of incomingEdges) {\n    references.push({\n      filePath: edge.sourceFile,\n      line: edge.line ?? edge.sourceLine,\n      column: edge.column ?? undefined,\n      context: edge.sourceName,\n      edgeKind: edge.kind,\n    });\n  }\n\n  // Also include export/import edges from the symbol itself\n  for (const edge of outgoingEdges) {\n    references.push({\n      filePath: edge.targetFile,\n      line: edge.line ?? 0,\n      column: edge.column ?? undefined,\n      context: edge.targetName,\n      edgeKind: edge.kind,\n    });\n  }\n\n  return {\n    symbol: target.name,\n    kind: target.kind,\n    filePath: target.filePath,\n    line: target.line,\n    references,\n    totalReferences: references.length,\n  };\n}\n\n/**\n * Generate refactoring suggestions based on graph structure.\n * Looks for:\n * - Symbols that are far from their most-connected peers (move candidates)\n * - Files with too many symbols in different \"clusters\" (split candidates)\n * - Groups of related symbols scattered across files (group candidates)\n */\nexport function suggestRefactorings(db: GraphDatabase, limit = 10): RefactorSuggestion[] {\n  const rawDb = db.getRawDb();\n  const suggestions: RefactorSuggestion[] = [];\n\n  // 1. Find files with high fan-out to a single other directory (move candidates)\n  const crossDirEdges = rawDb.all(\n    `SELECT\n       n1.file_path as sourceFile,\n       n2.file_path as targetFile,\n       COUNT(*) as edgeCount\n     FROM edges e\n     JOIN nodes n1 ON n1.id = e.source\n     JOIN nodes n2 ON n2.id = e.target\n     WHERE e.kind = 'calls'\n       AND n1.file_path != n2.file_path\n     GROUP BY n1.file_path, n2.file_path\n     HAVING edgeCount >= 5\n     ORDER BY edgeCount DESC\n     LIMIT 20`\n  ) as any[];\n\n  for (const row of crossDirEdges.slice(0, 5)) {\n    const sourceDir = row.sourceFile.split('/').slice(0, -1).join('/');\n    const targetDir = row.targetFile.split('/').slice(0, -1).join('/');\n    if (sourceDir !== targetDir) {\n      suggestions.push({\n        type: 'move',\n        description: `\\`${row.sourceFile}\\` has ${row.edgeCount} calls to \\`${row.targetFile}\\` \u2014 consider co-locating related code`,\n        symbols: [row.sourceFile, row.targetFile],\n        rationale: `High cross-directory coupling (${row.edgeCount} call edges) suggests these files belong together`,\n        priority: row.edgeCount >= 10 ? 'high' : 'medium',\n      });\n    }\n  }\n\n  // 2. Find large files (split candidates)\n  const largeFiles = rawDb.all(\n    `SELECT file_path, COUNT(*) as symbolCount\n     FROM nodes\n     WHERE kind IN ('function', 'method', 'class')\n     GROUP BY file_path\n     HAVING symbolCount >= 15\n     ORDER BY symbolCount DESC\n     LIMIT 10`\n  ) as any[];\n\n  for (const file of largeFiles.slice(0, 3)) {\n    suggestions.push({\n      type: 'split',\n      description: `\\`${file.file_path}\\` has ${file.symbolCount} functions/classes \u2014 consider splitting into focused modules`,\n      symbols: [file.file_path],\n      rationale: `Files with many symbols often handle multiple responsibilities`,\n      priority: file.symbolCount >= 30 ? 'high' : 'medium',\n    });\n  }\n\n  // 3. Find exported symbols with zero callers (dead export candidates)\n  const deadExports = rawDb.all(\n    `SELECT n.name, n.kind, n.file_path as filePath\n     FROM nodes n\n     WHERE n.is_exported = 1\n       AND n.kind IN ('function', 'method', 'class')\n       AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.target = n.id AND e.kind = 'calls')\n     LIMIT 10`\n  ) as any[];\n\n  if (deadExports.length >= 3) {\n    suggestions.push({\n      type: 'extract',\n      description: `${deadExports.length} exported symbols have no callers \u2014 consider removing exports or the symbols themselves`,\n      symbols: deadExports.slice(0, 5).map((d: any) => `${d.kind} \\`${d.name}\\` in ${d.filePath}`),\n      rationale: `Exported symbols with no callers are dead API surface \u2014 they add maintenance burden without value`,\n      priority: deadExports.length >= 8 ? 'high' : 'low',\n    });\n  }\n\n  return suggestions.slice(0, limit);\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsCO,SAAS,cAAc,IAAmB,YAA0C;AACzF,QAAM,QAAQ,GAAG,SAAS;AAG1B,QAAM,SAAS,MAAM;AAAA,IACnB;AAAA,IACA,CAAC,UAAU;AAAA,EACb;AAEA,MAAI,CAAC,QAAQ;AAEX,UAAM,YAAY,MAAM;AAAA,MACtB;AAAA,MACA,CAAC,IAAI,UAAU,EAAE;AAAA,IACnB;AACA,QAAI,CAAC,UAAW,QAAO;AACvB,WAAO,OAAO,QAAQ,SAAS;AAAA,EACjC;AAGA,QAAM,gBAAgB,MAAM;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,CAAC,OAAO,EAAE;AAAA,EACZ;AAGA,QAAM,gBAAgB,MAAM;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA,IAIA,CAAC,OAAO,EAAE;AAAA,EACZ;AAEA,QAAM,aAA+B,CAAC;AAEtC,aAAW,QAAQ,eAAe;AAChC,eAAW,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,MACf,MAAM,KAAK,QAAQ,KAAK;AAAA,MACxB,QAAQ,KAAK,UAAU;AAAA,MACvB,SAAS,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAGA,aAAW,QAAQ,eAAe;AAChC,eAAW,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,MACf,MAAM,KAAK,QAAQ;AAAA,MACnB,QAAQ,KAAK,UAAU;AAAA,MACvB,SAAS,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,IACjB,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,MAAM,OAAO;AAAA,IACb,UAAU,OAAO;AAAA,IACjB,MAAM,OAAO;AAAA,IACb;AAAA,IACA,iBAAiB,WAAW;AAAA,EAC9B;AACF;AASO,SAAS,oBAAoB,IAAmB,QAAQ,IAA0B;AACvF,QAAM,QAAQ,GAAG,SAAS;AAC1B,QAAM,cAAoC,CAAC;AAG3C,QAAM,gBAAgB,MAAM;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaF;AAEA,aAAW,OAAO,cAAc,MAAM,GAAG,CAAC,GAAG;AAC3C,UAAM,YAAY,IAAI,WAAW,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG;AACjE,UAAM,YAAY,IAAI,WAAW,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG;AACjE,QAAI,cAAc,WAAW;AAC3B,kBAAY,KAAK;AAAA,QACf,MAAM;AAAA,QACN,aAAa,KAAK,IAAI,UAAU,UAAU,IAAI,SAAS,eAAe,IAAI,UAAU;AAAA,QACpF,SAAS,CAAC,IAAI,YAAY,IAAI,UAAU;AAAA,QACxC,WAAW,kCAAkC,IAAI,SAAS;AAAA,QAC1D,UAAU,IAAI,aAAa,KAAK,SAAS;AAAA,MAC3C,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,aAAa,MAAM;AAAA,IACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOF;AAEA,aAAW,QAAQ,WAAW,MAAM,GAAG,CAAC,GAAG;AACzC,gBAAY,KAAK;AAAA,MACf,MAAM;AAAA,MACN,aAAa,KAAK,KAAK,SAAS,UAAU,KAAK,WAAW;AAAA,MAC1D,SAAS,CAAC,KAAK,SAAS;AAAA,MACxB,WAAW;AAAA,MACX,UAAU,KAAK,eAAe,KAAK,SAAS;AAAA,IAC9C,CAAC;AAAA,EACH;AAGA,QAAM,cAAc,MAAM;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMF;AAEA,MAAI,YAAY,UAAU,GAAG;AAC3B,gBAAY,KAAK;AAAA,MACf,MAAM;AAAA,MACN,aAAa,GAAG,YAAY,MAAM;AAAA,MAClC,SAAS,YAAY,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAW,GAAG,EAAE,IAAI,MAAM,EAAE,IAAI,SAAS,EAAE,QAAQ,EAAE;AAAA,MAC3F,WAAW;AAAA,MACX,UAAU,YAAY,UAAU,IAAI,SAAS;AAAA,IAC/C,CAAC;AAAA,EACH;AAEA,SAAO,YAAY,MAAM,GAAG,KAAK;AACnC;",
+  "names": []
+}

package/dist/index.d.ts

@@ -4,9 +4,13 @@
  * Pure facade. Every method delegates to a focused sub-system.
  * No business logic lives here.
  */
+import { GraphDatabase } from './db/database';
 import type { KiroGraphConfig } from './config';
+import { SnapshotManager } from './core/snapshot';
 import type { FileTreeNode, FileTree } from './core/file-tree';
-import type { Node, NodeKind, IndexResult, IndexProgress, SyncResult, TaskContext, SearchResult, SearchOptions, NodeContext, NodeMetrics } from './types';
+import type { GraphSnapshot, GraphDiff } from './core/snapshot';
+export type { GraphSnapshot, GraphDiff };
+import type { Node, Edge, NodeKind, IndexResult, IndexProgress, SyncResult, TaskContext, SearchResult, SearchOptions, NodeContext, NodeMetrics } from './types';
 import type { ArchitectureResult } from './architecture/types';
 export type { FileTreeNode, FileTree };
 export default class KiroGraph {
@@ -22,24 +26,36 @@ export default class KiroGraph {
     private readonly pipeline;
     private readonly searcher;
     private constructor();
-    static init(projectRoot: string, config?: Partial<KiroGraphConfig>): Promise<KiroGraph>;
-    static open(projectRoot: string): Promise<KiroGraph>;
+    static init(projectRoot: string, config?: Partial<KiroGraphConfig>, onModelProgress?: (file: string, loaded: number, total: number, done: boolean) => void): Promise<KiroGraph>;
+    static open(projectRoot: string, onModelProgress?: (file: string, loaded: number, total: number, done: boolean) => void): Promise<KiroGraph>;
     static isInitialized(projectRoot: string): boolean;
     unlockForce(): void;
     markDirty(): void;
     clearDirty(): void;
     isDirty(): boolean;
+    isIndexLocked(): boolean;
     syncIfDirty(): Promise<SyncResult | null>;
+    /**
+     * Returns the number of files that have changed on disk but are not yet
+     * reflected in the index. Used by the MCP status tool to warn the agent
+     * when the index may be stale.
+     */
+    getPendingSyncCount(): Promise<number>;
     indexAll(opts?: {
         onProgress?: (p: IndexProgress) => void;
         force?: boolean;
         signal?: AbortSignal;
     }): Promise<IndexResult>;
-    sync(changedFiles?: string[]): Promise<SyncResult>;
+    sync(changedFilesOrOpts?: string[] | {
+        files?: string[];
+        onProgress?: (p: IndexProgress) => void;
+    }): Promise<SyncResult>;
     searchNodes(query: string, kindOrOpts?: NodeKind | SearchOptions, limit?: number): SearchResult[];
     getCallers(nodeId: string, limit?: number): Promise<Node[]>;
     getCallees(nodeId: string, limit?: number): Promise<Node[]>;
     getImpactRadius(nodeId: string, depth?: number): Promise<Node[]>;
+    getAllNodes(): Node[];
+    getAllEdges(): Edge[];
     findDeadCode(limit?: number): Node[];
     findCircularDependencies(): string[][];
     findPath(fromId: string, toId: string, maxDepth?: number): Promise<Node[]>;
@@ -61,7 +77,22 @@ export default class KiroGraph {
         depth?: number;
         testPattern?: string;
     }): string[];
+    findHotspots(limit?: number): Array<Node & {
+        degree: number;
+        inDegree: number;
+        outDegree: number;
+    }>;
+    findSurprisingConnections(limit?: number): Array<{
+        source: Node;
+        target: Node;
+        kind: string;
+        score: number;
+    }>;
+    createSnapshotManager(): SnapshotManager;
     getStats(): Promise<{
+        pendingFiles: number;
+        syncRunning: boolean;
+        syncWarningThreshold: number;
         architectureStats?: {
             packages: number;
             layers: number;
@@ -95,6 +126,7 @@ export default class KiroGraph {
     };
     isArchitectureEnabled(): boolean;
     getProjectRoot(): string;
+    getDatabase(): GraphDatabase;
     close(): void;
 }
 /** Walk up directories to find the nearest .kirograph/ folder. */

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAUhD,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,KAAK,EACV,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EACnE,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EACtD,MAAM,SAAS,CAAC;AACjB,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AAIvC,MAAM,CAAC,OAAO,OAAO,SAAS;IAC5B,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAgB;IACnC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAoB;IACjD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAoB;IAC7C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IACxC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAiB;IAChD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAuB;IAC5C,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAc;IACnC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;IACzC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IAEpC,OAAO;WAgBM,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC;WAYhF,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAa1D,MAAM,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAMlD,WAAW,IAAI,IAAI;IACnB,SAAS,IAAI,IAAI;IACjB,UAAU,IAAI,IAAI;IAClB,OAAO,IAAI,OAAO;IAEZ,WAAW,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAOzC,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,KAAK,IAAI,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAIzH,IAAI,CAAC,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC;IAMxD,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,QAAQ,GAAG,aAAa,EAAE,KAAK,SAAK,GAAG,YAAY,EAAE;IAMvF,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACvD,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACvD,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACjE,YAAY,CAAC,KAAK,SAAK,GAAG,IAAI,EAAE;IAChC,wBAAwB,IAAI,MAAM,EAAE,EAAE;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC5E,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,MAAM,GAAG,MAAe,GAAG,IAAI,EAAE;IACpF,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAChC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAClD,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW;IAE3C,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI;IAUlC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAM3G,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,QAAQ;IAWvF,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,EAAE;IAM7F,QAAQ;;;;;;;;;;;;;;;;;;;;;;;IAsBd,iBAAiB,IAAI,MAAM,GAAG,IAAI;IAIlC,eAAe,IAAI,kBAAkB,GAAG;QACtC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QACvC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,cAAc,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC,CAAC;KACpG;IAkBD,qBAAqB,IAAI,OAAO;IAIhC,cAAc,IAAI,MAAM;IAExB,KAAK,IAAI,IAAI;CAKd;AAID,kEAAkE;AAClE,wBAAgB,wBAAwB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAQzE"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAG9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AAShD,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEhE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC;AACzC,OAAO,KAAK,EACV,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EACzE,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EACtD,MAAM,SAAS,CAAC;AACjB,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AAIvC,MAAM,CAAC,OAAO,OAAO,SAAS;IAC5B,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAgB;IACnC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAoB;IACjD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAoB;IAC7C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgB;IACxC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAiB;IAChD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAuB;IAC5C,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAc;IACnC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;IACzC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IAEpC,OAAO;WAgBM,IAAI,CACf,WAAW,EAAE,MAAM,EACnB,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,EACjC,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,KAAK,IAAI,GACrF,OAAO,CAAC,SAAS,CAAC;WAYR,IAAI,CACf,WAAW,EAAE,MAAM,EACnB,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,KAAK,IAAI,GACrF,OAAO,CAAC,SAAS,CAAC;IAarB,MAAM,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAMlD,WAAW,IAAI,IAAI;IACnB,SAAS,IAAI,IAAI;IACjB,UAAU,IAAI,IAAI;IAClB,OAAO,IAAI,OAAO;IAClB,aAAa,IAAI,OAAO;IAElB,WAAW,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAK/C;;;;OAIG;IACG,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC;IA8BtC,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,KAAK,IAAI,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAIzH,IAAI,CAAC,kBAAkB,CAAC,EAAE,MAAM,EAAE,GAAG;QAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,KAAK,IAAI,CAAA;KAAE,GAAG,OAAO,CAAC,UAAU,CAAC;IAY9H,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,QAAQ,GAAG,aAAa,EAAE,KAAK,SAAK,GAAG,YAAY,EAAE;IAMvF,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACvD,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACvD,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IACjE,WAAW,IAAI,IAAI,EAAE;IACrB,WAAW,IAAI,IAAI,EAAE;IACrB,YAAY,CAAC,KAAK,SAAK,GAAG,IAAI,EAAE;IAChC,wBAAwB,IAAI,MAAM,EAAE,EAAE;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC5E,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,MAAM,GAAG,MAAe,GAAG,IAAI,EAAE;IACpF,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAChC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAClD,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW;IAE3C,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI;IAUlC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAM3G,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,QAAQ;IAWvF,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,EAAE;IAMnG,YAAY,CAAC,KAAK,SAAK,GAAG,KAAK,CAAC,IAAI,GAAG;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAI/F,yBAAyB,CAAC,KAAK,SAAK,GAAG,KAAK,CAAC;QAAE,MAAM,EAAE,IAAI,CAAC;QAAC,MAAM,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAMzG,qBAAqB,IAAI,eAAe;IAMlC,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;IA2Bd,iBAAiB,IAAI,MAAM,GAAG,IAAI;IAIlC,eAAe,IAAI,kBAAkB,GAAG;QACtC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QACvC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,cAAc,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC,CAAC;KACpG;IAkBD,qBAAqB,IAAI,OAAO;IAIhC,cAAc,IAAI,MAAM;IAExB,WAAW,IAAI,aAAa;IAE5B,KAAK,IAAI,IAAI;CAKd;AAID,kEAAkE;AAClE,wBAAgB,wBAAwB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAQzE"}

package/dist/index.js

@@ -54,7 +54,7 @@ class KiroGraph {
     this.db = db;
     this.config = config;
     this.queryManager = new import_queries.GraphQueryManager(db);
-    this.resolver = new import_resolution.ReferenceResolver(db, config);
+    this.resolver = new import_resolution.ReferenceResolver(db, config, projectRoot);
     this.vectors = new import_vectors.VectorManager(db, config, projectRoot);
     this.contextBuilder = new import_context.ContextBuilder(db, this.resolver, this.vectors, projectRoot);
     this.arch = new import_architecture.ArchitectureAnalyzer(db, config, projectRoot);