kemdicode-mcp 1.15.0

package/dist/loci/graph-traversal.js

@@ -0,0 +1,291 @@
+/**
+ * KemdiCode MCP Server
+ * Copyright (C) 2025-2026 Kemdi Sp. z o.o.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <https://www.gnu.org/licenses/>.
+ */
+import { getGraphStorage } from './graph-storage.js';
+/**
+ * Default traversal options
+ */
+const DEFAULT_TRAVERSAL_OPTIONS = {
+    maxDepth: 5,
+    maxNodes: 100,
+    trackVisited: true,
+};
+/**
+ * Generic graph traversal (shared logic for BFS and DFS)
+ */
+async function traverse(startNodeId, strategy, options = {}) {
+    const opts = { ...DEFAULT_TRAVERSAL_OPTIONS, ...options };
+    const storage = getGraphStorage();
+    const visited = new Set();
+    const frontier = [];
+    const result = {
+        nodes: [],
+        edges: [],
+        maxDepthReached: 0,
+        nodesVisited: 0,
+        paths: new Map(),
+    };
+    const startNode = await storage.getNode(startNodeId);
+    if (!startNode)
+        return result;
+    frontier.push({ nodeId: startNodeId, depth: 0, path: [startNodeId], edgePath: [] });
+    if (strategy === 'bfs')
+        visited.add(startNodeId);
+    while (frontier.length > 0 && result.nodesVisited < opts.maxNodes) {
+        // BFS: shift from front, DFS: pop from back
+        const current = strategy === 'bfs' ? frontier.shift() : frontier.pop();
+        // DFS checks visited on dequeue
+        if (strategy === 'dfs') {
+            if (visited.has(current.nodeId))
+                continue;
+            visited.add(current.nodeId);
+        }
+        const node = await storage.getNode(current.nodeId);
+        if (!node)
+            continue;
+        if (opts.nodeTypes && !opts.nodeTypes.includes(node.type))
+            continue;
+        result.nodes.push(node);
+        result.nodesVisited++;
+        result.maxDepthReached = Math.max(result.maxDepthReached, current.depth);
+        result.paths.set(current.nodeId, {
+            nodeIds: current.path,
+            edgeIds: current.edgePath,
+            totalWeight: 0,
+        });
+        if (current.depth >= opts.maxDepth)
+            continue;
+        const edges = await storage.getOutgoingEdges(current.nodeId);
+        // DFS reverses edge order to process in natural order
+        const edgeList = strategy === 'dfs' ? [...edges].reverse() : edges;
+        for (const edge of edgeList) {
+            if (opts.edgeTypes && !opts.edgeTypes.includes(edge.type))
+                continue;
+            if (opts.minEdgeWeight !== undefined && edge.weight < opts.minEdgeWeight)
+                continue;
+            if (!visited.has(edge.to)) {
+                if (strategy === 'bfs')
+                    visited.add(edge.to);
+                result.edges.push(edge);
+                frontier.push({
+                    nodeId: edge.to,
+                    depth: current.depth + 1,
+                    path: [...current.path, edge.to],
+                    edgePath: [...current.edgePath, edge.id],
+                });
+            }
+        }
+    }
+    return result;
+}
+/**
+ * Breadth-First Search traversal
+ */
+export async function bfs(startNodeId, options = {}) {
+    return traverse(startNodeId, 'bfs', options);
+}
+/**
+ * Depth-First Search traversal
+ */
+export async function dfs(startNodeId, options = {}) {
+    return traverse(startNodeId, 'dfs', options);
+}
+/**
+ * Find shortest path between two nodes (BFS-based)
+ */
+export async function findShortestPath(fromNodeId, toNodeId, options = {}) {
+    const opts = { ...DEFAULT_TRAVERSAL_OPTIONS, ...options };
+    const storage = getGraphStorage();
+    const visited = new Set();
+    const queue = [];
+    queue.push({ nodeId: fromNodeId, path: [fromNodeId], edgePath: [], weight: 0 });
+    visited.add(fromNodeId);
+    while (queue.length > 0) {
+        const current = queue.shift();
+        // Found target
+        if (current.nodeId === toNodeId) {
+            return {
+                nodeIds: current.path,
+                edgeIds: current.edgePath,
+                totalWeight: current.weight,
+                pathType: 'shortest',
+            };
+        }
+        // Don't explore beyond max depth
+        if (current.path.length > opts.maxDepth)
+            continue;
+        // Get outgoing edges
+        const edges = await storage.getOutgoingEdges(current.nodeId);
+        for (const edge of edges) {
+            // Apply edge filters
+            if (opts.edgeTypes && !opts.edgeTypes.includes(edge.type))
+                continue;
+            if (!visited.has(edge.to)) {
+                visited.add(edge.to);
+                queue.push({
+                    nodeId: edge.to,
+                    path: [...current.path, edge.to],
+                    edgePath: [...current.edgePath, edge.id],
+                    weight: current.weight + (1 - edge.weight), // Higher weight = shorter path
+                });
+            }
+        }
+    }
+    return null; // No path found
+}
+/**
+ * Find path from error to solution
+ * Specialized search that follows 'fixes' edges
+ */
+export async function findErrorToSolutionPath(errorNodeId, options = {}) {
+    const storage = getGraphStorage();
+    const opts = { ...DEFAULT_TRAVERSAL_OPTIONS, ...options };
+    // Start from error node
+    const errorNode = await storage.getNode(errorNodeId);
+    if (!errorNode || errorNode.type !== 'error') {
+        return null;
+    }
+    const visited = new Set();
+    const queue = [];
+    queue.push({ nodeId: errorNodeId, path: [errorNodeId], edgePath: [] });
+    visited.add(errorNodeId);
+    // Prefer 'fixes' edges, but also follow 'similar' to find related solutions
+    const preferredEdges = ['fixes', 'similar', 'related_to'];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        // Check if this is a solution node
+        const node = await storage.getNode(current.nodeId);
+        if (node && node.type === 'solution') {
+            return {
+                nodeIds: current.path,
+                edgeIds: current.edgePath,
+                totalWeight: current.path.length,
+                pathType: 'error-to-solution',
+            };
+        }
+        if (current.path.length > opts.maxDepth)
+            continue;
+        // Get edges - check both directions for 'fixes' (solution fixes error)
+        const outEdges = await storage.getOutgoingEdges(current.nodeId);
+        const inEdges = await storage.getIncomingEdges(current.nodeId);
+        // Check incoming 'fixes' edges (solution -> this error)
+        for (const edge of inEdges) {
+            if (edge.type === 'fixes' && !visited.has(edge.from)) {
+                const sourceNode = await storage.getNode(edge.from);
+                if (sourceNode && sourceNode.type === 'solution') {
+                    return {
+                        nodeIds: [...current.path, edge.from],
+                        edgeIds: [...current.edgePath, edge.id],
+                        totalWeight: current.path.length + 1,
+                        pathType: 'error-to-solution',
+                    };
+                }
+            }
+        }
+        // Follow outgoing edges
+        for (const edge of outEdges) {
+            if (preferredEdges.includes(edge.type) && !visited.has(edge.to)) {
+                visited.add(edge.to);
+                queue.push({
+                    nodeId: edge.to,
+                    path: [...current.path, edge.to],
+                    edgePath: [...current.edgePath, edge.id],
+                });
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Find all paths between two nodes (up to a limit)
+ */
+export async function findAllPaths(fromNodeId, toNodeId, maxPaths = 5, options = {}) {
+    const opts = { ...DEFAULT_TRAVERSAL_OPTIONS, ...options };
+    const storage = getGraphStorage();
+    const paths = [];
+    async function explore(currentId, visited, path, edgePath) {
+        if (paths.length >= maxPaths)
+            return;
+        if (path.length > opts.maxDepth)
+            return;
+        if (currentId === toNodeId) {
+            paths.push({
+                nodeIds: path,
+                edgeIds: edgePath,
+                totalWeight: path.length,
+            });
+            return;
+        }
+        const edges = await storage.getOutgoingEdges(currentId);
+        for (const edge of edges) {
+            if (opts.edgeTypes && !opts.edgeTypes.includes(edge.type))
+                continue;
+            if (visited.has(edge.to))
+                continue;
+            visited.add(edge.to);
+            await explore(edge.to, visited, [...path, edge.to], [...edgePath, edge.id]);
+            visited.delete(edge.to);
+        }
+    }
+    const visited = new Set([fromNodeId]);
+    await explore(fromNodeId, visited, [fromNodeId], []);
+    return paths;
+}
+/**
+ * Get subgraph around a node
+ */
+export async function getSubgraph(centerNodeId, radius = 2) {
+    const result = await bfs(centerNodeId, { maxDepth: radius });
+    return {
+        nodes: result.nodes,
+        edges: result.edges,
+    };
+}
+/**
+ * Find nodes connected by specific relationship
+ */
+export async function findByRelationship(nodeId, relationshipType, direction = 'out') {
+    const storage = getGraphStorage();
+    const nodes = [];
+    const seenIds = new Set();
+    if (direction === 'out' || direction === 'both') {
+        const outEdges = await storage.getOutgoingEdges(nodeId);
+        for (const edge of outEdges) {
+            if (edge.type === relationshipType && !seenIds.has(edge.to)) {
+                const node = await storage.getNode(edge.to);
+                if (node) {
+                    nodes.push(node);
+                    seenIds.add(edge.to);
+                }
+            }
+        }
+    }
+    if (direction === 'in' || direction === 'both') {
+        const inEdges = await storage.getIncomingEdges(nodeId);
+        for (const edge of inEdges) {
+            if (edge.type === relationshipType && !seenIds.has(edge.from)) {
+                const node = await storage.getNode(edge.from);
+                if (node) {
+                    nodes.push(node);
+                    seenIds.add(edge.from);
+                }
+            }
+        }
+    }
+    return nodes;
+}
+//# sourceMappingURL=graph-traversal.js.map

package/dist/loci/graph-traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-traversal.js","sourceRoot":"","sources":["../../src/loci/graph-traversal.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAgBH,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD;;GAEG;AACH,MAAM,yBAAyB,GAAqB;IAClD,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,GAAG;IACb,YAAY,EAAE,IAAI;CACnB,CAAC;AASF;;GAEG;AACH,KAAK,UAAU,QAAQ,CACrB,WAAmB,EACnB,QAAuB,EACvB,UAA4B,EAAE;IAE9B,MAAM,IAAI,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,OAAO,EAAE,CAAC;IAC1D,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAElC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,MAAM,GAAoB;QAC9B,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,eAAe,EAAE,CAAC;QAClB,YAAY,EAAE,CAAC;QACf,KAAK,EAAE,IAAI,GAAG,EAAE;KACjB,CAAC;IAEF,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACrD,IAAI,CAAC,SAAS;QAAE,OAAO,MAAM,CAAC;IAE9B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IACpF,IAAI,QAAQ,KAAK,KAAK;QAAE,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAEjD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,QAAS,EAAE,CAAC;QACnE,4CAA4C;QAC5C,MAAM,OAAO,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAG,CAAC;QAEzE,gCAAgC;QAChC,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;YACvB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC1C,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAEpE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,MAAM,CAAC,YAAY,EAAE,CAAC;QACtB,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAEzE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE;YAC/B,OAAO,EAAE,OAAO,CAAC,IAAI;YACrB,OAAO,EAAE,OAAO,CAAC,QAAQ;YACzB,WAAW,EAAE,CAAC;SACf,CAAC,CAAC;QAEH,IAAI,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,QAAS;YAAE,SAAS;QAE9C,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC7D,sDAAsD;QACtD,MAAM,QAAQ,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAEnE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YACpE,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa;gBAAE,SAAS;YAEnF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,IAAI,QAAQ,KAAK,KAAK;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAExB,QAAQ,CAAC,IAAI,CAAC;oBACZ,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;oBACxB,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAChC,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;iBACzC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,GAAG,CACvB,WAAmB,EACnB,UAA4B,EAAE;IAE9B,OAAO,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,GAAG,CACvB,WAAmB,EACnB,UAA4B,EAAE;IAE9B,OAAO,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,UAAkB,EAClB,QAAgB,EAChB,UAA4B,EAAE;IAE9B,MAAM,IAAI,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,OAAO,EAAE,CAAC;IAC1D,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAElC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAkF,EAAE,CAAC;IAEhG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE/B,eAAe;QACf,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO;gBACL,OAAO,EAAE,OAAO,CAAC,IAAI;gBACrB,OAAO,EAAE,OAAO,CAAC,QAAQ;gBACzB,WAAW,EAAE,OAAO,CAAC,MAAM;gBAC3B,QAAQ,EAAE,UAAU;aACrB,CAAC;QACJ,CAAC;QAED,iCAAiC;QACjC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAS;YAAE,SAAS;QAEnD,qBAAqB;QACrB,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,qBAAqB;YACrB,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAEpE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAErB,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAChC,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;oBACxC,MAAM,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,+BAA+B;iBAC5E,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,WAAmB,EACnB,UAA4B,EAAE;IAE9B,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,OAAO,EAAE,CAAC;IAE1D,wBAAwB;IACxB,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACrD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAkE,EAAE,CAAC;IAEhF,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IACvE,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAEzB,4EAA4E;IAC5E,MAAM,cAAc,GAAoB,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IAE3E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE/B,mCAAmC;QACnC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACrC,OAAO;gBACL,OAAO,EAAE,OAAO,CAAC,IAAI;gBACrB,OAAO,EAAE,OAAO,CAAC,QAAQ;gBACzB,WAAW,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM;gBAChC,QAAQ,EAAE,mBAAmB;aAC9B,CAAC;QACJ,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAS;YAAE,SAAS;QAEnD,uEAAuE;QACvE,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAE/D,wDAAwD;QACxD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpD,IAAI,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;oBACjD,OAAO;wBACL,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;wBACrC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;wBACvC,WAAW,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;wBACpC,QAAQ,EAAE,mBAAmB;qBAC9B,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAChC,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;iBACzC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,UAAkB,EAClB,QAAgB,EAChB,WAAmB,CAAC,EACpB,UAA4B,EAAE;IAE9B,MAAM,IAAI,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,OAAO,EAAE,CAAC;IAC1D,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAClC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,KAAK,UAAU,OAAO,CACpB,SAAiB,EACjB,OAAoB,EACpB,IAAc,EACd,QAAkB;QAElB,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;YAAE,OAAO;QACrC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAS;YAAE,OAAO;QAEzC,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC;gBACT,OAAO,EAAE,IAAI;gBACb,OAAO,EAAE,QAAQ;gBACjB,WAAW,EAAE,IAAI,CAAC,MAAM;aACzB,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAExD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YACpE,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEnC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5E,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,CAAC,CAAC;IAC9C,MAAM,OAAO,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC;IAErD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,YAAoB,EACpB,SAAiB,CAAC;IAElB,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,YAAY,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IAE7D,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;KACpB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,MAAc,EACd,gBAA+B,EAC/B,YAAmC,KAAK;IAExC,MAAM,OAAO,GAAG,eAAe,EAAE,CAAC;IAClC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC5C,IAAI,IAAI,EAAE,CAAC;oBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACvD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC9C,IAAI,IAAI,EAAE,CAAC;oBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/loci/index.d.ts

@@ -0,0 +1,30 @@
+/**
+ * KemdiCode MCP Server
+ * Copyright (C) 2025-2026 Kemdi Sp. z o.o.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <https://www.gnu.org/licenses/>.
+ */
+/**
+ * Loci Palace Memory Graph Module
+ *
+ * Provides a knowledge graph connecting files, errors, solutions,
+ * and tools with mnemonic associations using the Method of Loci.
+ */
+export type { GraphNodeType, GraphEdgeType, GraphNode, GraphEdge, Loci, LociCategory, LociTemplate, ToolSequence, GraphPath, GraphQueryOptions, TraversalOptions, TraversalResult, LociRecall, SequenceRecommendation, AutoPopulationEvent, AutoPopulationConfig, } from './types.js';
+export { LOCI_KEYS, LOCI_TEMPLATES, DEFAULT_AUTO_POPULATION_CONFIG } from './types.js';
+export { GraphStorage, getGraphStorage, resetGraphStorage, type GraphStorageConfig, } from './graph-storage.js';
+export { bfs, dfs, findShortestPath, findErrorToSolutionPath, findAllPaths, getSubgraph, findByRelationship, } from './graph-traversal.js';
+export { LociManager, getLociManager, resetLociManager, type LociManagerConfig, } from './loci-manager.js';
+export { SequenceTracker, getSequenceTracker, resetSequenceTracker, type SequenceTrackerConfig, } from './sequence-tracker.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/loci/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/loci/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH;;;;;GAKG;AAGH,YAAY,EACV,aAAa,EACb,aAAa,EACb,SAAS,EACT,SAAS,EACT,IAAI,EACJ,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,SAAS,EACT,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,sBAAsB,EACtB,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,8BAA8B,EAAE,MAAM,YAAY,CAAC;AAGvF,OAAO,EACL,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,KAAK,kBAAkB,GACxB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,GAAG,EACH,GAAG,EACH,gBAAgB,EAChB,uBAAuB,EACvB,YAAY,EACZ,WAAW,EACX,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACL,WAAW,EACX,cAAc,EACd,gBAAgB,EAChB,KAAK,iBAAiB,GACvB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,oBAAoB,EACpB,KAAK,qBAAqB,GAC3B,MAAM,uBAAuB,CAAC"}

package/dist/loci/index.js

@@ -0,0 +1,27 @@
+/**
+ * KemdiCode MCP Server
+ * Copyright (C) 2025-2026 Kemdi Sp. z o.o.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <https://www.gnu.org/licenses/>.
+ */
+export { LOCI_KEYS, LOCI_TEMPLATES, DEFAULT_AUTO_POPULATION_CONFIG } from './types.js';
+// Graph storage
+export { GraphStorage, getGraphStorage, resetGraphStorage, } from './graph-storage.js';
+// Graph traversal
+export { bfs, dfs, findShortestPath, findErrorToSolutionPath, findAllPaths, getSubgraph, findByRelationship, } from './graph-traversal.js';
+// Loci manager
+export { LociManager, getLociManager, resetLociManager, } from './loci-manager.js';
+// Sequence tracker
+export { SequenceTracker, getSequenceTracker, resetSequenceTracker, } from './sequence-tracker.js';
+//# sourceMappingURL=index.js.map

package/dist/loci/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/loci/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AA6BH,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,8BAA8B,EAAE,MAAM,YAAY,CAAC;AAEvF,gBAAgB;AAChB,OAAO,EACL,YAAY,EACZ,eAAe,EACf,iBAAiB,GAElB,MAAM,oBAAoB,CAAC;AAE5B,kBAAkB;AAClB,OAAO,EACL,GAAG,EACH,GAAG,EACH,gBAAgB,EAChB,uBAAuB,EACvB,YAAY,EACZ,WAAW,EACX,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAE9B,eAAe;AACf,OAAO,EACL,WAAW,EACX,cAAc,EACd,gBAAgB,GAEjB,MAAM,mBAAmB,CAAC;AAE3B,mBAAmB;AACnB,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,oBAAoB,GAErB,MAAM,uBAAuB,CAAC"}

package/dist/loci/loci-manager.d.ts

@@ -0,0 +1,119 @@
+/**
+ * KemdiCode MCP Server
+ * Copyright (C) 2025-2026 Kemdi Sp. z o.o.
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <https://www.gnu.org/licenses/>.
+ */
+/**
+ * Loci Manager
+ *
+ * Manages mnemonic locations (loci) in the memory palace.
+ */
+import { RedisBackedService } from '../infrastructure/redis/redis-backed-service.js';
+import type { Loci, LociCategory, LociRecall, LociTemplate } from './types.js';
+/**
+ * Loci Manager configuration
+ */
+export interface LociManagerConfig {
+    /** TTL for loci in seconds */
+    lociTtl?: number;
+}
+/**
+ * Loci Manager
+ */
+export declare class LociManager extends RedisBackedService {
+    protected get serviceName(): string;
+    private config;
+    constructor(config?: LociManagerConfig);
+    /**
+     * Generate a unique loci ID
+     */
+    generateLociId(): string;
+    /**
+     * Create a new loci
+     */
+    createLoci(name: string, description: string, category: LociCategory, sessionId: string, options?: {
+        associations?: string[];
+        icon?: string;
+        color?: string;
+        parentLociId?: string;
+        order?: number;
+    }): Promise<Loci | null>;
+    /**
+     * Create loci from a template
+     */
+    createFromTemplate(templateName: string, sessionId: string, overrides?: Partial<LociTemplate>): Promise<Loci | null>;
+    /**
+     * Get a loci by ID
+     */
+    getLoci(lociId: string): Promise<Loci | null>;
+    /**
+     * Get loci by name
+     */
+    getLociByName(name: string): Promise<Loci | null>;
+    /**
+     * Add a node to a loci
+     */
+    addNodeToLoci(lociId: string, nodeId: string): Promise<boolean>;
+    /**
+     * Remove a node from a loci
+     */
+    removeNodeFromLoci(lociId: string, nodeId: string): Promise<boolean>;
+    /**
+     * Add child loci
+     */
+    private addChildToLoci;
+    /**
+     * Get loci by category
+     */
+    getLociByCategory(category: LociCategory): Promise<Loci[]>;
+    /**
+     * Get loci for a session
+     */
+    getSessionLoci(sessionId: string): Promise<Loci[]>;
+    /**
+     * Walk the memory palace - recall memories from a loci
+     */
+    recall(lociId: string): Promise<LociRecall | null>;
+    /**
+     * Walk the entire palace in order
+     */
+    walkPalace(sessionId: string): Promise<LociRecall[]>;
+    /**
+     * Delete a loci
+     */
+    deleteLoci(lociId: string): Promise<boolean>;
+    /**
+     * Get available templates
+     */
+    getTemplates(): Record<string, LociTemplate>;
+    /**
+     * Serialize loci for Redis
+     */
+    private serializeLoci;
+    /**
+     * Parse loci from Redis data
+     */
+    private parseLoci;
+    private safeJsonParse;
+}
+/**
+ * Get the global loci manager
+ */
+export declare function getLociManager(): LociManager;
+/**
+ * Reset the global loci manager (for testing)
+ */
+export declare function resetLociManager(): void;
+//# sourceMappingURL=loci-manager.d.ts.map

package/dist/loci/loci-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loci-manager.d.ts","sourceRoot":"","sources":["../../src/loci/loci-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH;;;;GAIG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,iDAAiD,CAAC;AACrF,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAa,YAAY,EAAE,MAAM,YAAY,CAAC;AAK1F;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,8BAA8B;IAC9B,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,qBAAa,WAAY,SAAQ,kBAAkB;IACjD,SAAS,KAAK,WAAW,WAA4B;IACrD,OAAO,CAAC,MAAM,CAAoB;gBAEtB,MAAM,GAAE,iBAAsB;IAO1C;;OAEG;IACH,cAAc,IAAI,MAAM;IAIxB;;OAEG;IACG,UAAU,CACd,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,YAAY,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE;QACP,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,YAAY,CAAC,EAAE,MAAM,CAAC;QACtB,KAAK,CAAC,EAAE,MAAM,CAAC;KACX,GACL,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAiDvB;;OAEG;IACG,kBAAkB,CACtB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,SAAS,GAAE,OAAO,CAAC,YAAY,CAAM,GACpC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAoBvB;;OAEG;IACG,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAkBnD;;OAEG;IACG,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAgBvD;;OAEG;IACG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAoBrE;;OAEG;IACG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAqB1E;;OAEG;YACW,cAAc;IAoB5B;;OAEG;IACG,iBAAiB,CAAC,QAAQ,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAmBhE;;OAEG;IACG,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAmBxD;;OAEG;IACG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IA+DxD;;OAEG;IACG,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAY1D;;OAEG;IACG,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAuClD;;OAEG;IACH,YAAY,IAAI,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC;IAI5C;;OAEG;IACH,OAAO,CAAC,aAAa;IAkBrB;;OAEG;IACH,OAAO,CAAC,SAAS;IAkBjB,OAAO,CAAC,aAAa;CAQtB;AAKD;;GAEG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAK5C;AAED;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,IAAI,CAKvC"}