@monoes/monomindcli 1.6.4 → 1.6.5

package/.claude/helpers/graphify-freshen.cjs

@@ -8,12 +8,21 @@ const projectDir = process.env.CLAUDE_PROJECT_DIR || process.cwd();
 const graphDir = path.join(projectDir, '.monomind', 'graph');
 const statsFile = path.join(graphDir, 'stats.json');
 
-// Locate @monomind/graph — check pnpm store first, then regular node_modules
+// Locate @monomind/graph — check local, global npm, bundled-graph, pnpm
 function findGraphPkg(base) {
   const candidates = [
     path.join(base, 'node_modules', '@monomind', 'graph', 'dist', 'src', 'index.js'),
     path.join(base, 'packages', '@monomind', 'cli', 'node_modules', '@monomind', 'graph', 'dist', 'src', 'index.js'),
+    path.join(base, 'packages', '@monomind', 'graph', 'dist', 'src', 'index.js'),
   ];
+  // Check global npm install paths (monomind umbrella ships bundled-graph)
+  try {
+    const globalRoot = require('child_process').execSync('npm root -g', { encoding: 'utf-8' }).trim();
+    candidates.push(
+      path.join(globalRoot, 'monomind', 'packages', '@monomind', 'cli', 'bundled-graph', 'dist', 'src', 'index.js'),
+      path.join(globalRoot, 'monomind', 'node_modules', '@monoes', 'monomindcli', 'bundled-graph', 'dist', 'src', 'index.js'),
+    );
+  } catch {}
   for (const c of candidates) {
     if (fs.existsSync(c)) return c;
   }

package/bundled-graph/dist/src/analyze.d.ts

@@ -0,0 +1,32 @@
+import type Graph from 'graphology';
+import type { GodNode, SurpriseEdge, GraphAnalysis, GraphStats, GraphQuestion, GraphDiff, SerializedGraph } 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.
+ * Base score is degree(source) * degree(target), boosted by confidence and file type factors.
+ */
+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;
+/**
+ * Generate clarifying questions about uncertain or structurally interesting graph patterns.
+ * Sorted by priority (high → medium → low), capped at 25 total.
+ */
+export declare function suggestQuestions(graph: Graph, communities?: Record<number, string[]>): GraphQuestion[];
+/**
+ * Compute the diff between two serialized graph snapshots.
+ */
+export declare function graphDiff(before: SerializedGraph, after: SerializedGraph): GraphDiff;
+//# sourceMappingURL=analyze.d.ts.map

package/bundled-graph/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,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE1I;;;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,CAuC7E;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,CAgB7E;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,aAAa,EAAE,CAgJtG;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,eAAe,GAAG,SAAS,CAmCpF"}

package/bundled-graph/dist/src/analyze.js

@@ -0,0 +1,297 @@
+/**
+ * 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.
+ * Base score is degree(source) * degree(target), boosted by confidence and file type factors.
+ */
+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) {
+            const confidence = attrs.confidence ?? 'AMBIGUOUS';
+            const confidenceScore = attrs.confidenceScore;
+            const sourceFileType = graph.getNodeAttribute(source, 'fileType');
+            const targetFileType = graph.getNodeAttribute(target, 'fileType');
+            let score = graph.degree(source) * graph.degree(target);
+            // Boost for AMBIGUOUS edges — more uncertain = more surprising
+            if (confidence === 'AMBIGUOUS')
+                score *= 1.5;
+            // Boost for cross-file-type connections
+            if (sourceFileType && targetFileType && sourceFileType !== targetFileType)
+                score *= 1.3;
+            // Boost for INFERRED edges based on confidence score
+            if (confidence === 'INFERRED')
+                score *= 1 + (confidenceScore ?? 0.5);
+            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,
+                score,
+            });
+        }
+    });
+    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) {
+    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),
+    };
+}
+/**
+ * Generate clarifying questions about uncertain or structurally interesting graph patterns.
+ * Sorted by priority (high → medium → low), capped at 25 total.
+ */
+export function suggestQuestions(graph, communities) {
+    const questions = [];
+    // Build communities map if not provided
+    const commMap = communities ?? {};
+    if (!communities) {
+        graph.forEachNode((id, attrs) => {
+            const c = attrs.community;
+            if (c !== undefined) {
+                if (!commMap[c])
+                    commMap[c] = [];
+                commMap[c].push(id);
+            }
+        });
+    }
+    // AMBIGUOUS_EDGE: cross-community edges with AMBIGUOUS confidence
+    graph.forEachEdge((_, attrs, source, target) => {
+        if (attrs.confidence !== 'AMBIGUOUS')
+            return;
+        const cu = graph.getNodeAttribute(source, 'community');
+        const cv = graph.getNodeAttribute(target, 'community');
+        if (cu === undefined || cv === undefined || cu === cv)
+            return;
+        const from = graph.getNodeAttribute(source, 'label') || source;
+        const to = graph.getNodeAttribute(target, 'label') || target;
+        questions.push({
+            type: 'AMBIGUOUS_EDGE',
+            question: `What is the exact relationship between ${from} and ${to}? The edge is marked AMBIGUOUS.`,
+            nodes: [source, target],
+            priority: 'high',
+        });
+    });
+    // BRIDGE_NODE: nodes with neighbors in ≥3 different communities (simple heuristic)
+    const bridgeCandidates = [];
+    graph.forEachNode((id, attrs) => {
+        const neighborComms = new Set();
+        graph.neighbors(id).forEach((n) => {
+            const c = graph.getNodeAttribute(n, 'community');
+            if (c !== undefined)
+                neighborComms.add(c);
+        });
+        if (neighborComms.size >= 3) {
+            bridgeCandidates.push({
+                id,
+                label: attrs.label || id,
+                comms: Array.from(neighborComms),
+            });
+        }
+    });
+    bridgeCandidates
+        .sort((a, b) => b.comms.length - a.comms.length)
+        .slice(0, 5)
+        .forEach(({ id, label, comms }) => {
+        questions.push({
+            type: 'BRIDGE_NODE',
+            question: `Is ${label} intentionally a bridge between communities [${comms.join(', ')}]? Should it be split?`,
+            nodes: [id],
+            priority: 'high',
+        });
+    });
+    // INFERRED_GOD_NODE: top 5 high-degree nodes where >50% of edges are INFERRED
+    const inferredGodNodes = [];
+    graph.forEachNode((id, attrs) => {
+        const edges = graph.edges(id);
+        if (edges.length === 0)
+            return;
+        const inferredCount = edges.filter((e) => graph.getEdgeAttribute(e, 'confidence') === 'INFERRED').length;
+        if (inferredCount / edges.length > 0.5) {
+            inferredGodNodes.push({
+                id,
+                label: attrs.label || id,
+                degree: graph.degree(id),
+            });
+        }
+    });
+    inferredGodNodes
+        .sort((a, b) => b.degree - a.degree)
+        .slice(0, 5)
+        .forEach(({ id, label }) => {
+        questions.push({
+            type: 'INFERRED_GOD_NODE',
+            question: `Verify the connections of ${label}: most edges are inferred, not extracted.`,
+            nodes: [id],
+            priority: 'medium',
+        });
+    });
+    // LOW_COHESION_COMMUNITY: communities where >70% of edges are cross-community
+    const commIds = Object.keys(commMap).map(Number);
+    const lowCohesion = [];
+    for (const commId of commIds) {
+        const members = new Set(commMap[commId] ?? []);
+        if (members.size === 0)
+            continue;
+        let total = 0;
+        let crossEdges = 0;
+        members.forEach((nodeId) => {
+            graph.edges(nodeId).forEach((e) => {
+                total++;
+                const src = graph.source(e);
+                const tgt = graph.target(e);
+                const otherNode = src === nodeId ? tgt : src;
+                if (!members.has(otherNode))
+                    crossEdges++;
+            });
+        });
+        // Each edge is counted twice (once per endpoint), halve the totals
+        total = Math.ceil(total / 2);
+        crossEdges = Math.ceil(crossEdges / 2);
+        if (total > 0 && crossEdges / total > 0.7) {
+            lowCohesion.push({ id: commId, ratio: crossEdges / total });
+        }
+    }
+    lowCohesion
+        .sort((a, b) => b.ratio - a.ratio)
+        .slice(0, 3)
+        .forEach(({ id }) => {
+        questions.push({
+            type: 'LOW_COHESION_COMMUNITY',
+            question: `Community ${id} has low cohesion. Should it be split or reorganized?`,
+            nodes: commMap[id] ?? [],
+            priority: 'medium',
+        });
+    });
+    // ISOLATED_NODE: degree 0
+    let isolatedCount = 0;
+    graph.forEachNode((id, attrs) => {
+        if (isolatedCount >= 10)
+            return;
+        if (graph.degree(id) === 0) {
+            const label = attrs.label || id;
+            questions.push({
+                type: 'ISOLATED_NODE',
+                question: `Why is ${label} isolated (no connections)? It may need imports/references added.`,
+                nodes: [id],
+                priority: 'low',
+            });
+            isolatedCount++;
+        }
+    });
+    // Sort by priority: high → medium → low
+    const priorityOrder = { high: 0, medium: 1, low: 2 };
+    questions.sort((a, b) => priorityOrder[a.priority] - priorityOrder[b.priority]);
+    return questions.slice(0, 25);
+}
+/**
+ * Compute the diff between two serialized graph snapshots.
+ */
+export function graphDiff(before, after) {
+    const beforeNodeIds = new Set(before.nodes.map((n) => n.id));
+    const afterNodeIds = new Set(after.nodes.map((n) => n.id));
+    const addedNodes = after.nodes.filter((n) => !beforeNodeIds.has(n.id)).map((n) => n.id);
+    const removedNodes = before.nodes.filter((n) => !afterNodeIds.has(n.id)).map((n) => n.id);
+    const edgeKey = (e) => `${String(e.source)}|${String(e.target)}|${String(e['relation'] ?? '')}`;
+    const beforeEdgeKeys = new Set(before.links.map(edgeKey));
+    const afterEdgeKeys = new Set(after.links.map(edgeKey));
+    const addedEdges = after.links
+        .filter((e) => !beforeEdgeKeys.has(edgeKey(e)))
+        .map((e) => ({ source: String(e.source), target: String(e.target), relation: String(e['relation'] ?? '') }));
+    const removedEdges = before.links
+        .filter((e) => !afterEdgeKeys.has(edgeKey(e)))
+        .map((e) => ({ source: String(e.source), target: String(e.target), relation: String(e['relation'] ?? '') }));
+    // Community changes: nodes present in both snapshots with a changed community attribute
+    const beforeNodeMap = new Map(before.nodes.map((n) => [n.id, n]));
+    const communityChanges = [];
+    for (const afterNode of after.nodes) {
+        const beforeNode = beforeNodeMap.get(afterNode.id);
+        if (!beforeNode)
+            continue;
+        const oldCommunity = beforeNode['community'];
+        const newCommunity = afterNode['community'];
+        if (oldCommunity !== undefined && newCommunity !== undefined && oldCommunity !== newCommunity) {
+            communityChanges.push({ node: afterNode.id, oldCommunity, newCommunity });
+        }
+    }
+    return { addedNodes, removedNodes, addedEdges, removedEdges, communityChanges };
+}
+//# sourceMappingURL=analyze.js.map

