agent-orcha 0.0.4 → 0.0.5

package/dist/templates/workflows/example.workflow.yaml

@@ -1,5 +1,5 @@
-name: example-workflow
-description: A workflow demonstrating multi-agent orchestration with MCP, function, and vector tools
+name: research-pipeline
+description: Multi-step research pipeline that searches knowledge bases and produces a friendly summary
 version: "1.0.0"
 type: steps
 
@@ -8,51 +8,50 @@ input:
     topic:
       type: string
       required: true
-      description: The topic or question to process
+      description: The research topic or question
 
 steps:
 
-  # Step 1: Search the knowledge base for relevant information
-  - id: search-knowledge
-    agent: call-center-analyst
+  # Step 1: Search web knowledge for background information
+  - id: web-research
+    agent: knowledge-broker
     input:
-      query: "{{input.topic}}"
+      query: "Find information about {{input.topic}}"
     output:
-      key: knowledge_result
+      key: web_findings
 
-  # Step 2: Calculate the 10th Fibonacci number
-  - id: perform-calculation
-    agent: math
+  # Step 2: Search org chart to find relevant people in the company
+  - id: find-experts
+    agent: knowledge-broker
     input:
-      query: "Calculate 2*2"
+      query: "Who in the company has expertise related to {{input.topic}}?"
     output:
-      key: calculation_result
+      key: expert_findings
 
-  # Step 3: Summarize results with the example agent
+  # Step 3: Summarize everything into a friendly report
   - id: summarize
-    agent: sentiment-structured
+    agent: chatbot
     input:
       query: |
-        Summarize the following information:
+        Write a brief research summary on: {{input.topic}}
 
-        Topic: {{input.topic}}
+        Background Research:
+        {{steps.web-research.output}}
 
-        Knowledge Base Results:
-        {{steps.search-knowledge.output}}
+        Internal Experts:
+        {{steps.find-experts.output}}
 
-        Calculation Results:
-        {{steps.perform-calculation.output}}
+        Combine these into a clear, concise report with sections for background context and recommended contacts.
     output:
-      key: final_summary
+      key: final_report
 
 config:
   timeout: 300000
   onError: stop
 
 output:
-  timestamp: "{{steps.get-time.output}}"
-  knowledge: "{{steps.search-knowledge.output}}"
-  calculation: "{{steps.perform-calculation.output}}"
+  research: "{{steps.web-research.output}}"
+  experts: "{{steps.find-experts.output}}"
   summary: "{{steps.summarize.output}}"
 
 metadata:
@@ -61,8 +60,4 @@ metadata:
     - demo
     - workflow
     - multi-agent
-    - function-tools
-    - vector-search
-    - mcp-tools
-    - time-api
-    - fibonacci
+    - knowledge-search

package/dist/templates/workflows/react-example.workflow.yaml

@@ -0,0 +1,53 @@
+name: react-research
+description: Autonomous research workflow that discovers and uses all available tools and knowledge bases
+version: "1.0.0"
+type: react
+
+input:
+  schema:
+    topic:
+      type: string
+      required: true
+      description: The research topic or question
+
+prompt:
+  system: |
+    You are a research assistant with access to knowledge bases, tools, and other agents.
+
+    Available knowledge bases include company org charts, product inventories, web content, and more.
+    You also have access to calculator functions and other utility tools.
+
+    Research process:
+    1. Identify which knowledge bases and tools are relevant to the topic
+    2. Search multiple sources in parallel when possible
+    3. Synthesize the results into a comprehensive, well-structured answer
+
+    If you need clarification from the user, use the ask_user tool.
+  goal: "Research and answer: {{input.topic}}"
+
+graph:
+  model: default
+  executionMode: react
+  tools:
+    mode: all
+    sources: [knowledge, function, builtin]
+  agents:
+    mode: all
+    exclude:
+      - architect
+  maxIterations: 10
+  timeout: 300000
+
+output:
+  analysis: "{{state.messages[-1].content}}"
+
+config:
+  onError: stop
+
+metadata:
+  category: example
+  tags:
+    - demo
+    - react
+    - autonomous
+    - tool-discovery

