@mohantn/gate-keeper 2.1.0

package/dist/graph/global-graph.js

@@ -0,0 +1,153 @@
+"use strict";
+/**
+ * Global graph — persistent cross-repo index stored at ~/.gate-keeper/global-graph.json.
+ *
+ * Merges per-repo graph JSONs into a single index. Detects shared library
+ * dependencies across repos and provides a cross-repo query interface.
+ *
+ * Storage format:
+ *   {
+ *     version: "1.0",
+ *     repos: [{ path, label, lastIndexedAt }],
+ *     nodes: [...merged nodes],
+ *     edges: [...merged edges],
+ *     crossRepoImports: [{ source, target, fromRepo, toRepo }],
+ *   }
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadGlobalGraph = loadGlobalGraph;
+exports.saveGlobalGraph = saveGlobalGraph;
+exports.indexRepo = indexRepo;
+exports.queryGlobalGraph = queryGlobalGraph;
+exports.getGlobalGraphPath = getGlobalGraphPath;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const graph_export_1 = require("./graph-export");
+const GK_DIR = path.join(process.env.HOME ?? '/tmp', '.gate-keeper');
+const GLOBAL_GRAPH_FILE = path.join(GK_DIR, 'global-graph.json');
+// ── Load / Save ────────────────────────────────────────────
+function loadGlobalGraph() {
+    try {
+        if (fs.existsSync(GLOBAL_GRAPH_FILE)) {
+            return JSON.parse(fs.readFileSync(GLOBAL_GRAPH_FILE, 'utf8'));
+        }
+    }
+    catch {
+        // Corrupt or missing — return fresh
+    }
+    return emptyGlobalGraph();
+}
+function saveGlobalGraph(data) {
+    fs.mkdirSync(GK_DIR, { recursive: true });
+    data.generatedAt = Date.now();
+    fs.writeFileSync(GLOBAL_GRAPH_FILE, JSON.stringify(data, null, 2), 'utf8');
+}
+function emptyGlobalGraph() {
+    return {
+        version: '1.0',
+        generatedAt: Date.now(),
+        repos: [],
+        nodes: [],
+        edges: [],
+        crossRepoImports: [],
+    };
+}
+// ── Index a repo's graph into the global index ────────────
+function indexRepo(repoPath, repoLabel, localNodes, localEdges) {
+    const global = loadGlobalGraph();
+    // Update or add the repo entry
+    const existingRepo = global.repos.find(r => r.path === repoPath);
+    if (existingRepo) {
+        existingRepo.lastIndexedAt = Date.now();
+        existingRepo.nodeCount = localNodes.length;
+    }
+    else {
+        global.repos.push({
+            path: repoPath, label: repoLabel,
+            lastIndexedAt: Date.now(), nodeCount: localNodes.length,
+        });
+    }
+    // Merge nodes (prefix IDs to avoid collision — e.g. "repo-id:actual-id")
+    const prefix = repoLabel.replace(/[^a-zA-Z0-9_-]/g, '_');
+    const prefixedNodes = localNodes.map(n => ({
+        ...n,
+        id: `${prefix}:${n.id}`,
+    }));
+    const prefixedEdges = localEdges.map(e => ({
+        source: `${prefix}:${e.source}`,
+        target: `${prefix}:${e.target}`,
+        type: e.type,
+    }));
+    // Union-merge with existing global; GNode/GEdge have optional fields so
+    // the narrower global types are structurally compatible with the expected shape.
+    const merged = (0, graph_export_1.mergeGraphs)({ nodes: global.nodes, edges: global.edges }, { nodes: prefixedNodes, edges: prefixedEdges });
+    global.nodes = merged.nodes;
+    global.edges = merged.edges;
+    global.generatedAt = Date.now();
+    saveGlobalGraph(global);
+    return { added: localNodes.length, conflicts: merged.conflicts.length };
+}
+// ── Query ──────────────────────────────────────────────────
+function queryGlobalGraph(query) {
+    const global = loadGlobalGraph();
+    const q = query.toLowerCase();
+    const results = [];
+    if (q.includes('repo') || q.includes('how many')) {
+        results.push(`Indexed ${global.repos.length} repos with ${global.nodes.length} total nodes and ${global.edges.length} edges.`);
+    }
+    if (q.includes('shared') || q.includes('cross')) {
+        results.push(global.crossRepoImports.length > 0
+            ? `${global.crossRepoImports.length} cross-repo import(s) detected.`
+            : 'No cross-repo imports tracked yet.');
+    }
+    if (q.includes('worst') || q.includes('low')) {
+        const sorted = [...global.nodes].sort((a, b) => a.rating - b.rating).slice(0, 5);
+        if (sorted.length > 0) {
+            results.push('Worst-rated nodes:', sorted.map(n => `  ${n.label} — ${n.rating}/10`).join('\n'));
+        }
+    }
+    return {
+        repos: global.repos,
+        nodeCount: global.nodes.length,
+        edgeCount: global.edges.length,
+        answer: results.length > 0 ? results.join('\n') : `No answer for "${query}". Try: repos, cross-repo, worst-rated.`,
+    };
+}
+/** Path to the global graph on disk */
+function getGlobalGraphPath() {
+    return GLOBAL_GRAPH_FILE;
+}
+//# sourceMappingURL=global-graph.js.map

