agent-orcha 0.0.2 → 0.0.4

package/dist/lib/knowledge/graph-rag/local-search.js

@@ -0,0 +1,110 @@
+import { createLogger } from '../../logger.js';
+const logger = createLogger('GraphLocalSearch');
+/**
+ * Entity-neighborhood search.
+ * 1. Embed the query
+ * 2. Find top-K similar entity nodes by embedding
+ * 3. Expand each node's neighborhood by maxDepth hops
+ * 4. Return structured context as SearchResult[]
+ */
+export class LocalSearch {
+    store;
+    embeddings;
+    config;
+    constructor(store, embeddings, config) {
+        this.store = store;
+        this.embeddings = embeddings;
+        this.config = config;
+    }
+    async search(query, k) {
+        logger.info(`Local search: "${query.substring(0, 50)}..." (k=${k}, depth=${this.config.maxDepth})`);
+        // 1. Embed the query
+        const queryEmbedding = await this.embeddings.embedQuery(query);
+        // 2. Find top-K similar entity nodes
+        const topNodes = await this.store.findNodesByEmbedding(queryEmbedding, k);
+        if (topNodes.length === 0) {
+            logger.warn('No matching entities found');
+            return [];
+        }
+        logger.info(`Found ${topNodes.length} matching entities`);
+        // 3. Expand each node's neighborhood
+        const results = [];
+        const processedNodes = new Set();
+        for (const node of topNodes) {
+            if (processedNodes.has(node.id))
+                continue;
+            const neighborhood = await this.store.getNeighbors(node.id, this.config.maxDepth);
+            for (const n of neighborhood.nodes) {
+                processedNodes.add(n.id);
+            }
+            const content = this.formatNeighborhood(node, neighborhood.nodes, neighborhood.edges);
+            const score = this.computeRelevanceScore(queryEmbedding, node);
+            results.push({
+                content,
+                metadata: {
+                    type: 'graph-local',
+                    entityId: node.id,
+                    entityName: node.name,
+                    entityType: node.type,
+                    neighborCount: neighborhood.nodes.length,
+                    edgeCount: neighborhood.edges.length,
+                },
+                score,
+            });
+        }
+        // Sort by score descending
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, k);
+    }
+    formatNeighborhood(centerNode, nodes, edges) {
+        const lines = [];
+        lines.push(`Entity: ${centerNode.name} (${centerNode.type})`);
+        lines.push(`Description: ${centerNode.description}`);
+        if (edges.length > 0) {
+            lines.push('');
+            lines.push('Relationships:');
+            // Build a name lookup for readable edge formatting
+            const nameMap = new Map();
+            for (const n of nodes) {
+                nameMap.set(n.id, `${n.name} (${n.type})`);
+            }
+            for (const edge of edges) {
+                const sourceName = nameMap.get(edge.sourceId) ?? edge.sourceId;
+                const targetName = nameMap.get(edge.targetId) ?? edge.targetId;
+                lines.push(`  ${sourceName} -[${edge.type}]-> ${targetName}: ${edge.description}`);
+            }
+        }
+        // List connected entities
+        const otherNodes = nodes.filter((n) => n.id !== centerNode.id);
+        if (otherNodes.length > 0) {
+            lines.push('');
+            lines.push('Connected Entities:');
+            for (const n of otherNodes) {
+                lines.push(`  - ${n.name} (${n.type}): ${n.description}`);
+            }
+        }
+        return lines.join('\n');
+    }
+    computeRelevanceScore(queryEmbedding, node) {
+        if (!node.embedding || node.embedding.length === 0)
+            return 0.5;
+        return cosineSimilarity(queryEmbedding, node.embedding);
+    }
+}
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denom === 0)
+        return 0;
+    return dot / denom;
+}
+//# sourceMappingURL=local-search.js.map