package/package.json

@@ -1,12 +1,11 @@
 {
   "name": "agent-orcha",
-  "version": "0.0.4",
+  "version": "0.0.5",
   "description": "TypeScript Agentic Orchestration http server and framework for building multi-agent workflows with MCP tools and vector stores",
   "keywords": [
     "ai",
     "agents",
     "llm",
-    "langchain",
     "mcp",
     "vector-store",
     "rag",
@@ -35,52 +34,50 @@
     "LICENSE"
   ],
   "scripts": {
-    "dev": "tsx watch src/index.ts",
+    "dev": "node --watch src/index.ts",
     "build": "tsc && npm run copy-assets",
     "copy-assets": "mkdir -p dist && cp -r public dist/ && cp -r templates dist/",
     "start": "node dist/src/index.js",
     "prepublishOnly": "npm run build",
     "lint": "eslint src lib --ext .ts",
     "typecheck": "tsc --noEmit",
-    "test": "node --import tsx/esm --test test/**/*.test.ts"
+    "test": "node --test --test-force-exit 'test/**/*.test.ts'",
+    "test:coverage": "node --test --test-force-exit --experimental-test-coverage --test-reporter=lcov --test-reporter-destination=lcov.info --test-reporter=spec --test-reporter-destination=stdout 'test/**/*.test.ts'"
   },
   "dependencies": {
-    "@aws-sdk/client-s3": "^3.712.0",
+    "@anthropic-ai/sdk": "^0.76.0",
     "@fastify/cors": "^10.0.1",
     "@fastify/static": "^8.0.4",
-    "@langchain/anthropic": "^1.3.11",
-    "@langchain/community": "^1.1.6",
-    "@langchain/core": "^1.1.16",
-    "@langchain/google-genai": "^2.1.12",
-    "@langchain/langgraph": "^1.1.2",
-    "@langchain/openai": "^1.2.3",
-    "@langchain/textsplitters": "^1.0.1",
+    "@google/generative-ai": "^0.24.1",
     "@modelcontextprotocol/sdk": "^1.0.0",
-    "chromadb": "^1.9.2",
+    "cheerio": "^1.0.0",
     "dotenv": "^16.4.7",
     "fastify": "^5.2.0",
+    "fastify-plugin": "^5.1.0",
     "glob": "^11.0.0",
-    "graphology": "^0.26.0",
-    "graphology-communities-louvain": "^2.0.2",
-    "langchain": "^1.2.12",
-    "minimatch": "^10.0.1",
+    "jsdom": "^28.1.0",
     "mysql2": "^3.12.0",
-    "openai": "^4.104.0",
+    "node-cron": "^4.2.1",
+    "openai": "^6.22.0",
     "pg": "^8.13.2",
     "pino": "^10.2.1",
     "pino-pretty": "^13.1.3",
+    "sqlite-vec": "^0.1.7-alpha.2",
+    "ws": "^8.18.0",
     "yaml": "^2.6.1",
     "zod": "^3.24.1",
     "zod-to-json-schema": "^3.25.1"
   },
   "devDependencies": {
+    "@types/jsdom": "^27.0.0",
     "@types/node": "^22.10.5",
+    "@types/node-cron": "^3.0.11",
     "@types/pg": "^8.11.10",
+    "@types/ws": "^8.18.1",
     "eslint": "^9.17.0",
-    "tsx": "^4.19.2",
     "typescript": "^5.7.2"
   },
   "engines": {
-    "node": ">=20.0.0"
+    "node": ">=24.0.0"
   }
 }

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

@@ -1,16 +0,0 @@
-import type { MemoryGraphStore } from './memory-graph-store.js';
-import type { Community, GraphCommunitiesConfig } from './types.js';
-/**
- * Louvain community detection on the in-memory graph.
- * Groups nodes into communities based on graph structure (edge density).
- */
-export declare class CommunityDetector {
-    private config;
-    constructor(config: GraphCommunitiesConfig);
-    /**
-     * Detect communities in the graph store.
-     * Only works with MemoryGraphStore (requires graphology instance).
-     */
-    detect(store: MemoryGraphStore): Promise<Community[]>;
-}
-//# sourceMappingURL=community-detector.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"community-detector.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/community-detector.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,KAAK,EAAE,SAAS,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAKpE;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAAyB;gBAE3B,MAAM,EAAE,sBAAsB;IAI1C;;;OAGG;IACG,MAAM,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;CA4E5D"}

