agent-orcha 0.0.4 → 0.0.7

package/dist/lib/knowledge/graph-rag/graph-rag-factory.js

@@ -1,239 +0,0 @@
-import { MemoryGraphStore } from './memory-graph-store.js';
-import { Neo4jGraphStore } from './neo4j-graph-store.js';
-import { EntityExtractor } from './entity-extractor.js';
-import { ExtractionCache } from './extraction-cache.js';
-import { CommunityDetector } from './community-detector.js';
-import { CommunitySummarizer } from './community-summarizer.js';
-import { LocalSearch } from './local-search.js';
-import { GlobalSearch } from './global-search.js';
-import { detectSearchMode } from './search-mode-detector.js';
-import { LLMFactory } from '../../llm/llm-factory.js';
-import { KnowledgeStoreFactory } from '../knowledge-store-factory.js';
-import { createLogger } from '../../logger.js';
-import * as path from 'path';
-const logger = createLogger('GraphRAGFactory');
-/**
- * Creates a GraphRAG KnowledgeStoreInstance from a graph-rag configuration.
- * Orchestrates: load → split → extract entities → build graph → detect communities → summarize → index.
- */
-export class GraphRagFactory {
-    /** Graph store references for API access (keyed by knowledge store name) */
-    static graphStores = new Map();
-    /** Get a graph store by knowledge store name (for API endpoints) */
-    static getGraphStore(name) {
-        return this.graphStores.get(name);
-    }
-    static async create(config, projectRoot) {
-        const graphConfig = config.graph;
-        const searchConfig = config.search;
-        logger.info(`Creating GraphRAG store "${config.name}"...`);
-        // 1. Load and split documents (reuse existing infrastructure)
-        logger.info('Loading documents...');
-        const documents = await KnowledgeStoreFactory.loadDocuments(config, projectRoot);
-        logger.info(`Loaded ${documents.length} document(s)`);
-        const splitDocs = await KnowledgeStoreFactory.splitDocuments(config, documents);
-        logger.info(`Split into ${splitDocs.length} chunk(s)`);
-        // 2. Create embeddings for entity descriptions
-        const embeddings = KnowledgeStoreFactory.createEmbeddings(config.embedding);
-        // 3. Create graph store
-        const store = this.createGraphStore(graphConfig);
-        // 4. Check cache
-        const cacheEnabled = graphConfig.cache.enabled;
-        const cachePath = path.resolve(projectRoot, graphConfig.cache.directory);
-        const cache = new ExtractionCache(cachePath, config.name);
-        const docContents = splitDocs.map((d) => d.pageContent);
-        const sourceHash = ExtractionCache.computeSourceHash(docContents);
-        let entities = [];
-        let relationships = [];
-        let communities = [];
-        let cacheHit = false;
-        if (cacheEnabled && await cache.isValid(sourceHash)) {
-            try {
-                logger.info('Cache HIT - loading from cache');
-                const cached = await cache.load();
-                entities = cached.entities;
-                relationships = cached.relationships;
-                communities = cached.communities;
-                cacheHit = true;
-            }
-            catch (cacheError) {
-                logger.warn(`Cache load failed, falling back to extraction: ${cacheError instanceof Error ? cacheError.message : String(cacheError)}`);
-            }
-        }
-        if (!cacheHit) {
-            if (cacheEnabled) {
-                logger.info('Cache MISS - running extraction pipeline');
-            }
-            // 5. Entity extraction
-            const extractionLlm = LLMFactory.create(graphConfig.extraction.llm);
-            const extractor = new EntityExtractor({
-                llm: extractionLlm,
-                entityTypes: graphConfig.extraction.entityTypes,
-                relationshipTypes: graphConfig.extraction.relationshipTypes,
-            });
-            const chunks = splitDocs.map((doc, idx) => ({
-                id: `chunk-${idx}`,
-                content: doc.pageContent,
-            }));
-            const extracted = await extractor.extractFromChunks(chunks);
-            entities = extracted.entities;
-            relationships = extracted.relationships;
-            // 6. Build graph
-            const nodes = await this.buildNodes(entities, embeddings);
-            const edges = this.buildEdges(relationships, nodes);
-            await store.addNodes(nodes);
-            await store.addEdges(edges);
-            // 7. Community detection
-            if (store instanceof MemoryGraphStore) {
-                const detector = new CommunityDetector(graphConfig.communities);
-                communities = await detector.detect(store);
-                // 8. Community summarization
-                if (communities.length > 0) {
-                    const summaryLlm = LLMFactory.create(graphConfig.communities.summaryLlm);
-                    const summarizer = new CommunitySummarizer(summaryLlm);
-                    communities = await summarizer.summarize(communities, store);
-                }
-            }
-            else {
-                // Neo4j: community detection not yet supported directly
-                communities = [];
-                logger.warn('Community detection not supported for Neo4j store (use memory store)');
-            }
-            await store.setCommunities(communities);
-            // 9. Save to cache
-            if (cacheEnabled) {
-                await cache.save(sourceHash, entities, relationships, communities);
-            }
-        }
-        // If loading from cache, we need to rebuild the graph store
-        if (cacheEnabled && entities.length > 0 && (await store.getAllNodes()).length === 0) {
-            const nodes = await this.buildNodes(entities, embeddings);
-            const edges = this.buildEdges(relationships, nodes);
-            await store.addNodes(nodes);
-            await store.addEdges(edges);
-            await store.setCommunities(communities);
-        }
-        logger.info(`GraphRAG "${config.name}" ready: ${entities.length} entities, ${relationships.length} relationships, ${communities.length} communities`);
-        // Register graph store for API access
-        this.graphStores.set(config.name, store);
-        // 10. Create search instances
-        const localSearch = new LocalSearch(store, embeddings, searchConfig.localSearch);
-        const globalSearchLlm = LLMFactory.create(searchConfig.globalSearch.llm);
-        const globalSearch = new GlobalSearch(store, globalSearchLlm, searchConfig.globalSearch);
-        // 11. Return KnowledgeStoreInstance
-        return {
-            config: config, // GraphRagKnowledgeConfig is compatible with KnowledgeConfig via the union
-            search: async (query, k) => {
-                const numResults = k ?? searchConfig.defaultK;
-                const mode = detectSearchMode(query);
-                logger.info(`Search mode: ${mode} for query: "${query.substring(0, 50)}..."`);
-                if (mode === 'global') {
-                    return globalSearch.search(query, numResults);
-                }
-                return localSearch.search(query, numResults);
-            },
-            addDocuments: async () => {
-                logger.warn('addDocuments not supported for GraphRAG stores - use refresh() instead');
-            },
-            refresh: async () => {
-                logger.info(`Refreshing GraphRAG store "${config.name}"...`);
-                await store.clear();
-                if (cacheEnabled) {
-                    await cache.clear();
-                }
-                // Re-run the full pipeline
-                await GraphRagFactory.create(config, projectRoot);
-            },
-        };
-    }
-    static createGraphStore(config) {
-        switch (config.store.type) {
-            case 'neo4j': {
-                const opts = config.store.options;
-                return new Neo4jGraphStore({
-                    uri: opts.uri ?? 'bolt://localhost:7687',
-                    username: opts.username ?? 'neo4j',
-                    password: opts.password ?? 'password',
-                    database: opts.database,
-                });
-            }
-            case 'memory':
-            default:
-                return new MemoryGraphStore();
-        }
-    }
-    /**
-     * Build GraphNode objects from extracted entities, creating embeddings for each.
-     */
-    static async buildNodes(entities, embeddings) {
-        const nodes = [];
-        // Batch embed all entity descriptions
-        const descriptions = entities.map((e) => `${e.name}: ${e.description}`);
-        let embeddingVectors = [];
-        try {
-            embeddingVectors = await embeddings.embedDocuments(descriptions);
-        }
-        catch (error) {
-            logger.error(`Failed to embed entity descriptions: ${error instanceof Error ? error.message : String(error)}`);
-            // Fall back to empty embeddings
-            embeddingVectors = entities.map(() => []);
-        }
-        for (let i = 0; i < entities.length; i++) {
-            const entity = entities[i];
-            const nodeId = normalizeId(entity.name, entity.type);
-            nodes.push({
-                id: nodeId,
-                type: entity.type,
-                name: entity.name,
-                description: entity.description,
-                properties: entity.properties,
-                sourceChunkIds: entity.properties.sourceChunkIds ?? [],
-                embedding: embeddingVectors[i],
-            });
-        }
-        return nodes;
-    }
-    /**
-     * Build GraphEdge objects from extracted relationships, resolving entity names to node IDs.
-     */
-    static buildEdges(relationships, nodes) {
-        const nodeIdMap = new Map();
-        for (const node of nodes) {
-            const key = `${node.name.toLowerCase()}::${node.type.toLowerCase()}`;
-            nodeIdMap.set(key, node.id);
-        }
-        const edges = [];
-        for (let i = 0; i < relationships.length; i++) {
-            const rel = relationships[i];
-            const sourceKey = `${rel.sourceName.toLowerCase()}::${rel.sourceType.toLowerCase()}`;
-            const targetKey = `${rel.targetName.toLowerCase()}::${rel.targetType.toLowerCase()}`;
-            const sourceId = nodeIdMap.get(sourceKey);
-            const targetId = nodeIdMap.get(targetKey);
-            if (!sourceId || !targetId) {
-                logger.debug(`Skipping relationship: missing node for ${rel.sourceName} -> ${rel.targetName}`);
-                continue;
-            }
-            edges.push({
-                id: `edge-${i}-${rel.type}`,
-                type: rel.type,
-                sourceId,
-                targetId,
-                description: rel.description,
-                weight: rel.weight,
-                properties: {},
-            });
-        }
-        return edges;
-    }
-}
-/**
- * Create a deterministic node ID from entity name and type.
- */
-function normalizeId(name, type) {
-    const normalized = `${type}::${name}`
-        .toLowerCase()
-        .replace(/[^a-z0-9:]+/g, '-')
-        .replace(/^-|-$/g, '');
-    return normalized;
-}
-//# sourceMappingURL=graph-rag-factory.js.map