package/dist/graph/global-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"global-graph.js","sourceRoot":"","sources":["../../src/graph/global-graph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BH,0CASC;AAED,0CAIC;AAeD,8BA8CC;AAID,4CAiCC;AAGD,gDAEC;AA/ID,uCAAyB;AACzB,2CAA6B;AAC7B,iDAA6C;AAE7C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,MAAM,EAAE,cAAc,CAAC,CAAC;AACrE,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;AAkBjE,8DAA8D;AAE9D,SAAgB,eAAe;IAC7B,IAAI,CAAC;QACH,IAAI,EAAE,CAAC,UAAU,CAAC,iBAAiB,CAAC,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAoB,CAAC;QACnF,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,oCAAoC;IACtC,CAAC;IACD,OAAO,gBAAgB,EAAE,CAAC;AAC5B,CAAC;AAED,SAAgB,eAAe,CAAC,IAAqB;IACnD,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC9B,EAAE,CAAC,aAAa,CAAC,iBAAiB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,gBAAgB;IACvB,OAAO;QACL,OAAO,EAAE,KAAK;QACd,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;QACvB,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,gBAAgB,EAAE,EAAE;KACrB,CAAC;AACJ,CAAC;AAED,6DAA6D;AAE7D,SAAgB,SAAS,CACvB,QAAgB,EAChB,SAAiB,EACjB,UAAwE,EACxE,UAA4E;IAE5E,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;IAEjC,+BAA+B;IAC/B,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACjE,IAAI,YAAY,EAAE,CAAC;QACjB,YAAY,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxC,YAAY,CAAC,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;IAC7C,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;YAChB,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS;YAChC,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,UAAU,CAAC,MAAM;SACxD,CAAC,CAAC;IACL,CAAC;IAED,yEAAyE;IACzE,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;IACzD,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzC,GAAG,CAAC;QACJ,EAAE,EAAE,GAAG,MAAM,IAAI,CAAC,CAAC,EAAE,EAAE;KACxB,CAAC,CAAC,CAAC;IACJ,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE;QAC/B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE;QAC/B,IAAI,EAAE,CAAC,CAAC,IAAI;KACb,CAAC,CAAC,CAAC;IAEJ,wEAAwE;IACxE,iFAAiF;IACjF,MAAM,MAAM,GAAG,IAAA,0BAAW,EACxB,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAC5C,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE,CAC/C,CAAC;IAEF,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC5B,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC5B,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEhC,eAAe,CAAC,MAAM,CAAC,CAAC;IAExB,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,8DAA8D;AAE9D,SAAgB,gBAAgB,CAC9B,KAAa;IAEb,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;IAEjC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QACjD,OAAO,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,KAAK,CAAC,MAAM,eAAe,MAAM,CAAC,KAAK,CAAC,MAAM,oBAAoB,MAAM,CAAC,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC;IACjI,CAAC;IAED,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChD,OAAO,CAAC,IAAI,CACV,MAAM,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAChC,CAAC,CAAC,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,iCAAiC;YACpE,CAAC,CAAC,oCAAoC,CACzC,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,oBAAoB,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClG,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC9B,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC9B,MAAM,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,kBAAkB,KAAK,yCAAyC;KACnH,CAAC;AACJ,CAAC;AAED,uCAAuC;AACvC,SAAgB,kBAAkB;IAChC,OAAO,iBAAiB,CAAC;AAC3B,CAAC"}

package/dist/graph/graph-algorithms.d.ts