package/dist/lib/knowledge/graph-rag/community-detector.js

@@ -1,81 +0,0 @@
-import { createLogger } from '../../logger.js';
-const logger = createLogger('CommunityDetector');
-/**
- * Louvain community detection on the in-memory graph.
- * Groups nodes into communities based on graph structure (edge density).
- */
-export class CommunityDetector {
-    config;
-    constructor(config) {
-        this.config = config;
-    }
-    /**
-     * Detect communities in the graph store.
-     * Only works with MemoryGraphStore (requires graphology instance).
-     */
-    async detect(store) {
-        const graph = await store.getGraphologyInstance();
-        if (graph.order === 0) {
-            logger.warn('Graph is empty, no communities to detect');
-            return [];
-        }
-        // Dynamic imports to handle ESM/CJS interop
-        const graphology = await import('graphology');
-        const GraphClass = graphology.default ?? graphology;
-        const louvainModule = await import('graphology-communities-louvain');
-        const louvain = louvainModule.default ?? louvainModule;
-        // graphology-communities-louvain requires an undirected graph for community detection.
-        // Create a temporary undirected copy.
-        const undirected = new GraphClass({ type: 'undirected' });
-        graph.forEachNode((nodeId, attrs) => {
-            undirected.addNode(nodeId, attrs);
-        });
-        graph.forEachEdge((_edgeKey, attrs, source, target) => {
-            if (source === target)
-                return; // skip self-loops
-            if (!undirected.hasEdge(source, target)) {
-                undirected.addEdge(source, target, { weight: attrs.weight ?? 1 });
-            }
-            else {
-                // Merge edge weights
-                const existing = undirected.getEdgeAttributes(source, target);
-                undirected.setEdgeAttribute(source, target, 'weight', existing.weight + (attrs.weight ?? 1));
-            }
-        });
-        if (undirected.size === 0) {
-            logger.warn('No edges in graph, each node becomes its own community');
-            const communities = [];
-            let i = 0;
-            graph.forEachNode((nodeId) => {
-                communities.push({ id: `community-${i}`, nodeIds: [nodeId] });
-                i++;
-            });
-            return communities.filter((c) => c.nodeIds.length >= this.config.minSize);
-        }
-        logger.info(`Running Louvain on ${undirected.order} nodes, ${undirected.size} edges (resolution: ${this.config.resolution})`);
-        // Run Louvain algorithm
-        const assignments = louvain(undirected, {
-            resolution: this.config.resolution,
-        });
-        // Group nodes by community
-        const communityMap = new Map();
-        for (const [nodeId, communityId] of Object.entries(assignments)) {
-            const existing = communityMap.get(communityId) ?? [];
-            existing.push(nodeId);
-            communityMap.set(communityId, existing);
-        }
-        // Filter by minimum size and create Community objects
-        const communities = [];
-        for (const [id, nodeIds] of communityMap.entries()) {
-            if (nodeIds.length >= this.config.minSize) {
-                communities.push({
-                    id: `community-${id}`,
-                    nodeIds,
-                });
-            }
-        }
-        logger.info(`Detected ${communities.length} communities (min size: ${this.config.minSize})`);
-        return communities;
-    }
-}
-//# sourceMappingURL=community-detector.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"community-detector.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/community-detector.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,mBAAmB,CAAC,CAAC;AAEjD;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACpB,MAAM,CAAyB;IAEvC,YAAY,MAA8B;QACxC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,KAAuB;QAClC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,qBAAqB,EAAE,CAAC;QAElD,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;YACxD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,4CAA4C;QAC5C,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,IAAI,UAAU,CAAC;QACpD,MAAM,aAAa,GAAG,MAAM,MAAM,CAAC,gCAAgC,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,IAAI,aAAa,CAAC;QAEvD,uFAAuF;QACvF,sCAAsC;QACtC,MAAM,UAAU,GAAkB,IAAK,UAAkB,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;QAElF,KAAK,CAAC,WAAW,CAAC,CAAC,MAAc,EAAE,KAAiB,EAAE,EAAE;YACtD,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,WAAW,CAAC,CAAC,QAAgB,EAAE,KAAiB,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;YACxF,IAAI,MAAM,KAAK,MAAM;gBAAE,OAAO,CAAC,kBAAkB;YACjD,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBACxC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,MAAM,EAAG,KAAiC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,CAAC;YACjG,CAAC;iBAAM,CAAC;gBACN,qBAAqB;gBACrB,MAAM,QAAQ,GAAG,UAAU,CAAC,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAuB,CAAC;gBACpF,UAAU,CAAC,gBAAgB,CACzB,MAAM,EAAE,MAAM,EAAE,QAAQ,EACxB,QAAQ,CAAC,MAAM,GAAG,CAAG,KAAiC,CAAC,MAAiB,IAAI,CAAC,CAAC,CAC/E,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;YACtE,MAAM,WAAW,GAAgB,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,CAAC,WAAW,CAAC,CAAC,MAAc,EAAE,EAAE;gBACnC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC9D,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,CAAC;YACH,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC5E,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,sBAAsB,UAAU,CAAC,KAAK,WAAW,UAAU,CAAC,IAAI,uBAAuB,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;QAE9H,wBAAwB;QACxB,MAAM,WAAW,GAAI,OAAe,CAAC,UAAU,EAAE;YAC/C,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU;SACnC,CAA2B,CAAC;QAE7B,2BAA2B;QAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAChE,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;QAED,sDAAsD;QACtD,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YACnD,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,WAAW,CAAC,IAAI,CAAC;oBACf,EAAE,EAAE,aAAa,EAAE,EAAE;oBACrB,OAAO;iBACR,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,YAAY,WAAW,CAAC,MAAM,2BAA2B,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;QAC7F,OAAO,WAAW,CAAC;IACrB,CAAC;CACF"}