package/dist/lib/knowledge/graph-rag/local-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-search.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/local-search.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,OAAO,WAAW;IACd,KAAK,CAAa;IAClB,UAAU,CAAa;IACvB,MAAM,CAAoB;IAElC,YAAY,KAAiB,EAAE,UAAsB,EAAE,MAAyB;QAC9E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,CAAS;QACnC,MAAM,CAAC,IAAI,CAAC,kBAAkB,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC;QAEpG,qBAAqB;QACrB,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAE/D,qCAAqC;QACrC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;YAC1C,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,SAAS,QAAQ,CAAC,MAAM,oBAAoB,CAAC,CAAC;QAE1D,qCAAqC;QACrC,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE1C,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClF,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;gBACnC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YACtF,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;YAE/D,OAAO,CAAC,IAAI,CAAC;gBACX,OAAO;gBACP,QAAQ,EAAE;oBACR,IAAI,EAAE,aAAa;oBACnB,QAAQ,EAAE,IAAI,CAAC,EAAE;oBACjB,UAAU,EAAE,IAAI,CAAC,IAAI;oBACrB,UAAU,EAAE,IAAI,CAAC,IAAI;oBACrB,aAAa,EAAE,YAAY,CAAC,KAAK,CAAC,MAAM;oBACxC,SAAS,EAAE,YAAY,CAAC,KAAK,CAAC,MAAM;iBACrC;gBACD,KAAK;aACN,CAAC,CAAC;QACL,CAAC;QAED,2BAA2B;QAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAEO,kBAAkB,CAAC,UAAqB,EAAE,KAAkB,EAAE,KAAkB;QACtF,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,KAAK,CAAC,IAAI,CAAC,WAAW,UAAU,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;QAC9D,KAAK,CAAC,IAAI,CAAC,gBAAgB,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAErD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAE7B,mDAAmD;YACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YAC7C,CAAC;YAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;gBAC/D,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;gBAC/D,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,MAAM,IAAI,CAAC,IAAI,OAAO,UAAU,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,qBAAqB,CAAC,cAAwB,EAAE,IAAe;QACrE,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC/D,OAAO,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1D,CAAC;CACF;AAED,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC"}

package/dist/lib/knowledge/graph-rag/memory-graph-store.d.ts

@@ -0,0 +1,31 @@
+import type { AbstractGraph } from 'graphology-types';
+import type { GraphStore, GraphNode, GraphEdge, Community } from './types.js';
+/**
+ * In-memory graph store implementation using graphology.
+ * Stores nodes with their embeddings for similarity search
+ * and supports neighborhood traversal.
+ */
+export declare class MemoryGraphStore implements GraphStore {
+    private graph;
+    private communities;
+    private initialized;
+    private ensureGraph;
+    addNodes(nodes: GraphNode[]): Promise<void>;
+    addEdges(edges: GraphEdge[]): Promise<void>;
+    getNode(id: string): Promise<GraphNode | undefined>;
+    getNeighbors(nodeId: string, depth: number): Promise<{
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }>;
+    findNodesByEmbedding(embedding: number[], k: number): Promise<GraphNode[]>;
+    getCommunities(): Promise<Community[]>;
+    setCommunities(communities: Community[]): Promise<void>;
+    getAllNodes(): Promise<GraphNode[]>;
+    getAllEdges(): Promise<GraphEdge[]>;
+    clear(): Promise<void>;
+    /**
+     * Returns the underlying graphology instance for community detection.
+     */
+    getGraphologyInstance(): Promise<AbstractGraph>;
+}
+//# sourceMappingURL=memory-graph-store.d.ts.map

package/dist/lib/knowledge/graph-rag/memory-graph-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph-store.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/memory-graph-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAc,MAAM,kBAAkB,CAAC;AAClE,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAY9E;;;;GAIG;AACH,qBAAa,gBAAiB,YAAW,UAAU;IACjD,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,WAAW,CAAmB;IACtC,OAAO,CAAC,WAAW,CAAS;YAEd,WAAW;IAQnB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAY3C,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAiB3C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;IAMnD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,CAAC;IA0ChG,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAiB1E,cAAc,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAItC,cAAc,CAAC,WAAW,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD,WAAW,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IASnC,WAAW,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IASnC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAO5B;;OAEG;IACG,qBAAqB,IAAI,OAAO,CAAC,aAAa,CAAC;CAGtD"}

package/dist/lib/knowledge/graph-rag/memory-graph-store.js

