kirograph 0.12.1

package/dist/graph/queries.d.ts

@@ -0,0 +1,53 @@
+/**
+ * KiroGraph Graph Query Manager
+ * High-level graph queries built on top of GraphTraverser and GraphDatabase.
+ */
+import type { Node, NodeContext, NodeMetrics, Subgraph } from '../types';
+import type { GraphDatabase } from '../db/database';
+import { type TraversalOptions } from './traversal';
+export declare class GraphQueryManager {
+    private readonly db;
+    private readonly traverser;
+    constructor(db: GraphDatabase);
+    /** Get full context for a node (node + ancestors + children + callers + callees). */
+    getContext(nodeId: string): Promise<NodeContext>;
+    /** Get all nodes that call the given node (depth=1, incoming 'calls' edges). */
+    getCallers(nodeId: string, limit?: number): Promise<Node[]>;
+    /** Get all nodes called by the given node (depth=1, outgoing 'calls' edges). */
+    getCallees(nodeId: string, limit?: number): Promise<Node[]>;
+    /** Get the full call graph rooted at nodeId up to the given depth. */
+    getCallGraph(nodeId: string, depth?: number): Promise<Subgraph>;
+    /**
+     * Get the type hierarchy for a node.
+     * direction: 'up' = base types, 'down' = derived types, 'both' = all.
+     */
+    getTypeHierarchy(nodeId: string, direction?: 'up' | 'down' | 'both'): Promise<Node[]>;
+    /** Get all nodes that would be impacted by changing nodeId (incoming edges). */
+    getImpactRadius(nodeId: string, depth?: number): Promise<Node[]>;
+    /** Find the shortest path between two nodes via BFS. */
+    findPath(fromId: string, toId: string, maxDepth?: number): Promise<Node[]>;
+    /** Get all ancestor containers of a node (incoming 'contains' edges). */
+    getAncestors(nodeId: string): Promise<Node[]>;
+    /** Get direct children of a node (outgoing 'contains' edges, depth=1). */
+    getChildren(nodeId: string): Promise<Node[]>;
+    /**
+     * Find test files that are transitively affected by changes to the given source files.
+     * BFS-traverses import/call dependents to discover which test files depend on changed code.
+     */
+    getAffectedTests(changedFiles: string[], opts?: {
+        depth?: number;
+        testPattern?: string;
+    }): string[];
+    /** Find all circular import dependencies. Returns arrays of file paths forming cycles. */
+    findCircularDependencies(): Promise<string[][]>;
+    /** Find nodes with no incoming edges (potential dead code). */
+    findDeadCode(limit?: number): Promise<Node[]>;
+    /** Get metrics for a node (edge counts, callers, callees, children). */
+    getNodeMetrics(nodeId: string): Promise<NodeMetrics>;
+    /**
+     * Build a subgraph from a set of node IDs, optionally traversing further
+     * with the given TraversalOptions.
+     */
+    getFilteredSubgraph(nodeIds: string[], opts?: TraversalOptions): Promise<Subgraph>;
+}
+//# sourceMappingURL=queries.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"queries.d.ts","sourceRoot":"","sources":["../../src/graph/queries.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACzE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAkB,KAAK,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpE,qBAAa,iBAAiB;IAGhB,OAAO,CAAC,QAAQ,CAAC,EAAE;IAF/B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAiB;gBAEd,EAAE,EAAE,aAAa;IAI9C,qFAAqF;IAC/E,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;IAUtD,gFAAgF;IAC1E,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IASjE,gFAAgF;IAC1E,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IASjE,sEAAsE;IAChE,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,QAAQ,CAAC;IAchE;;;OAGG;IACG,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,MAAM,GAAG,MAAe,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAYnG,gFAAgF;IAC1E,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAOjE,wDAAwD;IAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAgD5E,yEAAyE;IACnE,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAOnD,0EAA0E;IACpE,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAQlD;;;OAGG;IACH,gBAAgB,CACd,YAAY,EAAE,MAAM,EAAE,EACtB,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,GAC9C,MAAM,EAAE;IAqCX,0FAA0F;IACpF,wBAAwB,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAIrD,+DAA+D;IACzD,YAAY,CAAC,KAAK,SAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAI/C,wEAAwE;IAClE,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;IAI1D;;;OAGG;IACG,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,QAAQ,CAAC;CAyBzF"}

package/dist/graph/queries.js