package/dist/lib/knowledge/graph-rag/community-summarizer.d.ts

@@ -1,17 +0,0 @@
-import type { BaseChatModel } from '@langchain/core/language_models/chat_models';
-import type { Community, GraphStore } from './types.js';
-/**
- * Generates natural language summaries for graph communities using an LLM.
- * Each community summary describes the key entities and relationships within it.
- */
-export declare class CommunitySummarizer {
-    private llm;
-    constructor(llm: BaseChatModel);
-    /**
-     * Generate summaries for all communities.
-     */
-    summarize(communities: Community[], store: GraphStore): Promise<Community[]>;
-    private summarizeSingle;
-    private buildCommunityContext;
-}
-//# sourceMappingURL=community-summarizer.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"community-summarizer.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/community-summarizer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,6CAA6C,CAAC;AAEjF,OAAO,KAAK,EAAE,SAAS,EAAwB,UAAU,EAAE,MAAM,YAAY,CAAC;AAK9E;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,GAAG,CAAgB;gBAEf,GAAG,EAAE,aAAa;IAI9B;;OAEG;IACG,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;YAuBpE,eAAe;IAqD7B,OAAO,CAAC,qBAAqB;CAQ9B"}

package/dist/lib/knowledge/graph-rag/community-summarizer.js