@@ -0,0 +1,165 @@
+import { createLogger } from '../../logger.js';
+const logger = createLogger('MemoryGraphStore');
+// Dynamic import to handle ESM/CJS interop
+async function createGraph(options) {
+    const graphology = await import('graphology');
+    const Graph = graphology.default ?? graphology;
+    return new Graph(options);
+}
+/**
+ * In-memory graph store implementation using graphology.
+ * Stores nodes with their embeddings for similarity search
+ * and supports neighborhood traversal.
+ */
+export class MemoryGraphStore {
+    graph;
+    communities = [];
+    initialized = false;
+    async ensureGraph() {
+        if (!this.initialized) {
+            this.graph = await createGraph({ multi: true, type: 'directed' });
+            this.initialized = true;
+        }
+        return this.graph;
+    }
+    async addNodes(nodes) {
+        const graph = await this.ensureGraph();
+        for (const node of nodes) {
+            if (graph.hasNode(node.id)) {
+                graph.mergeNodeAttributes(node.id, node);
+            }
+            else {
+                graph.addNode(node.id, node);
+            }
+        }
+        logger.info(`Added ${nodes.length} nodes (total: ${graph.order})`);
+    }
+    async addEdges(edges) {
+        const graph = await this.ensureGraph();
+        for (const edge of edges) {
+            if (!graph.hasNode(edge.sourceId) || !graph.hasNode(edge.targetId)) {
+                logger.warn(`Skipping edge ${edge.id}: missing node (source=${edge.sourceId}, target=${edge.targetId})`);
+                continue;
+            }
+            try {
+                graph.addEdgeWithKey(edge.id, edge.sourceId, edge.targetId, edge);
+            }
+            catch {
+                // Edge key may already exist, merge attributes
+                graph.mergeEdgeAttributes(edge.id, edge);
+            }
+        }
+        logger.info(`Added ${edges.length} edges (total: ${graph.size})`);
+    }
+    async getNode(id) {
+        const graph = await this.ensureGraph();
+        if (!graph.hasNode(id))
+            return undefined;
+        return graph.getNodeAttributes(id);
+    }
+    async getNeighbors(nodeId, depth) {
+        const graph = await this.ensureGraph();
+        if (!graph.hasNode(nodeId)) {
+            return { nodes: [], edges: [] };
+        }
+        const visitedNodes = new Set();
+        const collectedEdges = new Map();
+        const queue = [{ id: nodeId, currentDepth: 0 }];
+        while (queue.length > 0) {
+            const item = queue.shift();
+            if (visitedNodes.has(item.id) || item.currentDepth > depth)
+                continue;
+            visitedNodes.add(item.id);
+            if (item.currentDepth < depth) {
+                // Traverse outbound edges
+                graph.forEachOutEdge(item.id, (edgeKey, attrs, _source, target) => {
+                    collectedEdges.set(edgeKey, attrs);
+                    if (!visitedNodes.has(target)) {
+                        queue.push({ id: target, currentDepth: item.currentDepth + 1 });
+                    }
+                });
+                // Traverse inbound edges
+                graph.forEachInEdge(item.id, (edgeKey, attrs, source, _target) => {
+                    collectedEdges.set(edgeKey, attrs);
+                    if (!visitedNodes.has(source)) {
+                        queue.push({ id: source, currentDepth: item.currentDepth + 1 });
+                    }
+                });
+            }
+        }
+        const nodes = [];
+        for (const nid of visitedNodes) {
+            nodes.push(graph.getNodeAttributes(nid));
+        }
+        return { nodes, edges: Array.from(collectedEdges.values()) };
+    }
+    async findNodesByEmbedding(embedding, k) {
+        const graph = await this.ensureGraph();
+        const scored = [];
+        graph.forEachNode((_nodeId, attrs) => {
+            const node = attrs;
+            if (!node.embedding || node.embedding.length === 0)
+                return;
+            const score = cosineSimilarity(embedding, node.embedding);
+            if (isFinite(score)) {
+                scored.push({ node, score });
+            }
+        });
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, k).map((s) => s.node);
+    }
+    async getCommunities() {
+        return this.communities;
+    }
+    async setCommunities(communities) {
+        this.communities = communities;
+    }
+    async getAllNodes() {
+        const graph = await this.ensureGraph();
+        const nodes = [];
+        graph.forEachNode((_key, attrs) => {
+            nodes.push(attrs);
+        });
+        return nodes;
+    }
+    async getAllEdges() {
+        const graph = await this.ensureGraph();
+        const edges = [];
+        graph.forEachEdge((_key, attrs) => {
+            edges.push(attrs);
+        });
+        return edges;
+    }
+    async clear() {
+        if (this.initialized) {
+            this.graph.clear();
+        }
+        this.communities = [];
+    }
+    /**
+     * Returns the underlying graphology instance for community detection.
+     */
+    async getGraphologyInstance() {
+        return this.ensureGraph();
+    }
+}
+/**
+ * Cosine similarity between two vectors.
+ */
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denom === 0)
+        return 0;
+    return dot / denom;
+}
+//# sourceMappingURL=memory-graph-store.js.map