package/bundled-graph/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,MAAM,UAAU,GAAI,KAAK,CAAC,UAAyB,IAAI,WAAW,CAAC;YACnE,MAAM,eAAe,GAAG,KAAK,CAAC,eAAqC,CAAC;YACpE,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAuB,CAAC;YACxF,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAuB,CAAC;YAExF,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAExD,+DAA+D;YAC/D,IAAI,UAAU,KAAK,WAAW;gBAAE,KAAK,IAAI,GAAG,CAAC;YAE7C,wCAAwC;YACxC,IAAI,cAAc,IAAI,cAAc,IAAI,cAAc,KAAK,cAAc;gBAAE,KAAK,IAAI,GAAG,CAAC;YAExF,qDAAqD;YACrD,IAAI,UAAU,KAAK,UAAU;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,eAAe,IAAI,GAAG,CAAC,CAAC;YAErE,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;gBACV,KAAK;aACN,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,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;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY,EAAE,WAAsC;IACnF,MAAM,SAAS,GAAoB,EAAE,CAAC;IAEtC,wCAAwC;IACxC,MAAM,OAAO,GAA6B,WAAW,IAAI,EAAE,CAAC;IAC5D,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,SAA+B,CAAC;YAChD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACjC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,kEAAkE;IAClE,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAC7C,IAAK,KAAK,CAAC,UAAqB,KAAK,WAAW;YAAE,OAAO;QACzD,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;QAC7E,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QAC9D,MAAM,IAAI,GAAI,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAY,IAAI,MAAM,CAAC;QAC3E,MAAM,EAAE,GAAI,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAY,IAAI,MAAM,CAAC;QACzE,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,gBAAgB;YACtB,QAAQ,EAAE,0CAA0C,IAAI,QAAQ,EAAE,iCAAiC;YACnG,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;YACvB,QAAQ,EAAE,MAAM;SACjB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,mFAAmF;IACnF,MAAM,gBAAgB,GAA0D,EAAE,CAAC;IACnF,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAuB,CAAC;YACvE,IAAI,CAAC,KAAK,SAAS;gBAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,IAAI,aAAa,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YAC5B,gBAAgB,CAAC,IAAI,CAAC;gBACpB,EAAE;gBACF,KAAK,EAAG,KAAK,CAAC,KAAgB,IAAI,EAAE;gBACpC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;aACjC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IACH,gBAAgB;SACb,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;SAC/C,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE;QAChC,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,aAAa;YACnB,QAAQ,EAAE,MAAM,KAAK,gDAAgD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB;YAC7G,KAAK,EAAE,CAAC,EAAE,CAAC;YACX,QAAQ,EAAE,MAAM;SACjB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEL,8EAA8E;IAC9E,MAAM,gBAAgB,GAAyD,EAAE,CAAC;IAClF,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,UAAU,CAC9D,CAAC,MAAM,CAAC;QACT,IAAI,aAAa,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACvC,gBAAgB,CAAC,IAAI,CAAC;gBACpB,EAAE;gBACF,KAAK,EAAG,KAAK,CAAC,KAAgB,IAAI,EAAE;gBACpC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IACH,gBAAgB;SACb,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;SACnC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE;QACzB,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,mBAAmB;YACzB,QAAQ,EAAE,6BAA6B,KAAK,2CAA2C;YACvF,KAAK,EAAE,CAAC,EAAE,CAAC;YACX,QAAQ,EAAE,QAAQ;SACnB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEL,8EAA8E;IAC9E,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjD,MAAM,WAAW,GAAyC,EAAE,CAAC;IAC7D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACjC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YACzB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;gBAChC,KAAK,EAAE,CAAC;gBACR,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,SAAS,GAAG,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,UAAU,EAAE,CAAC;YAC5C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,mEAAmE;QACnE,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC7B,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,IAAI,UAAU,GAAG,KAAK,GAAG,GAAG,EAAE,CAAC;YAC1C,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,KAAK,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,WAAW;SACR,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QAClB,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,wBAAwB;YAC9B,QAAQ,EAAE,aAAa,EAAE,uDAAuD;YAChF,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE;YACxB,QAAQ,EAAE,QAAQ;SACnB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEL,0BAA0B;IAC1B,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,IAAI,aAAa,IAAI,EAAE;YAAE,OAAO;QAChC,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAI,KAAK,CAAC,KAAgB,IAAI,EAAE,CAAC;YAC5C,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,eAAe;gBACrB,QAAQ,EAAE,UAAU,KAAK,mEAAmE;gBAC5F,KAAK,EAAE,CAAC,EAAE,CAAC;gBACX,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;YACH,aAAa,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,wCAAwC;IACxC,MAAM,aAAa,GAA2B,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAC7E,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEhF,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,MAAuB,EAAE,KAAsB;IACvE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3D,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxF,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE1F,MAAM,OAAO,GAAG,CAAC,CAA+D,EAAE,EAAE,CAClF,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;IAE3E,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAExD,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK;SAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/G,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/G,wFAAwF;IACxF,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,gBAAgB,GAAkC,EAAE,CAAC;IAC3D,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,MAAM,YAAY,GAAG,UAAU,CAAC,WAAW,CAAuB,CAAC;QACnE,MAAM,YAAY,GAAG,SAAS,CAAC,WAAW,CAAuB,CAAC;QAClE,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,KAAK,YAAY,EAAE,CAAC;YAC9F,gBAAgB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC;AAClF,CAAC"}