@@ -1,87 +0,0 @@
-import { HumanMessage, SystemMessage } from '@langchain/core/messages';
-import { createLogger } from '../../logger.js';
-const logger = createLogger('CommunitySummarizer');
-/**
- * Generates natural language summaries for graph communities using an LLM.
- * Each community summary describes the key entities and relationships within it.
- */
-export class CommunitySummarizer {
-    llm;
-    constructor(llm) {
-        this.llm = llm;
-    }
-    /**
-     * Generate summaries for all communities.
-     */
-    async summarize(communities, store) {
-        const summarized = [];
-        for (let i = 0; i < communities.length; i++) {
-            const community = communities[i];
-            logger.info(`Summarizing community ${i + 1}/${communities.length} (${community.nodeIds.length} nodes)`);
-            try {
-                const { title, summary } = await this.summarizeSingle(community, store);
-                summarized.push({ ...community, title, summary });
-            }
-            catch (error) {
-                logger.error(`Failed to summarize community ${community.id}: ${error instanceof Error ? error.message : String(error)}`);
-                summarized.push({
-                    ...community,
-                    title: `Community ${community.id}`,
-                    summary: `Community with ${community.nodeIds.length} entities.`,
-                });
-            }
-        }
-        return summarized;
-    }
-    async summarizeSingle(community, store) {
-        // Gather all nodes and their relationships within the community
-        const nodes = [];
-        for (const nodeId of community.nodeIds) {
-            const node = await store.getNode(nodeId);
-            if (node)
-                nodes.push(node);
-        }
-        const allEdges = await store.getAllEdges();
-        const communityNodeIds = new Set(community.nodeIds);
-        const internalEdges = allEdges.filter((e) => communityNodeIds.has(e.sourceId) && communityNodeIds.has(e.targetId));
-        const context = this.buildCommunityContext(nodes, internalEdges);
-        const response = await this.llm.invoke([
-            new SystemMessage(`You are a knowledge graph analyst. Given a set of entities and relationships from a community in a knowledge graph, provide:
-1. A short title (5-10 words) that captures the main theme
-2. A comprehensive summary (2-4 sentences) that describes the key entities, their relationships, and the overall theme
-
-Respond ONLY with valid JSON:
-{
-  "title": "Short descriptive title",
-  "summary": "Comprehensive summary of the community..."
-}`),
-            new HumanMessage(`Analyze this community:\n\n${context}`),
-        ]);
-        const responseText = typeof response.content === 'string'
-            ? response.content
-            : Array.isArray(response.content)
-                ? response.content.map((c) => (typeof c === 'string' ? c : 'text' in c ? c.text : '')).join('')
-                : '';
-        try {
-            const jsonMatch = responseText.match(/```(?:json)?\s*([\s\S]*?)```/) ?? [null, responseText];
-            const parsed = JSON.parse((jsonMatch[1] ?? responseText).trim());
-            return {
-                title: String(parsed.title ?? `Community ${community.id}`),
-                summary: String(parsed.summary ?? ''),
-            };
-        }
-        catch {
-            logger.warn(`Failed to parse community summary, using raw response`);
-            return {
-                title: `Community ${community.id}`,
-                summary: responseText.substring(0, 500),
-            };
-        }
-    }
-    buildCommunityContext(nodes, edges) {
-        const entityLines = nodes.map((n) => `- ${n.name} (${n.type}): ${n.description}`).join('\n');
-        const relLines = edges.map((e) => `- ${e.sourceId} -[${e.type}]-> ${e.targetId}: ${e.description}`).join('\n');
-        return `Entities:\n${entityLines}\n\nRelationships:\n${relLines}`;
-    }
-}
-//# sourceMappingURL=community-summarizer.js.map