package/dist/lib/knowledge/graph-rag/memory-graph-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph-store.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/memory-graph-store.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC;AAEhD,2CAA2C;AAC3C,KAAK,UAAU,WAAW,CAAC,OAAgC;IACzD,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,IAAI,UAAU,CAAC;IAC/C,OAAO,IAAK,KAAa,CAAC,OAAO,CAAC,CAAC;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACnB,KAAK,CAAiB;IACtB,WAAW,GAAgB,EAAE,CAAC;IAC9B,WAAW,GAAG,KAAK,CAAC;IAEpB,KAAK,CAAC,WAAW;QACvB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,MAAM,WAAW,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAClE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,IAA6B,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAA6B,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,MAAM,kBAAkB,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IACrE,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnE,MAAM,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,EAAE,0BAA0B,IAAI,CAAC,QAAQ,YAAY,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACzG,SAAS;YACX,CAAC;YACD,IAAI,CAAC;gBACH,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAA6B,CAAC,CAAC;YAC7F,CAAC;YAAC,MAAM,CAAC;gBACP,+CAA+C;gBAC/C,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,IAA6B,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,MAAM,kBAAkB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;IACpE,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,OAAO,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAyB,CAAC;IAC7D,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,MAAc,EAAE,KAAa;QAC9C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAClC,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAqB,CAAC;QACpD,MAAM,KAAK,GAAgD,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAE7F,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,YAAY,GAAG,KAAK;gBAAE,SAAS;YACrE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAE1B,IAAI,IAAI,CAAC,YAAY,GAAG,KAAK,EAAE,CAAC;gBAC9B,0BAA0B;gBAC1B,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,OAAe,EAAE,KAAiB,EAAE,OAAe,EAAE,MAAc,EAAE,EAAE;oBACpG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,KAA6B,CAAC,CAAC;oBAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC;oBAClE,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,yBAAyB;gBACzB,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,OAAe,EAAE,KAAiB,EAAE,MAAc,EAAE,OAAe,EAAE,EAAE;oBACnG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,KAA6B,CAAC,CAAC;oBAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC;oBAClE,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAyB,CAAC,CAAC;QACnE,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,KAAK,CAAC,oBAAoB,CAAC,SAAmB,EAAE,CAAS;QACvD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,MAAM,GAA8C,EAAE,CAAC;QAE7D,KAAK,CAAC,WAAW,CAAC,CAAC,OAAe,EAAE,KAAiB,EAAE,EAAE;YACvD,MAAM,IAAI,GAAG,KAA6B,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO;YAC3D,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1D,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,WAAwB;QAC3C,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,WAAW;QACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAiB,EAAE,EAAE;YACpD,KAAK,CAAC,IAAI,CAAC,KAA6B,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,WAAW;QACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,CAAC,WAAW,CAAC,CAAC,IAAY,EAAE,KAAiB,EAAE,EAAE;YACpD,KAAK,CAAC,IAAI,CAAC,KAA6B,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB;QACzB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;CACF;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC"}

package/dist/lib/knowledge/graph-rag/neo4j-graph-store.d.ts

