codeseeker 1.4.0

package/dist/cli/knowledge/graph/services/graph-analyzer.js

@@ -0,0 +1,262 @@
+"use strict";
+/**
+ * Graph Analysis Service
+ * Handles complex graph analysis operations following Single Responsibility Principle
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphAnalyzer = void 0;
+const logger_1 = require("../../../../utils/logger");
+class GraphAnalyzer {
+    logger = logger_1.Logger.getInstance().child('GraphAnalyzer');
+    async analyzeGraph(nodes, triads) {
+        const nodeCount = nodes.size;
+        const triadCount = triads.size;
+        const relationshipDistribution = {};
+        const nodeTypeDistribution = {};
+        // Count relationships and node types
+        for (const triad of triads.values()) {
+            relationshipDistribution[triad.predicate] =
+                (relationshipDistribution[triad.predicate] || 0) + 1;
+        }
+        for (const node of nodes.values()) {
+            nodeTypeDistribution[node.type] =
+                (nodeTypeDistribution[node.type] || 0) + 1;
+        }
+        // Calculate centrality scores (simplified PageRank-like algorithm)
+        const centralityScores = await this.calculateCentralityScores(nodes, triads);
+        // Find strongly connected components
+        const stronglyConnectedComponents = await this.findStronglyConnectedComponents(nodes, triads);
+        // Calculate clustering coefficient
+        const clusteringCoefficient = this.calculateClusteringCoefficient(nodes, triads);
+        return {
+            nodeCount,
+            triadCount,
+            relationshipDistribution,
+            nodeTypeDistribution,
+            centralityScores,
+            clusteringCoefficient,
+            stronglyConnectedComponents
+        };
+    }
+    async findSemanticClusters(nodes, triads, minClusterSize = 3) {
+        const clusters = [];
+        const visited = new Set();
+        for (const node of nodes.values()) {
+            if (visited.has(node.id))
+                continue;
+            const cluster = await this.expandSemanticCluster(node.id, nodes, triads, visited);
+            if (cluster.nodes.length >= minClusterSize) {
+                clusters.push(cluster);
+            }
+        }
+        return clusters;
+    }
+    async calculateCentralityScores(nodes, triads) {
+        const scores = {};
+        const damping = 0.85;
+        const iterations = 50;
+        // Initialize scores
+        for (const node of nodes.values()) {
+            scores[node.id] = 1.0;
+        }
+        // Build adjacency list
+        const adjacency = {};
+        const incomingLinks = {};
+        for (const node of nodes.values()) {
+            adjacency[node.id] = [];
+            incomingLinks[node.id] = [];
+        }
+        for (const triad of triads.values()) {
+            if (adjacency[triad.subject] && adjacency[triad.object]) {
+                adjacency[triad.subject].push(triad.object);
+                incomingLinks[triad.object].push(triad.subject);
+            }
+        }
+        // Iterative PageRank calculation
+        for (let i = 0; i < iterations; i++) {
+            const newScores = {};
+            for (const nodeId of nodes.keys()) {
+                let score = (1 - damping) / nodes.size;
+                for (const incomingNodeId of incomingLinks[nodeId]) {
+                    const incomingScore = scores[incomingNodeId];
+                    const outgoingLinksCount = adjacency[incomingNodeId].length || 1;
+                    score += damping * (incomingScore / outgoingLinksCount);
+                }
+                newScores[nodeId] = score;
+            }
+            // Update scores
+            Object.assign(scores, newScores);
+        }
+        return scores;
+    }
+    async findStronglyConnectedComponents(nodes, triads) {
+        const components = [];
+        const visited = new Set();
+        const stack = [];
+        const indices = {};
+        const lowLinks = {};
+        const onStack = new Set();
+        let index = 0;
+        // Build adjacency list
+        const adjacency = {};
+        for (const node of nodes.values()) {
+            adjacency[node.id] = [];
+        }
+        for (const triad of triads.values()) {
+            if (adjacency[triad.subject] && adjacency[triad.object]) {
+                adjacency[triad.subject].push(triad.object);
+            }
+        }
+        // Tarjan's algorithm
+        const strongConnect = (v) => {
+            indices[v] = index;
+            lowLinks[v] = index;
+            index++;
+            stack.push(v);
+            onStack.add(v);
+            for (const w of adjacency[v] || []) {
+                if (indices[w] === undefined) {
+                    strongConnect(w);
+                    lowLinks[v] = Math.min(lowLinks[v], lowLinks[w]);
+                }
+                else if (onStack.has(w)) {
+                    lowLinks[v] = Math.min(lowLinks[v], indices[w]);
+                }
+            }
+            if (lowLinks[v] === indices[v]) {
+                const component = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    component.push(w);
+                } while (w !== v);
+                if (component.length > 1) {
+                    components.push(component);
+                }
+            }
+        };
+        for (const nodeId of nodes.keys()) {
+            if (indices[nodeId] === undefined) {
+                strongConnect(nodeId);
+            }
+        }
+        return components;
+    }
+    calculateClusteringCoefficient(nodes, triads) {
+        let totalCoefficient = 0;
+        let nodeCount = 0;
+        // Build adjacency list
+        const adjacency = {};
+        for (const node of nodes.values()) {
+            adjacency[node.id] = new Set();
+        }
+        for (const triad of triads.values()) {
+            if (adjacency[triad.subject] && adjacency[triad.object]) {
+                adjacency[triad.subject].add(triad.object);
+                adjacency[triad.object].add(triad.subject); // Treat as undirected
+            }
+        }
+        for (const nodeId of nodes.keys()) {
+            const neighbors = Array.from(adjacency[nodeId]);
+            const k = neighbors.length;
+            if (k < 2) {
+                continue; // Clustering coefficient is 0 for nodes with < 2 neighbors
+            }
+            let triangles = 0;
+            for (let i = 0; i < neighbors.length; i++) {
+                for (let j = i + 1; j < neighbors.length; j++) {
+                    if (adjacency[neighbors[i]].has(neighbors[j])) {
+                        triangles++;
+                    }
+                }
+            }
+            const possibleTriangles = (k * (k - 1)) / 2;
+            const coefficient = triangles / possibleTriangles;
+            totalCoefficient += coefficient;
+            nodeCount++;
+        }
+        return nodeCount > 0 ? totalCoefficient / nodeCount : 0;
+    }
+    async expandSemanticCluster(startNodeId, nodes, triads, visited, semanticThreshold = 0.7) {
+        const clusterNodes = [];
+        const clusterTriads = [];
+        const queue = [startNodeId];
+        const clusterVisited = new Set();
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            if (clusterVisited.has(nodeId))
+                continue;
+            clusterVisited.add(nodeId);
+            visited.add(nodeId);
+            clusterNodes.push(nodeId);
+            // Find related triads
+            for (const triad of triads.values()) {
+                if ((triad.subject === nodeId || triad.object === nodeId) &&
+                    !clusterTriads.includes(triad.id)) {
+                    clusterTriads.push(triad.id);
+                    // Add connected nodes if they meet semantic similarity threshold
+                    const connectedNodeId = triad.subject === nodeId ? triad.object : triad.subject;
+                    if (!clusterVisited.has(connectedNodeId)) {
+                        const similarity = await this.calculateSemanticSimilarity(nodeId, connectedNodeId, nodes);
+                        if (similarity >= semanticThreshold) {
+                            queue.push(connectedNodeId);
+                        }
+                    }
+                }
+            }
+        }
+        return {
+            id: `cluster_${startNodeId}`,
+            nodes: clusterNodes,
+            triads: clusterTriads,
+            semanticScore: await this.calculateClusterSemanticScore(clusterNodes, nodes),
+            density: clusterTriads.length / (clusterNodes.length * (clusterNodes.length - 1))
+        };
+    }
+    async calculateSemanticSimilarity(nodeId1, nodeId2, nodes) {
+        const node1 = nodes.get(nodeId1);
+        const node2 = nodes.get(nodeId2);
+        if (!node1 || !node2)
+            return 0;
+        // Simple semantic similarity based on node type and metadata
+        if (node1.type === node2.type) {
+            // Same type gets base similarity
+            let similarity = 0.5;
+            // Check metadata similarity
+            const metadata1 = node1.metadata || {};
+            const metadata2 = node2.metadata || {};
+            const commonKeys = Object.keys(metadata1).filter(key => key in metadata2);
+            const totalKeys = new Set([...Object.keys(metadata1), ...Object.keys(metadata2)]).size;
+            if (totalKeys > 0) {
+                similarity += (commonKeys.length / totalKeys) * 0.3;
+            }
+            // Check name/label similarity
+            if (node1.name && node2.name) {
+                const name1 = node1.name.toLowerCase();
+                const name2 = node2.name.toLowerCase();
+                if (name1.includes(name2) || name2.includes(name1)) {
+                    similarity += 0.2;
+                }
+            }
+            return Math.min(1.0, similarity);
+        }
+        return 0.1; // Different types have minimal similarity
+    }
+    async calculateClusterSemanticScore(clusterNodes, nodes) {
+        if (clusterNodes.length < 2)
+            return 1.0;
+        let totalSimilarity = 0;
+        let pairCount = 0;
+        for (let i = 0; i < clusterNodes.length; i++) {
+            for (let j = i + 1; j < clusterNodes.length; j++) {
+                const similarity = await this.calculateSemanticSimilarity(clusterNodes[i], clusterNodes[j], nodes);
+                totalSimilarity += similarity;
+                pairCount++;
+            }
+        }
+        return pairCount > 0 ? totalSimilarity / pairCount : 0;
+    }
+}
+exports.GraphAnalyzer = GraphAnalyzer;
+//# sourceMappingURL=graph-analyzer.js.map

package/dist/cli/knowledge/graph/services/graph-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-analyzer.js","sourceRoot":"","sources":["../../../../../src/cli/knowledge/graph/services/graph-analyzer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,qDAAkD;AAUlD,MAAa,aAAa;IAChB,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAE7D,KAAK,CAAC,YAAY,CAChB,KAAiC,EACjC,MAAmC;QAEnC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;QAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;QAE/B,MAAM,wBAAwB,GAAG,EAAkC,CAAC;QACpE,MAAM,oBAAoB,GAAG,EAA8B,CAAC;QAE5D,qCAAqC;QACrC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,wBAAwB,CAAC,KAAK,CAAC,SAAS,CAAC;gBACvC,CAAC,wBAAwB,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzD,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QAED,mEAAmE;QACnE,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE7E,qCAAqC;QACrC,MAAM,2BAA2B,GAAG,MAAM,IAAI,CAAC,+BAA+B,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE9F,mCAAmC;QACnC,MAAM,qBAAqB,GAAG,IAAI,CAAC,8BAA8B,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEjF,OAAO;YACL,SAAS;YACT,UAAU;YACV,wBAAwB;YACxB,oBAAoB;YACpB,gBAAgB;YAChB,qBAAqB;YACrB,2BAA2B;SAC5B,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,oBAAoB,CACxB,KAAiC,EACjC,MAAmC,EACnC,cAAc,GAAG,CAAC;QAElB,MAAM,QAAQ,GAAsB,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEnC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YAClF,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBAC3C,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,yBAAyB,CAC7B,KAAiC,EACjC,MAAmC;QAEnC,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC;QACrB,MAAM,UAAU,GAAG,EAAE,CAAC;QAEtB,oBAAoB;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACxB,CAAC;QAED,uBAAuB;QACvB,MAAM,SAAS,GAA6B,EAAE,CAAC;QAC/C,MAAM,aAAa,GAA6B,EAAE,CAAC;QAEnD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACxB,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAC9B,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxD,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC5C,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,SAAS,GAA2B,EAAE,CAAC;YAE7C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClC,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;gBAEvC,KAAK,MAAM,cAAc,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;oBACnD,MAAM,aAAa,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;oBAC7C,MAAM,kBAAkB,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;oBACjE,KAAK,IAAI,OAAO,GAAG,CAAC,aAAa,GAAG,kBAAkB,CAAC,CAAC;gBAC1D,CAAC;gBAED,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;YAC5B,CAAC;YAED,gBAAgB;YAChB,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,+BAA+B,CACnC,KAAiC,EACjC,MAAmC;QAEnC,MAAM,UAAU,GAAe,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,uBAAuB;QACvB,MAAM,SAAS,GAA6B,EAAE,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxD,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,EAAE;YAClC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACnB,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACpB,KAAK,EAAE,CAAC;YACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEf,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;oBAC7B,aAAa,CAAC,CAAC,CAAC,CAAC;oBACjB,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnD,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,IAAI,CAAS,CAAC;gBACd,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAElB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;gBAClC,aAAa,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,8BAA8B,CAC5B,KAAiC,EACjC,MAAmC;QAEnC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,uBAAuB;QACvB,MAAM,SAAS,GAAgC,EAAE,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxD,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC3C,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,sBAAsB;YACpE,CAAC;QACH,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;YAE3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,SAAS,CAAC,2DAA2D;YACvE,CAAC;YAED,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC9C,SAAS,EAAE,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,iBAAiB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,SAAS,GAAG,iBAAiB,CAAC;YAClD,gBAAgB,IAAI,WAAW,CAAC;YAChC,SAAS,EAAE,CAAC;QACd,CAAC;QAED,OAAO,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAEO,KAAK,CAAC,qBAAqB,CACjC,WAAmB,EACnB,KAAiC,EACjC,MAAmC,EACnC,OAAoB,EACpB,iBAAiB,GAAG,GAAG;QAEvB,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,MAAM,KAAK,GAAa,CAAC,WAAW,CAAC,CAAC;QACtC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAEzC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAE1B,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC;oBACrD,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAE7B,iEAAiE;oBACjE,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;oBAChF,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;wBACzC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;wBAC1F,IAAI,UAAU,IAAI,iBAAiB,EAAE,CAAC;4BACpC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;wBAC9B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,EAAE,EAAE,WAAW,WAAW,EAAE;YAC5B,KAAK,EAAE,YAAY;YACnB,MAAM,EAAE,aAAa;YACrB,aAAa,EAAE,MAAM,IAAI,CAAC,6BAA6B,CAAC,YAAY,EAAE,KAAK,CAAC;YAC5E,OAAO,EAAE,aAAa,CAAC,MAAM,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SAClF,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,2BAA2B,CACvC,OAAe,EACf,OAAe,EACf,KAAiC;QAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEjC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QAE/B,6DAA6D;QAC7D,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YAC9B,iCAAiC;YACjC,IAAI,UAAU,GAAG,GAAG,CAAC;YAErB,4BAA4B;YAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;YAEvC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;YAC1E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAEvF,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,UAAU,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC;YACtD,CAAC;YAED,8BAA8B;YAC9B,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;gBACvC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;gBAEvC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBACnD,UAAU,IAAI,GAAG,CAAC;gBACpB,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,GAAG,CAAC,CAAC,0CAA0C;IACxD,CAAC;IAEO,KAAK,CAAC,6BAA6B,CACzC,YAAsB,EACtB,KAAiC;QAEjC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QAExC,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,2BAA2B,CACvD,YAAY,CAAC,CAAC,CAAC,EACf,YAAY,CAAC,CAAC,CAAC,EACf,KAAK,CACN,CAAC;gBACF,eAAe,IAAI,UAAU,CAAC;gBAC9B,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;CACF;AAnVD,sCAmVC"}

package/dist/cli/knowledge/graph/services/graph-database-service.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Graph Database Service
+ * Handles persistence and database operations for the knowledge graph
+ */
+import { KnowledgeNode, KnowledgeTriad, GraphQuery, GraphMutation, RelationType } from '../types';
+export interface IGraphDatabaseService {
+    initializeDatabase(): Promise<void>;
+    createTables(): Promise<void>;
+    saveNode(node: KnowledgeNode): Promise<void>;
+    saveTriad(triad: KnowledgeTriad): Promise<void>;
+    loadNodes(): Promise<Map<string, KnowledgeNode>>;
+    loadTriads(): Promise<Map<string, KnowledgeTriad>>;
+    queryNodes(query: GraphQuery): Promise<KnowledgeNode[]>;
+    queryTriads(query: GraphQuery): Promise<KnowledgeTriad[]>;
+    mutateGraph(mutation: GraphMutation): Promise<void>;
+    closeConnection(): Promise<void>;
+}
+export declare class GraphDatabaseService implements IGraphDatabaseService {
+    private projectPath;
+    private logger;
+    private db;
+    private initialized;
+    private static databaseUnavailable;
+    private static errorNotified;
+    constructor(projectPath: string);
+    /**
+     * Check if database is marked as unavailable
+     */
+    static isDatabaseUnavailable(): boolean;
+    /**
+     * Reset the database unavailable flag (for retry attempts)
+     */
+    static resetAvailability(): void;
+    initializeDatabase(): Promise<void>;
+    /**
+     * Create database tables - should only be called during setup phase
+     */
+    createTables(): Promise<void>;
+    saveNode(node: KnowledgeNode): Promise<void>;
+    saveTriad(triad: KnowledgeTriad): Promise<void>;
+    loadNodes(): Promise<Map<string, KnowledgeNode>>;
+    loadTriads(): Promise<Map<string, KnowledgeTriad>>;
+    queryNodes(query: GraphQuery): Promise<KnowledgeNode[]>;
+    queryTriads(query: GraphQuery): Promise<KnowledgeTriad[]>;
+    mutateGraph(mutation: GraphMutation): Promise<void>;
+    closeConnection(): Promise<void>;
+    private generateNodeId;
+    private generateTriadId;
+    getNodesByType(nodeType: string, limit?: number): Promise<KnowledgeNode[]>;
+    getTriadsByPredicate(predicate: RelationType, limit?: number): Promise<KnowledgeTriad[]>;
+    getNodeConnections(nodeId: string): Promise<{
+        incoming: KnowledgeTriad[];
+        outgoing: KnowledgeTriad[];
+    }>;
+    getNodeNeighbors(nodeId: string): Promise<string[]>;
+    getSubgraph(nodeIds: string[]): Promise<{
+        nodes: KnowledgeNode[];
+        triads: KnowledgeTriad[];
+    }>;
+}
+//# sourceMappingURL=graph-database-service.d.ts.map