@@ -0,0 +1,90 @@
+/**
+ * Pure graph traversal algorithms used by graph-aware MCP tools.
+ *
+ * All functions operate on adjacency maps built from GraphResponse data,
+ * keeping them free of I/O and daemon dependencies.
+ */
+export interface NodeData {
+    id: string;
+    rating: number;
+    linesOfCode?: number;
+}
+/** Build adjacency: source → [targets] */
+export declare function buildAdjacency(edges: ReadonlyArray<{
+    source: string;
+    target: string;
+}>): Map<string, string[]>;
+/** Build reverse adjacency: target → [sources] (who imports me) */
+export declare function buildReverseAdjacency(edges: ReadonlyArray<{
+    source: string;
+    target: string;
+}>): Map<string, string[]>;
+export interface ImpactEntry {
+    path: string;
+    depth: number;
+    severity: 'direct' | 'indirect';
+    rating: number;
+    fragile: boolean;
+}
+/**
+ * BFS over reverse adjacency (dependents) up to `maxDepth` hops.
+ * Returns entries ordered by depth then by rating asc (fragile first).
+ */
+export declare function getImpactSet(filePath: string, reverseAdj: Map<string, string[]>, ratingByNode: Map<string, number>, maxDepth: number, fragileThreshold: number): ImpactEntry[];
+export interface PathEntry {
+    path: string;
+    rating: number;
+}
+/**
+ * BFS shortest dependency path from source to target.
+ * Follows forward adjacency (import direction).
+ * Returns null if no path exists.
+ */
+export declare function tracePath(source: string, target: string, adj: Map<string, string[]>, ratingByNode: Map<string, number>): PathEntry[] | null;
+export interface CentralityEntry {
+    path: string;
+    inDegree: number;
+    outDegree: number;
+    totalDegree: number;
+    rating: number;
+    label: string;
+}
+/**
+ * Compute degree centrality for all nodes.
+ * Higher totalDegree = more connected = higher blast radius.
+ */
+export declare function computeCentrality(nodes: ReadonlyArray<{
+    id: string;
+    label: string;
+    rating: number;
+}>, edges: ReadonlyArray<{
+    source: string;
+    target: string;
+}>): CentralityEntry[];
+export interface BetweennessEntry {
+    path: string;
+    betweenness: number;
+    normalizedBetweenness: number;
+}
+/**
+ * Compute betweenness centrality using the Brandes algorithm.
+ * Betweenness(v) = Σ_{s≠v≠t} σ(s,t|v) / σ(s,t)
+ * where σ(s,t) = number of shortest paths from s to t, σ(s,t|v) = those passing through v.
+ *
+ * Time complexity: O(V·E).
+ * Normalised by (n-1)(n-2) for directed graphs, so values are in [0,1].
+ *
+ * Files that score high here are "bridge" nodes — removing them would most
+ * disrupt information flow across the codebase.
+ */
+export declare function computeBetweennessCentrality(nodes: ReadonlyArray<{
+    id: string;
+}>, edges: ReadonlyArray<{
+    source: string;
+    target: string;
+}>): BetweennessEntry[];
+/** Estimate token count for a raw text block (rough: 4 chars ≈ 1 token) */
+export declare function estimateTokens(text: string): number;
+/** Estimate tokens saved by not reading N source files */
+export declare function estimateSavings(filesNotRead: number, avgFileSizeTokens?: number): number;
+//# sourceMappingURL=graph-algorithms.d.ts.map

package/dist/graph/graph-algorithms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-algorithms.d.ts","sourceRoot":"","sources":["../../src/graph/graph-algorithms.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,0CAA0C;AAC1C,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAM9G;AAED,mEAAmE;AACnE,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,aAAa,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAMrH;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,GAAG,UAAU,CAAC;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACjC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EACjC,QAAQ,EAAE,MAAM,EAChB,gBAAgB,EAAE,MAAM,GACvB,WAAW,EAAE,CA2Bf;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAC1B,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,SAAS,EAAE,GAAG,IAAI,CAoBpB;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,EACnE,KAAK,EAAE,aAAa,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD,eAAe,EAAE,CAqBnB;AAID,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,4BAA4B,CAC1C,KAAK,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,EACpC,KAAK,EAAE,aAAa,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD,gBAAgB,EAAE,CAkDpB;AAED,2EAA2E;AAC3E,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED,0DAA0D;AAC1D,wBAAgB,eAAe,CAAC,YAAY,EAAE,MAAM,EAAE,iBAAiB,SAAO,GAAG,MAAM,CAEtF"}

package/dist/graph/graph-algorithms.js