package/bundled-graph/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/bundled-graph/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/bundled-graph/dist/src/build.js

@@ -0,0 +1,73 @@
+import Graph from 'graphology';
+// Mirrors upstream graphify's _normalize_id: lowercase + collapse non-alphanumeric to underscores.
+function normalizeId(s) {
+    return s.replace(/[^a-zA-Z0-9]+/g, '_').replace(/^_+|_+$/g, '').toLowerCase();
+}
+/**
+ * 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 });
+        }
+    }
+    // Build normalized ID lookup to remap mismatched edge endpoints before stubbing.
+    const normToId = new Map();
+    graph.forEachNode((id) => {
+        normToId.set(normalizeId(id), id);
+    });
+    // Add edges — skip self-loops, remap via normalization, stub only true externals
+    for (const edge of extraction.edges) {
+        let src = edge.source;
+        let tgt = edge.target;
+        if (!graph.hasNode(src)) {
+            const remapped = normToId.get(normalizeId(src));
+            if (remapped) {
+                src = remapped;
+            }
+            else {
+                graph.addNode(src, { id: src, label: src, fileType: 'unknown', sourceFile: '' });
+                normToId.set(normalizeId(src), src);
+            }
+        }
+        if (!graph.hasNode(tgt)) {
+            const remapped = normToId.get(normalizeId(tgt));
+            if (remapped) {
+                tgt = remapped;
+            }
+            else {
+                graph.addNode(tgt, { id: tgt, label: tgt, fileType: 'unknown', sourceFile: '' });
+                normToId.set(normalizeId(tgt), tgt);
+            }
+        }
+        if (src === tgt)
+            continue;
+        try {
+            graph.addEdge(src, tgt, {
+                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(src, tgt);
+            if (existing) {
+                const prev = graph.getEdgeAttribute(existing, 'weight') ?? 1;
+                graph.setEdgeAttribute(existing, 'weight', prev + 1);
+            }
+        }
+    }
+    return graph;
+}
+//# sourceMappingURL=build.js.map

package/bundled-graph/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/bundled-graph/dist/src/cache.d.ts

@@ -0,0 +1,12 @@
+import type { ExtractionResult } from './types.js';
+export declare class FileCache {
+    private cacheDir;
+    constructor(outputDir: string);
+    /** Strip YAML frontmatter (--- blocks) before hashing so metadata-only changes don't bust the cache. */
+    private stripFrontmatter;
+    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/bundled-graph/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,wGAAwG;IACxG,OAAO,CAAC,gBAAgB;IAMxB,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;IAOhD,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;CAG1B"}