@@ -0,0 +1,38 @@
+import type { GraphStore, GraphNode, GraphEdge, Community } from './types.js';
+interface Neo4jOptions {
+    uri: string;
+    username: string;
+    password: string;
+    database?: string;
+}
+/**
+ * Neo4j-backed graph store implementation.
+ * Requires neo4j-driver as a peer dependency.
+ */
+export declare class Neo4jGraphStore implements GraphStore {
+    private options;
+    private driver;
+    private database;
+    private communities;
+    constructor(options: Neo4jOptions);
+    private getDriver;
+    private runQuery;
+    addNodes(nodes: GraphNode[]): Promise<void>;
+    addEdges(edges: GraphEdge[]): Promise<void>;
+    getNode(id: string): Promise<GraphNode | undefined>;
+    getNeighbors(nodeId: string, depth: number): Promise<{
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }>;
+    findNodesByEmbedding(embedding: number[], k: number): Promise<GraphNode[]>;
+    getCommunities(): Promise<Community[]>;
+    setCommunities(communities: Community[]): Promise<void>;
+    getAllNodes(): Promise<GraphNode[]>;
+    getAllEdges(): Promise<GraphEdge[]>;
+    clear(): Promise<void>;
+    close(): Promise<void>;
+    private recordToNode;
+    private recordToEdge;
+}
+export {};
+//# sourceMappingURL=neo4j-graph-store.d.ts.map

package/dist/lib/knowledge/graph-rag/neo4j-graph-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"neo4j-graph-store.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/neo4j-graph-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAK9E,UAAU,YAAY;IACpB,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,qBAAa,eAAgB,YAAW,UAAU;IAKpC,OAAO,CAAC,OAAO;IAJ3B,OAAO,CAAC,MAAM,CAAM;IACpB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,WAAW,CAAmB;gBAElB,OAAO,EAAE,YAAY;YAI3B,SAAS;YAgBT,QAAQ;IAWhB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAqB3C,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAqB3C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;IASnD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,CAAC;IAsChG,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAa1E,cAAc,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAItC,cAAc,CAAC,WAAW,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAcvD,WAAW,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAKnC,WAAW,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAOnC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAMtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAO5B,OAAO,CAAC,YAAY;IAapB,OAAO,CAAC,YAAY;CAYrB"}

package/dist/lib/knowledge/graph-rag/neo4j-graph-store.js