@@ -0,0 +1,180 @@
+"use strict";
+/**
+ * Pure graph traversal algorithms used by graph-aware MCP tools.
+ *
+ * All functions operate on adjacency maps built from GraphResponse data,
+ * keeping them free of I/O and daemon dependencies.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildAdjacency = buildAdjacency;
+exports.buildReverseAdjacency = buildReverseAdjacency;
+exports.getImpactSet = getImpactSet;
+exports.tracePath = tracePath;
+exports.computeCentrality = computeCentrality;
+exports.computeBetweennessCentrality = computeBetweennessCentrality;
+exports.estimateTokens = estimateTokens;
+exports.estimateSavings = estimateSavings;
+/** Build adjacency: source → [targets] */
+function buildAdjacency(edges) {
+    const adj = new Map();
+    for (const e of edges) {
+        (adj.get(e.source) ?? adj.set(e.source, []).get(e.source)).push(e.target);
+    }
+    return adj;
+}
+/** Build reverse adjacency: target → [sources] (who imports me) */
+function buildReverseAdjacency(edges) {
+    const rev = new Map();
+    for (const e of edges) {
+        (rev.get(e.target) ?? rev.set(e.target, []).get(e.target)).push(e.source);
+    }
+    return rev;
+}
+/**
+ * BFS over reverse adjacency (dependents) up to `maxDepth` hops.
+ * Returns entries ordered by depth then by rating asc (fragile first).
+ */
+function getImpactSet(filePath, reverseAdj, ratingByNode, maxDepth, fragileThreshold) {
+    const visited = new Set();
+    const queue = [{ id: filePath, depth: 0 }];
+    const result = [];
+    while (queue.length > 0) {
+        const { id, depth } = queue.shift();
+        if (depth > maxDepth)
+            continue;
+        if (id !== filePath) {
+            const rating = ratingByNode.get(id) ?? 10;
+            result.push({
+                path: id,
+                depth,
+                severity: depth === 1 ? 'direct' : 'indirect',
+                rating,
+                fragile: rating < fragileThreshold,
+            });
+        }
+        for (const dependent of reverseAdj.get(id) ?? []) {
+            if (!visited.has(dependent) && dependent !== filePath) {
+                visited.add(dependent);
+                if (depth < maxDepth)
+                    queue.push({ id: dependent, depth: depth + 1 });
+            }
+        }
+    }
+    return result.sort((a, b) => a.depth - b.depth || a.rating - b.rating);
+}
+/**
+ * BFS shortest dependency path from source to target.
+ * Follows forward adjacency (import direction).
+ * Returns null if no path exists.
+ */
+function tracePath(source, target, adj, ratingByNode) {
+    if (source === target)
+        return [{ path: source, rating: ratingByNode.get(source) ?? 10 }];
+    const visited = new Set([source]);
+    const queue = [{ id: source, trail: [source] }];
+    while (queue.length > 0) {
+        const { id, trail } = queue.shift();
+        for (const next of adj.get(id) ?? []) {
+            if (visited.has(next))
+                continue;
+            const newTrail = [...trail, next];
+            if (next === target) {
+                return newTrail.map(p => ({ path: p, rating: ratingByNode.get(p) ?? 10 }));
+            }
+            visited.add(next);
+            queue.push({ id: next, trail: newTrail });
+        }
+    }
+    return null;
+}
+/**
+ * Compute degree centrality for all nodes.
+ * Higher totalDegree = more connected = higher blast radius.
+ */
+function computeCentrality(nodes, edges) {
+    const inDeg = new Map();
+    const outDeg = new Map();
+    for (const n of nodes) {
+        inDeg.set(n.id, 0);
+        outDeg.set(n.id, 0);
+    }
+    for (const e of edges) {
+        outDeg.set(e.source, (outDeg.get(e.source) ?? 0) + 1);
+        inDeg.set(e.target, (inDeg.get(e.target) ?? 0) + 1);
+    }
+    return nodes.map(n => ({
+        path: n.id,
+        label: n.label,
+        inDegree: inDeg.get(n.id) ?? 0,
+        outDegree: outDeg.get(n.id) ?? 0,
+        totalDegree: (inDeg.get(n.id) ?? 0) + (outDeg.get(n.id) ?? 0),
+        rating: n.rating,
+    })).sort((a, b) => b.totalDegree - a.totalDegree);
+}
+/**
+ * Compute betweenness centrality using the Brandes algorithm.
+ * Betweenness(v) = Σ_{s≠v≠t} σ(s,t|v) / σ(s,t)
+ * where σ(s,t) = number of shortest paths from s to t, σ(s,t|v) = those passing through v.
+ *
+ * Time complexity: O(V·E).
+ * Normalised by (n-1)(n-2) for directed graphs, so values are in [0,1].
+ *
+ * Files that score high here are "bridge" nodes — removing them would most
+ * disrupt information flow across the codebase.
+ */
+function computeBetweennessCentrality(nodes, edges) {
+    const adj = buildAdjacency(edges);
+    const nodeList = nodes.map(n => n.id);
+    const betweenness = new Map(nodeList.map(id => [id, 0]));
+    for (const s of nodeList) {
+        const stack = [];
+        const predecessors = new Map(nodeList.map(id => [id, []]));
+        const sigma = new Map(nodeList.map(id => [id, 0]));
+        sigma.set(s, 1);
+        const dist = new Map(nodeList.map(id => [id, -1]));
+        dist.set(s, 0);
+        const queue = [s];
+        let qi = 0;
+        while (qi < queue.length) {
+            const v = queue[qi++];
+            stack.push(v);
+            for (const w of adj.get(v) ?? []) {
+                if (dist.get(w) === -1) {
+                    queue.push(w);
+                    dist.set(w, dist.get(v) + 1);
+                }
+                if (dist.get(w) === dist.get(v) + 1) {
+                    sigma.set(w, sigma.get(w) + sigma.get(v));
+                    predecessors.get(w).push(v);
+                }
+            }
+        }
+        const delta = new Map(nodeList.map(id => [id, 0]));
+        while (stack.length > 0) {
+            const w = stack.pop();
+            for (const v of predecessors.get(w)) {
+                const coeff = (sigma.get(v) / sigma.get(w)) * (1 + delta.get(w));
+                delta.set(v, delta.get(v) + coeff);
+            }
+            if (w !== s) {
+                betweenness.set(w, betweenness.get(w) + delta.get(w));
+            }
+        }
+    }
+    const n = nodeList.length;
+    const norm = n > 2 ? (n - 1) * (n - 2) : 1;
+    return nodeList.map(id => ({
+        path: id,
+        betweenness: betweenness.get(id),
+        normalizedBetweenness: betweenness.get(id) / norm,
+    })).sort((a, b) => b.betweenness - a.betweenness);
+}
+/** Estimate token count for a raw text block (rough: 4 chars ≈ 1 token) */
+function estimateTokens(text) {
+    return Math.ceil(text.length / 4);
+}
+/** Estimate tokens saved by not reading N source files */
+function estimateSavings(filesNotRead, avgFileSizeTokens = 5000) {
+    return filesNotRead * avgFileSizeTokens;
+}
+//# sourceMappingURL=graph-algorithms.js.map