package/dist/lib/knowledge/graph-rag/graph-rag-factory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-rag-factory.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/graph-rag-factory.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,MAAM,MAAM,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;AAE/C;;;GAGG;AACH,MAAM,OAAO,eAAe;IAC1B,4EAA4E;IACpE,MAAM,CAAC,WAAW,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE3D,oEAAoE;IACpE,MAAM,CAAC,aAAa,CAAC,IAAY;QAC/B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAA+B,EAAE,WAAmB;QACtE,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;QACjC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC;QAEnC,MAAM,CAAC,IAAI,CAAC,4BAA4B,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC;QAE3D,8DAA8D;QAC9D,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACpC,MAAM,SAAS,GAAG,MAAM,qBAAqB,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACjF,MAAM,CAAC,IAAI,CAAC,UAAU,SAAS,CAAC,MAAM,cAAc,CAAC,CAAC;QAEtD,MAAM,SAAS,GAAG,MAAM,qBAAqB,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAChF,MAAM,CAAC,IAAI,CAAC,cAAc,SAAS,CAAC,MAAM,WAAW,CAAC,CAAC;QAEvD,+CAA+C;QAC/C,MAAM,UAAU,GAAG,qBAAqB,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAE5E,wBAAwB;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;QAEjD,iBAAiB;QACjB,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,IAAI,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAE1D,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACxD,MAAM,UAAU,GAAG,eAAe,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAElE,IAAI,QAAQ,GAAsB,EAAE,CAAC;QACrC,IAAI,aAAa,GAA4B,EAAE,CAAC;QAChD,IAAI,WAAW,GAAgB,EAAE,CAAC;QAElC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,YAAY,IAAI,MAAM,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC;gBACH,MAAM,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC9C,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC;gBAClC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;gBAC3B,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;gBACrC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;gBACjC,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YAAC,OAAO,UAAU,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,kDAAkD,UAAU,YAAY,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACzI,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;YAC1D,CAAC;YAED,uBAAuB;YACvB,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACpE,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC;gBACpC,GAAG,EAAE,aAAa;gBAClB,WAAW,EAAE,WAAW,CAAC,UAAU,CAAC,WAAW;gBAC/C,iBAAiB,EAAE,WAAW,CAAC,UAAU,CAAC,iBAAiB;aAC5D,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;gBAC1C,EAAE,EAAE,SAAS,GAAG,EAAE;gBAClB,OAAO,EAAE,GAAG,CAAC,WAAW;aACzB,CAAC,CAAC,CAAC;YAEJ,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC5D,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;YAC9B,aAAa,GAAG,SAAS,CAAC,aAAa,CAAC;YAExC,iBAAiB;YACjB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YAEpD,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5B,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE5B,yBAAyB;YACzB,IAAI,KAAK,YAAY,gBAAgB,EAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;gBAChE,WAAW,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAE3C,6BAA6B;gBAC7B,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;oBACzE,MAAM,UAAU,GAAG,IAAI,mBAAmB,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,GAAG,MAAM,UAAU,CAAC,SAAS,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;gBAC/D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,wDAAwD;gBACxD,WAAW,GAAG,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;YACtF,CAAC;YAED,MAAM,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;YAExC,mBAAmB;YACnB,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;QAED,4DAA4D;QAC5D,IAAI,YAAY,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpF,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YAC1D,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YACpD,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5B,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5B,MAAM,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,IAAI,YAAY,QAAQ,CAAC,MAAM,cAAc,aAAa,CAAC,MAAM,mBAAmB,WAAW,CAAC,MAAM,cAAc,CAAC,CAAC;QAEtJ,sCAAsC;QACtC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAEzC,8BAA8B;QAC9B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,CAAC,WAAW,CAAC,CAAC;QACjF,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,YAAY,CAAC,YAAY,CAAC,CAAC;QAEzF,oCAAoC;QACpC,OAAO;YACL,MAAM,EAAE,MAAa,EAAE,2EAA2E;YAClG,MAAM,EAAE,KAAK,EAAE,KAAa,EAAE,CAAU,EAA2B,EAAE;gBACnE,MAAM,UAAU,GAAG,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC;gBAC9C,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;gBAE9E,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACtB,OAAO,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBAChD,CAAC;gBACD,OAAO,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAC/C,CAAC;YACD,YAAY,EAAE,KAAK,IAAmB,EAAE;gBACtC,MAAM,CAAC,IAAI,CAAC,wEAAwE,CAAC,CAAC;YACxF,CAAC;YACD,OAAO,EAAE,KAAK,IAAmB,EAAE;gBACjC,MAAM,CAAC,IAAI,CAAC,8BAA8B,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC;gBAC7D,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;gBACpB,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;gBACtB,CAAC;gBACD,2BAA2B;gBAC3B,MAAM,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACpD,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,MAAM,CAAC,gBAAgB,CAAC,MAAmB;QACjD,QAAQ,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1B,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,OAAiC,CAAC;gBAC5D,OAAO,IAAI,eAAe,CAAC;oBACzB,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,uBAAuB;oBACxC,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,OAAO;oBAClC,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,UAAU;oBACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;iBACxB,CAAC,CAAC;YACL,CAAC;YACD,KAAK,QAAQ,CAAC;YACd;gBACE,OAAO,IAAI,gBAAgB,EAAE,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,QAA2B,EAAE,UAAsB;QACjF,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,sCAAsC;QACtC,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACxE,IAAI,gBAAgB,GAAe,EAAE,CAAC;QAEtC,IAAI,CAAC;YACH,gBAAgB,GAAG,MAAM,UAAU,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QACnE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,wCAAwC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC/G,gCAAgC;YAChC,gBAAgB,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YACrD,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,MAAM;gBACV,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,cAAc,EAAG,MAAM,CAAC,UAAU,CAAC,cAA2B,IAAI,EAAE;gBACpE,SAAS,EAAE,gBAAgB,CAAC,CAAC,CAAC;aAC/B,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,UAAU,CAAC,aAAsC,EAAE,KAAkB;QAClF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACrE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;YACrF,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;YAErF,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAE1C,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,2CAA2C,GAAG,CAAC,UAAU,OAAO,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC/F,SAAS;YACX,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,QAAQ,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE;gBAC3B,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,QAAQ;gBACR,QAAQ;gBACR,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,UAAU,EAAE,EAAE;aACf,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;;AAGH;;GAEG;AACH,SAAS,WAAW,CAAC,IAAY,EAAE,IAAY;IAC7C,MAAM,UAAU,GAAG,GAAG,IAAI,KAAK,IAAI,EAAE;SAClC,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACzB,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/lib/knowledge/graph-rag/index.d.ts