@@ -0,0 +1,190 @@
+import { createLogger } from '../../logger.js';
+const logger = createLogger('Neo4jGraphStore');
+/**
+ * Neo4j-backed graph store implementation.
+ * Requires neo4j-driver as a peer dependency.
+ */
+export class Neo4jGraphStore {
+    options;
+    driver;
+    database;
+    communities = [];
+    constructor(options) {
+        this.options = options;
+        this.database = options.database ?? 'neo4j';
+    }
+    async getDriver() {
+        if (this.driver)
+            return this.driver;
+        try {
+            const neo4j = await import('neo4j-driver');
+            this.driver = neo4j.default.driver(this.options.uri, neo4j.default.auth.basic(this.options.username, this.options.password));
+            await this.driver.verifyConnectivity();
+            logger.info(`Connected to Neo4j at ${this.options.uri}`);
+            return this.driver;
+        }
+        catch (error) {
+            throw new Error(`Failed to connect to Neo4j: ${error instanceof Error ? error.message : String(error)}. Install neo4j-driver: npm install neo4j-driver`);
+        }
+    }
+    async runQuery(query, params = {}) {
+        const driver = await this.getDriver();
+        const session = driver.session({ database: this.database });
+        try {
+            const result = await session.run(query, params);
+            return result.records;
+        }
+        finally {
+            await session.close();
+        }
+    }
+    async addNodes(nodes) {
+        for (const node of nodes) {
+            await this.runQuery(`MERGE (n:Entity {id: $id})
+         SET n.type = $type, n.name = $name, n.description = $description,
+             n.properties = $properties, n.sourceChunkIds = $sourceChunkIds,
+             n.embedding = $embedding`, {
+                id: node.id,
+                type: node.type,
+                name: node.name,
+                description: node.description,
+                properties: JSON.stringify(node.properties),
+                sourceChunkIds: node.sourceChunkIds,
+                embedding: node.embedding ?? [],
+            });
+        }
+        logger.info(`Added ${nodes.length} nodes to Neo4j`);
+    }
+    async addEdges(edges) {
+        for (const edge of edges) {
+            await this.runQuery(`MATCH (source:Entity {id: $sourceId}), (target:Entity {id: $targetId})
+         MERGE (source)-[r:RELATES {id: $id}]->(target)
+         SET r.type = $type, r.description = $description, r.weight = $weight,
+             r.properties = $properties`, {
+                id: edge.id,
+                type: edge.type,
+                sourceId: edge.sourceId,
+                targetId: edge.targetId,
+                description: edge.description,
+                weight: edge.weight,
+                properties: JSON.stringify(edge.properties),
+            });
+        }
+        logger.info(`Added ${edges.length} edges to Neo4j`);
+    }
+    async getNode(id) {
+        const records = await this.runQuery(`MATCH (n:Entity {id: $id}) RETURN n`, { id });
+        if (records.length === 0)
+            return undefined;
+        return this.recordToNode(records[0].get('n'));
+    }
+    async getNeighbors(nodeId, depth) {
+        // Fetch nodes
+        const nodeRecords = await this.runQuery(`MATCH (start:Entity {id: $nodeId})-[*1..${depth}]-(n:Entity)
+       RETURN DISTINCT n`, { nodeId });
+        // Also include the start node
+        const startRecords = await this.runQuery(`MATCH (n:Entity {id: $nodeId}) RETURN n`, { nodeId });
+        // Fetch edges with source/target IDs
+        const edgeRecords = await this.runQuery(`MATCH (start:Entity {id: $nodeId})-[*0..${Math.max(0, depth - 1)}]-(s:Entity)-[r:RELATES]-(t:Entity)
+       WHERE (start)-[*1..${depth}]-(s) OR s.id = $nodeId
+       RETURN DISTINCT r, s.id AS sourceId, t.id AS targetId`, { nodeId });
+        const nodesMap = new Map();
+        for (const record of [...startRecords, ...nodeRecords]) {
+            const node = this.recordToNode(record.get('n'));
+            nodesMap.set(node.id, node);
+        }
+        const edgesMap = new Map();
+        for (const record of edgeRecords) {
+            const edge = this.recordToEdge(record.get('r'), record.get('sourceId'), record.get('targetId'));
+            edgesMap.set(edge.id, edge);
+        }
+        return {
+            nodes: Array.from(nodesMap.values()),
+            edges: Array.from(edgesMap.values()),
+        };
+    }
+    async findNodesByEmbedding(embedding, k) {
+        // Neo4j vector search requires a vector index to be set up.
+        // For now, fall back to fetching all nodes and computing similarity in-memory.
+        const allNodes = await this.getAllNodes();
+        const scored = allNodes
+            .filter((n) => n.embedding && n.embedding.length > 0)
+            .map((n) => ({ node: n, score: cosineSimilarity(embedding, n.embedding) }))
+            .filter((s) => isFinite(s.score))
+            .sort((a, b) => b.score - a.score);
+        return scored.slice(0, k).map((s) => s.node);
+    }
+    async getCommunities() {
+        return this.communities;
+    }
+    async setCommunities(communities) {
+        this.communities = communities;
+        // Persist community assignments to Neo4j nodes
+        for (const community of communities) {
+            for (const nodeId of community.nodeIds) {
+                await this.runQuery(`MATCH (n:Entity {id: $nodeId})
+           SET n.communityId = $communityId`, { nodeId, communityId: community.id });
+            }
+        }
+    }
+    async getAllNodes() {
+        const records = await this.runQuery(`MATCH (n:Entity) RETURN n`);
+        return records.map((r) => this.recordToNode(r.get('n')));
+    }
+    async getAllEdges() {
+        const records = await this.runQuery(`MATCH (s:Entity)-[r:RELATES]->(t:Entity) RETURN r, s.id AS sourceId, t.id AS targetId`);
+        return records.map((r) => this.recordToEdge(r.get('r'), r.get('sourceId'), r.get('targetId')));
+    }
+    async clear() {
+        await this.runQuery(`MATCH (n:Entity) DETACH DELETE n`);
+        this.communities = [];
+        logger.info('Cleared all Neo4j graph data');
+    }
+    async close() {
+        if (this.driver) {
+            await this.driver.close();
+            this.driver = null;
+        }
+    }
+    recordToNode(record) {
+        const props = record.properties;
+        return {
+            id: props.id,
+            type: props.type,
+            name: props.name,
+            description: props.description,
+            properties: props.properties ? JSON.parse(props.properties) : {},
+            sourceChunkIds: props.sourceChunkIds ?? [],
+            embedding: props.embedding ?? undefined,
+        };
+    }
+    recordToEdge(record, sourceId, targetId) {
+        const props = record.properties;
+        return {
+            id: props.id,
+            type: props.type,
+            sourceId: sourceId ?? props.sourceId ?? '',
+            targetId: targetId ?? props.targetId ?? '',
+            description: props.description,
+            weight: typeof props.weight === 'number' ? props.weight : 1,
+            properties: props.properties ? JSON.parse(props.properties) : {},
+        };
+    }
+}
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denom === 0)
+        return 0;
+    return dot / denom;
+}
+//# sourceMappingURL=neo4j-graph-store.js.map