@@ -0,0 +1,224 @@
+"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 queries_exports = {};
+__export(queries_exports, {
+  GraphQueryManager: () => GraphQueryManager
+});
+module.exports = __toCommonJS(queries_exports);
+var import_traversal = require("./traversal");
+class GraphQueryManager {
+  constructor(db) {
+    this.db = db;
+    this.traverser = new import_traversal.GraphTraverser(db);
+  }
+  /** Get full context for a node (node + ancestors + children + callers + callees). */
+  async getContext(nodeId) {
+    const ctx = this.db.getNodeContext(nodeId);
+    if (!ctx) {
+      const node = this.db.getNode(nodeId);
+      if (!node) throw new Error(`Node not found: ${nodeId}`);
+      return { node, ancestors: [], children: [], callers: [], callees: [] };
+    }
+    return ctx;
+  }
+  /** Get all nodes that call the given node (depth=1, incoming 'calls' edges). */
+  async getCallers(nodeId, limit) {
+    return this.traverser.traverseBFS(nodeId, {
+      direction: "incoming",
+      edgeKinds: ["calls"],
+      maxDepth: 1,
+      limit
+    });
+  }
+  /** Get all nodes called by the given node (depth=1, outgoing 'calls' edges). */
+  async getCallees(nodeId, limit) {
+    return this.traverser.traverseBFS(nodeId, {
+      direction: "outgoing",
+      edgeKinds: ["calls"],
+      maxDepth: 1,
+      limit
+    });
+  }
+  /** Get the full call graph rooted at nodeId up to the given depth. */
+  async getCallGraph(nodeId, depth = 3) {
+    const nodes = await this.traverser.traverseBFS(nodeId, {
+      direction: "outgoing",
+      edgeKinds: ["calls"],
+      maxDepth: depth,
+      includeStart: true
+    });
+    const nodeIds = nodes.map((n) => n.id);
+    const edges = this.db.getEdgesForNodes(nodeIds).filter(
+      (e) => nodeIds.includes(e.source) && nodeIds.includes(e.target) && e.kind === "calls"
+    );
+    return { nodes, edges, entryPoints: [nodeId] };
+  }
+  /**
+   * Get the type hierarchy for a node.
+   * direction: 'up' = base types, 'down' = derived types, 'both' = all.
+   */
+  async getTypeHierarchy(nodeId, direction = "both") {
+    const traversalDirection = direction === "up" ? "outgoing" : direction === "down" ? "incoming" : "both";
+    return this.traverser.traverseBFS(nodeId, {
+      direction: traversalDirection,
+      edgeKinds: ["extends", "implements"]
+    });
+  }
+  /** Get all nodes that would be impacted by changing nodeId (incoming edges). */
+  async getImpactRadius(nodeId, depth = 2) {
+    return this.traverser.traverseBFS(nodeId, {
+      direction: "incoming",
+      maxDepth: depth
+    });
+  }
+  /** Find the shortest path between two nodes via BFS. */
+  async findPath(fromId, toId, maxDepth = 10) {
+    if (fromId === toId) {
+      const node = this.db.getNode(fromId);
+      return node ? [node] : [];
+    }
+    const prev = /* @__PURE__ */ new Map();
+    const queue = [[fromId, 0]];
+    const visited = /* @__PURE__ */ new Set([fromId]);
+    let found = false;
+    outer: while (queue.length > 0) {
+      const [currentId, depth] = queue.shift();
+      if (depth >= maxDepth) continue;
+      const edges = this.db.getEdgesForNodes([currentId]);
+      for (const edge of edges) {
+        const neighborId = edge.source === currentId ? edge.target : edge.source;
+        if (!visited.has(neighborId)) {
+          visited.add(neighborId);
+          prev.set(neighborId, currentId);
+          if (neighborId === toId) {
+            found = true;
+            break outer;
+          }
+          queue.push([neighborId, depth + 1]);
+        }
+      }
+    }
+    if (!found) return [];
+    const pathIds = [];
+    let cur = toId;
+    while (cur !== void 0) {
+      pathIds.unshift(cur);
+      cur = prev.get(cur);
+    }
+    const result = [];
+    for (const id of pathIds) {
+      const node = this.db.getNode(id);
+      if (node) result.push(node);
+    }
+    return result;
+  }
+  /** Get all ancestor containers of a node (incoming 'contains' edges). */
+  async getAncestors(nodeId) {
+    return this.traverser.traverseBFS(nodeId, {
+      direction: "incoming",
+      edgeKinds: ["contains"]
+    });
+  }
+  /** Get direct children of a node (outgoing 'contains' edges, depth=1). */
+  async getChildren(nodeId) {
+    return this.traverser.traverseBFS(nodeId, {
+      direction: "outgoing",
+      edgeKinds: ["contains"],
+      maxDepth: 1
+    });
+  }
+  /**
+   * Find test files that are transitively affected by changes to the given source files.
+   * BFS-traverses import/call dependents to discover which test files depend on changed code.
+   */
+  getAffectedTests(changedFiles, opts) {
+    const picomatch = require("picomatch");
+    const depth = opts?.depth ?? 5;
+    const isTest = picomatch(
+      opts?.testPattern ?? "{**/*.spec.*,**/*.test.*,**/e2e/**,**/tests/**,**/__tests__/**}"
+    );
+    const results = /* @__PURE__ */ new Set();
+    for (const file of changedFiles) {
+      const rel = file.replace(/\\/g, "/").replace(/^\.\//, "");
+      if (isTest(rel)) {
+        results.add(rel);
+        continue;
+      }
+      const visited = /* @__PURE__ */ new Set([rel]);
+      let frontier = [rel];
+      for (let d = 0; d < depth; d++) {
+        if (frontier.length === 0) break;
+        const next = [];
+        for (const f of frontier) {
+          for (const dep of this.db.getDependentFiles(f)) {
+            if (!visited.has(dep)) {
+              visited.add(dep);
+              next.push(dep);
+              if (isTest(dep)) results.add(dep);
+            }
+          }
+        }
+        frontier = next;
+      }
+    }
+    return [...results].sort();
+  }
+  /** Find all circular import dependencies. Returns arrays of file paths forming cycles. */
+  async findCircularDependencies() {
+    return this.db.findCircularDependencies();
+  }
+  /** Find nodes with no incoming edges (potential dead code). */
+  async findDeadCode(limit = 50) {
+    return this.db.findDeadCode(limit);
+  }
+  /** Get metrics for a node (edge counts, callers, callees, children). */
+  async getNodeMetrics(nodeId) {
+    return this.db.getNodeMetrics(nodeId);
+  }
+  /**
+   * Build a subgraph from a set of node IDs, optionally traversing further
+   * with the given TraversalOptions.
+   */
+  async getFilteredSubgraph(nodeIds, opts) {
+    const allNodeIds = new Set(nodeIds);
+    if (opts) {
+      for (const startId of nodeIds) {
+        const traversed = await this.traverser.traverseBFS(startId, opts);
+        for (const node of traversed) {
+          allNodeIds.add(node.id);
+        }
+      }
+    }
+    const ids = [...allNodeIds];
+    const nodes = [];
+    for (const id of ids) {
+      const node = this.db.getNode(id);
+      if (node) nodes.push(node);
+    }
+    const edges = this.db.getEdgesForNodes(ids).filter(
+      (e) => allNodeIds.has(e.source) && allNodeIds.has(e.target)
+    );
+    return { nodes, edges, entryPoints: nodeIds };
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  GraphQueryManager
+});
+//# sourceMappingURL=queries.js.map

package/dist/graph/queries.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/graph/queries.ts"],
+  "sourcesContent": ["/**\n * KiroGraph Graph Query Manager\n * High-level graph queries built on top of GraphTraverser and GraphDatabase.\n */\n\nimport type { Node, NodeContext, NodeMetrics, Subgraph } from '../types';\nimport type { GraphDatabase } from '../db/database';\nimport { GraphTraverser, type TraversalOptions } from './traversal';\n\nexport class GraphQueryManager {\n  private readonly traverser: GraphTraverser;\n\n  constructor(private readonly db: GraphDatabase) {\n    this.traverser = new GraphTraverser(db);\n  }\n\n  /** Get full context for a node (node + ancestors + children + callers + callees). */\n  async getContext(nodeId: string): Promise<NodeContext> {\n    const ctx = this.db.getNodeContext(nodeId);\n    if (!ctx) {\n      const node = this.db.getNode(nodeId);\n      if (!node) throw new Error(`Node not found: ${nodeId}`);\n      return { node, ancestors: [], children: [], callers: [], callees: [] };\n    }\n    return ctx;\n  }\n\n  /** Get all nodes that call the given node (depth=1, incoming 'calls' edges). */\n  async getCallers(nodeId: string, limit?: number): Promise<Node[]> {\n    return this.traverser.traverseBFS(nodeId, {\n      direction: 'incoming',\n      edgeKinds: ['calls'],\n      maxDepth: 1,\n      limit,\n    });\n  }\n\n  /** Get all nodes called by the given node (depth=1, outgoing 'calls' edges). */\n  async getCallees(nodeId: string, limit?: number): Promise<Node[]> {\n    return this.traverser.traverseBFS(nodeId, {\n      direction: 'outgoing',\n      edgeKinds: ['calls'],\n      maxDepth: 1,\n      limit,\n    });\n  }\n\n  /** Get the full call graph rooted at nodeId up to the given depth. */\n  async getCallGraph(nodeId: string, depth = 3): Promise<Subgraph> {\n    const nodes = await this.traverser.traverseBFS(nodeId, {\n      direction: 'outgoing',\n      edgeKinds: ['calls'],\n      maxDepth: depth,\n      includeStart: true,\n    });\n    const nodeIds = nodes.map(n => n.id);\n    const edges = this.db.getEdgesForNodes(nodeIds).filter(\n      e => nodeIds.includes(e.source) && nodeIds.includes(e.target) && e.kind === 'calls'\n    );\n    return { nodes, edges, entryPoints: [nodeId] };\n  }\n\n  /**\n   * Get the type hierarchy for a node.\n   * direction: 'up' = base types, 'down' = derived types, 'both' = all.\n   */\n  async getTypeHierarchy(nodeId: string, direction: 'up' | 'down' | 'both' = 'both'): Promise<Node[]> {\n    const traversalDirection =\n      direction === 'up' ? 'outgoing' :\n      direction === 'down' ? 'incoming' :\n      'both';\n\n    return this.traverser.traverseBFS(nodeId, {\n      direction: traversalDirection,\n      edgeKinds: ['extends', 'implements'],\n    });\n  }\n\n  /** Get all nodes that would be impacted by changing nodeId (incoming edges). */\n  async getImpactRadius(nodeId: string, depth = 2): Promise<Node[]> {\n    return this.traverser.traverseBFS(nodeId, {\n      direction: 'incoming',\n      maxDepth: depth,\n    });\n  }\n\n  /** Find the shortest path between two nodes via BFS. */\n  async findPath(fromId: string, toId: string, maxDepth = 10): Promise<Node[]> {\n    if (fromId === toId) {\n      const node = this.db.getNode(fromId);\n      return node ? [node] : [];\n    }\n\n    const prev = new Map<string, string>();\n    const queue: Array<[string, number]> = [[fromId, 0]];\n    const visited = new Set<string>([fromId]);\n    let found = false;\n\n    outer: while (queue.length > 0) {\n      const [currentId, depth] = queue.shift()!;\n      if (depth >= maxDepth) continue;\n\n      const edges = this.db.getEdgesForNodes([currentId]);\n      for (const edge of edges) {\n        const neighborId = edge.source === currentId ? edge.target : edge.source;\n        if (!visited.has(neighborId)) {\n          visited.add(neighborId);\n          prev.set(neighborId, currentId);\n          if (neighborId === toId) {\n            found = true;\n            break outer;\n          }\n          queue.push([neighborId, depth + 1]);\n        }\n      }\n    }\n\n    if (!found) return [];\n\n    // Reconstruct path\n    const pathIds: string[] = [];\n    let cur: string | undefined = toId;\n    while (cur !== undefined) {\n      pathIds.unshift(cur);\n      cur = prev.get(cur);\n    }\n\n    const result: Node[] = [];\n    for (const id of pathIds) {\n      const node = this.db.getNode(id);\n      if (node) result.push(node);\n    }\n    return result;\n  }\n\n  /** Get all ancestor containers of a node (incoming 'contains' edges). */\n  async getAncestors(nodeId: string): Promise<Node[]> {\n    return this.traverser.traverseBFS(nodeId, {\n      direction: 'incoming',\n      edgeKinds: ['contains'],\n    });\n  }\n\n  /** Get direct children of a node (outgoing 'contains' edges, depth=1). */\n  async getChildren(nodeId: string): Promise<Node[]> {\n    return this.traverser.traverseBFS(nodeId, {\n      direction: 'outgoing',\n      edgeKinds: ['contains'],\n      maxDepth: 1,\n    });\n  }\n\n  /**\n   * Find test files that are transitively affected by changes to the given source files.\n   * BFS-traverses import/call dependents to discover which test files depend on changed code.\n   */\n  getAffectedTests(\n    changedFiles: string[],\n    opts?: { depth?: number; testPattern?: string },\n  ): string[] {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports\n    const picomatch = require('picomatch');\n    const depth = opts?.depth ?? 5;\n    const isTest = picomatch(\n      opts?.testPattern ?? '{**/*.spec.*,**/*.test.*,**/e2e/**,**/tests/**,**/__tests__/**}'\n    );\n\n    const results = new Set<string>();\n\n    for (const file of changedFiles) {\n      const rel = file.replace(/\\\\/g, '/').replace(/^\\.\\//, '');\n\n      if (isTest(rel)) { results.add(rel); continue; }\n\n      const visited = new Set<string>([rel]);\n      let frontier = [rel];\n\n      for (let d = 0; d < depth; d++) {\n        if (frontier.length === 0) break;\n        const next: string[] = [];\n        for (const f of frontier) {\n          for (const dep of this.db.getDependentFiles(f)) {\n            if (!visited.has(dep)) {\n              visited.add(dep);\n              next.push(dep);\n              if (isTest(dep)) results.add(dep);\n            }\n          }\n        }\n        frontier = next;\n      }\n    }\n\n    return [...results].sort();\n  }\n\n  /** Find all circular import dependencies. Returns arrays of file paths forming cycles. */\n  async findCircularDependencies(): Promise<string[][]> {\n    return this.db.findCircularDependencies();\n  }\n\n  /** Find nodes with no incoming edges (potential dead code). */\n  async findDeadCode(limit = 50): Promise<Node[]> {\n    return this.db.findDeadCode(limit);\n  }\n\n  /** Get metrics for a node (edge counts, callers, callees, children). */\n  async getNodeMetrics(nodeId: string): Promise<NodeMetrics> {\n    return this.db.getNodeMetrics(nodeId);\n  }\n\n  /**\n   * Build a subgraph from a set of node IDs, optionally traversing further\n   * with the given TraversalOptions.\n   */\n  async getFilteredSubgraph(nodeIds: string[], opts?: TraversalOptions): Promise<Subgraph> {\n    const allNodeIds = new Set<string>(nodeIds);\n\n    if (opts) {\n      for (const startId of nodeIds) {\n        const traversed = await this.traverser.traverseBFS(startId, opts);\n        for (const node of traversed) {\n          allNodeIds.add(node.id);\n        }\n      }\n    }\n\n    const ids = [...allNodeIds];\n    const nodes: Node[] = [];\n    for (const id of ids) {\n      const node = this.db.getNode(id);\n      if (node) nodes.push(node);\n    }\n\n    const edges = this.db.getEdgesForNodes(ids).filter(\n      e => allNodeIds.has(e.source) && allNodeIds.has(e.target)\n    );\n\n    return { nodes, edges, entryPoints: nodeIds };\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAOA,uBAAsD;AAE/C,MAAM,kBAAkB;AAAA,EAG7B,YAA6B,IAAmB;AAAnB;AAC3B,SAAK,YAAY,IAAI,gCAAe,EAAE;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,WAAW,QAAsC;AACrD,UAAM,MAAM,KAAK,GAAG,eAAe,MAAM;AACzC,QAAI,CAAC,KAAK;AACR,YAAM,OAAO,KAAK,GAAG,QAAQ,MAAM;AACnC,UAAI,CAAC,KAAM,OAAM,IAAI,MAAM,mBAAmB,MAAM,EAAE;AACtD,aAAO,EAAE,MAAM,WAAW,CAAC,GAAG,UAAU,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,EAAE;AAAA,IACvE;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,WAAW,QAAgB,OAAiC;AAChE,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,CAAC,OAAO;AAAA,MACnB,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,WAAW,QAAgB,OAAiC;AAChE,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,CAAC,OAAO;AAAA,MACnB,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,aAAa,QAAgB,QAAQ,GAAsB;AAC/D,UAAM,QAAQ,MAAM,KAAK,UAAU,YAAY,QAAQ;AAAA,MACrD,WAAW;AAAA,MACX,WAAW,CAAC,OAAO;AAAA,MACnB,UAAU;AAAA,MACV,cAAc;AAAA,IAChB,CAAC;AACD,UAAM,UAAU,MAAM,IAAI,OAAK,EAAE,EAAE;AACnC,UAAM,QAAQ,KAAK,GAAG,iBAAiB,OAAO,EAAE;AAAA,MAC9C,OAAK,QAAQ,SAAS,EAAE,MAAM,KAAK,QAAQ,SAAS,EAAE,MAAM,KAAK,EAAE,SAAS;AAAA,IAC9E;AACA,WAAO,EAAE,OAAO,OAAO,aAAa,CAAC,MAAM,EAAE;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAAiB,QAAgB,YAAoC,QAAyB;AAClG,UAAM,qBACJ,cAAc,OAAO,aACrB,cAAc,SAAS,aACvB;AAEF,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,CAAC,WAAW,YAAY;AAAA,IACrC,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,gBAAgB,QAAgB,QAAQ,GAAoB;AAChE,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,SAAS,QAAgB,MAAc,WAAW,IAAqB;AAC3E,QAAI,WAAW,MAAM;AACnB,YAAM,OAAO,KAAK,GAAG,QAAQ,MAAM;AACnC,aAAO,OAAO,CAAC,IAAI,IAAI,CAAC;AAAA,IAC1B;AAEA,UAAM,OAAO,oBAAI,IAAoB;AACrC,UAAM,QAAiC,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnD,UAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAI,QAAQ;AAEZ,UAAO,QAAO,MAAM,SAAS,GAAG;AAC9B,YAAM,CAAC,WAAW,KAAK,IAAI,MAAM,MAAM;AACvC,UAAI,SAAS,SAAU;AAEvB,YAAM,QAAQ,KAAK,GAAG,iBAAiB,CAAC,SAAS,CAAC;AAClD,iBAAW,QAAQ,OAAO;AACxB,cAAM,aAAa,KAAK,WAAW,YAAY,KAAK,SAAS,KAAK;AAClE,YAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,kBAAQ,IAAI,UAAU;AACtB,eAAK,IAAI,YAAY,SAAS;AAC9B,cAAI,eAAe,MAAM;AACvB,oBAAQ;AACR,kBAAM;AAAA,UACR;AACA,gBAAM,KAAK,CAAC,YAAY,QAAQ,CAAC,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,MAAO,QAAO,CAAC;AAGpB,UAAM,UAAoB,CAAC;AAC3B,QAAI,MAA0B;AAC9B,WAAO,QAAQ,QAAW;AACxB,cAAQ,QAAQ,GAAG;AACnB,YAAM,KAAK,IAAI,GAAG;AAAA,IACpB;AAEA,UAAM,SAAiB,CAAC;AACxB,eAAW,MAAM,SAAS;AACxB,YAAM,OAAO,KAAK,GAAG,QAAQ,EAAE;AAC/B,UAAI,KAAM,QAAO,KAAK,IAAI;AAAA,IAC5B;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,aAAa,QAAiC;AAClD,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,CAAC,UAAU;AAAA,IACxB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,YAAY,QAAiC;AACjD,WAAO,KAAK,UAAU,YAAY,QAAQ;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,CAAC,UAAU;AAAA,MACtB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBACE,cACA,MACU;AAEV,UAAM,YAAY,QAAQ,WAAW;AACrC,UAAM,QAAQ,MAAM,SAAS;AAC7B,UAAM,SAAS;AAAA,MACb,MAAM,eAAe;AAAA,IACvB;AAEA,UAAM,UAAU,oBAAI,IAAY;AAEhC,eAAW,QAAQ,cAAc;AAC/B,YAAM,MAAM,KAAK,QAAQ,OAAO,GAAG,EAAE,QAAQ,SAAS,EAAE;AAExD,UAAI,OAAO,GAAG,GAAG;AAAE,gBAAQ,IAAI,GAAG;AAAG;AAAA,MAAU;AAE/C,YAAM,UAAU,oBAAI,IAAY,CAAC,GAAG,CAAC;AACrC,UAAI,WAAW,CAAC,GAAG;AAEnB,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAI,SAAS,WAAW,EAAG;AAC3B,cAAM,OAAiB,CAAC;AACxB,mBAAW,KAAK,UAAU;AACxB,qBAAW,OAAO,KAAK,GAAG,kBAAkB,CAAC,GAAG;AAC9C,gBAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,sBAAQ,IAAI,GAAG;AACf,mBAAK,KAAK,GAAG;AACb,kBAAI,OAAO,GAAG,EAAG,SAAQ,IAAI,GAAG;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AACA,mBAAW;AAAA,MACb;AAAA,IACF;AAEA,WAAO,CAAC,GAAG,OAAO,EAAE,KAAK;AAAA,EAC3B;AAAA;AAAA,EAGA,MAAM,2BAAgD;AACpD,WAAO,KAAK,GAAG,yBAAyB;AAAA,EAC1C;AAAA;AAAA,EAGA,MAAM,aAAa,QAAQ,IAAqB;AAC9C,WAAO,KAAK,GAAG,aAAa,KAAK;AAAA,EACnC;AAAA;AAAA,EAGA,MAAM,eAAe,QAAsC;AACzD,WAAO,KAAK,GAAG,eAAe,MAAM;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,oBAAoB,SAAmB,MAA4C;AACvF,UAAM,aAAa,IAAI,IAAY,OAAO;AAE1C,QAAI,MAAM;AACR,iBAAW,WAAW,SAAS;AAC7B,cAAM,YAAY,MAAM,KAAK,UAAU,YAAY,SAAS,IAAI;AAChE,mBAAW,QAAQ,WAAW;AAC5B,qBAAW,IAAI,KAAK,EAAE;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,MAAM,CAAC,GAAG,UAAU;AAC1B,UAAM,QAAgB,CAAC;AACvB,eAAW,MAAM,KAAK;AACpB,YAAM,OAAO,KAAK,GAAG,QAAQ,EAAE;AAC/B,UAAI,KAAM,OAAM,KAAK,IAAI;AAAA,IAC3B;AAEA,UAAM,QAAQ,KAAK,GAAG,iBAAiB,GAAG,EAAE;AAAA,MAC1C,OAAK,WAAW,IAAI,EAAE,MAAM,KAAK,WAAW,IAAI,EAAE,MAAM;AAAA,IAC1D;AAEA,WAAO,EAAE,OAAO,OAAO,aAAa,QAAQ;AAAA,EAC9C;AACF;",
+  "names": []
+}

package/dist/graph/traversal.d.ts

@@ -0,0 +1,35 @@
+/**
+ * KiroGraph Graph Traversal Module
+ * Provides BFS and DFS traversal over the knowledge graph.
+ */
+import type { Node, EdgeKind, NodeKind } from '../types';
+import type { GraphDatabase } from '../db/database';
+export interface TraversalOptions {
+    maxDepth?: number;
+    edgeKinds?: EdgeKind[];
+    nodeKinds?: NodeKind[];
+    direction?: 'outgoing' | 'incoming' | 'both';
+    limit?: number;
+    includeStart?: boolean;
+}
+export declare class GraphTraverser {
+    private readonly db;
+    constructor(db: GraphDatabase);
+    /**
+     * Breadth-first traversal from startId.
+     * Visits all nodes at depth D before any node at depth D+1.
+     */
+    traverseBFS(startId: string, opts?: TraversalOptions): Promise<Node[]>;
+    /**
+     * Depth-first traversal from startId.
+     */
+    traverseDFS(startId: string, opts?: TraversalOptions): Promise<Node[]>;
+    /**
+     * Get neighbor node IDs from the database, filtered by direction and edge kinds.
+     */
+    private getNeighbors;
+    private getOutgoingEdges;
+    private getIncomingEdges;
+    private matchesNodeKinds;
+}
+//# sourceMappingURL=traversal.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../../src/graph/traversal.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACzD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,SAAS,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,qBAAa,cAAc;IACb,OAAO,CAAC,QAAQ,CAAC,EAAE;gBAAF,EAAE,EAAE,aAAa;IAE9C;;;OAGG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,GAAE,gBAAqB,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAoDhF;;OAEG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,GAAE,gBAAqB,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IA+ChF;;OAEG;IACH,OAAO,CAAC,YAAY;IAoBpB,OAAO,CAAC,gBAAgB;IASxB,OAAO,CAAC,gBAAgB;IAQxB,OAAO,CAAC,gBAAgB;CAIzB"}

package/dist/graph/traversal.js

@@ -0,0 +1,148 @@
+"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 traversal_exports = {};
+__export(traversal_exports, {
+  GraphTraverser: () => GraphTraverser
+});
+module.exports = __toCommonJS(traversal_exports);
+class GraphTraverser {
+  constructor(db) {
+    this.db = db;
+  }
+  /**
+   * Breadth-first traversal from startId.
+   * Visits all nodes at depth D before any node at depth D+1.
+   */
+  async traverseBFS(startId, opts = {}) {
+    const {
+      maxDepth = Infinity,
+      edgeKinds,
+      nodeKinds,
+      direction = "outgoing",
+      limit = Infinity,
+      includeStart = false
+    } = opts;
+    const visited = /* @__PURE__ */ new Set();
+    const result = [];
+    const queue = [[startId, 0]];
+    visited.add(startId);
+    while (queue.length > 0) {
+      const [currentId, depth] = queue.shift();
+      if (currentId === startId) {
+        if (includeStart) {
+          const node = this.db.getNode(currentId);
+          if (node && this.matchesNodeKinds(node, nodeKinds)) {
+            result.push(node);
+            if (result.length >= limit) break;
+          }
+        }
+      } else {
+        const node = this.db.getNode(currentId);
+        if (node && this.matchesNodeKinds(node, nodeKinds)) {
+          result.push(node);
+          if (result.length >= limit) break;
+        }
+      }
+      if (depth >= maxDepth) continue;
+      const neighbors = this.getNeighbors(currentId, direction, edgeKinds);
+      for (const neighborId of neighbors) {
+        if (!visited.has(neighborId)) {
+          visited.add(neighborId);
+          queue.push([neighborId, depth + 1]);
+        }
+      }
+    }
+    return result;
+  }
+  /**
+   * Depth-first traversal from startId.
+   */
+  async traverseDFS(startId, opts = {}) {
+    const {
+      maxDepth = Infinity,
+      edgeKinds,
+      nodeKinds,
+      direction = "outgoing",
+      limit = Infinity,
+      includeStart = false
+    } = opts;
+    const visited = /* @__PURE__ */ new Set();
+    const result = [];
+    const dfs = (currentId, depth) => {
+      if (result.length >= limit) return;
+      if (visited.has(currentId)) return;
+      visited.add(currentId);
+      if (currentId === startId) {
+        if (includeStart) {
+          const node = this.db.getNode(currentId);
+          if (node && this.matchesNodeKinds(node, nodeKinds)) {
+            result.push(node);
+          }
+        }
+      } else {
+        const node = this.db.getNode(currentId);
+        if (node && this.matchesNodeKinds(node, nodeKinds)) {
+          result.push(node);
+        }
+      }
+      if (depth >= maxDepth) return;
+      const neighbors = this.getNeighbors(currentId, direction, edgeKinds);
+      for (const neighborId of neighbors) {
+        if (!visited.has(neighborId)) {
+          dfs(neighborId, depth + 1);
+          if (result.length >= limit) return;
+        }
+      }
+    };
+    dfs(startId, 0);
+    return result;
+  }
+  /**
+   * Get neighbor node IDs from the database, filtered by direction and edge kinds.
+   */
+  getNeighbors(nodeId, direction, edgeKinds) {
+    const neighbors = [];
+    if (direction === "outgoing" || direction === "both") {
+      const edges = this.getOutgoingEdges(nodeId, edgeKinds);
+      for (const e of edges) neighbors.push(e.target);
+    }
+    if (direction === "incoming" || direction === "both") {
+      const edges = this.getIncomingEdges(nodeId, edgeKinds);
+      for (const e of edges) neighbors.push(e.target);
+    }
+    return neighbors;
+  }
+  getOutgoingEdges(nodeId, edgeKinds) {
+    const allEdges = this.db.getEdgesForNodes([nodeId]);
+    return allEdges.filter((e) => e.source === nodeId).filter((e) => !edgeKinds || edgeKinds.includes(e.kind)).map((e) => ({ target: e.target }));
+  }
+  getIncomingEdges(nodeId, edgeKinds) {
+    const allEdges = this.db.getEdgesForNodes([nodeId]);
+    return allEdges.filter((e) => e.target === nodeId).filter((e) => !edgeKinds || edgeKinds.includes(e.kind)).map((e) => ({ target: e.source }));
+  }
+  matchesNodeKinds(node, nodeKinds) {
+    if (!nodeKinds || nodeKinds.length === 0) return true;
+    return nodeKinds.includes(node.kind);
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  GraphTraverser
+});
+//# sourceMappingURL=traversal.js.map

package/dist/graph/traversal.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/graph/traversal.ts"],
+  "sourcesContent": ["/**\n * KiroGraph Graph Traversal Module\n * Provides BFS and DFS traversal over the knowledge graph.\n */\n\nimport type { Node, EdgeKind, NodeKind } from '../types';\nimport type { GraphDatabase } from '../db/database';\n\nexport interface TraversalOptions {\n  maxDepth?: number;\n  edgeKinds?: EdgeKind[];\n  nodeKinds?: NodeKind[];\n  direction?: 'outgoing' | 'incoming' | 'both';\n  limit?: number;\n  includeStart?: boolean;\n}\n\nexport class GraphTraverser {\n  constructor(private readonly db: GraphDatabase) {}\n\n  /**\n   * Breadth-first traversal from startId.\n   * Visits all nodes at depth D before any node at depth D+1.\n   */\n  async traverseBFS(startId: string, opts: TraversalOptions = {}): Promise<Node[]> {\n    const {\n      maxDepth = Infinity,\n      edgeKinds,\n      nodeKinds,\n      direction = 'outgoing',\n      limit = Infinity,\n      includeStart = false,\n    } = opts;\n\n    const visited = new Set<string>();\n    const result: Node[] = [];\n\n    // Queue entries: [nodeId, depth]\n    const queue: Array<[string, number]> = [[startId, 0]];\n    visited.add(startId);\n\n    while (queue.length > 0) {\n      const [currentId, depth] = queue.shift()!;\n\n      // Include the start node only if requested\n      if (currentId === startId) {\n        if (includeStart) {\n          const node = this.db.getNode(currentId);\n          if (node && this.matchesNodeKinds(node, nodeKinds)) {\n            result.push(node);\n            if (result.length >= limit) break;\n          }\n        }\n      } else {\n        const node = this.db.getNode(currentId);\n        if (node && this.matchesNodeKinds(node, nodeKinds)) {\n          result.push(node);\n          if (result.length >= limit) break;\n        }\n      }\n\n      if (depth >= maxDepth) continue;\n\n      // Get neighbors\n      const neighbors = this.getNeighbors(currentId, direction, edgeKinds);\n      for (const neighborId of neighbors) {\n        if (!visited.has(neighborId)) {\n          visited.add(neighborId);\n          queue.push([neighborId, depth + 1]);\n        }\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Depth-first traversal from startId.\n   */\n  async traverseDFS(startId: string, opts: TraversalOptions = {}): Promise<Node[]> {\n    const {\n      maxDepth = Infinity,\n      edgeKinds,\n      nodeKinds,\n      direction = 'outgoing',\n      limit = Infinity,\n      includeStart = false,\n    } = opts;\n\n    const visited = new Set<string>();\n    const result: Node[] = [];\n\n    const dfs = (currentId: string, depth: number): void => {\n      if (result.length >= limit) return;\n      if (visited.has(currentId)) return;\n      visited.add(currentId);\n\n      if (currentId === startId) {\n        if (includeStart) {\n          const node = this.db.getNode(currentId);\n          if (node && this.matchesNodeKinds(node, nodeKinds)) {\n            result.push(node);\n          }\n        }\n      } else {\n        const node = this.db.getNode(currentId);\n        if (node && this.matchesNodeKinds(node, nodeKinds)) {\n          result.push(node);\n        }\n      }\n\n      if (depth >= maxDepth) return;\n\n      const neighbors = this.getNeighbors(currentId, direction, edgeKinds);\n      for (const neighborId of neighbors) {\n        if (!visited.has(neighborId)) {\n          dfs(neighborId, depth + 1);\n          if (result.length >= limit) return;\n        }\n      }\n    };\n\n    dfs(startId, 0);\n    return result;\n  }\n\n  /**\n   * Get neighbor node IDs from the database, filtered by direction and edge kinds.\n   */\n  private getNeighbors(\n    nodeId: string,\n    direction: 'outgoing' | 'incoming' | 'both',\n    edgeKinds?: EdgeKind[]\n  ): string[] {\n    const neighbors: string[] = [];\n\n    if (direction === 'outgoing' || direction === 'both') {\n      const edges = this.getOutgoingEdges(nodeId, edgeKinds);\n      for (const e of edges) neighbors.push(e.target);\n    }\n\n    if (direction === 'incoming' || direction === 'both') {\n      const edges = this.getIncomingEdges(nodeId, edgeKinds);\n      for (const e of edges) neighbors.push(e.target);\n    }\n\n    return neighbors;\n  }\n\n  private getOutgoingEdges(nodeId: string, edgeKinds?: EdgeKind[]): Array<{ target: string }> {\n    // Use getEdgesForNodes and filter manually since db doesn't expose raw edge queries\n    const allEdges = this.db.getEdgesForNodes([nodeId]);\n    return allEdges\n      .filter(e => e.source === nodeId)\n      .filter(e => !edgeKinds || edgeKinds.includes(e.kind))\n      .map(e => ({ target: e.target }));\n  }\n\n  private getIncomingEdges(nodeId: string, edgeKinds?: EdgeKind[]): Array<{ target: string }> {\n    const allEdges = this.db.getEdgesForNodes([nodeId]);\n    return allEdges\n      .filter(e => e.target === nodeId)\n      .filter(e => !edgeKinds || edgeKinds.includes(e.kind))\n      .map(e => ({ target: e.source }));\n  }\n\n  private matchesNodeKinds(node: Node, nodeKinds?: NodeKind[]): boolean {\n    if (!nodeKinds || nodeKinds.length === 0) return true;\n    return nodeKinds.includes(node.kind);\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAiBO,MAAM,eAAe;AAAA,EAC1B,YAA6B,IAAmB;AAAnB;AAAA,EAAoB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMjD,MAAM,YAAY,SAAiB,OAAyB,CAAC,GAAoB;AAC/E,UAAM;AAAA,MACJ,WAAW;AAAA,MACX;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,eAAe;AAAA,IACjB,IAAI;AAEJ,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,SAAiB,CAAC;AAGxB,UAAM,QAAiC,CAAC,CAAC,SAAS,CAAC,CAAC;AACpD,YAAQ,IAAI,OAAO;AAEnB,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,CAAC,WAAW,KAAK,IAAI,MAAM,MAAM;AAGvC,UAAI,cAAc,SAAS;AACzB,YAAI,cAAc;AAChB,gBAAM,OAAO,KAAK,GAAG,QAAQ,SAAS;AACtC,cAAI,QAAQ,KAAK,iBAAiB,MAAM,SAAS,GAAG;AAClD,mBAAO,KAAK,IAAI;AAChB,gBAAI,OAAO,UAAU,MAAO;AAAA,UAC9B;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,OAAO,KAAK,GAAG,QAAQ,SAAS;AACtC,YAAI,QAAQ,KAAK,iBAAiB,MAAM,SAAS,GAAG;AAClD,iBAAO,KAAK,IAAI;AAChB,cAAI,OAAO,UAAU,MAAO;AAAA,QAC9B;AAAA,MACF;AAEA,UAAI,SAAS,SAAU;AAGvB,YAAM,YAAY,KAAK,aAAa,WAAW,WAAW,SAAS;AACnE,iBAAW,cAAc,WAAW;AAClC,YAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,kBAAQ,IAAI,UAAU;AACtB,gBAAM,KAAK,CAAC,YAAY,QAAQ,CAAC,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAY,SAAiB,OAAyB,CAAC,GAAoB;AAC/E,UAAM;AAAA,MACJ,WAAW;AAAA,MACX;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,eAAe;AAAA,IACjB,IAAI;AAEJ,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,SAAiB,CAAC;AAExB,UAAM,MAAM,CAAC,WAAmB,UAAwB;AACtD,UAAI,OAAO,UAAU,MAAO;AAC5B,UAAI,QAAQ,IAAI,SAAS,EAAG;AAC5B,cAAQ,IAAI,SAAS;AAErB,UAAI,cAAc,SAAS;AACzB,YAAI,cAAc;AAChB,gBAAM,OAAO,KAAK,GAAG,QAAQ,SAAS;AACtC,cAAI,QAAQ,KAAK,iBAAiB,MAAM,SAAS,GAAG;AAClD,mBAAO,KAAK,IAAI;AAAA,UAClB;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,OAAO,KAAK,GAAG,QAAQ,SAAS;AACtC,YAAI,QAAQ,KAAK,iBAAiB,MAAM,SAAS,GAAG;AAClD,iBAAO,KAAK,IAAI;AAAA,QAClB;AAAA,MACF;AAEA,UAAI,SAAS,SAAU;AAEvB,YAAM,YAAY,KAAK,aAAa,WAAW,WAAW,SAAS;AACnE,iBAAW,cAAc,WAAW;AAClC,YAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,cAAI,YAAY,QAAQ,CAAC;AACzB,cAAI,OAAO,UAAU,MAAO;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,SAAS,CAAC;AACd,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aACN,QACA,WACA,WACU;AACV,UAAM,YAAsB,CAAC;AAE7B,QAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,YAAM,QAAQ,KAAK,iBAAiB,QAAQ,SAAS;AACrD,iBAAW,KAAK,MAAO,WAAU,KAAK,EAAE,MAAM;AAAA,IAChD;AAEA,QAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,YAAM,QAAQ,KAAK,iBAAiB,QAAQ,SAAS;AACrD,iBAAW,KAAK,MAAO,WAAU,KAAK,EAAE,MAAM;AAAA,IAChD;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,iBAAiB,QAAgB,WAAmD;AAE1F,UAAM,WAAW,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC;AAClD,WAAO,SACJ,OAAO,OAAK,EAAE,WAAW,MAAM,EAC/B,OAAO,OAAK,CAAC,aAAa,UAAU,SAAS,EAAE,IAAI,CAAC,EACpD,IAAI,QAAM,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACpC;AAAA,EAEQ,iBAAiB,QAAgB,WAAmD;AAC1F,UAAM,WAAW,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC;AAClD,WAAO,SACJ,OAAO,OAAK,EAAE,WAAW,MAAM,EAC/B,OAAO,OAAK,CAAC,aAAa,UAAU,SAAS,EAAE,IAAI,CAAC,EACpD,IAAI,QAAM,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,EACpC;AAAA,EAEQ,iBAAiB,MAAY,WAAiC;AACpE,QAAI,CAAC,aAAa,UAAU,WAAW,EAAG,QAAO;AACjD,WAAO,UAAU,SAAS,KAAK,IAAI;AAAA,EACrC;AACF;",
+  "names": []
+}

package/dist/index.d.ts

@@ -0,0 +1,102 @@
+/**
+ * KiroGraph — Semantic code knowledge graph for Kiro
+ *
+ * Pure facade. Every method delegates to a focused sub-system.
+ * No business logic lives here.
+ */
+import type { KiroGraphConfig } from './config';
+import type { FileTreeNode, FileTree } from './core/file-tree';
+import type { Node, 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 {
+    private readonly db;
+    private readonly config;
+    private readonly projectRoot;
+    private readonly queryManager;
+    private readonly resolver;
+    private readonly vectors;
+    private readonly contextBuilder;
+    private readonly arch;
+    private readonly lock;
+    private readonly pipeline;
+    private readonly searcher;
+    private constructor();
+    static init(projectRoot: string, config?: Partial<KiroGraphConfig>): Promise<KiroGraph>;
+    static open(projectRoot: string): Promise<KiroGraph>;
+    static isInitialized(projectRoot: string): boolean;
+    unlockForce(): void;
+    markDirty(): void;
+    clearDirty(): void;
+    isDirty(): boolean;
+    syncIfDirty(): Promise<SyncResult | null>;
+    indexAll(opts?: {
+        onProgress?: (p: IndexProgress) => void;
+        force?: boolean;
+        signal?: AbortSignal;
+    }): Promise<IndexResult>;
+    sync(changedFiles?: string[]): 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[]>;
+    findDeadCode(limit?: number): Node[];
+    findCircularDependencies(): string[][];
+    findPath(fromId: string, toId: string, maxDepth?: number): Promise<Node[]>;
+    getTypeHierarchy(nodeId: string, direction?: 'up' | 'down' | 'both'): Node[];
+    getNode(id: string): Node | null;
+    getNodeContext(nodeId: string): NodeContext | null;
+    getNodeMetrics(nodeId: string): NodeMetrics;
+    getNodeSource(node: Node): string | null;
+    buildContext(task: string, opts?: {
+        maxNodes?: number;
+        includeCode?: boolean;
+    }): Promise<TaskContext>;
+    getFiles(opts?: {
+        filterPath?: string;
+        pattern?: string;
+        maxDepth?: number;
+    }): FileTree;
+    getAffectedTests(changedFiles: string[], opts?: {
+        depth?: number;
+        testPattern?: string;
+    }): string[];
+    getStats(): Promise<{
+        architectureStats?: {
+            packages: number;
+            layers: number;
+            packageDeps: number;
+        };
+        embeddingCount: number;
+        embeddableNodeCount: number;
+        embeddingsEnabled: boolean;
+        embeddingModel: string;
+        useVecIndex: boolean;
+        semanticEngine: "cosine" | "sqlite-vec" | "orama" | "pglite" | "lancedb" | "qdrant" | "typesense";
+        vecIndexCount: number;
+        engineFallback: string | null;
+        frameworks: string[];
+        architectureEnabled: boolean;
+        files: number;
+        nodes: number;
+        edges: number;
+        nodesByKind: Record<string, number>;
+        filesByLanguage: Record<string, number>;
+        dbSizeBytes: number;
+    }>;
+    getEngineFallback(): string | null;
+    getArchitecture(): ArchitectureResult & {
+        filePackages: Record<string, string[]>;
+        fileLayers: Record<string, Array<{
+            layerId: string;
+            confidence: number;
+            matchedPattern: string;
+        }>>;
+    };
+    isArchitectureEnabled(): boolean;
+    getProjectRoot(): string;
+    close(): void;
+}
+/** Walk up directories to find the nearest .kirograph/ folder. */
+export declare function findNearestKiroGraphRoot(startPath: string): string | null;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +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"}