@monoes/graph 1.0.0

package/dist/src/analyze.d.ts

@@ -0,0 +1,23 @@
+import type Graph from 'graphology';
+import type { GodNode, SurpriseEdge, GraphAnalysis, GraphStats } from './types.js';
+/**
+ * Find the most connected nodes (god nodes) — core abstractions of the codebase.
+ * Sorted by total degree (in + out), descending.
+ */
+export declare function godNodes(graph: Graph, topN?: number): GodNode[];
+/**
+ * Find surprising cross-community connections.
+ * An edge is surprising when its endpoints belong to different communities.
+ * Scored by the product of their degrees — high degree on both sides = high surprise.
+ */
+export declare function surprisingConnections(graph: Graph, topN?: number): SurpriseEdge[];
+/**
+ * Compute high-level graph statistics.
+ */
+export declare function graphStats(graph: Graph, graphPath?: string): GraphStats;
+/**
+ * Build a complete GraphAnalysis object from an annotated graph.
+ * Assumes community detection has already been run (nodes have `community` attribute).
+ */
+export declare function buildAnalysis(graph: Graph, graphPath?: string): GraphAnalysis;
+//# sourceMappingURL=analyze.d.ts.map

package/dist/src/analyze.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze.d.ts","sourceRoot":"","sources":["../../src/analyze.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAc,MAAM,YAAY,CAAC;AAE/F;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,SAAK,GAAG,OAAO,EAAE,CAkB3D;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,SAAK,GAAG,YAAY,EAAE,CAuB7E;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,UAAU,CAsCvE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,aAAa,CAiB7E"}

package/dist/src/analyze.js

@@ -0,0 +1,105 @@
+/**
+ * Find the most connected nodes (god nodes) — core abstractions of the codebase.
+ * Sorted by total degree (in + out), descending.
+ */
+export function godNodes(graph, topN = 15) {
+    const nodes = [];
+    graph.forEachNode((id, attrs) => {
+        nodes.push({
+            id,
+            label: attrs.label || id,
+            degree: graph.degree(id),
+            community: attrs.community,
+            sourceFile: attrs.sourceFile || '',
+            neighbors: graph
+                .neighbors(id)
+                .slice(0, 8)
+                .map((n) => graph.getNodeAttribute(n, 'label') || n),
+        });
+    });
+    return nodes.sort((a, b) => b.degree - a.degree).slice(0, topN);
+}
+/**
+ * Find surprising cross-community connections.
+ * An edge is surprising when its endpoints belong to different communities.
+ * Scored by the product of their degrees — high degree on both sides = high surprise.
+ */
+export function surprisingConnections(graph, topN = 20) {
+    const surprises = [];
+    graph.forEachEdge((_, attrs, source, target) => {
+        const cu = graph.getNodeAttribute(source, 'community');
+        const cv = graph.getNodeAttribute(target, 'community');
+        if (cu !== undefined && cv !== undefined && cu !== cv) {
+            surprises.push({
+                from: graph.getNodeAttribute(source, 'label') || source,
+                fromCommunity: cu,
+                fromFile: graph.getNodeAttribute(source, 'sourceFile') || '',
+                to: graph.getNodeAttribute(target, 'label') || target,
+                toCommunity: cv,
+                toFile: graph.getNodeAttribute(target, 'sourceFile') || '',
+                relation: attrs.relation || '',
+                confidence: attrs.confidence ?? 'AMBIGUOUS',
+                score: graph.degree(source) * graph.degree(target),
+            });
+        }
+    });
+    return surprises.sort((a, b) => b.score - a.score).slice(0, topN);
+}
+/**
+ * Compute high-level graph statistics.
+ */
+export function graphStats(graph, graphPath) {
+    const confidence = {};
+    const relations = {};
+    const fileTypes = {};
+    const commSet = new Set();
+    graph.forEachEdge((_, attrs) => {
+        const c = attrs.confidence || 'UNKNOWN';
+        confidence[c] = (confidence[c] ?? 0) + 1;
+        const r = attrs.relation || 'unknown';
+        relations[r] = (relations[r] ?? 0) + 1;
+    });
+    graph.forEachNode((_, attrs) => {
+        const ft = attrs.fileType || 'unknown';
+        fileTypes[ft] = (fileTypes[ft] ?? 0) + 1;
+        const c = attrs.community;
+        if (c !== undefined)
+            commSet.add(c);
+    });
+    const topRelations = Object.fromEntries(Object.entries(relations)
+        .sort(([, a], [, b]) => b - a)
+        .slice(0, 10));
+    return {
+        nodes: graph.order,
+        edges: graph.size,
+        communities: commSet.size,
+        confidence: confidence,
+        fileTypes,
+        topRelations,
+        isDirected: graph.type === 'directed',
+        graphPath,
+    };
+}
+/**
+ * Build a complete GraphAnalysis object from an annotated graph.
+ * Assumes community detection has already been run (nodes have `community` attribute).
+ */
+export function buildAnalysis(graph, graphPath) {
+    // Reconstruct communities map from node attributes
+    const communities = {};
+    graph.forEachNode((id, attrs) => {
+        const c = attrs.community;
+        if (c !== undefined) {
+            if (!communities[c])
+                communities[c] = [];
+            communities[c].push(id);
+        }
+    });
+    return {
+        godNodes: godNodes(graph),
+        surprises: surprisingConnections(graph),
+        communities,
+        stats: graphStats(graph, graphPath),
+    };
+}
+//# sourceMappingURL=analyze.js.map