@@ -1,14 +0,0 @@
-export { GraphRagFactory } from './graph-rag-factory.js';
-export { MemoryGraphStore } from './memory-graph-store.js';
-export { Neo4jGraphStore } from './neo4j-graph-store.js';
-export { EntityExtractor } from './entity-extractor.js';
-export { ExtractionCache } from './extraction-cache.js';
-export { CommunityDetector } from './community-detector.js';
-export { CommunitySummarizer } from './community-summarizer.js';
-export { LocalSearch } from './local-search.js';
-export { GlobalSearch } from './global-search.js';
-export { detectSearchMode } from './search-mode-detector.js';
-export type { SearchMode } from './search-mode-detector.js';
-export { GraphConfigSchema, GraphSearchConfigSchema, GraphExtractionConfigSchema, GraphCommunitiesConfigSchema, GraphStoreConfigSchema, GraphCacheConfigSchema, EntityTypeSchema, RelationshipTypeSchema, LocalSearchConfigSchema, GlobalSearchConfigSchema, } from './types.js';
-export type { GraphNode, GraphEdge, Community, GraphStore, GraphConfig, GraphSearchConfig, GraphExtractionConfig, GraphCommunitiesConfig, GraphStoreConfig, GraphCacheConfig, EntityTypeConfig, RelationshipTypeConfig, LocalSearchConfig, GlobalSearchConfig, ExtractedEntity, ExtractedRelationship, ExtractionResult, CacheMetadata, CachedGraphData, } from './types.js';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,YAAY,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAE5D,OAAO,EACL,iBAAiB,EACjB,uBAAuB,EACvB,2BAA2B,EAC3B,4BAA4B,EAC5B,sBAAsB,EACtB,sBAAsB,EACtB,gBAAgB,EAChB,sBAAsB,EACtB,uBAAuB,EACvB,wBAAwB,GACzB,MAAM,YAAY,CAAC;AAEpB,YAAY,EACV,SAAS,EACT,SAAS,EACT,SAAS,EACT,UAAU,EACV,WAAW,EACX,iBAAiB,EACjB,qBAAqB,EACrB,sBAAsB,EACtB,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,EAChB,sBAAsB,EACtB,iBAAiB,EACjB,kBAAkB,EAClB,eAAe,EACf,qBAAqB,EACrB,gBAAgB,EAChB,aAAa,EACb,eAAe,GAChB,MAAM,YAAY,CAAC"}