package/bundled-graph/dist/src/cache.js

@@ -0,0 +1,43 @@
+import { createHash } from 'crypto';
+import { existsSync, readFileSync, writeFileSync, mkdirSync, renameSync } from 'fs';
+import { join } from 'path';
+export class FileCache {
+    cacheDir;
+    constructor(outputDir) {
+        this.cacheDir = join(outputDir, 'cache');
+        mkdirSync(this.cacheDir, { recursive: true });
+    }
+    /** Strip YAML frontmatter (--- blocks) before hashing so metadata-only changes don't bust the cache. */
+    stripFrontmatter(content) {
+        if (!content.startsWith('---'))
+            return content;
+        const end = content.indexOf('\n---', 3);
+        return end === -1 ? content : content.slice(end + 4);
+    }
+    key(filePath, content) {
+        return createHash('sha256')
+            .update(filePath + this.stripFrontmatter(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`);
+        const tmp = `${p}.tmp`;
+        writeFileSync(tmp, JSON.stringify(result), 'utf-8');
+        renameSync(tmp, p);
+    }
+    has(key) {
+        return existsSync(join(this.cacheDir, `${key}.json`));
+    }
+}
+//# sourceMappingURL=cache.js.map

package/bundled-graph/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,UAAU,EAAE,MAAM,IAAI,CAAC;AACpF,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,wGAAwG;IAChG,gBAAgB,CAAC,OAAe;QACtC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,GAAG,CAAC,QAAgB,EAAE,OAAe;QACnC,OAAO,UAAU,CAAC,QAAQ,CAAC;aACxB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;aACjD,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,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;QACpD,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,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/bundled-graph/dist/src/cluster.d.ts

@@ -0,0 +1,5 @@
+import type Graph from 'graphology';
+export declare function detectCommunities(graph: Graph): Promise<Record<number, string[]>>;
+export declare function cohesionScore(graph: Graph, communityNodes: string[]): number;
+export declare function splitOversizedCommunities(graph: Graph, communities: Record<number, string[]>, threshold?: number, louvainFn?: ((g: Graph) => Record<string, number>) | null): Record<number, string[]>;
+//# sourceMappingURL=cluster.d.ts.map

package/bundled-graph/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,wBAAsB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAkBvF;AAsBD,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,MAAM,CAe5E;AAED,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,KAAK,EACZ,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACrC,SAAS,SAAO,GACf,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CA6B1B"}