package/dist/src/analyze.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze.js","sourceRoot":"","sources":["../../src/analyze.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAY,EAAE,IAAI,GAAG,EAAE;IAC9C,MAAM,KAAK,GAAc,EAAE,CAAC;IAE5B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,KAAK,CAAC,IAAI,CAAC;YACT,EAAE;YACF,KAAK,EAAG,KAAK,CAAC,KAAgB,IAAI,EAAE;YACpC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,SAAS,EAAE,KAAK,CAAC,SAA+B;YAChD,UAAU,EAAG,KAAK,CAAC,UAAqB,IAAI,EAAE;YAC9C,SAAS,EAAE,KAAK;iBACb,SAAS,CAAC,EAAE,CAAC;iBACb,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,OAAO,CAAY,IAAI,CAAC,CAAC;SACnE,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAClE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAY,EAAE,IAAI,GAAG,EAAE;IAC3D,MAAM,SAAS,GAAmB,EAAE,CAAC;IAErC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAC7C,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAuB,CAAC;QAC7E,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAuB,CAAC;QAE7E,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACtD,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAY,IAAI,MAAM;gBACnE,aAAa,EAAE,EAAE;gBACjB,QAAQ,EAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,YAAY,CAAY,IAAI,EAAE;gBACxE,EAAE,EAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAY,IAAI,MAAM;gBACjE,WAAW,EAAE,EAAE;gBACf,MAAM,EAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,YAAY,CAAY,IAAI,EAAE;gBACtE,QAAQ,EAAG,KAAK,CAAC,QAAmB,IAAI,EAAE;gBAC1C,UAAU,EAAG,KAAK,CAAC,UAAyB,IAAI,WAAW;gBAC3D,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;aACnD,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACpE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,KAAY,EAAE,SAAkB;IACzD,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;QAC7B,MAAM,CAAC,GAAI,KAAK,CAAC,UAAqB,IAAI,SAAS,CAAC;QACpD,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEzC,MAAM,CAAC,GAAI,KAAK,CAAC,QAAmB,IAAI,SAAS,CAAC;QAClD,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;QAC7B,MAAM,EAAE,GAAI,KAAK,CAAC,QAAmB,IAAI,SAAS,CAAC;QACnD,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEzC,MAAM,CAAC,GAAG,KAAK,CAAC,SAA+B,CAAC;QAChD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CACrC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SAC7B,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAChB,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,KAAK,EAAE,KAAK,CAAC,IAAI;QACjB,WAAW,EAAE,OAAO,CAAC,IAAI;QACzB,UAAU,EAAE,UAAwC;QACpD,SAAS;QACT,YAAY;QACZ,UAAU,EAAE,KAAK,CAAC,IAAI,KAAK,UAAU;QACrC,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,SAAkB;IAC5D,mDAAmD;IACnD,MAAM,WAAW,GAA6B,EAAE,CAAC;IACjD,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,SAA+B,CAAC;QAChD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAAE,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACzC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;QACzB,SAAS,EAAE,qBAAqB,CAAC,KAAK,CAAC;QACvC,WAAW;QACX,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC;KACpC,CAAC;AACJ,CAAC"}

