codeseeker 1.4.0

package/dist/cli/knowledge/graph/managers/graph-traversal-manager.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Graph Traversal Manager
+ * Handles traversal operations and navigation through the graph
+ */
+import { KnowledgeNode, KnowledgeTriad, TraversalQuery, SemanticCluster, RelationType } from '../types';
+import { IGraphStateManager } from './graph-state-manager';
+import { IGraphUtilityService } from '../services/graph-utility-service';
+export interface IGraphTraversalManager {
+    traverse(query: TraversalQuery, stateManager: IGraphStateManager): Promise<{
+        nodes: KnowledgeNode[];
+        path: string[];
+    }>;
+    traverseFromNode(startNodeId: string, maxDepth: number, relationFilter: RelationType[], stateManager: IGraphStateManager): Promise<{
+        nodes: KnowledgeNode[];
+        depth: number;
+    }>;
+    expandSemanticCluster(startNodeId: string, visited: Set<string>, stateManager: IGraphStateManager, utilityService: IGraphUtilityService): Promise<SemanticCluster>;
+    findPath(startId: string, endId: string, stateManager: IGraphStateManager): string[];
+    findAllPaths(startId: string, endId: string, maxDepth: number, stateManager: IGraphStateManager): string[][];
+    findLongestPath(startId: string, stateManager: IGraphStateManager, maxDepth?: number): string[];
+    exploreFromNode(startNodeId: string, explorationDepth: number, stateManager: IGraphStateManager): Promise<{
+        exploredNodes: string[];
+        exploredTriads: string[];
+    }>;
+    randomWalk(startNodeId: string, steps: number, stateManager: IGraphStateManager): string[];
+    extractSubgraph(nodeIds: string[], stateManager: IGraphStateManager): {
+        nodes: KnowledgeNode[];
+        triads: KnowledgeTriad[];
+    };
+    findConnectedComponent(startNodeId: string, stateManager: IGraphStateManager): string[];
+}
+export declare class GraphTraversalManager implements IGraphTraversalManager {
+    private logger;
+    traverse(query: TraversalQuery, stateManager: IGraphStateManager): Promise<{
+        nodes: KnowledgeNode[];
+        path: string[];
+    }>;
+    traverseFromNode(startNodeId: string, maxDepth: number, relationFilter: RelationType[], stateManager: IGraphStateManager): Promise<{
+        nodes: KnowledgeNode[];
+        depth: number;
+    }>;
+    expandSemanticCluster(startNodeId: string, visited: Set<string>, stateManager: IGraphStateManager, utilityService: IGraphUtilityService): Promise<SemanticCluster>;
+    findPath(startId: string, endId: string, stateManager: IGraphStateManager): string[];
+    findAllPaths(startId: string, endId: string, maxDepth: number, stateManager: IGraphStateManager): string[][];
+    findLongestPath(startId: string, stateManager: IGraphStateManager, maxDepth?: number): string[];
+    exploreFromNode(startNodeId: string, explorationDepth: number, stateManager: IGraphStateManager): Promise<{
+        exploredNodes: string[];
+        exploredTriads: string[];
+    }>;
+    randomWalk(startNodeId: string, steps: number, stateManager: IGraphStateManager): string[];
+    extractSubgraph(nodeIds: string[], stateManager: IGraphStateManager): {
+        nodes: KnowledgeNode[];
+        triads: KnowledgeTriad[];
+    };
+    findConnectedComponent(startNodeId: string, stateManager: IGraphStateManager): string[];
+    /**
+     * Breadth-first search with custom node filter
+     */
+    bfsWithFilter(startNodeId: string, nodeFilter: (node: KnowledgeNode) => boolean, maxDepth: number, stateManager: IGraphStateManager): KnowledgeNode[];
+    /**
+     * Depth-first search with custom relation filter
+     */
+    dfsWithRelationFilter(startNodeId: string, relationFilter: (relation: RelationType) => boolean, maxDepth: number, stateManager: IGraphStateManager): string[];
+    /**
+     * Find articulation points (nodes whose removal disconnects the graph)
+     */
+    findArticulationPoints(stateManager: IGraphStateManager): string[];
+    private countConnectedComponents;
+    private countConnectedComponentsWithoutNode;
+    private findConnectedComponentExcludingNode;
+}
+//# sourceMappingURL=graph-traversal-manager.d.ts.map

