driftdetect-cortex 0.9.41

package/dist/causal/traversal/path-finder.js

@@ -0,0 +1,246 @@
+/**
+ * Causal Path Finder
+ *
+ * Finds paths between two memories in the causal graph,
+ * useful for understanding how two pieces of knowledge
+ * are connected.
+ *
+ * @module causal/traversal/path-finder
+ */
+/**
+ * Default path finder options
+ */
+const DEFAULT_OPTIONS = {
+    maxLength: 10,
+    minStrength: 0.2,
+    relationTypes: [],
+    includeInferred: true,
+    findAll: false,
+    maxPaths: 5,
+};
+/**
+ * Causal path finder
+ *
+ * Uses BFS for shortest path and DFS for all paths.
+ */
+export class CausalPathFinder {
+    causalStorage;
+    memoryStorage;
+    constructor(causalStorage, memoryStorage) {
+        this.causalStorage = causalStorage;
+        this.memoryStorage = memoryStorage;
+    }
+    /**
+     * Find a path between two memories
+     *
+     * Returns the shortest path if findAll is false,
+     * otherwise returns all paths up to maxPaths.
+     */
+    async findPath(fromId, toId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        if (fromId === toId) {
+            return this.createSingleNodeChain(fromId);
+        }
+        const paths = opts.findAll
+            ? await this.findAllPaths(fromId, toId, opts)
+            : await this.findShortestPath(fromId, toId, opts);
+        if (!paths || paths.length === 0) {
+            return null;
+        }
+        // Convert best path to chain
+        const bestPath = paths[0];
+        if (!bestPath) {
+            return null;
+        }
+        return this.pathToChain(bestPath);
+    }
+    /**
+     * Find shortest path using BFS
+     */
+    async findShortestPath(fromId, toId, options) {
+        const queue = [];
+        const visited = new Set();
+        // Initialize with starting node
+        queue.push({
+            memoryId: fromId,
+            path: { memoryIds: [fromId], edges: [], length: 0, strength: 1.0 },
+        });
+        visited.add(fromId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.path.length >= options.maxLength) {
+                continue;
+            }
+            // Get outgoing edges
+            const queryOpts = {
+                minStrength: options.minStrength,
+                includeInferred: options.includeInferred,
+            };
+            if (options.relationTypes.length > 0) {
+                queryOpts.relationTypes = options.relationTypes;
+            }
+            const edges = await this.causalStorage.getEdgesFrom(current.memoryId, queryOpts);
+            for (const edge of edges) {
+                const nextId = edge.targetId;
+                // Found the target!
+                if (nextId === toId) {
+                    return [{
+                            memoryIds: [...current.path.memoryIds, nextId],
+                            edges: [...current.path.edges, edge],
+                            length: current.path.length + 1,
+                            strength: current.path.strength * edge.strength,
+                        }];
+                }
+                // Continue searching if not visited
+                if (!visited.has(nextId)) {
+                    visited.add(nextId);
+                    queue.push({
+                        memoryId: nextId,
+                        path: {
+                            memoryIds: [...current.path.memoryIds, nextId],
+                            edges: [...current.path.edges, edge],
+                            length: current.path.length + 1,
+                            strength: current.path.strength * edge.strength,
+                        },
+                    });
+                }
+            }
+        }
+        return [];
+    }
+    /**
+     * Find all paths using DFS
+     */
+    async findAllPaths(fromId, toId, options) {
+        const paths = [];
+        const currentPath = {
+            memoryIds: [fromId],
+            edges: [],
+            length: 0,
+            strength: 1.0,
+        };
+        await this.dfs(fromId, toId, currentPath, new Set([fromId]), paths, options);
+        // Sort by strength (descending) then length (ascending)
+        paths.sort((a, b) => {
+            if (Math.abs(a.strength - b.strength) > 0.01) {
+                return b.strength - a.strength;
+            }
+            return a.length - b.length;
+        });
+        return paths.slice(0, options.maxPaths);
+    }
+    /**
+     * Check if a path exists between two memories
+     */
+    async pathExists(fromId, toId, options) {
+        const path = await this.findPath(fromId, toId, { ...options, findAll: false });
+        return path !== null;
+    }
+    /**
+     * Get the distance (shortest path length) between two memories
+     */
+    async getDistance(fromId, toId, options) {
+        if (fromId === toId)
+            return 0;
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const paths = await this.findShortestPath(fromId, toId, opts);
+        return paths.length > 0 && paths[0] ? paths[0].length : null;
+    }
+    // Private helpers
+    async dfs(currentId, targetId, currentPath, visited, paths, options) {
+        if (paths.length >= options.maxPaths)
+            return;
+        if (currentPath.length >= options.maxLength)
+            return;
+        const queryOpts = {
+            minStrength: options.minStrength,
+            includeInferred: options.includeInferred,
+        };
+        if (options.relationTypes.length > 0) {
+            queryOpts.relationTypes = options.relationTypes;
+        }
+        const edges = await this.causalStorage.getEdgesFrom(currentId, queryOpts);
+        for (const edge of edges) {
+            const nextId = edge.targetId;
+            if (nextId === targetId) {
+                // Found a path!
+                paths.push({
+                    memoryIds: [...currentPath.memoryIds, nextId],
+                    edges: [...currentPath.edges, edge],
+                    length: currentPath.length + 1,
+                    strength: currentPath.strength * edge.strength,
+                });
+                continue;
+            }
+            if (!visited.has(nextId)) {
+                visited.add(nextId);
+                const newPath = {
+                    memoryIds: [...currentPath.memoryIds, nextId],
+                    edges: [...currentPath.edges, edge],
+                    length: currentPath.length + 1,
+                    strength: currentPath.strength * edge.strength,
+                };
+                await this.dfs(nextId, targetId, newPath, visited, paths, options);
+                visited.delete(nextId);
+            }
+        }
+    }
+    async createSingleNodeChain(memoryId) {
+        const memory = await this.memoryStorage.read(memoryId);
+        if (!memory)
+            return null;
+        const node = {
+            memoryId,
+            memoryType: memory.type,
+            summary: memory.summary,
+            depth: 0,
+            incomingEdges: [],
+            outgoingEdges: [],
+        };
+        return {
+            rootId: memoryId,
+            direction: 'bidirectional',
+            nodes: [node],
+            edges: [],
+            maxDepth: 0,
+            totalMemories: 1,
+            chainConfidence: 1.0,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    async pathToChain(path) {
+        const nodes = [];
+        const rootId = path.memoryIds[0] ?? '';
+        for (let i = 0; i < path.memoryIds.length; i++) {
+            const memoryId = path.memoryIds[i];
+            if (!memoryId)
+                continue;
+            const memory = await this.memoryStorage.read(memoryId);
+            if (memory) {
+                const prevEdge = path.edges[i - 1];
+                const currEdge = path.edges[i];
+                const incomingEdges = i > 0 && prevEdge ? [prevEdge] : [];
+                const outgoingEdges = i < path.edges.length && currEdge ? [currEdge] : [];
+                nodes.push({
+                    memoryId,
+                    memoryType: memory.type,
+                    summary: memory.summary,
+                    depth: i,
+                    incomingEdges,
+                    outgoingEdges,
+                });
+            }
+        }
+        return {
+            rootId,
+            direction: 'effects',
+            nodes,
+            edges: path.edges,
+            maxDepth: path.length,
+            totalMemories: nodes.length,
+            chainConfidence: path.strength,
+            computedAt: new Date().toISOString(),
+        };
+    }
+}
+//# sourceMappingURL=path-finder.js.map

package/dist/causal/traversal/path-finder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-finder.js","sourceRoot":"","sources":["../../../src/causal/traversal/path-finder.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA2CH;;GAEG;AACH,MAAM,eAAe,GAAgC;IACnD,SAAS,EAAE,EAAE;IACb,WAAW,EAAE,GAAG;IAChB,aAAa,EAAE,EAAE;IACjB,eAAe,EAAE,IAAI;IACrB,OAAO,EAAE,KAAK;IACd,QAAQ,EAAE,CAAC;CACZ,CAAC;AAEF;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IAEjB;IACA;IAFV,YACU,aAA6B,EAC7B,aAA6B;QAD7B,kBAAa,GAAb,aAAa,CAAgB;QAC7B,kBAAa,GAAb,aAAa,CAAgB;IACpC,CAAC;IAEJ;;;;;OAKG;IACH,KAAK,CAAC,QAAQ,CACZ,MAAc,EACd,IAAY,EACZ,OAA2B;QAE3B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAEhD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO;YACxB,CAAC,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;YAC7C,CAAC,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAEpD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CACpB,MAAc,EACd,IAAY,EACZ,OAAoC;QAEpC,MAAM,KAAK,GAAkD,EAAE,CAAC;QAChE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,gCAAgC;QAChC,KAAK,CAAC,IAAI,CAAC;YACT,QAAQ,EAAE,MAAM;YAChB,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE;SACnE,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YAED,qBAAqB;YACrB,MAAM,SAAS,GAAyD;gBACtE,WAAW,EAAE,OAAO,CAAC,WAAW;gBAChC,eAAe,EAAE,OAAO,CAAC,eAAe;aACzC,CAAC;YACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;YAClD,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEjF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAE7B,oBAAoB;gBACpB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBACpB,OAAO,CAAC;4BACN,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC;4BAC9C,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;4BACpC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;4BAC/B,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;yBAChD,CAAC,CAAC;gBACL,CAAC;gBAED,oCAAoC;gBACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC;wBACT,QAAQ,EAAE,MAAM;wBAChB,IAAI,EAAE;4BACJ,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC;4BAC9C,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;4BACpC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;4BAC/B,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;yBAChD;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,MAAc,EACd,IAAY,EACZ,OAAoC;QAEpC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAe;YAC9B,SAAS,EAAE,CAAC,MAAM,CAAC;YACnB,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,CAAC;YACT,QAAQ,EAAE,GAAG;SACd,CAAC;QAEF,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAE7E,wDAAwD;QACxD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,EAAE,CAAC;gBAC7C,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YACjC,CAAC;YACD,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,MAAc,EACd,IAAY,EACZ,OAA2B;QAE3B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/E,OAAO,IAAI,KAAK,IAAI,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CACf,MAAc,EACd,IAAY,EACZ,OAA2B;QAE3B,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAE9B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAE9D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,CAAC;IAED,kBAAkB;IAEV,KAAK,CAAC,GAAG,CACf,SAAiB,EACjB,QAAgB,EAChB,WAAuB,EACvB,OAAoB,EACpB,KAAmB,EACnB,OAAoC;QAEpC,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ;YAAE,OAAO;QAC7C,IAAI,WAAW,CAAC,MAAM,IAAI,OAAO,CAAC,SAAS;YAAE,OAAO;QAEpD,MAAM,SAAS,GAAyD;YACtE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,eAAe,EAAE,OAAO,CAAC,eAAe;SACzC,CAAC;QACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAClD,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAE1E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE7B,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxB,gBAAgB;gBAChB,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,CAAC,GAAG,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC;oBAC7C,KAAK,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;oBACnC,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;oBAC9B,QAAQ,EAAE,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;iBAC/C,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAEpB,MAAM,OAAO,GAAe;oBAC1B,SAAS,EAAE,CAAC,GAAG,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC;oBAC7C,KAAK,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;oBACnC,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;oBAC9B,QAAQ,EAAE,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ;iBAC/C,CAAC;gBAEF,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;gBAEnE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,qBAAqB,CAAC,QAAgB;QAClD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEzB,MAAM,IAAI,GAAe;YACvB,QAAQ;YACR,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,EAAE;YACjB,aAAa,EAAE,EAAE;SAClB,CAAC;QAEF,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,eAAe;YAC1B,KAAK,EAAE,CAAC,IAAI,CAAC;YACb,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,CAAC;YACX,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,GAAG;YACpB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,WAAW,CAAC,IAAgB;QACxC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAEvD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,aAAa,GAAiB,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxE,MAAM,aAAa,GAAiB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAExF,KAAK,CAAC,IAAI,CAAC;oBACT,QAAQ;oBACR,UAAU,EAAE,MAAM,CAAC,IAAI;oBACvB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,KAAK,EAAE,CAAC;oBACR,aAAa;oBACb,aAAa;iBACd,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,SAAS,EAAE,SAAS;YACpB,KAAK;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,MAAM;YACrB,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,eAAe,EAAE,IAAI,CAAC,QAAQ;YAC9B,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;CACF"}

package/dist/causal/traversal/subgraph.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Causal Subgraph Extractor
+ *
+ * Extracts subgraphs from the causal graph containing
+ * specific memories and their connections.
+ *
+ * @module causal/traversal/subgraph
+ */
+import type { CausalChain, CausalRelation } from '../../types/causal.js';
+import type { ICausalStorage } from '../storage/interface.js';
+import type { IMemoryStorage } from '../../storage/interface.js';
+/**
+ * Subgraph extraction options
+ */
+export interface SubgraphOptions {
+    /** Include edges between the specified memories */
+    includeInternalEdges?: boolean;
+    /** Include immediate neighbors */
+    includeNeighbors?: boolean;
+    /** Depth for neighbor inclusion */
+    neighborDepth?: number;
+    /** Minimum edge strength */
+    minStrength?: number;
+    /** Relation types to include */
+    relationTypes?: CausalRelation[];
+    /** Include inferred edges */
+    includeInferred?: boolean;
+    /** Maximum nodes in subgraph */
+    maxNodes?: number;
+}
+/**
+ * Causal subgraph extractor
+ */
+export declare class CausalSubgraphExtractor {
+    private causalStorage;
+    private memoryStorage;
+    constructor(causalStorage: ICausalStorage, memoryStorage: IMemoryStorage);
+    /**
+     * Extract a subgraph containing the specified memories
+     */
+    extractSubgraph(memoryIds: string[], options?: SubgraphOptions): Promise<CausalChain>;
+    /**
+     * Extract the connected component containing a memory
+     */
+    extractConnectedComponent(memoryId: string, options?: SubgraphOptions): Promise<CausalChain>;
+    /**
+     * Get the induced subgraph (only edges between specified nodes)
+     */
+    getInducedSubgraph(memoryIds: string[]): Promise<CausalChain>;
+    /**
+     * Get ego network (node + immediate neighbors)
+     */
+    getEgoNetwork(memoryId: string, depth?: number, options?: SubgraphOptions): Promise<CausalChain>;
+    private createNode;
+    private addInternalEdges;
+    private addNeighbors;
+    private exploreComponent;
+}
+//# sourceMappingURL=subgraph.d.ts.map

package/dist/causal/traversal/subgraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.d.ts","sourceRoot":"","sources":["../../../src/causal/traversal/subgraph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAEV,WAAW,EAEX,cAAc,EACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,mDAAmD;IACnD,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B,kCAAkC;IAClC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,mCAAmC;IACnC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4BAA4B;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gCAAgC;IAChC,aAAa,CAAC,EAAE,cAAc,EAAE,CAAC;IACjC,6BAA6B;IAC7B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,gCAAgC;IAChC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAeD;;GAEG;AACH,qBAAa,uBAAuB;IAEhC,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,aAAa;gBADb,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc;IAGvC;;OAEG;IACG,eAAe,CACnB,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,WAAW,CAAC;IAmDvB;;OAEG;IACG,yBAAyB,CAC7B,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,WAAW,CAAC;IAiCvB;;OAEG;IACG,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAOnE;;OAEG;IACG,aAAa,CACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,SAAI,EACT,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,WAAW,CAAC;YAUT,UAAU;YAiBV,gBAAgB;YAyBhB,YAAY;YAqDZ,gBAAgB;CA+C/B"}

package/dist/causal/traversal/subgraph.js

@@ -0,0 +1,226 @@
+/**
+ * Causal Subgraph Extractor
+ *
+ * Extracts subgraphs from the causal graph containing
+ * specific memories and their connections.
+ *
+ * @module causal/traversal/subgraph
+ */
+/**
+ * Default subgraph options
+ */
+const DEFAULT_OPTIONS = {
+    includeInternalEdges: true,
+    includeNeighbors: false,
+    neighborDepth: 1,
+    minStrength: 0.3,
+    relationTypes: [],
+    includeInferred: true,
+    maxNodes: 100,
+};
+/**
+ * Causal subgraph extractor
+ */
+export class CausalSubgraphExtractor {
+    causalStorage;
+    memoryStorage;
+    constructor(causalStorage, memoryStorage) {
+        this.causalStorage = causalStorage;
+        this.memoryStorage = memoryStorage;
+    }
+    /**
+     * Extract a subgraph containing the specified memories
+     */
+    async extractSubgraph(memoryIds, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const nodeMap = new Map();
+        const edgeMap = new Map();
+        // Add nodes for specified memories
+        for (const memoryId of memoryIds) {
+            if (nodeMap.size >= opts.maxNodes)
+                break;
+            const node = await this.createNode(memoryId, 0);
+            if (node) {
+                nodeMap.set(memoryId, node);
+            }
+        }
+        // Get internal edges (between specified memories)
+        if (opts.includeInternalEdges) {
+            await this.addInternalEdges(memoryIds, edgeMap, opts);
+        }
+        // Include neighbors if requested
+        if (opts.includeNeighbors) {
+            await this.addNeighbors(memoryIds, nodeMap, edgeMap, opts);
+        }
+        // Update nodes with their edges
+        const nodes = Array.from(nodeMap.values());
+        const edges = Array.from(edgeMap.values());
+        for (const node of nodes) {
+            node.incomingEdges = edges.filter(e => e.targetId === node.memoryId);
+            node.outgoingEdges = edges.filter(e => e.sourceId === node.memoryId);
+        }
+        // Compute chain confidence
+        const chainConfidence = edges.length > 0
+            ? edges.reduce((sum, e) => sum + e.strength, 0) / edges.length
+            : 1.0;
+        return {
+            rootId: memoryIds[0] || '',
+            direction: 'bidirectional',
+            nodes,
+            edges,
+            maxDepth: Math.max(0, ...nodes.map(n => n.depth)),
+            totalMemories: nodes.length,
+            chainConfidence,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    /**
+     * Extract the connected component containing a memory
+     */
+    async extractConnectedComponent(memoryId, options) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const visited = new Set();
+        const nodeMap = new Map();
+        const edgeMap = new Map();
+        await this.exploreComponent(memoryId, 0, visited, nodeMap, edgeMap, opts);
+        const nodes = Array.from(nodeMap.values());
+        const edges = Array.from(edgeMap.values());
+        // Update nodes with their edges
+        for (const node of nodes) {
+            node.incomingEdges = edges.filter(e => e.targetId === node.memoryId);
+            node.outgoingEdges = edges.filter(e => e.sourceId === node.memoryId);
+        }
+        const chainConfidence = edges.length > 0
+            ? edges.reduce((sum, e) => sum + e.strength, 0) / edges.length
+            : 1.0;
+        return {
+            rootId: memoryId,
+            direction: 'bidirectional',
+            nodes,
+            edges,
+            maxDepth: Math.max(0, ...nodes.map(n => n.depth)),
+            totalMemories: nodes.length,
+            chainConfidence,
+            computedAt: new Date().toISOString(),
+        };
+    }
+    /**
+     * Get the induced subgraph (only edges between specified nodes)
+     */
+    async getInducedSubgraph(memoryIds) {
+        return this.extractSubgraph(memoryIds, {
+            includeInternalEdges: true,
+            includeNeighbors: false,
+        });
+    }
+    /**
+     * Get ego network (node + immediate neighbors)
+     */
+    async getEgoNetwork(memoryId, depth = 1, options) {
+        return this.extractSubgraph([memoryId], {
+            ...options,
+            includeNeighbors: true,
+            neighborDepth: depth,
+        });
+    }
+    // Private helpers
+    async createNode(memoryId, depth) {
+        const memory = await this.memoryStorage.read(memoryId);
+        if (!memory)
+            return null;
+        return {
+            memoryId,
+            memoryType: memory.type,
+            summary: memory.summary,
+            depth,
+            incomingEdges: [],
+            outgoingEdges: [],
+        };
+    }
+    async addInternalEdges(memoryIds, edgeMap, options) {
+        const idSet = new Set(memoryIds);
+        for (const memoryId of memoryIds) {
+            const queryOpts = {
+                minStrength: options.minStrength,
+                includeInferred: options.includeInferred,
+            };
+            if (options.relationTypes.length > 0) {
+                queryOpts.relationTypes = options.relationTypes;
+            }
+            const edges = await this.causalStorage.getEdgesFrom(memoryId, queryOpts);
+            for (const edge of edges) {
+                if (idSet.has(edge.targetId) && !edgeMap.has(edge.id)) {
+                    edgeMap.set(edge.id, edge);
+                }
+            }
+        }
+    }
+    async addNeighbors(memoryIds, nodeMap, edgeMap, options) {
+        const toExplore = [...memoryIds];
+        const explored = new Set(memoryIds);
+        for (let depth = 1; depth <= options.neighborDepth; depth++) {
+            const nextLevel = [];
+            for (const memoryId of toExplore) {
+                if (nodeMap.size >= options.maxNodes)
+                    break;
+                const queryOpts = {
+                    minStrength: options.minStrength,
+                    includeInferred: options.includeInferred,
+                };
+                if (options.relationTypes.length > 0) {
+                    queryOpts.relationTypes = options.relationTypes;
+                }
+                // Get outgoing edges
+                const outgoing = await this.causalStorage.getEdgesFrom(memoryId, queryOpts);
+                // Get incoming edges
+                const incoming = await this.causalStorage.getEdgesTo(memoryId, queryOpts);
+                for (const edge of [...outgoing, ...incoming]) {
+                    if (!edgeMap.has(edge.id)) {
+                        edgeMap.set(edge.id, edge);
+                    }
+                    const neighborId = edge.sourceId === memoryId ? edge.targetId : edge.sourceId;
+                    if (!explored.has(neighborId) && nodeMap.size < options.maxNodes) {
+                        explored.add(neighborId);
+                        nextLevel.push(neighborId);
+                        const node = await this.createNode(neighborId, depth);
+                        if (node) {
+                            nodeMap.set(neighborId, node);
+                        }
+                    }
+                }
+            }
+            toExplore.length = 0;
+            toExplore.push(...nextLevel);
+        }
+    }
+    async exploreComponent(memoryId, depth, visited, nodeMap, edgeMap, options) {
+        if (visited.has(memoryId))
+            return;
+        if (nodeMap.size >= options.maxNodes)
+            return;
+        visited.add(memoryId);
+        const node = await this.createNode(memoryId, depth);
+        if (node) {
+            nodeMap.set(memoryId, node);
+        }
+        // Get all edges for this memory
+        const queryOpts = {
+            minStrength: options.minStrength,
+            includeInferred: options.includeInferred,
+        };
+        if (options.relationTypes.length > 0) {
+            queryOpts.relationTypes = options.relationTypes;
+        }
+        const edges = await this.causalStorage.getEdgesFor(memoryId, queryOpts);
+        for (const edge of edges) {
+            if (!edgeMap.has(edge.id)) {
+                edgeMap.set(edge.id, edge);
+            }
+            const neighborId = edge.sourceId === memoryId ? edge.targetId : edge.sourceId;
+            if (!visited.has(neighborId)) {
+                await this.exploreComponent(neighborId, depth + 1, visited, nodeMap, edgeMap, options);
+            }
+        }
+    }
+}
+//# sourceMappingURL=subgraph.js.map

package/dist/causal/traversal/subgraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.js","sourceRoot":"","sources":["../../../src/causal/traversal/subgraph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA+BH;;GAEG;AACH,MAAM,eAAe,GAA8B;IACjD,oBAAoB,EAAE,IAAI;IAC1B,gBAAgB,EAAE,KAAK;IACvB,aAAa,EAAE,CAAC;IAChB,WAAW,EAAE,GAAG;IAChB,aAAa,EAAE,EAAE;IACjB,eAAe,EAAE,IAAI;IACrB,QAAQ,EAAE,GAAG;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,uBAAuB;IAExB;IACA;IAFV,YACU,aAA6B,EAC7B,aAA6B;QAD7B,kBAAa,GAAb,aAAa,CAAgB;QAC7B,kBAAa,GAAb,aAAa,CAAgB;IACpC,CAAC;IAEJ;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,SAAmB,EACnB,OAAyB;QAEzB,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAE9C,mCAAmC;QACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAAE,MAAM;YAEzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAChD,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC9B,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;QAED,iCAAiC;QACjC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7D,CAAC;QAED,gCAAgC;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrE,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvE,CAAC;QAED,2BAA2B;QAC3B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;YACtC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;YAC9D,CAAC,CAAC,GAAG,CAAC;QAER,OAAO;YACL,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE;YAC1B,SAAS,EAAE,eAAe;YAC1B,KAAK;YACL,KAAK;YACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,eAAe;YACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,yBAAyB,CAC7B,QAAgB,EAChB,OAAyB;QAEzB,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAE9C,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAE1E,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAE3C,gCAAgC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrE,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;YACtC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;YAC9D,CAAC,CAAC,GAAG,CAAC;QAER,OAAO;YACL,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,eAAe;YAC1B,KAAK;YACL,KAAK;YACL,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,eAAe;YACf,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CAAC,SAAmB;QAC1C,OAAO,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE;YACrC,oBAAoB,EAAE,IAAI;YAC1B,gBAAgB,EAAE,KAAK;SACxB,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,QAAgB,EAChB,KAAK,GAAG,CAAC,EACT,OAAyB;QAEzB,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,QAAQ,CAAC,EAAE;YACtC,GAAG,OAAO;YACV,gBAAgB,EAAE,IAAI;YACtB,aAAa,EAAE,KAAK;SACrB,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;IAEV,KAAK,CAAC,UAAU,CACtB,QAAgB,EAChB,KAAa;QAEb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAEzB,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,KAAK;YACL,aAAa,EAAE,EAAE;YACjB,aAAa,EAAE,EAAE;SAClB,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,gBAAgB,CAC5B,SAAmB,EACnB,OAAgC,EAChC,OAAkC;QAElC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;QAEjC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,SAAS,GAAyD;gBACtE,WAAW,EAAE,OAAO,CAAC,WAAW;gBAChC,eAAe,EAAE,OAAO,CAAC,eAAe;aACzC,CAAC;YACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;YAClD,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEzE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,YAAY,CACxB,SAAmB,EACnB,OAAgC,EAChC,OAAgC,EAChC,OAAkC;QAElC,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;QAEpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAa,EAAE,CAAC;YAE/B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,QAAQ;oBAAE,MAAM;gBAE5C,MAAM,SAAS,GAAyD;oBACtE,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,eAAe,EAAE,OAAO,CAAC,eAAe;iBACzC,CAAC;gBACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;gBAClD,CAAC;gBAED,qBAAqB;gBACrB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAE5E,qBAAqB;gBACrB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAE1E,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;oBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAC7B,CAAC;oBAED,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;oBAE9E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;wBACjE,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;wBACzB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAE3B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;wBACtD,IAAI,IAAI,EAAE,CAAC;4BACT,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;wBAChC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;YACrB,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,gBAAgB,CAC5B,QAAgB,EAChB,KAAa,EACb,OAAoB,EACpB,OAAgC,EAChC,OAAgC,EAChC,OAAkC;QAElC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAClC,IAAI,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,QAAQ;YAAE,OAAO;QAE7C,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,gCAAgC;QAChC,MAAM,SAAS,GAAyD;YACtE,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,eAAe,EAAE,OAAO,CAAC,eAAe;SACzC,CAAC;QACF,IAAI,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,SAAS,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAClD,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAExE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7B,CAAC;YAED,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAE9E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,CAAC,gBAAgB,CACzB,UAAU,EACV,KAAK,GAAG,CAAC,EACT,OAAO,EACP,OAAO,EACP,OAAO,EACP,OAAO,CACR,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/causal/traversal/traverser.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Causal Graph Traverser
+ *
+ * Traverses the causal graph to trace origins and effects
+ * of memories, building causal chains for narrative generation.
+ *
+ * @module causal/traversal/traverser
+ */
+import type { CausalChain, CausalNode, GraphTraversalOptions } from '../../types/causal.js';
+import type { ICausalStorage } from '../storage/interface.js';
+import type { IMemoryStorage } from '../../storage/interface.js';
+/**
+ * Causal graph traverser
+ *
+ * Provides methods to traverse the causal graph and build
+ * chains of causally connected memories.
+ */
+export declare class CausalGraphTraverser {
+    private causalStorage;
+    private memoryStorage;
+    constructor(causalStorage: ICausalStorage, memoryStorage: IMemoryStorage);
+    /**
+     * Trace the origins of a memory (what caused it)
+     *
+     * Traverses backwards through the causal graph to find
+     * all memories that contributed to this one.
+     */
+    traceOrigins(memoryId: string, options?: GraphTraversalOptions): Promise<CausalChain>;
+    /**
+     * Trace the effects of a memory (what it caused)
+     *
+     * Traverses forward through the causal graph to find
+     * all memories that were influenced by this one.
+     */
+    traceEffects(memoryId: string, options?: GraphTraversalOptions): Promise<CausalChain>;
+    /**
+     * Trace both origins and effects
+     */
+    traceBidirectional(memoryId: string, options?: GraphTraversalOptions): Promise<CausalChain>;
+    /**
+     * Get immediate neighbors (one hop)
+     */
+    getNeighbors(memoryId: string, options?: GraphTraversalOptions): Promise<{
+        incoming: CausalNode[];
+        outgoing: CausalNode[];
+    }>;
+    private traverseBackward;
+    private traverseForward;
+    private createNode;
+    private computeChainConfidence;
+    private deduplicateNodes;
+}
+//# sourceMappingURL=traverser.d.ts.map

package/dist/causal/traversal/traverser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverser.d.ts","sourceRoot":"","sources":["../../../src/causal/traversal/traverser.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAEV,WAAW,EACX,UAAU,EACV,qBAAqB,EACtB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAcjE;;;;;GAKG;AACH,qBAAa,oBAAoB;IAE7B,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,aAAa;gBADb,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc;IAGvC;;;;;OAKG;IACG,YAAY,CAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,qBAAqB,GAC9B,OAAO,CAAC,WAAW,CAAC;IAwBvB;;;;;OAKG;IACG,YAAY,CAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,qBAAqB,GAC9B,OAAO,CAAC,WAAW,CAAC;IAwBvB;;OAEG;IACG,kBAAkB,CACtB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,qBAAqB,GAC9B,OAAO,CAAC,WAAW,CAAC;IAmCvB;;OAEG;IACG,YAAY,CAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,qBAAqB,GAC9B,OAAO,CAAC;QAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;QAAC,QAAQ,EAAE,UAAU,EAAE,CAAA;KAAE,CAAC;YAgChD,gBAAgB;YAwDhB,eAAe;YAwDf,UAAU;IAmBxB,OAAO,CAAC,sBAAsB;IAa9B,OAAO,CAAC,gBAAgB;CAYzB"}