package/dist/src/build.d.ts

@@ -0,0 +1,8 @@
+import Graph from 'graphology';
+import type { ExtractionResult } from './types.js';
+/**
+ * Build a graphology Graph from extracted nodes and edges.
+ * Deduplicates nodes by id, merges parallel edges with higher weight.
+ */
+export declare function buildGraph(extraction: ExtractionResult): Graph;
+//# sourceMappingURL=build.d.ts.map

package/dist/src/build.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../src/build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,YAAY,CAAC;AAC/B,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEnD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,UAAU,EAAE,gBAAgB,GAAG,KAAK,CAsD9D"}

package/dist/src/build.js

@@ -0,0 +1,59 @@
+import Graph from 'graphology';
+/**
+ * Build a graphology Graph from extracted nodes and edges.
+ * Deduplicates nodes by id, merges parallel edges with higher weight.
+ */
+export function buildGraph(extraction) {
+    const graph = new Graph({ type: 'directed', multi: false });
+    // Add all nodes — merge attributes if already present (dedup by id)
+    for (const node of extraction.nodes) {
+        if (!graph.hasNode(node.id)) {
+            graph.addNode(node.id, { ...node });
+        }
+        else {
+            graph.mergeNodeAttributes(node.id, { ...node });
+        }
+    }
+    // Add edges — skip self-loops, auto-stub missing endpoints
+    for (const edge of extraction.edges) {
+        if (edge.source === edge.target)
+            continue;
+        // Create stub nodes for referenced endpoints not in the extraction
+        if (!graph.hasNode(edge.source)) {
+            graph.addNode(edge.source, {
+                id: edge.source,
+                label: edge.source,
+                fileType: 'unknown',
+                sourceFile: '',
+            });
+        }
+        if (!graph.hasNode(edge.target)) {
+            graph.addNode(edge.target, {
+                id: edge.target,
+                label: edge.target,
+                fileType: 'unknown',
+                sourceFile: '',
+            });
+        }
+        try {
+            graph.addEdge(edge.source, edge.target, {
+                relation: edge.relation,
+                confidence: edge.confidence,
+                confidenceScore: edge.confidenceScore,
+                weight: edge.weight ?? 1,
+                sourceFile: edge.sourceFile,
+                sourceLocation: edge.sourceLocation,
+            });
+        }
+        catch {
+            // Edge already exists — bump its weight
+            const existing = graph.edge(edge.source, edge.target);
+            if (existing) {
+                const prev = graph.getEdgeAttribute(existing, 'weight') ?? 1;
+                graph.setEdgeAttribute(existing, 'weight', prev + 1);
+            }
+        }
+    }
+    return graph;
+}
+//# sourceMappingURL=build.js.map