package/dist/cli/knowledge/graph/managers/graph-traversal-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-traversal-manager.d.ts","sourceRoot":"","sources":["../../../../../src/cli/knowledge/graph/managers/graph-traversal-manager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAAY,MAAM,UAAU,CAAC;AAClH,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,oBAAoB,EAAE,MAAM,mCAAmC,CAAC;AAGzE,MAAM,WAAW,sBAAsB;IAErC,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,YAAY,EAAE,kBAAkB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,IAAI,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACvH,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,cAAc,EAAE,YAAY,EAAE,EAAE,YAAY,EAAE,kBAAkB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAG9K,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,kBAAkB,EAAE,cAAc,EAAE,oBAAoB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAGnK,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE,CAAC;IACrF,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE,EAAE,CAAC;IAC7G,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAGhG,eAAe,CAAC,WAAW,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,OAAO,CAAC;QAAE,aAAa,EAAE,MAAM,EAAE,CAAC;QAAC,cAAc,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACjK,UAAU,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE,CAAC;IAG3F,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,kBAAkB,GAAG;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,MAAM,EAAE,cAAc,EAAE,CAAA;KAAE,CAAC;IAC3H,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE,CAAC;CACzF;AAED,qBAAa,qBAAsB,YAAW,sBAAsB;IAClE,OAAO,CAAC,MAAM,CAAuD;IAE/D,QAAQ,CACZ,KAAK,EAAE,cAAc,EACrB,YAAY,EAAE,kBAAkB,GAC/B,OAAO,CAAC;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,IAAI,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAoBhD,gBAAgB,CACpB,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,YAAY,EAAE,EAC9B,YAAY,EAAE,kBAAkB,GAC/B,OAAO,CAAC;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAwC/C,qBAAqB,CACzB,WAAW,EAAE,MAAM,EACnB,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EACpB,YAAY,EAAE,kBAAkB,EAChC,cAAc,EAAE,oBAAoB,GACnC,OAAO,CAAC,eAAe,CAAC;IAiD3B,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE;IAsCpF,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE,EAAE;IAoC5G,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,EAAE,QAAQ,SAAK,GAAG,MAAM,EAAE;IAmCrF,eAAe,CACnB,WAAW,EAAE,MAAM,EACnB,gBAAgB,EAAE,MAAM,EACxB,YAAY,EAAE,kBAAkB,GAC/B,OAAO,CAAC;QAAE,aAAa,EAAE,MAAM,EAAE,CAAC;QAAC,cAAc,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAiCjE,UAAU,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE;IA2B1F,eAAe,CACb,OAAO,EAAE,MAAM,EAAE,EACjB,YAAY,EAAE,kBAAkB,GAC/B;QAAE,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,MAAM,EAAE,cAAc,EAAE,CAAA;KAAE;IAuBvD,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE;IA2BvF;;OAEG;IACH,aAAa,CACX,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO,EAC5C,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,kBAAkB,GAC/B,aAAa,EAAE;IAqClB;;OAEG;IACH,qBAAqB,CACnB,WAAW,EAAE,MAAM,EACnB,cAAc,EAAE,CAAC,QAAQ,EAAE,YAAY,KAAK,OAAO,EACnD,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,kBAAkB,GAC/B,MAAM,EAAE;IAiCX;;OAEG;IACH,sBAAsB,CAAC,YAAY,EAAE,kBAAkB,GAAG,MAAM,EAAE;IAmBlE,OAAO,CAAC,wBAAwB;IAehC,OAAO,CAAC,mCAAmC;IAe3C,OAAO,CAAC,mCAAmC;CA8B5C"}

package/dist/cli/knowledge/graph/managers/graph-traversal-manager.js