package/dist/cli/knowledge/graph/services/graph-database-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-database-service.d.ts","sourceRoot":"","sources":["../../../../../src/cli/knowledge/graph/services/graph-database-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAIlG,MAAM,WAAW,qBAAqB;IACpC,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7C,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAChD,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;IACjD,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;IACnD,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;IACxD,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;IAC1D,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACpD,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CAClC;AAED,qBAAa,oBAAqB,YAAW,qBAAqB;IASpD,OAAO,CAAC,WAAW;IAR/B,OAAO,CAAC,MAAM,CAAsD;IACpE,OAAO,CAAC,EAAE,CAAM;IAChB,OAAO,CAAC,WAAW,CAAS;IAG5B,OAAO,CAAC,MAAM,CAAC,mBAAmB,CAAS;IAC3C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAS;gBAEjB,WAAW,EAAE,MAAM;IAEvC;;OAEG;IACH,MAAM,CAAC,qBAAqB,IAAI,OAAO;IAIvC;;OAEG;IACH,MAAM,CAAC,iBAAiB,IAAI,IAAI;IAK1B,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC;IAwCzC;;OAEG;IACG,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC;IAkE7B,QAAQ,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAqC5C,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAkC/C,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IA2ChD,UAAU,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IA0ClD,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IA+DvD,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IAuEzD,WAAW,CAAC,QAAQ,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAsInD,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC;IAatC,OAAO,CAAC,cAAc;IAItB,OAAO,CAAC,eAAe;IAKjB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAI1E,oBAAoB,CAAC,SAAS,EAAE,YAAY,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;IAIxF,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QAAC,QAAQ,EAAE,cAAc,EAAE,CAAC;QAAC,QAAQ,EAAE,cAAc,EAAE,CAAA;KAAC,CAAC;IAOrG,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAWnD,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAAC,KAAK,EAAE,aAAa,EAAE,CAAC;QAAC,MAAM,EAAE,cAAc,EAAE,CAAA;KAAC,CAAC;CAkDlG"}