package/dist/graph/graph-algorithms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-algorithms.js","sourceRoot":"","sources":["../../src/graph/graph-algorithms.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AASH,wCAMC;AAGD,sDAMC;AAcD,oCAiCC;AAYD,8BAyBC;AAeD,8CAwBC;AAqBD,oEAqDC;AAGD,wCAEC;AAGD,0CAEC;AA/ND,0CAA0C;AAC1C,SAAgB,cAAc,CAAC,KAAwD;IACrF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mEAAmE;AACnE,SAAgB,qBAAqB,CAAC,KAAwD;IAC5F,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAUD;;;GAGG;AACH,SAAgB,YAAY,CAC1B,QAAgB,EAChB,UAAiC,EACjC,YAAiC,EACjC,QAAgB,EAChB,gBAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACjF,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACrC,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAC/B,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,EAAE;gBACR,KAAK;gBACL,QAAQ,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU;gBAC7C,MAAM;gBACN,OAAO,EAAE,MAAM,GAAG,gBAAgB;aACnC,CAAC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;gBACtD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACvB,IAAI,KAAK,GAAG,QAAQ;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACzE,CAAC;AAOD;;;;GAIG;AACH,SAAgB,SAAS,CACvB,MAAc,EACd,MAAc,EACd,GAA0B,EAC1B,YAAiC;IAEjC,IAAI,MAAM,KAAK,MAAM;QAAE,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEzF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAA2C,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAExF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;gBACpB,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7E,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAWD;;;GAGG;AACH,SAAgB,iBAAiB,CAC/B,KAAmE,EACnE,KAAwD;IAExD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrB,IAAI,EAAE,CAAC,CAAC,EAAE;QACV,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;QAC9B,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;QAChC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,EAAE,CAAC,CAAC,MAAM;KACjB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;AACpD,CAAC;AAUD;;;;;;;;;;GAUG;AACH,SAAgB,4BAA4B,CAC1C,KAAoC,EACpC,KAAwD;IAExD,MAAM,GAAG,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAiB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,CAAmB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAiB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEf,MAAM,KAAK,GAAa,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,EAAE,CAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;gBAChC,CAAC;gBACD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;oBACrC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;oBAC5C,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,CAAiB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBACpE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,OAAO,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,EAAE;QACR,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAE;QACjC,qBAAqB,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,IAAI;KACnD,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;AACpD,CAAC;AAED,2EAA2E;AAC3E,SAAgB,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,0DAA0D;AAC1D,SAAgB,eAAe,CAAC,YAAoB,EAAE,iBAAiB,GAAG,IAAI;IAC5E,OAAO,YAAY,GAAG,iBAAiB,CAAC;AAC1C,CAAC"}