@@ -0,0 +1,414 @@
+"use strict";
+/**
+ * Graph Traversal Manager
+ * Handles traversal operations and navigation through the graph
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphTraversalManager = void 0;
+const types_1 = require("../types");
+const logger_1 = require("../../../../utils/logger");
+class GraphTraversalManager {
+    logger = logger_1.Logger.getInstance().child('GraphTraversalManager');
+    async traverse(query, stateManager) {
+        const startNodeId = query.startNodes[0]; // Use first node for now
+        const maxDepth = query.maxDepth || 5;
+        const relationFilter = query.relations || [];
+        if (!stateManager.getNodes().has(startNodeId)) {
+            throw new Error(`Start node ${startNodeId} not found`);
+        }
+        const result = await this.traverseFromNode(startNodeId, maxDepth, relationFilter, stateManager);
+        // Convert node IDs to actual nodes
+        const nodes = result.nodes;
+        const path = nodes.map(node => node.id);
+        this.logger.debug(`Traversed ${nodes.length} nodes from ${startNodeId} with depth ${result.depth}`);
+        return { nodes, path };
+    }
+    async traverseFromNode(startNodeId, maxDepth, relationFilter, stateManager) {
+        const visited = new Set();
+        const nodes = [];
+        const queue = [{ nodeId: startNodeId, depth: 0 }];
+        let maxDepthReached = 0;
+        while (queue.length > 0) {
+            const { nodeId, depth } = queue.shift();
+            if (visited.has(nodeId) || depth > maxDepth)
+                continue;
+            visited.add(nodeId);
+            maxDepthReached = Math.max(maxDepthReached, depth);
+            const node = stateManager.getNodes().get(nodeId);
+            if (node) {
+                nodes.push(node);
+            }
+            if (depth < maxDepth) {
+                // Find connected nodes through filtered relations
+                const connectedTriads = Array.from(stateManager.getTriads().values())
+                    .filter(triad => {
+                    const isConnected = triad.subject === nodeId || triad.object === nodeId;
+                    const relationAllowed = relationFilter.length === 0 || relationFilter.includes(triad.predicate);
+                    return isConnected && relationAllowed;
+                });
+                for (const triad of connectedTriads) {
+                    const nextNodeId = triad.subject === nodeId ? triad.object : triad.subject;
+                    if (!visited.has(nextNodeId)) {
+                        queue.push({ nodeId: nextNodeId, depth: depth + 1 });
+                    }
+                }
+            }
+        }
+        return { nodes, depth: maxDepthReached };
+    }
+    async expandSemanticCluster(startNodeId, visited, stateManager, utilityService) {
+        const clusterNodes = new Set();
+        const representativeTriads = [];
+        const queue = [startNodeId];
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            clusterNodes.add(nodeId);
+            // Find semantically similar nodes
+            const similarTriads = Array.from(stateManager.getTriads().values()).filter(triad => (triad.subject === nodeId && triad.predicate === types_1.RelationType.IS_SIMILAR_TO) ||
+                (triad.object === nodeId && triad.predicate === types_1.RelationType.IS_SIMILAR_TO) ||
+                (triad.subject === nodeId && triad.predicate === types_1.RelationType.IS_TYPE_OF) ||
+                (triad.object === nodeId && triad.predicate === types_1.RelationType.IS_TYPE_OF));
+            for (const triad of similarTriads) {
+                representativeTriads.push(triad);
+                const relatedNode = triad.subject === nodeId ? triad.object : triad.subject;
+                if (!visited.has(relatedNode)) {
+                    queue.push(relatedNode);
+                }
+            }
+        }
+        const coherenceScore = utilityService.calculateClusterCoherence(Array.from(clusterNodes), stateManager.getTriads());
+        const nodeList = Array.from(clusterNodes);
+        const triadIds = representativeTriads.map(t => t.id);
+        const cluster = {
+            id: utilityService.generateNodeId(types_1.NodeType.CONCEPT, `cluster_${startNodeId}`, 'semantic'),
+            nodes: nodeList,
+            triads: triadIds,
+            semanticScore: coherenceScore,
+            density: triadIds.length / (nodeList.length * (nodeList.length - 1) || 1),
+            // Backward compatibility
+            name: `Semantic Cluster ${startNodeId}`,
+            coherenceScore,
+            representativeTriads
+        };
+        this.logger.debug(`Expanded semantic cluster from ${startNodeId} with ${nodeList.length} nodes`);
+        return cluster;
+    }
+    findPath(startId, endId, stateManager) {
+        if (startId === endId)
+            return [startId];
+        const visited = new Set();
+        const queue = [{ nodeId: startId, path: [startId] }];
+        while (queue.length > 0) {
+            const { nodeId, path } = queue.shift();
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            if (nodeId === endId) {
+                return path;
+            }
+            // Find connected nodes
+            for (const triad of stateManager.getTriads().values()) {
+                let nextNodeId = null;
+                if (triad.subject === nodeId) {
+                    nextNodeId = triad.object;
+                }
+                else if (triad.object === nodeId) {
+                    nextNodeId = triad.subject;
+                }
+                if (nextNodeId && !visited.has(nextNodeId)) {
+                    queue.push({
+                        nodeId: nextNodeId,
+                        path: [...path, nextNodeId]
+                    });
+                }
+            }
+        }
+        return []; // No path found
+    }
+    findAllPaths(startId, endId, maxDepth, stateManager) {
+        const paths = [];
+        const dfs = (currentId, targetId, currentPath, visited, depth) => {
+            if (depth > maxDepth)
+                return;
+            if (currentId === targetId && currentPath.length > 1) {
+                paths.push([...currentPath]);
+                return;
+            }
+            for (const triad of stateManager.getTriads().values()) {
+                let nextNodeId = null;
+                if (triad.subject === currentId) {
+                    nextNodeId = triad.object;
+                }
+                else if (triad.object === currentId) {
+                    nextNodeId = triad.subject;
+                }
+                if (nextNodeId && !visited.has(nextNodeId)) {
+                    visited.add(nextNodeId);
+                    currentPath.push(nextNodeId);
+                    dfs(nextNodeId, targetId, currentPath, visited, depth + 1);
+                    currentPath.pop();
+                    visited.delete(nextNodeId);
+                }
+            }
+        };
+        const visited = new Set([startId]);
+        dfs(startId, endId, [startId], visited, 0);
+        return paths;
+    }
+    findLongestPath(startId, stateManager, maxDepth = 20) {
+        let longestPath = [];
+        const dfs = (currentId, currentPath, visited, depth) => {
+            if (depth > maxDepth)
+                return;
+            if (currentPath.length > longestPath.length) {
+                longestPath = [...currentPath];
+            }
+            for (const triad of stateManager.getTriads().values()) {
+                let nextNodeId = null;
+                if (triad.subject === currentId) {
+                    nextNodeId = triad.object;
+                }
+                else if (triad.object === currentId) {
+                    nextNodeId = triad.subject;
+                }
+                if (nextNodeId && !visited.has(nextNodeId)) {
+                    visited.add(nextNodeId);
+                    currentPath.push(nextNodeId);
+                    dfs(nextNodeId, currentPath, visited, depth + 1);
+                    currentPath.pop();
+                    visited.delete(nextNodeId);
+                }
+            }
+        };
+        const visited = new Set([startId]);
+        dfs(startId, [startId], visited, 0);
+        return longestPath;
+    }
+    async exploreFromNode(startNodeId, explorationDepth, stateManager) {
+        const exploredNodes = new Set();
+        const exploredTriads = new Set();
+        const queue = [{ nodeId: startNodeId, depth: 0 }];
+        while (queue.length > 0) {
+            const { nodeId, depth } = queue.shift();
+            if (exploredNodes.has(nodeId) || depth > explorationDepth)
+                continue;
+            exploredNodes.add(nodeId);
+            if (depth < explorationDepth) {
+                // Find all connected triads
+                for (const triad of stateManager.getTriads().values()) {
+                    if (triad.subject === nodeId || triad.object === nodeId) {
+                        exploredTriads.add(triad.id);
+                        const connectedNodeId = triad.subject === nodeId ? triad.object : triad.subject;
+                        if (!exploredNodes.has(connectedNodeId)) {
+                            queue.push({ nodeId: connectedNodeId, depth: depth + 1 });
+                        }
+                    }
+                }
+            }
+        }
+        return {
+            exploredNodes: Array.from(exploredNodes),
+            exploredTriads: Array.from(exploredTriads)
+        };
+    }
+    randomWalk(startNodeId, steps, stateManager) {
+        const path = [startNodeId];
+        let currentNodeId = startNodeId;
+        for (let i = 0; i < steps; i++) {
+            // Find all neighbors
+            const neighbors = [];
+            for (const triad of stateManager.getTriads().values()) {
+                if (triad.subject === currentNodeId) {
+                    neighbors.push(triad.object);
+                }
+                else if (triad.object === currentNodeId) {
+                    neighbors.push(triad.subject);
+                }
+            }
+            if (neighbors.length === 0)
+                break; // No more neighbors
+            // Choose random neighbor
+            const randomIndex = Math.floor(Math.random() * neighbors.length);
+            currentNodeId = neighbors[randomIndex];
+            path.push(currentNodeId);
+        }
+        return path;
+    }
+    extractSubgraph(nodeIds, stateManager) {
+        const nodeSet = new Set(nodeIds);
+        const nodes = [];
+        const triads = [];
+        // Collect nodes
+        for (const nodeId of nodeIds) {
+            const node = stateManager.getNodes().get(nodeId);
+            if (node) {
+                nodes.push(node);
+            }
+        }
+        // Collect triads that connect the nodes
+        for (const triad of stateManager.getTriads().values()) {
+            if (nodeSet.has(triad.subject) && nodeSet.has(triad.object)) {
+                triads.push(triad);
+            }
+        }
+        return { nodes, triads };
+    }
+    findConnectedComponent(startNodeId, stateManager) {
+        const component = [];
+        const visited = new Set();
+        const queue = [startNodeId];
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            component.push(nodeId);
+            // Find all directly connected nodes
+            for (const triad of stateManager.getTriads().values()) {
+                if (triad.subject === nodeId && !visited.has(triad.object)) {
+                    queue.push(triad.object);
+                }
+                else if (triad.object === nodeId && !visited.has(triad.subject)) {
+                    queue.push(triad.subject);
+                }
+            }
+        }
+        return component;
+    }
+    // Advanced traversal patterns
+    /**
+     * Breadth-first search with custom node filter
+     */
+    bfsWithFilter(startNodeId, nodeFilter, maxDepth, stateManager) {
+        const result = [];
+        const visited = new Set();
+        const queue = [{ nodeId: startNodeId, depth: 0 }];
+        while (queue.length > 0) {
+            const { nodeId, depth } = queue.shift();
+            if (visited.has(nodeId) || depth > maxDepth)
+                continue;
+            visited.add(nodeId);
+            const node = stateManager.getNodes().get(nodeId);
+            if (node && nodeFilter(node)) {
+                result.push(node);
+            }
+            if (depth < maxDepth) {
+                // Add neighbors to queue
+                for (const triad of stateManager.getTriads().values()) {
+                    let nextNodeId = null;
+                    if (triad.subject === nodeId) {
+                        nextNodeId = triad.object;
+                    }
+                    else if (triad.object === nodeId) {
+                        nextNodeId = triad.subject;
+                    }
+                    if (nextNodeId && !visited.has(nextNodeId)) {
+                        queue.push({ nodeId: nextNodeId, depth: depth + 1 });
+                    }
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Depth-first search with custom relation filter
+     */
+    dfsWithRelationFilter(startNodeId, relationFilter, maxDepth, stateManager) {
+        const result = [];
+        const visited = new Set();
+        const dfs = (nodeId, depth) => {
+            if (visited.has(nodeId) || depth > maxDepth)
+                return;
+            visited.add(nodeId);
+            result.push(nodeId);
+            if (depth < maxDepth) {
+                for (const triad of stateManager.getTriads().values()) {
+                    if (!relationFilter(triad.predicate))
+                        continue;
+                    let nextNodeId = null;
+                    if (triad.subject === nodeId) {
+                        nextNodeId = triad.object;
+                    }
+                    else if (triad.object === nodeId) {
+                        nextNodeId = triad.subject;
+                    }
+                    if (nextNodeId && !visited.has(nextNodeId)) {
+                        dfs(nextNodeId, depth + 1);
+                    }
+                }
+            }
+        };
+        dfs(startNodeId, 0);
+        return result;
+    }
+    /**
+     * Find articulation points (nodes whose removal disconnects the graph)
+     */
+    findArticulationPoints(stateManager) {
+        const articulationPoints = [];
+        const nodeIds = Array.from(stateManager.getNodes().keys());
+        for (const nodeId of nodeIds) {
+            // Count connected components before removal
+            const componentsBefore = this.countConnectedComponents(stateManager);
+            // Temporarily remove node and count components
+            const componentsAfter = this.countConnectedComponentsWithoutNode(nodeId, stateManager);
+            if (componentsAfter > componentsBefore) {
+                articulationPoints.push(nodeId);
+            }
+        }
+        return articulationPoints;
+    }
+    countConnectedComponents(stateManager) {
+        const visited = new Set();
+        let components = 0;
+        for (const nodeId of stateManager.getNodes().keys()) {
+            if (!visited.has(nodeId)) {
+                const component = this.findConnectedComponent(nodeId, stateManager);
+                component.forEach(id => visited.add(id));
+                components++;
+            }
+        }
+        return components;
+    }
+    countConnectedComponentsWithoutNode(excludeNodeId, stateManager) {
+        const visited = new Set([excludeNodeId]); // Exclude the node
+        let components = 0;
+        for (const nodeId of stateManager.getNodes().keys()) {
+            if (!visited.has(nodeId)) {
+                const component = this.findConnectedComponentExcludingNode(nodeId, excludeNodeId, stateManager);
+                component.forEach(id => visited.add(id));
+                components++;
+            }
+        }
+        return components;
+    }
+    findConnectedComponentExcludingNode(startNodeId, excludeNodeId, stateManager) {
+        const component = [];
+        const visited = new Set([excludeNodeId]); // Start with excluded node as visited
+        const queue = [startNodeId];
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            component.push(nodeId);
+            // Find connected nodes (excluding the excluded node)
+            for (const triad of stateManager.getTriads().values()) {
+                if (triad.subject === excludeNodeId || triad.object === excludeNodeId)
+                    continue;
+                if (triad.subject === nodeId && !visited.has(triad.object)) {
+                    queue.push(triad.object);
+                }
+                else if (triad.object === nodeId && !visited.has(triad.subject)) {
+                    queue.push(triad.subject);
+                }
+            }
+        }
+        return component;
+    }
+}
+exports.GraphTraversalManager = GraphTraversalManager;
+//# sourceMappingURL=graph-traversal-manager.js.map

package/dist/cli/knowledge/graph/managers/graph-traversal-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-traversal-manager.js","sourceRoot":"","sources":["../../../../../src/cli/knowledge/graph/managers/graph-traversal-manager.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,oCAAkH;AAGlH,qDAAkD;AAwBlD,MAAa,qBAAqB;IACxB,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAErE,KAAK,CAAC,QAAQ,CACZ,KAAqB,EACrB,YAAgC;QAEhC,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,yBAAyB;QAClE,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;QACrC,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;QAE7C,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,cAAc,WAAW,YAAY,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;QAEhG,mCAAmC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAExC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,KAAK,CAAC,MAAM,eAAe,WAAW,eAAe,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAEpG,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,gBAAgB,CACpB,WAAmB,EACnB,QAAgB,EAChB,cAA8B,EAC9B,YAAgC;QAEhC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,KAAK,GAAwC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACvF,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEzC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAEtD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YAEnD,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;YAED,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,kDAAkD;gBAClD,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,CAAC;qBAClE,MAAM,CAAC,KAAK,CAAC,EAAE;oBACd,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC;oBACxE,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;oBAChG,OAAO,WAAW,IAAI,eAAe,CAAC;gBACxC,CAAC,CAAC,CAAC;gBAEL,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;oBACpC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;oBAC3E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,qBAAqB,CACzB,WAAmB,EACnB,OAAoB,EACpB,YAAgC,EAChC,cAAoC;QAEpC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,MAAM,oBAAoB,GAAqB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAE5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAElC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEzB,kCAAkC;YAClC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CACjF,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,oBAAY,CAAC,aAAa,CAAC;gBAC5E,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,oBAAY,CAAC,aAAa,CAAC;gBAC3E,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,oBAAY,CAAC,UAAU,CAAC;gBACzE,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,oBAAY,CAAC,UAAU,CAAC,CACzE,CAAC;YAEF,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;gBAClC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjC,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;gBAC5E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,cAAc,GAAG,cAAc,CAAC,yBAAyB,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC;QACpH,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAErD,MAAM,OAAO,GAAoB;YAC/B,EAAE,EAAE,cAAc,CAAC,cAAc,CAAC,gBAAQ,CAAC,OAAO,EAAE,WAAW,WAAW,EAAE,EAAE,UAAU,CAAC;YACzF,KAAK,EAAE,QAAQ;YACf,MAAM,EAAE,QAAQ;YAChB,aAAa,EAAE,cAAc;YAC7B,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,yBAAyB;YACzB,IAAI,EAAE,oBAAoB,WAAW,EAAE;YACvC,cAAc;YACd,oBAAoB;SACrB,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kCAAkC,WAAW,SAAS,QAAQ,CAAC,MAAM,QAAQ,CAAC,CAAC;QACjG,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,QAAQ,CAAC,OAAe,EAAE,KAAa,EAAE,YAAgC;QACvE,IAAI,OAAO,KAAK,KAAK;YAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAE3F,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAExC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,uBAAuB;YACvB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,UAAU,GAAkB,IAAI,CAAC;gBAErC,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,EAAE,CAAC;oBAC7B,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC5B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;oBACnC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;gBAC7B,CAAC;gBAED,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3C,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,UAAU;wBAClB,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC;qBAC5B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,CAAC,gBAAgB;IAC7B,CAAC;IAED,YAAY,CAAC,OAAe,EAAE,KAAa,EAAE,QAAgB,EAAE,YAAgC;QAC7F,MAAM,KAAK,GAAe,EAAE,CAAC;QAE7B,MAAM,GAAG,GAAG,CAAC,SAAiB,EAAE,QAAgB,EAAE,WAAqB,EAAE,OAAoB,EAAE,KAAa,EAAE,EAAE;YAC9G,IAAI,KAAK,GAAG,QAAQ;gBAAE,OAAO;YAE7B,IAAI,SAAS,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;gBAC7B,OAAO;YACT,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,UAAU,GAAkB,IAAI,CAAC;gBAErC,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;oBAChC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC5B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBACtC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;gBAC7B,CAAC;gBAED,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3C,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC7B,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC3D,WAAW,CAAC,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QAE3C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,eAAe,CAAC,OAAe,EAAE,YAAgC,EAAE,QAAQ,GAAG,EAAE;QAC9E,IAAI,WAAW,GAAa,EAAE,CAAC;QAE/B,MAAM,GAAG,GAAG,CAAC,SAAiB,EAAE,WAAqB,EAAE,OAAoB,EAAE,KAAa,EAAE,EAAE;YAC5F,IAAI,KAAK,GAAG,QAAQ;gBAAE,OAAO;YAE7B,IAAI,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;gBAC5C,WAAW,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;YACjC,CAAC;YAED,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,UAAU,GAAkB,IAAI,CAAC;gBAErC,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;oBAChC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;gBAC5B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;oBACtC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;gBAC7B,CAAC;gBAED,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3C,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC7B,GAAG,CAAC,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBACjD,WAAW,CAAC,GAAG,EAAE,CAAC;oBAClB,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QAEpC,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,eAAe,CACnB,WAAmB,EACnB,gBAAwB,EACxB,YAAgC;QAEhC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,KAAK,GAAwC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEvF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEzC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,gBAAgB;gBAAE,SAAS;YAEpE,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE1B,IAAI,KAAK,GAAG,gBAAgB,EAAE,CAAC;gBAC7B,4BAA4B;gBAC5B,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;oBACtD,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;wBACxD,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBAE7B,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;wBAChF,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;4BACxC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;YACxC,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC;SAC3C,CAAC;IACJ,CAAC;IAED,UAAU,CAAC,WAAmB,EAAE,KAAa,EAAE,YAAgC;QAC7E,MAAM,IAAI,GAAa,CAAC,WAAW,CAAC,CAAC;QACrC,IAAI,aAAa,GAAG,WAAW,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,qBAAqB;YACrB,MAAM,SAAS,GAAa,EAAE,CAAC;YAE/B,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,KAAK,CAAC,OAAO,KAAK,aAAa,EAAE,CAAC;oBACpC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC/B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;oBAC1C,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,CAAC,oBAAoB;YAEvD,yBAAyB;YACzB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YACjE,aAAa,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CACb,OAAiB,EACjB,YAAgC;QAEhC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,gBAAgB;QAChB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YACtD,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED,sBAAsB,CAAC,WAAmB,EAAE,YAAgC;QAC1E,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAE5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEvB,oCAAoC;YACpC,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3D,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,8BAA8B;IAE9B;;OAEG;IACH,aAAa,CACX,WAAmB,EACnB,UAA4C,EAC5C,QAAgB,EAChB,YAAgC;QAEhC,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAwC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEvF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEzC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YACtD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;YAED,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,yBAAyB;gBACzB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;oBACtD,IAAI,UAAU,GAAkB,IAAI,CAAC;oBAErC,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,EAAE,CAAC;wBAC7B,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;oBAC5B,CAAC;yBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;wBACnC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;oBAC7B,CAAC;oBAED,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,qBAAqB,CACnB,WAAmB,EACnB,cAAmD,EACnD,QAAgB,EAChB,YAAgC;QAEhC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,KAAa,EAAE,EAAE;YAC5C,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,GAAG,QAAQ;gBAAE,OAAO;YAEpD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;oBACtD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC;wBAAE,SAAS;oBAE/C,IAAI,UAAU,GAAkB,IAAI,CAAC;oBAErC,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,EAAE,CAAC;wBAC7B,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;oBAC5B,CAAC;yBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;wBACnC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;oBAC7B,CAAC;oBAED,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC3C,GAAG,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC7B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,YAAgC;QACrD,MAAM,kBAAkB,GAAa,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QAE3D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,4CAA4C;YAC5C,MAAM,gBAAgB,GAAG,IAAI,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC;YAErE,+CAA+C;YAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAEvF,IAAI,eAAe,GAAG,gBAAgB,EAAE,CAAC;gBACvC,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAEO,wBAAwB,CAAC,YAAgC;QAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACpE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,mCAAmC,CAAC,aAAqB,EAAE,YAAgC;QACjG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,mBAAmB;QACrE,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,MAAM,SAAS,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;gBAChG,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,UAAU,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,mCAAmC,CACzC,WAAmB,EACnB,aAAqB,EACrB,YAAgC;QAEhC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,sCAAsC;QACxF,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAE5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEvB,qDAAqD;YACrD,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,KAAK,CAAC,OAAO,KAAK,aAAa,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa;oBAAE,SAAS;gBAEhF,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3D,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAvgBD,sDAugBC"}

package/dist/cli/knowledge/graph/services/architectural-insight-detector.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Architectural Insight Detector
+ * Detects design patterns, anti-patterns, and architectural issues
+ */
+import { KnowledgeNode, KnowledgeTriad, ArchitecturalInsight } from '../types';
+export interface IArchitecturalInsightDetector {
+    detectArchitecturalInsights(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectDesignPatterns(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectAntiPatterns(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectCouplingIssues(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectRefactoringOpportunities(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+}
+export declare class ArchitecturalInsightDetector implements IArchitecturalInsightDetector {
+    private logger;
+    detectArchitecturalInsights(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectDesignPatterns(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectAntiPatterns(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectCouplingIssues(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    detectRefactoringOpportunities(nodes: Map<string, KnowledgeNode>, triads: Map<string, KnowledgeTriad>): Promise<ArchitecturalInsight[]>;
+    private detectSingletonPattern;
+    private detectFactoryPattern;
+    private detectObserverPattern;
+    private detectStrategyPattern;
+    private detectGodClassAntiPattern;
+    private detectCircularDependencies;
+    private detectDeadCode;
+    private detectFeatureEnvy;
+    private detectHighCoupling;
+    private detectInappropriateIntimacy;
+    private detectExtractInterfaceOpportunities;
+    private detectExtractClassOpportunities;
+    private detectMoveMethodOpportunities;
+    private hasRelation;
+    private getRelatedNodes;
+    private getNodesUsing;
+    private getNodesUsingStrategy;
+    private isEntryPoint;
+    private getUsedClasses;
+    private getOwningClass;
+    private getAccessedClasses;
+    private groupMethodsByFields;
+}
+//# sourceMappingURL=architectural-insight-detector.d.ts.map

package/dist/cli/knowledge/graph/services/architectural-insight-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"architectural-insight-detector.d.ts","sourceRoot":"","sources":["../../../../../src/cli/knowledge/graph/services/architectural-insight-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,oBAAoB,EAA0B,MAAM,UAAU,CAAC;AAGvG,MAAM,WAAW,6BAA6B;IAC5C,2BAA2B,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;IACrI,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;IAC9H,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;IAC5H,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;IAC9H,8BAA8B,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;CACzI;AAED,qBAAa,4BAA6B,YAAW,6BAA6B;IAChF,OAAO,CAAC,MAAM,CAA8D;IAEtE,2BAA2B,CAC/B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAClC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAkB5B,oBAAoB,CACxB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAClC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAkB5B,kBAAkB,CACtB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAClC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAkB5B,oBAAoB,CACxB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAClC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAY5B,8BAA8B,CAClC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,EACjC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,GAClC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAelC,OAAO,CAAC,sBAAsB;IA6B9B,OAAO,CAAC,oBAAoB;IA+B5B,OAAO,CAAC,qBAAqB;IAgC7B,OAAO,CAAC,qBAAqB;IAiC7B,OAAO,CAAC,yBAAyB;IA8BjC,OAAO,CAAC,0BAA0B;IAgDlC,OAAO,CAAC,cAAc;IA4BtB,OAAO,CAAC,iBAAiB;IAgCzB,OAAO,CAAC,kBAAkB;IA2B1B,OAAO,CAAC,2BAA2B;IA6BnC,OAAO,CAAC,mCAAmC;IA6C3C,OAAO,CAAC,+BAA+B;IAiCvC,OAAO,CAAC,6BAA6B;IAyCrC,OAAO,CAAC,WAAW;IAmBnB,OAAO,CAAC,eAAe;IAuBvB,OAAO,CAAC,aAAa;IAerB,OAAO,CAAC,qBAAqB;IAmB7B,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,cAAc;IAgBtB,OAAO,CAAC,cAAc;IAWtB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,oBAAoB;CA+C7B"}