package/dist/src/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,YAAY,CAAC;AAG/B;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,UAA4B;IACrD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAE5D,oEAAoE;IACpE,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAAE,SAAS;QAE1C,mEAAmE;QACnE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE;gBACzB,EAAE,EAAE,IAAI,CAAC,MAAM;gBACf,KAAK,EAAE,IAAI,CAAC,MAAM;gBAClB,QAAQ,EAAE,SAAS;gBACnB,UAAU,EAAE,EAAE;aACf,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE;gBACzB,EAAE,EAAE,IAAI,CAAC,MAAM;gBACf,KAAK,EAAE,IAAI,CAAC,MAAM;gBAClB,QAAQ,EAAE,SAAS;gBACnB,UAAU,EAAE,EAAE;aACf,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC;YACH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;gBACtC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,eAAe,EAAE,IAAI,CAAC,eAAe;gBACrC,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;gBACxB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,cAAc,EAAE,IAAI,CAAC,cAAc;aACpC,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;YACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACtD,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,IAAI,GAAI,KAAK,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,CAAY,IAAI,CAAC,CAAC;gBACzE,KAAK,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/src/cache.d.ts

@@ -0,0 +1,10 @@
+import type { ExtractionResult } from './types.js';
+export declare class FileCache {
+    private cacheDir;
+    constructor(outputDir: string);
+    key(filePath: string, content: string): string;
+    get(key: string): ExtractionResult | null;
+    set(key: string, result: ExtractionResult): void;
+    has(key: string): boolean;
+}
+//# sourceMappingURL=cache.d.ts.map

package/dist/src/cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.d.ts","sourceRoot":"","sources":["../../src/cache.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEnD,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAS;gBAEb,SAAS,EAAE,MAAM;IAK7B,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM;IAM9C,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAUzC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,GAAG,IAAI;IAKhD,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;CAG1B"}

package/dist/src/cache.js

@@ -0,0 +1,34 @@
+import { createHash } from 'crypto';
+import { existsSync, readFileSync, writeFileSync, mkdirSync } from 'fs';
+import { join } from 'path';
+export class FileCache {
+    cacheDir;
+    constructor(outputDir) {
+        this.cacheDir = join(outputDir, 'cache');
+        mkdirSync(this.cacheDir, { recursive: true });
+    }
+    key(filePath, content) {
+        return createHash('sha256')
+            .update(filePath + content)
+            .digest('hex');
+    }
+    get(key) {
+        const p = join(this.cacheDir, `${key}.json`);
+        if (!existsSync(p))
+            return null;
+        try {
+            return JSON.parse(readFileSync(p, 'utf-8'));
+        }
+        catch {
+            return null;
+        }
+    }
+    set(key, result) {
+        const p = join(this.cacheDir, `${key}.json`);
+        writeFileSync(p, JSON.stringify(result), 'utf-8');
+    }
+    has(key) {
+        return existsSync(join(this.cacheDir, `${key}.json`));
+    }
+}
+//# sourceMappingURL=cache.js.map

package/dist/src/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AACxE,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAG5B,MAAM,OAAO,SAAS;IACZ,QAAQ,CAAS;IAEzB,YAAY,SAAiB;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACzC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,GAAG,CAAC,QAAgB,EAAE,OAAe;QACnC,OAAO,UAAU,CAAC,QAAQ,CAAC;aACxB,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC;aAC1B,MAAM,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,GAAW;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC;QAC7C,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAqB,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,MAAwB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC;QAC7C,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC;IACxD,CAAC;CACF"}

package/dist/src/cluster.d.ts

@@ -0,0 +1,8 @@
+import type Graph from 'graphology';
+/**
+ * Run Louvain community detection on the graph.
+ * Assigns the `community` attribute to each node in-place.
+ * Returns a map from communityId → list of nodeIds.
+ */
+export declare function detectCommunities(graph: Graph): Promise<Record<number, string[]>>;
+//# sourceMappingURL=cluster.d.ts.map

package/dist/src/cluster.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.d.ts","sourceRoot":"","sources":["../../src/cluster.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAEpC;;;;GAIG;AACH,wBAAsB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAqBvF"}

package/dist/src/cluster.js