package/dist/lib/knowledge/graph-rag/community-summarizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"community-summarizer.js","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/community-summarizer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAEvE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,MAAM,GAAG,YAAY,CAAC,qBAAqB,CAAC,CAAC;AAEnD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACtB,GAAG,CAAgB;IAE3B,YAAY,GAAkB;QAC5B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,WAAwB,EAAE,KAAiB;QACzD,MAAM,UAAU,GAAgB,EAAE,CAAC;QAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,CAAC,OAAO,CAAC,MAAM,SAAS,CAAC,CAAC;YAExG,IAAI,CAAC;gBACH,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBACxE,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACpD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,iCAAiC,SAAS,CAAC,EAAE,KAAK,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACzH,UAAU,CAAC,IAAI,CAAC;oBACd,GAAG,SAAS;oBACZ,KAAK,EAAE,aAAa,SAAS,CAAC,EAAE,EAAE;oBAClC,OAAO,EAAE,kBAAkB,SAAS,CAAC,OAAO,CAAC,MAAM,YAAY;iBAChE,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,KAAK,CAAC,eAAe,CAAC,SAAoB,EAAE,KAAiB;QACnE,gEAAgE;QAChE,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACzC,IAAI,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,WAAW,EAAE,CAAC;QAC3C,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC5E,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAEjE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YACrC,IAAI,aAAa,CACf;;;;;;;;EAQN,CACK;YACD,IAAI,YAAY,CAAC,8BAA8B,OAAO,EAAE,CAAC;SAC1D,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,OAAO,QAAQ,CAAC,OAAO,KAAK,QAAQ;YACvD,CAAC,CAAC,QAAQ,CAAC,OAAO;YAClB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAC/B,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/F,CAAC,CAAC,EAAE,CAAC;QAET,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC7F,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACjE,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,aAAa,SAAS,CAAC,EAAE,EAAE,CAAC;gBAC1D,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;aACtC,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;YACrE,OAAO;gBACL,KAAK,EAAE,aAAa,SAAS,CAAC,EAAE,EAAE;gBAClC,OAAO,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;aACxC,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,qBAAqB,CAAC,KAAkB,EAAE,KAAkB;QAClE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7F,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CACxB,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,WAAW,EAAE,CACxE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,OAAO,cAAc,WAAW,uBAAuB,QAAQ,EAAE,CAAC;IACpE,CAAC;CACF"}

package/dist/lib/knowledge/graph-rag/entity-extractor.d.ts

@@ -1,36 +0,0 @@
-import type { BaseChatModel } from '@langchain/core/language_models/chat_models';
-import type { EntityTypeConfig, RelationshipTypeConfig, ExtractionResult } from './types.js';
-interface EntityExtractorOptions {
-    llm: BaseChatModel;
-    entityTypes?: EntityTypeConfig[];
-    relationshipTypes?: RelationshipTypeConfig[];
-}
-/**
- * LLM-based entity and relationship extraction from text chunks.
- */
-export declare class EntityExtractor {
-    private llm;
-    private entityTypes?;
-    private relationshipTypes?;
-    constructor(options: EntityExtractorOptions);
-    /**
-     * Extract entities and relationships from a set of text chunks.
-     * Processes chunks sequentially to avoid rate limiting.
-     */
-    extractFromChunks(chunks: Array<{
-        id: string;
-        content: string;
-    }>): Promise<ExtractionResult>;
-    private extractFromSingleChunk;
-    private buildSystemPrompt;
-    private buildUserPrompt;
-    private parseExtractionResponse;
-    /**
-     * Deduplicate entities by normalized key (lowercase name + type).
-     * Merges descriptions and source chunk IDs.
-     * Updates relationship references to use canonical entity names.
-     */
-    private deduplicateEntities;
-}
-export {};
-//# sourceMappingURL=entity-extractor.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"entity-extractor.d.ts","sourceRoot":"","sources":["../../../../lib/knowledge/graph-rag/entity-extractor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,6CAA6C,CAAC;AAEjF,OAAO,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAA0C,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAKrI,UAAU,sBAAsB;IAC9B,GAAG,EAAE,aAAa,CAAC;IACnB,WAAW,CAAC,EAAE,gBAAgB,EAAE,CAAC;IACjC,iBAAiB,CAAC,EAAE,sBAAsB,EAAE,CAAC;CAC9C;AAED;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,GAAG,CAAgB;IAC3B,OAAO,CAAC,WAAW,CAAC,CAAqB;IACzC,OAAO,CAAC,iBAAiB,CAAC,CAA2B;gBAEzC,OAAO,EAAE,sBAAsB;IAM3C;;;OAGG;IACG,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,gBAAgB,CAAC;YA0BpF,sBAAsB;IAkBpC,OAAO,CAAC,iBAAiB;IA2CzB,OAAO,CAAC,eAAe;IAIvB,OAAO,CAAC,uBAAuB;IAgC/B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;CAmE5B"}