package/dist/lib/knowledge/graph-rag/neo4j-graph-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"neo4j-graph-store.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/neo4j-graph-store.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;AAS/C;;;GAGG;AACH,MAAM,OAAO,eAAe;IAKN;IAJZ,MAAM,CAAM;IACZ,QAAQ,CAAS;IACjB,WAAW,GAAgB,EAAE,CAAC;IAEtC,YAAoB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;QACvC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC;IAC9C,CAAC;IAEO,KAAK,CAAC,SAAS;QACrB,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC;QACpC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAChC,IAAI,CAAC,OAAO,CAAC,GAAG,EAChB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CACvE,CAAC;YACF,MAAM,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,yBAAyB,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,+BAA+B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAC3J,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,SAAkC,EAAE;QACxE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC5D,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAChD,OAAO,MAAM,CAAC,OAAO,CAAC;QACxB,CAAC;gBAAS,CAAC;YACT,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,QAAQ,CACjB;;;sCAG8B,EAC9B;gBACE,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC3C,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;aAChC,CACF,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,MAAM,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,QAAQ,CACjB;;;wCAGgC,EAChC;gBACE,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;aAC5C,CACF,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,MAAM,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CACjC,qCAAqC,EACrC,EAAE,EAAE,EAAE,CACP,CAAC;QACF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC3C,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,MAAc,EAAE,KAAa;QAC9C,cAAc;QACd,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CACrC,2CAA2C,KAAK;yBAC7B,EACnB,EAAE,MAAM,EAAE,CACX,CAAC;QACF,8BAA8B;QAC9B,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,QAAQ,CACtC,yCAAyC,EACzC,EAAE,MAAM,EAAE,CACX,CAAC;QACF,qCAAqC;QACrC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,QAAQ,CACrC,2CAA2C,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;4BAC3C,KAAK;6DAC4B,EACvD,EAAE,MAAM,EAAE,CACX,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC9C,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,YAAY,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC9C,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;YAChG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;SACrC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,oBAAoB,CAAC,SAAmB,EAAE,CAAS;QACvD,4DAA4D;QAC5D,+EAA+E;QAC/E,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,QAAQ;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;aACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,SAAS,EAAE,CAAC,CAAC,SAAU,CAAC,EAAE,CAAC,CAAC;aAC3E,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAErC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,WAAwB;QAC3C,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,+CAA+C;QAC/C,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;YACpC,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;gBACvC,MAAM,IAAI,CAAC,QAAQ,CACjB;4CACkC,EAClC,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,CACtC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW;QACf,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,2BAA2B,CAAC,CAAC;QACjE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,KAAK,CAAC,WAAW;QACf,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CACjC,uFAAuF,CACxF,CAAC;QACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACjG,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,QAAQ,CAAC,kCAAkC,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACrB,CAAC;IACH,CAAC;IAEO,YAAY,CAAC,MAAW;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC;QAChC,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;YAChE,cAAc,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE;YAC1C,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,SAAS;SACxC,CAAC;IACJ,CAAC;IAEO,YAAY,CAAC,MAAW,EAAE,QAAiB,EAAE,QAAiB;QACpE,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC;QAChC,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,QAAQ,EAAE,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE;YAC1C,QAAQ,EAAE,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE;YAC1C,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,MAAM,EAAE,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3D,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;SACjE,CAAC;IACJ,CAAC;CACF;AAED,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC"}