package/dist/lib/knowledge/graph-rag/index.js

@@ -1,12 +0,0 @@
-export { GraphRagFactory } from './graph-rag-factory.js';
-export { MemoryGraphStore } from './memory-graph-store.js';
-export { Neo4jGraphStore } from './neo4j-graph-store.js';
-export { EntityExtractor } from './entity-extractor.js';
-export { ExtractionCache } from './extraction-cache.js';
-export { CommunityDetector } from './community-detector.js';
-export { CommunitySummarizer } from './community-summarizer.js';
-export { LocalSearch } from './local-search.js';
-export { GlobalSearch } from './global-search.js';
-export { detectSearchMode } from './search-mode-detector.js';
-export { GraphConfigSchema, GraphSearchConfigSchema, GraphExtractionConfigSchema, GraphCommunitiesConfigSchema, GraphStoreConfigSchema, GraphCacheConfigSchema, EntityTypeSchema, RelationshipTypeSchema, LocalSearchConfigSchema, GlobalSearchConfigSchema, } from './types.js';
-//# sourceMappingURL=index.js.map

package/dist/lib/knowledge/graph-rag/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAG7D,OAAO,EACL,iBAAiB,EACjB,uBAAuB,EACvB,2BAA2B,EAC3B,4BAA4B,EAC5B,sBAAsB,EACtB,sBAAsB,EACtB,gBAAgB,EAChB,sBAAsB,EACtB,uBAAuB,EACvB,wBAAwB,GACzB,MAAM,YAAY,CAAC"}

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

@@ -1,20 +0,0 @@
-import type { Embeddings } from '@langchain/core/embeddings';
-import type { GraphStore, LocalSearchConfig } from './types.js';
-import type { SearchResult } from '../types.js';
-/**
- * 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 declare class LocalSearch {
-    private store;
-    private embeddings;
-    private config;
-    constructor(store: GraphStore, embeddings: Embeddings, config: LocalSearchConfig);
-    search(query: string, k: number): Promise<SearchResult[]>;
-    private formatNeighborhood;
-    private computeRelevanceScore;
-}
-//# sourceMappingURL=local-search.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"local-search.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/local-search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,KAAK,EAAE,UAAU,EAAwB,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACtF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAKhD;;;;;;GAMG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,MAAM,CAAoB;gBAEtB,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB;IAM1E,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAiD/D,OAAO,CAAC,kBAAkB;IAoC1B,OAAO,CAAC,qBAAqB;CAI9B"}

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

@@ -1,110 +0,0 @@
-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

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

@@ -1,31 +0,0 @@
-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

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

@@ -1,165 +0,0 @@
-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