agentdb 3.0.0-alpha.10 → 3.0.0-alpha.12

package/dist/src/controllers/MemoryController.js

@@ -0,0 +1,303 @@
+/**
+ * MemoryController - Unified Memory Management with Attention Mechanisms
+ *
+ * Provides a unified interface for memory storage, retrieval, and search
+ * with integrated attention mechanisms for enhanced relevance scoring.
+ *
+ * Features:
+ * - CRUD operations for memory entries
+ * - Vector similarity search
+ * - Attention-enhanced retrieval
+ * - Temporal and importance weighting
+ * - Multiple namespace support
+ * - Integration with vector backends
+ */
+import { SelfAttentionController } from './attention/SelfAttentionController.js';
+import { CrossAttentionController } from './attention/CrossAttentionController.js';
+import { MultiHeadAttentionController } from './attention/MultiHeadAttentionController.js';
+/**
+ * MemoryController - Main class for memory management
+ */
+export class MemoryController {
+    vectorBackend;
+    memories;
+    config;
+    // Attention controllers
+    selfAttention;
+    crossAttention;
+    multiHeadAttention;
+    constructor(vectorBackend = null, config = {}) {
+        this.vectorBackend = vectorBackend;
+        this.memories = new Map();
+        this.config = {
+            namespace: 'default',
+            enableAttention: true,
+            numHeads: 8,
+            defaultTopK: 10,
+            defaultThreshold: 0.0,
+            ...config
+        };
+        // Initialize attention controllers
+        this.selfAttention = new SelfAttentionController(vectorBackend);
+        this.crossAttention = new CrossAttentionController(vectorBackend);
+        this.multiHeadAttention = new MultiHeadAttentionController(vectorBackend, {
+            numHeads: this.config.numHeads
+        });
+    }
+    /**
+     * Store a memory entry
+     */
+    async store(memory, namespace) {
+        if (!memory.id || !memory.embedding || memory.embedding.length === 0) {
+            throw new Error('Memory must have id and non-empty embedding');
+        }
+        // Add timestamp if not provided
+        const storedMemory = {
+            ...memory,
+            timestamp: memory.timestamp ?? Date.now()
+        };
+        // Store in local map
+        this.memories.set(memory.id, storedMemory);
+        // Store in vector backend if available
+        if (this.vectorBackend) {
+            const embedding = new Float32Array(memory.embedding);
+            this.vectorBackend.insert(memory.id, embedding, {
+                ...memory.metadata,
+                namespace: namespace || this.config.namespace
+            });
+        }
+        // Add to attention controllers
+        const attentionEntry = {
+            id: memory.id,
+            embedding: memory.embedding,
+            content: memory.content,
+            metadata: memory.metadata
+        };
+        this.selfAttention.addMemory(attentionEntry);
+        if (namespace) {
+            this.crossAttention.addToContext(namespace, attentionEntry);
+        }
+        else {
+            this.crossAttention.addToContext(this.config.namespace || 'default', attentionEntry);
+        }
+        this.multiHeadAttention.addMemory(attentionEntry);
+    }
+    /**
+     * Retrieve a memory by ID
+     */
+    async retrieve(id) {
+        return this.memories.get(id);
+    }
+    /**
+     * Update an existing memory
+     */
+    async update(id, updates) {
+        const existing = this.memories.get(id);
+        if (!existing) {
+            return false;
+        }
+        const updated = {
+            ...existing,
+            ...updates,
+            id // Ensure ID cannot be changed
+        };
+        // Re-store with updates
+        await this.delete(id);
+        await this.store(updated);
+        return true;
+    }
+    /**
+     * Delete a memory by ID
+     */
+    async delete(id) {
+        const existed = this.memories.delete(id);
+        // Remove from attention controllers
+        this.selfAttention.removeMemory(id);
+        this.multiHeadAttention.removeMemory(id);
+        // Remove from all cross-attention contexts
+        for (const contextName of this.crossAttention.listContexts()) {
+            this.crossAttention.removeFromContext(contextName, id);
+        }
+        return existed;
+    }
+    /**
+     * Search for similar memories
+     */
+    async search(query, options = {}) {
+        const { topK = this.config.defaultTopK || 10, threshold = this.config.defaultThreshold || 0.0, filter, temporalWeight = 0, weighByImportance = false } = options;
+        // Compute similarity scores
+        const results = [];
+        for (const [id, memory] of this.memories.entries()) {
+            // Apply metadata filter if provided
+            if (filter && !this.matchesFilter(memory.metadata || {}, filter)) {
+                continue;
+            }
+            // Compute cosine similarity
+            let score = this.cosineSimilarity(query, memory.embedding);
+            // Apply temporal weighting
+            if (temporalWeight > 0 && memory.timestamp) {
+                const age = Date.now() - memory.timestamp;
+                const decayFactor = Math.exp(-temporalWeight * age / (24 * 60 * 60 * 1000));
+                score = score * (1 - temporalWeight) + score * temporalWeight * decayFactor;
+            }
+            // Apply importance weighting
+            if (weighByImportance && memory.importance !== undefined) {
+                score = score * (0.5 + 0.5 * memory.importance);
+            }
+            if (score >= threshold) {
+                results.push({
+                    ...memory,
+                    score
+                });
+            }
+        }
+        // Sort by score and return top-k
+        return results
+            .sort((a, b) => b.score - a.score)
+            .slice(0, topK);
+    }
+    /**
+     * Retrieve memories with attention-enhanced scoring
+     */
+    async retrieveWithAttention(query, options = {}) {
+        const { topK = this.config.defaultTopK || 10, threshold = this.config.defaultThreshold || 0.0, useAttention = true, temporalWeight = 0, weighByImportance = false } = options;
+        // First get base search results
+        const baseResults = await this.search(query, {
+            ...options,
+            topK: topK * 2 // Get more candidates for attention ranking
+        });
+        if (!useAttention || !this.config.enableAttention) {
+            return baseResults.map(r => ({
+                ...r,
+                attentionScore: r.score
+            }));
+        }
+        // Compute attention scores
+        const selfAttentionResult = await this.selfAttention.computeAttention(query, {
+            topK: topK * 2,
+            minScore: 0
+        });
+        const multiHeadResult = await this.multiHeadAttention.computeMultiHeadAttention(query, { topK: topK * 2 });
+        // Build attention score map
+        const attentionScores = new Map();
+        for (const score of selfAttentionResult.scores) {
+            attentionScores.set(score.id, (attentionScores.get(score.id) || 0) + score.score);
+        }
+        if (multiHeadResult.aggregatedScores) {
+            for (const score of multiHeadResult.aggregatedScores) {
+                attentionScores.set(score.id, (attentionScores.get(score.id) || 0) + score.score);
+            }
+        }
+        // Combine base similarity with attention scores
+        const results = [];
+        for (const baseResult of baseResults) {
+            const attentionScore = attentionScores.get(baseResult.id) || 0;
+            // Combine scores (weighted average)
+            const combinedScore = 0.5 * baseResult.score + 0.5 * (attentionScore / 2);
+            // Apply temporal weighting
+            let finalScore = combinedScore;
+            if (temporalWeight > 0 && baseResult.timestamp) {
+                const age = Date.now() - baseResult.timestamp;
+                const decayFactor = Math.exp(-temporalWeight * age / (24 * 60 * 60 * 1000));
+                finalScore = combinedScore * (1 - temporalWeight) + combinedScore * temporalWeight * decayFactor;
+            }
+            // Apply importance weighting
+            if (weighByImportance && baseResult.importance !== undefined) {
+                finalScore = finalScore * (0.5 + 0.5 * baseResult.importance);
+            }
+            if (finalScore >= threshold) {
+                results.push({
+                    ...baseResult,
+                    score: finalScore,
+                    attentionScore
+                });
+            }
+        }
+        // Sort by combined score and return top-k
+        return results
+            .sort((a, b) => b.score - a.score)
+            .slice(0, topK);
+    }
+    /**
+     * Compute cosine similarity between two vectors
+     */
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length) {
+            throw new Error('Vectors must have same dimension');
+        }
+        let dotProduct = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dotProduct += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+        if (denominator === 0)
+            return 0;
+        return dotProduct / denominator;
+    }
+    /**
+     * Check if metadata matches filter criteria
+     */
+    matchesFilter(metadata, filter) {
+        for (const [key, value] of Object.entries(filter)) {
+            if (metadata[key] !== value) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Get all memories (for iteration/export)
+     */
+    getAllMemories() {
+        return Array.from(this.memories.values());
+    }
+    /**
+     * Get memory count
+     */
+    get count() {
+        return this.memories.size;
+    }
+    /**
+     * Clear all memories
+     */
+    clear() {
+        this.memories.clear();
+        this.selfAttention.clearMemories();
+        this.crossAttention.clearAllContexts();
+        this.multiHeadAttention.clearMemories();
+    }
+    /**
+     * Get the self-attention controller for direct access
+     */
+    getSelfAttentionController() {
+        return this.selfAttention;
+    }
+    /**
+     * Get the cross-attention controller for direct access
+     */
+    getCrossAttentionController() {
+        return this.crossAttention;
+    }
+    /**
+     * Get the multi-head attention controller for direct access
+     */
+    getMultiHeadAttentionController() {
+        return this.multiHeadAttention;
+    }
+    /**
+     * Get controller statistics
+     */
+    getStats() {
+        return {
+            memoryCount: this.memories.size,
+            selfAttention: this.selfAttention.getStats(),
+            crossAttention: this.crossAttention.getStats(),
+            multiHeadAttention: this.multiHeadAttention.getStats()
+        };
+    }
+}
+//# sourceMappingURL=MemoryController.js.map

package/dist/src/controllers/MemoryController.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryController.js","sourceRoot":"","sources":["../../../src/controllers/MemoryController.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AACjF,OAAO,EAAE,wBAAwB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,EAAE,4BAA4B,EAAE,MAAM,6CAA6C,CAAC;AAwE3F;;GAEG;AACH,MAAM,OAAO,gBAAgB;IACnB,aAAa,CAAuB;IACpC,QAAQ,CAAsB;IAC9B,MAAM,CAAyB;IAEvC,wBAAwB;IAChB,aAAa,CAA0B;IACvC,cAAc,CAA2B;IACzC,kBAAkB,CAA+B;IAEzD,YACE,gBAAsC,IAAI,EAC1C,SAAiC,EAAE;QAEnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG;YACZ,SAAS,EAAE,SAAS;YACpB,eAAe,EAAE,IAAI;YACrB,QAAQ,EAAE,CAAC;YACX,WAAW,EAAE,EAAE;YACf,gBAAgB,EAAE,GAAG;YACrB,GAAG,MAAM;SACV,CAAC;QAEF,mCAAmC;QACnC,IAAI,CAAC,aAAa,GAAG,IAAI,uBAAuB,CAAC,aAAa,CAAC,CAAC;QAChE,IAAI,CAAC,cAAc,GAAG,IAAI,wBAAwB,CAAC,aAAa,CAAC,CAAC;QAClE,IAAI,CAAC,kBAAkB,GAAG,IAAI,4BAA4B,CAAC,aAAa,EAAE;YACxE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;SAC/B,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,MAAc,EAAE,SAAkB;QAC5C,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QAED,gCAAgC;QAChC,MAAM,YAAY,GAAW;YAC3B,GAAG,MAAM;YACT,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE;SAC1C,CAAC;QAEF,qBAAqB;QACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QAE3C,uCAAuC;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE;gBAC9C,GAAG,MAAM,CAAC,QAAQ;gBAClB,SAAS,EAAE,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS;aAC9C,CAAC,CAAC;QACL,CAAC;QAED,+BAA+B;QAC/B,MAAM,cAAc,GAAG;YACrB,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;SAC1B,CAAC;QAEF,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAE7C,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC9D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,SAAS,EAAE,cAAc,CAAC,CAAC;QACvF,CAAC;QAED,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAU;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,EAAU,EAAE,OAAwB;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,OAAO,GAAW;YACtB,GAAG,QAAQ;YACX,GAAG,OAAO;YACV,EAAE,CAAC,8BAA8B;SAClC,CAAC;QAEF,wBAAwB;QACxB,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAE1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEzC,oCAAoC;QACpC,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAEzC,2CAA2C;QAC3C,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,EAAE,CAAC;YAC7D,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAAe,EACf,UAAyB,EAAE;QAE3B,MAAM,EACJ,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,IAAI,EAAE,EACpC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,GAAG,EAC/C,MAAM,EACN,cAAc,GAAG,CAAC,EAClB,iBAAiB,GAAG,KAAK,EAC1B,GAAG,OAAO,CAAC;QAEZ,4BAA4B;QAC5B,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YACnD,oCAAoC;YACpC,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;gBACjE,SAAS;YACX,CAAC;YAED,4BAA4B;YAC5B,IAAI,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAE3D,2BAA2B;YAC3B,IAAI,cAAc,GAAG,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC5E,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,KAAK,GAAG,cAAc,GAAG,WAAW,CAAC;YAC9E,CAAC;YAED,6BAA6B;YAC7B,IAAI,iBAAiB,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACzD,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;YAClD,CAAC;YAED,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC;oBACX,GAAG,MAAM;oBACT,KAAK;iBACN,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,OAAO,OAAO;aACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB,CACzB,KAAe,EACf,UAAyB,EAAE;QAE3B,MAAM,EACJ,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,IAAI,EAAE,EACpC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,GAAG,EAC/C,YAAY,GAAG,IAAI,EACnB,cAAc,GAAG,CAAC,EAClB,iBAAiB,GAAG,KAAK,EAC1B,GAAG,OAAO,CAAC;QAEZ,gCAAgC;QAChC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE;YAC3C,GAAG,OAAO;YACV,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,4CAA4C;SAC5D,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAClD,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3B,GAAG,CAAC;gBACJ,cAAc,EAAE,CAAC,CAAC,KAAK;aACxB,CAAC,CAAC,CAAC;QACN,CAAC;QAED,2BAA2B;QAC3B,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,gBAAgB,CAAC,KAAK,EAAE;YAC3E,IAAI,EAAE,IAAI,GAAG,CAAC;YACd,QAAQ,EAAE,CAAC;SACZ,CAAC,CAAC;QAEH,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,yBAAyB,CAC7E,KAAK,EACL,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,CACnB,CAAC;QAEF,4BAA4B;QAC5B,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;QAElD,KAAK,MAAM,KAAK,IAAI,mBAAmB,CAAC,MAAM,EAAE,CAAC;YAC/C,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACpF,CAAC;QAED,IAAI,eAAe,CAAC,gBAAgB,EAAE,CAAC;YACrC,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,gBAAgB,EAAE,CAAC;gBACrD,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,MAAM,OAAO,GAA+B,EAAE,CAAC;QAE/C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAE/D,oCAAoC;YACpC,MAAM,aAAa,GAAG,GAAG,GAAG,UAAU,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;YAE1E,2BAA2B;YAC3B,IAAI,UAAU,GAAG,aAAa,CAAC;YAC/B,IAAI,cAAc,GAAG,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC;gBAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC5E,UAAU,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,aAAa,GAAG,cAAc,GAAG,WAAW,CAAC;YACnG,CAAC;YAED,6BAA6B;YAC7B,IAAI,iBAAiB,IAAI,UAAU,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7D,UAAU,GAAG,UAAU,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YAChE,CAAC;YAED,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC;oBACX,GAAG,UAAU;oBACb,KAAK,EAAE,UAAU;oBACjB,cAAc;iBACf,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,OAAO,OAAO;aACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAI,WAAW,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEhC,OAAO,UAAU,GAAG,WAAW,CAAC;IAClC,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,QAA6B,EAC7B,MAA2B;QAE3B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAClD,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,CAAC;QACnC,IAAI,CAAC,cAAc,CAAC,gBAAgB,EAAE,CAAC;QACvC,IAAI,CAAC,kBAAkB,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,0BAA0B;QACxB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,2BAA2B;QACzB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,+BAA+B;QAC7B,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,OAAO;YACL,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YAC/B,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE;YAC5C,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE;YAC9C,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE;SACvD,CAAC;IACJ,CAAC;CACF"}

package/dist/src/controllers/MincutService.d.ts

@@ -0,0 +1,92 @@
+/**
+ * MincutService - Graph Partitioning with Minimum Cut Algorithms
+ *
+ * Implements multiple minimum cut algorithms for dynamic graph partitioning
+ * to achieve 50-80% memory reduction through intelligent node clustering.
+ *
+ * Features:
+ * - Stoer-Wagner algorithm (deterministic, optimal for small graphs)
+ * - Karger's randomized algorithm (probabilistic, good for large graphs)
+ * - Flow-based mincut (max-flow min-cut theorem)
+ * - Partition caching for repeated queries
+ * - WASM/NAPI acceleration when available
+ *
+ * Goal: 50-80% memory reduction through dynamic graph partitioning
+ */
+import type { GraphEdges } from '../types/graph.js';
+export interface MincutConfig {
+    algorithm: 'stoer-wagner' | 'karger' | 'flow-based';
+    maxPartitionSize?: number;
+    minCutThreshold?: number;
+}
+export interface MincutResult {
+    partitions: number[][];
+    cutSize: number;
+    cutEdges: Array<[number, number]>;
+    algorithm: string;
+}
+export interface Partition {
+    nodes: Set<number>;
+    internalEdges: number;
+    externalEdges: number;
+}
+export declare class MincutService {
+    private config;
+    private wasmModule;
+    private napiModule;
+    private initialized;
+    private partitionCache;
+    constructor(config: MincutConfig);
+    initialize(): Promise<void>;
+    /**
+     * Stoer-Wagner mincut algorithm
+     */
+    stoerWagnerMincut(edges: GraphEdges): Promise<MincutResult>;
+    /**
+     * Karger's randomized mincut
+     */
+    kargerMincut(edges: GraphEdges, iterations?: number): Promise<MincutResult>;
+    /**
+     * Flow-based mincut (max-flow min-cut theorem)
+     */
+    flowBasedMincut(edges: GraphEdges, source: number, sink: number): Promise<MincutResult>;
+    /**
+     * Partition graph based on configuration
+     */
+    partition(edges: GraphEdges): Promise<MincutResult>;
+    /**
+     * Get partition containing a node
+     */
+    getPartition(node: number, result: MincutResult): number[];
+    /**
+     * Check if two nodes are in same partition
+     */
+    inSamePartition(node1: number, node2: number, result: MincutResult): boolean;
+    /**
+     * Calculate partition statistics
+     */
+    getPartitionStats(result: MincutResult, edges: GraphEdges): {
+        numPartitions: number;
+        avgPartitionSize: number;
+        maxPartitionSize: number;
+        minPartitionSize: number;
+        cutRatio: number;
+    };
+    /**
+     * Clear partition cache
+     */
+    clearCache(): void;
+    /**
+     * Get cache statistics
+     */
+    getCacheStats(): {
+        size: number;
+        keys: string[];
+    };
+    private hashEdges;
+    private stoerWagnerFallback;
+    private kargerIteration;
+    private fordFulkersonMincut;
+    private getCutEdges;
+}
+//# sourceMappingURL=MincutService.d.ts.map

package/dist/src/controllers/MincutService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MincutService.d.ts","sourceRoot":"","sources":["../../../src/controllers/MincutService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,cAAc,GAAG,QAAQ,GAAG,YAAY,CAAC;IACpD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAClC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,qBAAa,aAAa;IAMZ,OAAO,CAAC,MAAM;IAL1B,OAAO,CAAC,UAAU,CAAM;IACxB,OAAO,CAAC,UAAU,CAAM;IACxB,OAAO,CAAC,WAAW,CAAkB;IACrC,OAAO,CAAC,cAAc,CAAwC;gBAE1C,MAAM,EAAE,YAAY;IAElC,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAsBjC;;OAEG;IACG,iBAAiB,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC;IAsBjE;;OAEG;IACG,YAAY,CAChB,KAAK,EAAE,UAAU,EACjB,UAAU,GAAE,MAAY,GACvB,OAAO,CAAC,YAAY,CAAC;IAcxB;;OAEG;IACG,eAAe,CACnB,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,OAAO,CAAC,YAAY,CAAC;IASxB;;OAEG;IACG,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC;IAczD;;OAEG;IACH,YAAY,CACV,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,YAAY,GACnB,MAAM,EAAE;IASX;;OAEG;IACH,eAAe,CACb,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,YAAY,GACnB,OAAO;IAKV;;OAEG;IACH,iBAAiB,CACf,MAAM,EAAE,YAAY,EACpB,KAAK,EAAE,UAAU,GAChB;QACD,aAAa,EAAE,MAAM,CAAC;QACtB,gBAAgB,EAAE,MAAM,CAAC;QACzB,gBAAgB,EAAE,MAAM,CAAC;QACzB,gBAAgB,EAAE,MAAM,CAAC;QACzB,QAAQ,EAAE,MAAM,CAAC;KAClB;IAaD;;OAEG;IACH,UAAU,IAAI,IAAI;IAIlB;;OAEG;IACH,aAAa,IAAI;QACf,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,MAAM,EAAE,CAAC;KAChB;IAQD,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,mBAAmB;YAmCb,eAAe;IA+D7B,OAAO,CAAC,mBAAmB;IA2F3B,OAAO,CAAC,WAAW;CAsBpB"}