package/dist/lib/knowledge/graph-rag/search-mode-detector.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Heuristically detects whether a query should use local (entity-specific)
+ * or global (thematic/community-summary) search mode.
+ */
+export type SearchMode = 'local' | 'global';
+/**
+ * Detect whether a query should use local or global search.
+ * Default: local (more commonly useful for specific queries).
+ */
+export declare function detectSearchMode(query: string): SearchMode;
+//# sourceMappingURL=search-mode-detector.d.ts.map

package/dist/lib/knowledge/graph-rag/search-mode-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-mode-detector.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/search-mode-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG,QAAQ,CAAC;AAc5C;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAyC1D"}

package/dist/lib/knowledge/graph-rag/search-mode-detector.js

@@ -0,0 +1,50 @@
+const GLOBAL_INDICATORS = [
+    'overall', 'common', 'themes', 'patterns', 'summarize', 'summary',
+    'across', 'trends', 'general', 'most frequent', 'overview', 'main topics',
+    'all', 'broadly', 'generally', 'what are the', 'how do', 'what do',
+    'in general', 'typically', 'aggregate', 'big picture',
+];
+const LOCAL_INDICATORS = [
+    'who', 'which', 'tell me about', 'what is', 'what does',
+    'describe', 'find', 'specific', 'details about', 'information on',
+];
+/**
+ * Detect whether a query should use local or global search.
+ * Default: local (more commonly useful for specific queries).
+ */
+export function detectSearchMode(query) {
+    const lower = query.toLowerCase().trim();
+    // Score each mode
+    let globalScore = 0;
+    let localScore = 0;
+    for (const indicator of GLOBAL_INDICATORS) {
+        if (lower.includes(indicator)) {
+            globalScore++;
+        }
+    }
+    for (const indicator of LOCAL_INDICATORS) {
+        if (lower.includes(indicator)) {
+            localScore++;
+        }
+    }
+    // Check for proper nouns (capitalized words not at start of sentence)
+    const words = query.trim().split(/\s+/);
+    const hasProperNouns = words.some((word, idx) => {
+        if (idx === 0)
+            return false; // Skip first word (always capitalized)
+        return /^[A-Z][a-z]/.test(word);
+    });
+    if (hasProperNouns) {
+        localScore += 2;
+    }
+    // Check if query mentions a specific name (quoted text)
+    if (query.includes('"') || query.includes("'")) {
+        localScore += 2;
+    }
+    if (globalScore > localScore) {
+        return 'global';
+    }
+    // Default to local
+    return 'local';
+}
+//# sourceMappingURL=search-mode-detector.js.map

package/dist/lib/knowledge/graph-rag/search-mode-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-mode-detector.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/search-mode-detector.ts"],"names":[],"mappings":"AAMA,MAAM,iBAAiB,GAAG;IACxB,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS;IACjE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,aAAa;IACzE,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS;IAClE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa;CACtD,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACvB,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,WAAW;IACvD,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE,gBAAgB;CAClE,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAEzC,kBAAkB;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;QAC1C,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,WAAW,EAAE,CAAC;QAChB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;QACzC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,UAAU,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QAC9C,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,uCAAuC;QACpE,OAAO,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,cAAc,EAAE,CAAC;QACnB,UAAU,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,wDAAwD;IACxD,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,UAAU,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,IAAI,WAAW,GAAG,UAAU,EAAE,CAAC;QAC7B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,mBAAmB;IACnB,OAAO,OAAO,CAAC;AACjB,CAAC"}