@@ -0,0 +1,50 @@
+/**
+ * Run Louvain community detection on the graph.
+ * Assigns the `community` attribute to each node in-place.
+ * Returns a map from communityId → list of nodeIds.
+ */
+export async function detectCommunities(graph) {
+    try {
+        const { default: louvain } = await import('graphology-communities-louvain');
+        const assignment = louvain(graph);
+        // Write community id back onto each node
+        for (const [nodeId, communityId] of Object.entries(assignment)) {
+            graph.setNodeAttribute(nodeId, 'community', communityId);
+        }
+        // Build communityId → members map
+        const communities = {};
+        for (const [nodeId, communityId] of Object.entries(assignment)) {
+            if (!communities[communityId])
+                communities[communityId] = [];
+            communities[communityId].push(nodeId);
+        }
+        return communities;
+    }
+    catch {
+        // Louvain unavailable — fall back to directory-based clustering
+        return fallbackCluster(graph);
+    }
+}
+/**
+ * Fallback: group nodes by the directory portion of their sourceFile attribute.
+ * Deterministic and zero-dependency.
+ */
+function fallbackCluster(graph) {
+    const dirMap = new Map();
+    let nextId = 0;
+    const communities = {};
+    graph.forEachNode((id, attrs) => {
+        const file = attrs.sourceFile || '';
+        const parts = file.split('/');
+        const dir = parts.length > 1 ? parts.slice(0, -1).join('/') : 'root';
+        if (!dirMap.has(dir))
+            dirMap.set(dir, nextId++);
+        const cid = dirMap.get(dir);
+        graph.setNodeAttribute(id, 'community', cid);
+        if (!communities[cid])
+            communities[cid] = [];
+        communities[cid].push(id);
+    });
+    return communities;
+}
+//# sourceMappingURL=cluster.js.map

package/dist/src/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sourceRoot":"","sources":["../../src/cluster.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,KAAY;IAClD,IAAI,CAAC;QACH,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,MAAM,CAAC,gCAAgC,CAAC,CAAC;QAC5E,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAA2B,CAAC;QAE5D,yCAAyC;QACzC,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/D,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAC3D,CAAC;QAED,kCAAkC;QAClC,MAAM,WAAW,GAA6B,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;gBAAE,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;YAC7D,WAAW,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,gEAAgE;QAChE,OAAO,eAAe,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,KAAY;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,WAAW,GAA6B,EAAE,CAAC;IAEjD,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAI,KAAK,CAAC,UAAqB,IAAI,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAErE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAE7B,KAAK,CAAC,gBAAgB,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QAC7C,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/dist/src/detect.d.ts

@@ -0,0 +1,8 @@
+import type { BuildOptions, ClassifiedFile } from './types.js';
+/**
+ * Recursively collects and classifies all files under rootPath, applying
+ * exclusion rules for directories, file size limits, and optional language
+ * filtering from BuildOptions.
+ */
+export declare function collectFiles(rootPath: string, options?: BuildOptions): ClassifiedFile[];
+//# sourceMappingURL=detect.d.ts.map

package/dist/src/detect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.d.ts","sourceRoot":"","sources":["../../src/detect.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,cAAc,EAAY,MAAM,YAAY,CAAC;AAwCzE;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,YAAiB,GACzB,cAAc,EAAE,CAwElB"}

package/dist/src/detect.js