package/dist/graph/graph-export.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Graph export engine — produces graphify-compatible JSON, GraphML, and Neo4j Cypher.
+ *
+ * All formats capture the full node+edge structure so external tools (graph
+ * databases, visualizers, other repos) can consume gate-keeper analysis.
+ */
+interface GNode {
+    id: string;
+    label: string;
+    rating: number;
+    metrics?: {
+        linesOfCode?: number;
+        cyclomaticComplexity?: number;
+        importCount?: number;
+    };
+    violations?: Array<{
+        type: string;
+        severity: string;
+        message: string;
+    }>;
+}
+interface GEdge {
+    source: string;
+    target: string;
+    type?: string;
+    strength?: number;
+}
+interface CycleInfo {
+    nodes: string[];
+}
+export type ExportFormat = 'json' | 'graphml' | 'neo4j' | 'svg';
+export interface ExportOptions {
+    format: ExportFormat;
+    repoRoot?: string;
+    overallRating?: number | null;
+}
+export declare function exportToJson(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>, cycles: ReadonlyArray<CycleInfo>, opts: ExportOptions): string;
+export declare function exportToGraphML(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>): string;
+export declare function exportToNeo4j(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>): string;
+/**
+ * Render the graph as SVG using a circular node layout.
+ * Nodes are placed evenly around a circle; edges are straight lines.
+ * Node colour encodes rating; node radius encodes in-degree.
+ */
+export declare function exportToSvg(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>, opts?: {
+    width?: number;
+    height?: number;
+}): string;
+export interface MergeResult {
+    nodes: GNode[];
+    edges: GEdge[];
+    conflicts: Array<{
+        id: string;
+        ratingA: number;
+        ratingB: number;
+        resolved: number;
+    }>;
+}
+export declare function mergeGraphs(graphA: {
+    nodes: GNode[];
+    edges: GEdge[];
+}, graphB: {
+    nodes: GNode[];
+    edges: GEdge[];
+}): MergeResult;
+export declare function exportGraph(nodes: ReadonlyArray<GNode>, edges: ReadonlyArray<GEdge>, cycles: ReadonlyArray<CycleInfo>, opts: ExportOptions): string;
+export {};
+//# sourceMappingURL=graph-export.d.ts.map

package/dist/graph/graph-export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-export.d.ts","sourceRoot":"","sources":["../../src/graph/graph-export.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAMH,UAAU,KAAK;IACb,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IACxF,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACzE;AAED,UAAU,KAAK;IAAG,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE;AACpF,UAAU,SAAS;IAAG,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE;AAEvC,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,GAAG,KAAK,CAAC;AAEhE,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,YAAY,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAID,wBAAgB,YAAY,CAC1B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,EAChC,IAAI,EAAE,aAAa,GAClB,MAAM,CA+CR;AAID,wBAAgB,eAAe,CAC7B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,GAC1B,MAAM,CAkCR;AAID,wBAAgB,aAAa,CAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,GAC1B,MAAM,CAgCR;AAID;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAC7C,MAAM,CA6GR;AAID,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,SAAS,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtF;AAED,wBAAgB,WAAW,CACzB,MAAM,EAAE;IAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAAC,KAAK,EAAE,KAAK,EAAE,CAAA;CAAE,EAC1C,MAAM,EAAE;IAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAAC,KAAK,EAAE,KAAK,EAAE,CAAA;CAAE,GACzC,WAAW,CA8Bb;AAID,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAC3B,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,EAChC,IAAI,EAAE,aAAa,GAClB,MAAM,CAOR"}