@@ -0,0 +1,108 @@
+import { readdirSync, statSync } from 'fs';
+import { join, extname, relative } from 'path';
+const DEFAULT_MAX_FILE_SIZE = 500 * 1024; // 500KB
+const EXCLUDED_DIRS = new Set([
+    'node_modules',
+    '.git',
+    'dist',
+    'build',
+    '.monobrain',
+    '__pycache__',
+    '.pytest_cache',
+    'target',
+    '.cache',
+]);
+// Maps file extension to [fileType, language]
+const EXTENSION_MAP = {
+    '.ts': ['code', 'typescript'],
+    '.tsx': ['code', 'typescript'],
+    '.js': ['code', 'javascript'],
+    '.jsx': ['code', 'javascript'],
+    '.py': ['code', 'python'],
+    '.go': ['code', 'go'],
+    '.rs': ['code', 'rust'],
+    '.java': ['code', 'java'],
+    '.c': ['code', 'c'],
+    '.cpp': ['code', 'cpp'],
+    '.h': ['code', 'c'],
+    '.cs': ['code', 'csharp'],
+    '.rb': ['code', 'ruby'],
+    '.php': ['code', 'php'],
+    '.swift': ['code', 'swift'],
+    '.kt': ['code', 'kotlin'],
+    '.scala': ['code', 'scala'],
+    '.md': ['document', 'markdown'],
+    '.txt': ['document', 'text'],
+    '.rst': ['document', 'rst'],
+};
+/**
+ * Recursively collects and classifies all files under rootPath, applying
+ * exclusion rules for directories, file size limits, and optional language
+ * filtering from BuildOptions.
+ */
+export function collectFiles(rootPath, options = {}) {
+    const maxFileSizeBytes = options.maxFileSizeBytes ?? DEFAULT_MAX_FILE_SIZE;
+    const codeOnly = options.codeOnly ?? false;
+    const languageFilter = options.languages ? new Set(options.languages) : null;
+    const excludePatterns = options.excludePatterns ?? [];
+    const results = [];
+    function walkDir(dirPath) {
+        let entries;
+        try {
+            entries = readdirSync(dirPath);
+        }
+        catch {
+            // Skip unreadable directories
+            return;
+        }
+        for (const entry of entries) {
+            const fullPath = join(dirPath, entry);
+            // Check against custom exclude patterns (matched against relative path)
+            const relPath = relative(rootPath, fullPath);
+            if (excludePatterns.some((pat) => relPath.includes(pat))) {
+                continue;
+            }
+            let stat;
+            try {
+                stat = statSync(fullPath);
+            }
+            catch {
+                continue;
+            }
+            if (stat.isDirectory()) {
+                // Skip excluded directory names
+                if (EXCLUDED_DIRS.has(entry))
+                    continue;
+                walkDir(fullPath);
+                continue;
+            }
+            if (!stat.isFile())
+                continue;
+            // Enforce file size limit
+            if (stat.size > maxFileSizeBytes)
+                continue;
+            const ext = extname(entry).toLowerCase();
+            const mapping = EXTENSION_MAP[ext];
+            if (!mapping) {
+                // Unknown extension — skip rather than emit 'unknown' noise
+                continue;
+            }
+            const [fileType, language] = mapping;
+            // Apply codeOnly filter
+            if (codeOnly && fileType !== 'code')
+                continue;
+            // Apply language filter
+            if (languageFilter && !languageFilter.has(language))
+                continue;
+            results.push({
+                path: fullPath,
+                fileType,
+                language,
+                sizeBytes: stat.size,
+            });
+        }
+    }
+    walkDir(rootPath);
+    return results;
+}
+//# sourceMappingURL=detect.js.map

package/dist/src/detect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.js","sourceRoot":"","sources":["../../src/detect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC;AAG/C,MAAM,qBAAqB,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,QAAQ;AAElD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC5B,cAAc;IACd,MAAM;IACN,MAAM;IACN,OAAO;IACP,YAAY;IACZ,aAAa;IACb,eAAe;IACf,QAAQ;IACR,QAAQ;CACT,CAAC,CAAC;AAEH,8CAA8C;AAC9C,MAAM,aAAa,GAAuC;IACxD,KAAK,EAAK,CAAC,MAAM,EAAE,YAAY,CAAC;IAChC,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IAChC,KAAK,EAAK,CAAC,MAAM,EAAE,YAAY,CAAC;IAChC,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IAChC,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC5B,KAAK,EAAK,CAAC,MAAM,EAAE,IAAI,CAAC;IACxB,KAAK,EAAK,CAAC,MAAM,EAAE,MAAM,CAAC;IAC1B,OAAO,EAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IACvB,MAAM,EAAI,CAAC,MAAM,EAAE,KAAK,CAAC;IACzB,IAAI,EAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IACvB,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC5B,KAAK,EAAK,CAAC,MAAM,EAAE,MAAM,CAAC;IAC1B,MAAM,EAAI,CAAC,MAAM,EAAE,KAAK,CAAC;IACzB,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC;IAC3B,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC5B,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC;IAC3B,KAAK,EAAK,CAAC,UAAU,EAAE,UAAU,CAAC;IAClC,MAAM,EAAI,CAAC,UAAU,EAAE,MAAM,CAAC;IAC9B,MAAM,EAAI,CAAC,UAAU,EAAE,KAAK,CAAC;CAC9B,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,UAAwB,EAAE;IAE1B,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,qBAAqB,CAAC;IAC3E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC;IAC3C,MAAM,cAAc,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7E,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,EAAE,CAAC;IAEtD,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,SAAS,OAAO,CAAC,OAAe;QAC9B,IAAI,OAAiB,CAAC;QACtB,IAAI,CAAC;YACH,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,8BAA8B;YAC9B,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAEtC,wEAAwE;YACxE,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACzD,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,gCAAgC;gBAChC,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACvC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;gBAAE,SAAS;YAE7B,0BAA0B;YAC1B,IAAI,IAAI,CAAC,IAAI,GAAG,gBAAgB;gBAAE,SAAS;YAE3C,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YAEnC,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,4DAA4D;gBAC5D,SAAS;YACX,CAAC;YAED,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,OAAO,CAAC;YAErC,wBAAwB;YACxB,IAAI,QAAQ,IAAI,QAAQ,KAAK,MAAM;gBAAE,SAAS;YAE9C,wBAAwB;YACxB,IAAI,cAAc,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAE9D,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,QAAQ;gBACR,QAAQ;gBACR,SAAS,EAAE,IAAI,CAAC,IAAI;aACrB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,CAAC,QAAQ,CAAC,CAAC;IAClB,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/src/export.d.ts

@@ -0,0 +1,21 @@
+import Graph from 'graphology';
+/**
+ * Serialize a graphology graph to disk as a JSON file.
+ * Creates the output directory if it does not exist.
+ * Returns the absolute path to the written file.
+ */
+export declare function saveGraph(graph: Graph, outputDir: string, projectPath: string): string;
+/**
+ * Deserialize a graph from a previously saved JSON file.
+ * Silently skips edges whose endpoints are missing from the node list.
+ */
+export declare function loadGraph(graphPath: string): Graph;
+/**
+ * Return true when a graph.json already exists in the given output directory.
+ */
+export declare function graphExists(outputDir: string): boolean;
+/**
+ * Return the canonical path to graph.json inside an output directory.
+ */
+export declare function getGraphPath(outputDir: string): string;
+//# sourceMappingURL=export.d.ts.map

package/dist/src/export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.d.ts","sourceRoot":"","sources":["../../src/export.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,MAAM,YAAY,CAAC;AAG/B;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAsBtF;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,KAAK,CAyBlD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtD"}

package/dist/src/export.js

@@ -0,0 +1,68 @@
+import { existsSync, readFileSync, writeFileSync, mkdirSync } from 'fs';
+import { join } from 'path';
+import Graph from 'graphology';
+/**
+ * Serialize a graphology graph to disk as a JSON file.
+ * Creates the output directory if it does not exist.
+ * Returns the absolute path to the written file.
+ */
+export function saveGraph(graph, outputDir, projectPath) {
+    mkdirSync(outputDir, { recursive: true });
+    const graphPath = join(outputDir, 'graph.json');
+    const nodes = [];
+    graph.forEachNode((id, attrs) => nodes.push({ id, ...attrs }));
+    const links = [];
+    graph.forEachEdge((_, attrs, source, target) => links.push({ source, target, ...attrs }));
+    const serialized = {
+        version: '1.0.0',
+        builtAt: new Date().toISOString(),
+        projectPath,
+        nodes,
+        links,
+        directed: graph.type === 'directed',
+        multigraph: graph.multi,
+    };
+    writeFileSync(graphPath, JSON.stringify(serialized, null, 2), 'utf-8');
+    return graphPath;
+}
+/**
+ * Deserialize a graph from a previously saved JSON file.
+ * Silently skips edges whose endpoints are missing from the node list.
+ */
+export function loadGraph(graphPath) {
+    const raw = readFileSync(graphPath, 'utf-8');
+    const data = JSON.parse(raw);
+    const graph = new Graph({
+        type: data.directed ? 'directed' : 'undirected',
+        multi: false,
+    });
+    for (const node of data.nodes) {
+        const { id, ...attrs } = node;
+        graph.addNode(id, attrs);
+    }
+    for (const link of data.links) {
+        const { source, target, ...attrs } = link;
+        if (!graph.hasNode(source) || !graph.hasNode(target))
+            continue;
+        try {
+            graph.addEdge(source, target, attrs);
+        }
+        catch {
+            // Duplicate edge — ignore
+        }
+    }
+    return graph;
+}
+/**
+ * Return true when a graph.json already exists in the given output directory.
+ */
+export function graphExists(outputDir) {
+    return existsSync(join(outputDir, 'graph.json'));
+}
+/**
+ * Return the canonical path to graph.json inside an output directory.
+ */
+export function getGraphPath(outputDir) {
+    return join(outputDir, 'graph.json');
+}
+//# sourceMappingURL=export.js.map

package/dist/src/export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.js","sourceRoot":"","sources":["../../src/export.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AACxE,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,KAAK,MAAM,YAAY,CAAC;AAG/B;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,KAAY,EAAE,SAAiB,EAAE,WAAmB;IAC5E,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAEhD,MAAM,KAAK,GAAoD,EAAE,CAAC;IAClE,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;IAE/D,MAAM,KAAK,GAAwE,EAAE,CAAC;IACtF,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;IAE1F,MAAM,UAAU,GAAoB;QAClC,OAAO,EAAE,OAAO;QAChB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,WAAW;QACX,KAAK;QACL,KAAK;QACL,QAAQ,EAAE,KAAK,CAAC,IAAI,KAAK,UAAU;QACnC,UAAU,EAAE,KAAK,CAAC,KAAK;KACxB,CAAC;IAEF,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAoB,CAAC;IAEhD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY;QAC/C,KAAK,EAAE,KAAK;KACb,CAAC,CAAC;IAEH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC;QAC9B,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,SAAS;QAC/D,IAAI,CAAC;YACH,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB;IAC3C,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB;IAC5C,OAAO,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AACvC,CAAC"}

package/dist/src/extract/index.d.ts

@@ -0,0 +1,20 @@
+import type { ClassifiedFile, ExtractionResult, BuildOptions } from '../types.js';
+/**
+ * Extract graph nodes and edges from all classified files.
+ *
+ * Reads each file, checks the on-disk cache keyed by SHA-256 content hash,
+ * dispatches to the appropriate language extractor, and merges all results
+ * into a single ExtractionResult (nodes deduplicated by id, edges by source+target+relation).
+ *
+ * @param files      - Classified files to process (from the classify layer)
+ * @param outputDir  - Directory used for cache storage (.monobrain/graph by default)
+ * @param options    - Build options (languages filter, maxFileSizeBytes, etc.)
+ */
+export declare function extractAll(files: ClassifiedFile[], outputDir: string, options?: BuildOptions): Promise<ExtractionResult>;
+export type { LanguageExtractor } from './types.js';
+export { typescriptExtractor } from './languages/typescript.js';
+export { pythonExtractor } from './languages/python.js';
+export { goExtractor } from './languages/go.js';
+export { rustExtractor } from './languages/rust.js';
+export { isTreeSitterAvailable, tryLoadParser, walk, parseFile, parseFileFromDisk } from './tree-sitter-runner.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/extract/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/extract/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,YAAY,EAAwB,MAAM,aAAa,CAAC;AA+ExG;;;;;;;;;;GAUG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,cAAc,EAAE,EACvB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,gBAAgB,CAAC,CAqF3B;AAGD,YAAY,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,IAAI,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC"}