agentic-qe 2.6.5 → 2.6.6

package/dist/code-intelligence/analysis/mincut/CircularDependencyDetector.js

@@ -0,0 +1,393 @@
+"use strict";
+/**
+ * Circular Dependency Detector using MinCut Analysis
+ *
+ * Detects circular dependencies using Tarjan's algorithm for finding
+ * strongly connected components (SCCs), then uses MinCut to suggest
+ * optimal break points for resolving the cycles.
+ *
+ * @example
+ * ```typescript
+ * const detector = new CircularDependencyDetector(codeGraph);
+ * const cycles = await detector.detectAll();
+ * for (const cycle of cycles) {
+ *   console.log(`Cycle: ${cycle.cycle.join(' -> ')}`);
+ *   console.log(`Severity: ${cycle.severity}`);
+ *   console.log('Break points:', cycle.breakPoints);
+ * }
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CircularDependencyDetector = void 0;
+const MinCutAnalyzer_js_1 = require("./MinCutAnalyzer.js");
+const GraphAdapter_js_1 = require("./GraphAdapter.js");
+const Logger_js_1 = require("../../../utils/Logger.js");
+const logger = Logger_js_1.Logger.getInstance();
+/**
+ * Detects and analyzes circular dependencies in code graphs
+ */
+class CircularDependencyDetector {
+    /**
+     * Create a new CircularDependencyDetector
+     *
+     * @param graph - The code graph to analyze
+     */
+    constructor(graph) {
+        this.graph = graph;
+        this.analyzer = new MinCutAnalyzer_js_1.MinCutAnalyzer({
+            algorithm: 'auto',
+            normalizeWeights: true,
+            maxNodes: 1000,
+            timeout: 10000,
+        });
+    }
+    /**
+     * Detect all circular dependencies in the codebase.
+     *
+     * Uses Tarjan's algorithm to find strongly connected components (SCCs),
+     * filters to only cycles (SCCs with >1 node), then analyzes each cycle
+     * using MinCut to find optimal break points.
+     *
+     * @returns Promise resolving to array of CircularDependencyResults, sorted by severity
+     *
+     * @example
+     * ```typescript
+     * const results = await detector.detectAll();
+     * console.log(`Found ${results.length} circular dependencies`);
+     * results.forEach(r => {
+     *   console.log(`${r.severity}: ${r.cycle.join(' -> ')}`);
+     * });
+     * ```
+     */
+    async detectAll() {
+        logger.info('Starting circular dependency detection');
+        // 1. Find strongly connected components using Tarjan's algorithm
+        const sccs = this.findStronglyConnectedComponents();
+        logger.info(`Found ${sccs.length} strongly connected components`);
+        // 2. Filter to only SCCs with >1 node (these are cycles)
+        const cycles = sccs.filter(scc => scc.nodes.length > 1);
+        logger.info(`Found ${cycles.length} circular dependencies`);
+        if (cycles.length === 0) {
+            return [];
+        }
+        // 3. Analyze each cycle
+        const results = await Promise.all(cycles.map(scc => this.analyzeCycle(scc)));
+        // Sort by severity (high -> medium -> low)
+        return results.sort((a, b) => {
+            const severityOrder = { high: 0, medium: 1, low: 2 };
+            return severityOrder[a.severity] - severityOrder[b.severity];
+        });
+    }
+    /**
+     * Check if a specific file is part of any circular dependency.
+     *
+     * @param filePath - The file path to check
+     * @returns Promise resolving to CircularDependencyResult if found, null otherwise
+     *
+     * @example
+     * ```typescript
+     * const result = await detector.checkFile('/src/auth/service.ts');
+     * if (result) {
+     *   console.log('File is part of a cycle:', result.cycle);
+     * }
+     * ```
+     */
+    async checkFile(filePath) {
+        const results = await this.detectAll();
+        return results.find(r => r.cycle.includes(filePath)) || null;
+    }
+    /**
+     * Analyze a single circular dependency and suggest break points.
+     *
+     * Extracts the subgraph for the SCC, runs MinCut to find weakest links,
+     * and generates actionable recommendations.
+     *
+     * @param scc - The strongly connected component to analyze
+     * @returns Promise resolving to CircularDependencyResult
+     */
+    async analyzeCycle(scc) {
+        logger.debug(`Analyzing cycle with ${scc.nodes.length} nodes`, {
+            nodes: scc.nodes.map(n => n.label),
+        });
+        // Extract subgraph for this SCC
+        const subgraph = this.extractSCCSubgraph(scc);
+        // Run MinCut to find weakest links
+        const minCutInput = GraphAdapter_js_1.GraphAdapter.toMinCutFormat(subgraph, {
+            normalizeWeights: true,
+            directed: false, // MinCut works on undirected graphs
+        });
+        let breakPoints = [];
+        try {
+            const result = await this.analyzer.computeMinCut(minCutInput);
+            breakPoints = result.cutEdges.map(edge => this.createBreakPoint(edge));
+        }
+        catch (error) {
+            logger.warn('MinCut analysis failed, using fallback heuristic', { error });
+            // Fallback: use weakest edges based on edge type
+            breakPoints = this.findWeakestEdges(scc);
+        }
+        // Determine severity based on cycle size and edge types
+        const severity = this.calculateSeverity(scc);
+        // Generate recommendations
+        const recommendations = this.generateRecommendations(scc, breakPoints);
+        return {
+            cycle: scc.nodes.map(n => n.filePath || n.label),
+            breakPoints,
+            severity,
+            recommendations,
+        };
+    }
+    /**
+     * Tarjan's algorithm for finding strongly connected components.
+     *
+     * Time complexity: O(V + E) where V is nodes and E is edges.
+     *
+     * @returns Array of strongly connected components
+     */
+    findStronglyConnectedComponents() {
+        const index = new Map();
+        const lowlink = new Map();
+        const onStack = new Set();
+        const stack = [];
+        const sccs = [];
+        let currentIndex = 0;
+        const strongConnect = (node) => {
+            // Set the depth index for this node
+            index.set(node.id, currentIndex);
+            lowlink.set(node.id, currentIndex);
+            currentIndex++;
+            stack.push(node);
+            onStack.add(node.id);
+            // Consider successors of node
+            const outgoing = this.graph.outgoingEdges.get(node.id) || [];
+            for (const edgeId of outgoing) {
+                const edge = this.graph.edges.get(edgeId);
+                if (!edge)
+                    continue;
+                const successor = this.graph.nodes.get(edge.target);
+                if (!successor)
+                    continue;
+                if (!index.has(successor.id)) {
+                    // Successor has not yet been visited; recurse on it
+                    strongConnect(successor);
+                    lowlink.set(node.id, Math.min(lowlink.get(node.id), lowlink.get(successor.id)));
+                }
+                else if (onStack.has(successor.id)) {
+                    // Successor is in the current SCC
+                    lowlink.set(node.id, Math.min(lowlink.get(node.id), index.get(successor.id)));
+                }
+            }
+            // If node is a root node, pop the stack and generate an SCC
+            if (lowlink.get(node.id) === index.get(node.id)) {
+                const scc = {
+                    nodes: [],
+                    edges: [],
+                };
+                let w;
+                do {
+                    w = stack.pop();
+                    if (w) {
+                        onStack.delete(w.id);
+                        scc.nodes.push(w);
+                    }
+                } while (w && w.id !== node.id);
+                // Collect edges within this SCC
+                const nodeIds = new Set(scc.nodes.map(n => n.id));
+                for (const n of scc.nodes) {
+                    const outgoing = this.graph.outgoingEdges.get(n.id) || [];
+                    for (const edgeId of outgoing) {
+                        const edge = this.graph.edges.get(edgeId);
+                        if (edge && nodeIds.has(edge.target)) {
+                            scc.edges.push(edge);
+                        }
+                    }
+                }
+                sccs.push(scc);
+            }
+        };
+        // Run Tarjan's algorithm on all nodes
+        for (const [nodeId, node] of Array.from(this.graph.nodes.entries())) {
+            if (!index.has(nodeId)) {
+                strongConnect(node);
+            }
+        }
+        return sccs;
+    }
+    /**
+     * Calculate severity of a circular dependency.
+     *
+     * Severity is based on:
+     * - Cycle size (larger = more severe)
+     * - Edge types (inheritance = most severe)
+     *
+     * @param scc - The strongly connected component
+     * @returns Severity level
+     */
+    calculateSeverity(scc) {
+        // High severity: large cycles or inheritance cycles
+        if (scc.nodes.length > 5)
+            return 'high';
+        if (scc.edges.some(e => e.type === 'extends'))
+            return 'high';
+        // Medium severity: 3-5 node cycles or implements cycles
+        if (scc.nodes.length >= 3)
+            return 'medium';
+        if (scc.edges.some(e => e.type === 'implements'))
+            return 'medium';
+        // Low severity: 2-node cycles with imports only
+        return 'low';
+    }
+    /**
+     * Create a break point suggestion from a cut edge.
+     *
+     * @param edge - The edge identified by MinCut
+     * @returns BreakPoint with effort estimation and suggestion
+     */
+    createBreakPoint(edge) {
+        const effortMap = {
+            'imports': 'low',
+            'calls': 'low',
+            'uses': 'medium',
+            'implements': 'medium',
+            'extends': 'high',
+        };
+        const effort = effortMap[edge.edgeType || 'imports'] || 'medium';
+        const suggestions = {
+            'low': 'Extract to shared module or use dependency injection',
+            'medium': 'Introduce an interface/abstraction layer',
+            'high': 'Restructure inheritance hierarchy - consider composition over inheritance',
+        };
+        return {
+            source: edge.source,
+            target: edge.target,
+            edgeType: edge.edgeType || 'unknown',
+            effort,
+            suggestion: suggestions[effort],
+        };
+    }
+    /**
+     * Fallback method to find weakest edges when MinCut fails.
+     *
+     * @param scc - The strongly connected component
+     * @returns Array of break points based on edge type heuristics
+     */
+    findWeakestEdges(scc) {
+        // Edge type strength (lower = weaker = better to break)
+        const edgeStrength = {
+            'tests': 1,
+            'imports': 2,
+            'calls': 3,
+            'uses': 4,
+            'exports': 5,
+            'contains': 5,
+            'returns': 6,
+            'parameter': 6,
+            'defines': 7,
+            'implements': 8,
+            'overrides': 9,
+            'extends': 10,
+        };
+        // Sort edges by strength (weakest first)
+        const sortedEdges = [...scc.edges].sort((a, b) => {
+            const strengthA = edgeStrength[a.type] || 5;
+            const strengthB = edgeStrength[b.type] || 5;
+            return strengthA - strengthB;
+        });
+        // Take up to 3 weakest edges
+        return sortedEdges.slice(0, 3).map(edge => {
+            const sourceNode = this.graph.nodes.get(edge.source);
+            const targetNode = this.graph.nodes.get(edge.target);
+            return this.createBreakPoint({
+                source: sourceNode?.filePath || edge.source,
+                target: targetNode?.filePath || edge.target,
+                weight: edge.weight,
+                edgeType: edge.type,
+            });
+        });
+    }
+    /**
+     * Generate actionable recommendations for resolving a circular dependency.
+     *
+     * @param scc - The strongly connected component
+     * @param breakPoints - Suggested break points
+     * @returns Array of recommendation strings
+     */
+    generateRecommendations(scc, breakPoints) {
+        const recommendations = [];
+        recommendations.push(`Circular dependency detected involving ${scc.nodes.length} files`);
+        if (breakPoints.length === 0) {
+            recommendations.push('No break points identified - manual refactoring required');
+            return recommendations;
+        }
+        if (breakPoints.length === 1) {
+            const bp = breakPoints[0];
+            recommendations.push(`Recommended: Break the ${bp.source} -> ${bp.target} dependency`);
+            recommendations.push(`Effort: ${bp.effort} - ${bp.suggestion}`);
+        }
+        else {
+            recommendations.push('Multiple break points available (lowest effort first):');
+            const sorted = [...breakPoints].sort((a, b) => {
+                const order = { low: 0, medium: 1, high: 2 };
+                return order[a.effort] - order[b.effort];
+            });
+            for (const bp of sorted.slice(0, 3)) {
+                recommendations.push(`  - ${bp.source} -> ${bp.target} (${bp.effort} effort)`);
+            }
+        }
+        // Add specific recommendations based on edge types
+        const hasInheritance = scc.edges.some(e => e.type === 'extends' || e.type === 'implements');
+        if (hasInheritance) {
+            recommendations.push('Consider: Favor composition over inheritance');
+        }
+        const hasImports = scc.edges.some(e => e.type === 'imports');
+        if (hasImports) {
+            recommendations.push('Consider: Use dependency injection or event-driven patterns');
+        }
+        return recommendations;
+    }
+    /**
+     * Extract a subgraph containing only the nodes and edges in an SCC.
+     *
+     * @param scc - The strongly connected component
+     * @returns Graph with only SCC nodes and edges
+     */
+    extractSCCSubgraph(scc) {
+        return {
+            nodes: scc.nodes,
+            edges: scc.edges,
+        };
+    }
+    /**
+     * Get statistics about circular dependencies in the graph.
+     *
+     * @returns Object with stats about cycles
+     *
+     * @example
+     * ```typescript
+     * const stats = await detector.getStats();
+     * console.log(`Total cycles: ${stats.totalCycles}`);
+     * console.log(`High severity: ${stats.bySeverity.high}`);
+     * ```
+     */
+    async getStats() {
+        const results = await this.detectAll();
+        const bySeverity = {
+            high: results.filter(r => r.severity === 'high').length,
+            medium: results.filter(r => r.severity === 'medium').length,
+            low: results.filter(r => r.severity === 'low').length,
+        };
+        const cycleSizes = results.map(r => r.cycle.length);
+        const largestCycle = cycleSizes.length > 0 ? Math.max(...cycleSizes) : 0;
+        const avgCycleSize = cycleSizes.length > 0
+            ? cycleSizes.reduce((a, b) => a + b, 0) / cycleSizes.length
+            : 0;
+        return {
+            totalCycles: results.length,
+            bySeverity,
+            largestCycle,
+            avgCycleSize,
+        };
+    }
+}
+exports.CircularDependencyDetector = CircularDependencyDetector;
+//# sourceMappingURL=CircularDependencyDetector.js.map

package/dist/code-intelligence/analysis/mincut/CircularDependencyDetector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CircularDependencyDetector.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/CircularDependencyDetector.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;AAEH,2DAAqD;AACrD,uDAAiD;AAGjD,wDAAkD;AAElD,MAAM,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;AAYpC;;GAEG;AACH,MAAa,0BAA0B;IAIrC;;;;OAIG;IACH,YAAY,KAAgB;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,kCAAc,CAAC;YACjC,SAAS,EAAE,MAAM;YACjB,gBAAgB,EAAE,IAAI;YACtB,QAAQ,EAAE,IAAI;YACd,OAAO,EAAE,KAAK;SACf,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,KAAK,CAAC,SAAS;QACb,MAAM,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;QAEtD,iEAAiE;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,+BAA+B,EAAE,CAAC;QAEpD,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,MAAM,gCAAgC,CAAC,CAAC;QAElE,yDAAyD;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAExD,MAAM,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,MAAM,wBAAwB,CAAC,CAAC;QAE5D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,wBAAwB;QACxB,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAC1C,CAAC;QAEF,2CAA2C;QAC3C,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,aAAa,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YACrD,OAAO,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAS,CAAC,QAAgB;QAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACvC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC;IAC/D,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,YAAY,CACxB,GAA+B;QAE/B,MAAM,CAAC,KAAK,CAAC,wBAAwB,GAAG,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;YAC7D,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;SACnC,CAAC,CAAC;QAEH,gCAAgC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAE9C,mCAAmC;QACnC,MAAM,WAAW,GAAG,8BAAY,CAAC,cAAc,CAAC,QAAQ,EAAE;YACxD,gBAAgB,EAAE,IAAI;YACtB,QAAQ,EAAE,KAAK,EAAE,oCAAoC;SACtD,CAAC,CAAC;QAEH,IAAI,WAAW,GAAiB,EAAE,CAAC;QAEnC,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;YAC9D,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;QACzE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,kDAAkD,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3E,iDAAiD;YACjD,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;QAED,wDAAwD;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QAE7C,2BAA2B;QAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;QAEvE,OAAO;YACL,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC;YAChD,WAAW;YACX,QAAQ;YACR,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,+BAA+B;QACrC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAiC,EAAE,CAAC;QAC9C,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,MAAM,aAAa,GAAG,CAAC,IAAe,EAAE,EAAE;YACxC,oCAAoC;YACpC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YACjC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YACnC,YAAY,EAAE,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAErB,8BAA8B;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7D,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC1C,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACpD,IAAI,CAAC,SAAS;oBAAE,SAAS;gBAEzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7B,oDAAoD;oBACpD,aAAa,CAAC,SAAS,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,EACrB,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAE,CAC3B,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;oBACrC,kCAAkC;oBAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,EACrB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAE,CACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,4DAA4D;YAC5D,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChD,MAAM,GAAG,GAA+B;oBACtC,KAAK,EAAE,EAAE;oBACT,KAAK,EAAE,EAAE;iBACV,CAAC;gBAEF,IAAI,CAAwB,CAAC;gBAC7B,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;oBAChB,IAAI,CAAC,EAAE,CAAC;wBACN,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBACrB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACpB,CAAC;gBACH,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE;gBAEhC,gCAAgC;gBAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;oBAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;oBAC1D,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;wBAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;wBAC1C,IAAI,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;4BACrC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC,CAAC;QAEF,sCAAsC;QACtC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;YACpE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,aAAa,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACK,iBAAiB,CAAC,GAA+B;QACvD,oDAAoD;QACpD,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,MAAM,CAAC;QACxC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC;YAAE,OAAO,MAAM,CAAC;QAE7D,wDAAwD;QACxD,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC3C,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;YAAE,OAAO,QAAQ,CAAC;QAElE,gDAAgD;QAChD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CAAC,IAAa;QACpC,MAAM,SAAS,GAA8C;YAC3D,SAAS,EAAE,KAAK;YAChB,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,QAAQ;YAChB,YAAY,EAAE,QAAQ;YACtB,SAAS,EAAE,MAAM;SAClB,CAAC;QAEF,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,IAAI,QAAQ,CAAC;QAEjE,MAAM,WAAW,GAA2B;YAC1C,KAAK,EAAE,sDAAsD;YAC7D,QAAQ,EAAE,0CAA0C;YACpD,MAAM,EAAE,2EAA2E;SACpF,CAAC;QAEF,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,SAAS;YACpC,MAAM;YACN,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC;SAChC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CAAC,GAA+B;QACtD,wDAAwD;QACxD,MAAM,YAAY,GAA6B;YAC7C,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,EAAE;SACd,CAAC;QAEF,yCAAyC;QACzC,MAAM,WAAW,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/C,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,OAAO,SAAS,GAAG,SAAS,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,6BAA6B;QAC7B,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACxC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAErD,OAAO,IAAI,CAAC,gBAAgB,CAAC;gBAC3B,MAAM,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,CAAC,MAAM;gBAC3C,MAAM,EAAE,UAAU,EAAE,QAAQ,IAAI,IAAI,CAAC,MAAM;gBAC3C,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,QAAQ,EAAE,IAAI,CAAC,IAAI;aACpB,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACK,uBAAuB,CAC7B,GAA+B,EAC/B,WAAyB;QAEzB,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,eAAe,CAAC,IAAI,CAAC,0CAA0C,GAAG,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;QAEzF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,eAAe,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;YACjF,OAAO,eAAe,CAAC;QACzB,CAAC;QAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,0BAA0B,EAAE,CAAC,MAAM,OAAO,EAAE,CAAC,MAAM,aAAa,CAAC,CAAC;YACvF,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,MAAM,MAAM,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;YAC/E,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;YACH,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,OAAO,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,UAAU,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QAED,mDAAmD;QACnD,MAAM,cAAc,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;QAC5F,IAAI,cAAc,EAAE,CAAC;YACnB,eAAe,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QAC7D,IAAI,UAAU,EAAE,CAAC;YACf,eAAe,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;QACtF,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,GAA+B;QACxD,OAAO;YACL,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,KAAK,EAAE,GAAG,CAAC,KAAK;SACjB,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,QAAQ;QAMZ,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QAEvC,MAAM,UAAU,GAAG;YACjB,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,MAAM;YACvD,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,MAAM;YAC3D,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,MAAM;SACtD,CAAC;QAEF,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC;YACxC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM;YAC3D,CAAC,CAAC,CAAC,CAAC;QAEN,OAAO;YACL,WAAW,EAAE,OAAO,CAAC,MAAM;YAC3B,UAAU;YACV,YAAY;YACZ,YAAY;SACb,CAAC;IACJ,CAAC;CACF;AAzaD,gEAyaC"}

package/dist/code-intelligence/analysis/mincut/GraphAdapter.d.ts

@@ -0,0 +1,169 @@
+/**
+ * Graph Adapter for MinCut Analysis
+ *
+ * Converts CodeGraph format to MinCut input format, enabling
+ * minimum cut analysis on code dependency graphs for identifying
+ * optimal module boundaries and coupling reduction points.
+ */
+import { GraphNode, GraphEdge, EdgeType } from '../../graph/types.js';
+import { MinCutGraphInput } from './types.js';
+/**
+ * Options for graph adaptation
+ */
+export interface GraphAdapterOptions {
+    /** Filter function for nodes (return true to include) */
+    nodeFilter?: (node: GraphNode) => boolean;
+    /** Filter function for edges (return true to include) */
+    edgeFilter?: (edge: GraphEdge) => boolean;
+    /** Whether the output graph should be directed */
+    directed?: boolean;
+    /** Whether to normalize edge weights based on edge type */
+    normalizeWeights?: boolean;
+}
+/**
+ * GraphAdapter converts CodeGraph to MinCut input format
+ *
+ * @example
+ * ```typescript
+ * const graphBuilder = new GraphBuilder();
+ * // ... build graph ...
+ *
+ * const adapter = GraphAdapter.toMinCutFormat(graphBuilder.exportGraph(), {
+ *   nodeFilter: (node) => node.type === 'file',
+ *   normalizeWeights: true
+ * });
+ *
+ * const analyzer = new MinCutAnalyzer();
+ * const result = await analyzer.computeMinCut(adapter);
+ * ```
+ */
+export declare class GraphAdapter {
+    /**
+     * Convert CodeGraph to MinCut input format.
+     *
+     * @param graph - The code graph to convert (from GraphBuilder.exportGraph())
+     * @param options - Conversion options
+     * @returns MinCut-compatible graph format
+     *
+     * @example
+     * ```typescript
+     * const minCutInput = GraphAdapter.toMinCutFormat(graph, {
+     *   nodeFilter: (node) => node.type === 'file' || node.type === 'class',
+     *   normalizeWeights: true,
+     *   directed: false
+     * });
+     * ```
+     */
+    static toMinCutFormat(graph: {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }, options?: GraphAdapterOptions): MinCutGraphInput;
+    /**
+     * Normalize edge weight based on edge type.
+     *
+     * Different edge types represent different coupling strengths:
+     * - extends: 1.0 (strongest - inheritance)
+     * - implements: 0.9
+     * - imports: 0.8
+     * - calls: 0.6
+     * - uses: 0.5
+     * - contains: 0.3 (weakest)
+     *
+     * @param edge - The edge to normalize
+     * @returns Normalized weight (0.0 - 1.0)
+     *
+     * @example
+     * ```typescript
+     * const edge = { type: 'extends', weight: 2.5, ... };
+     * const normalized = GraphAdapter.normalizeWeight(edge);
+     * // normalized = 1.0 (extends has highest coupling)
+     * ```
+     */
+    static normalizeWeight(edge: GraphEdge): number;
+    /**
+     * Get coupling weight for an edge type.
+     *
+     * @param edgeType - The type of edge
+     * @returns Weight between 0.0 and 1.0
+     *
+     * @example
+     * ```typescript
+     * const weight = GraphAdapter.getEdgeTypeWeight('extends'); // 1.0
+     * const weight2 = GraphAdapter.getEdgeTypeWeight('uses'); // 0.5
+     * ```
+     */
+    static getEdgeTypeWeight(edgeType: EdgeType): number;
+    /**
+     * Extract a subgraph containing only specified files.
+     *
+     * Useful for analyzing coupling between specific modules or components.
+     * Only includes nodes and edges where both endpoints are in the specified files.
+     *
+     * @param graph - The full code graph
+     * @param filePaths - List of file paths to include
+     * @returns Subgraph containing only specified files
+     *
+     * @example
+     * ```typescript
+     * const subgraph = GraphAdapter.extractFileSubgraph(graph, [
+     *   '/src/auth/login.ts',
+     *   '/src/auth/register.ts'
+     * ]);
+     * // Analyze coupling within auth module
+     * const minCutInput = GraphAdapter.toMinCutFormat(subgraph);
+     * ```
+     */
+    static extractFileSubgraph(graph: {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }, filePaths: string[]): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    /**
+     * Create a file-level dependency graph from a detailed code graph.
+     *
+     * Aggregates all relationships between files, useful for module-level analysis.
+     *
+     * @param graph - The detailed code graph
+     * @returns File-level graph with aggregated edges
+     *
+     * @example
+     * ```typescript
+     * const fileGraph = GraphAdapter.aggregateByFile(detailedGraph);
+     * const minCutInput = GraphAdapter.toMinCutFormat(fileGraph, {
+     *   normalizeWeights: true
+     * });
+     * // Analyze optimal module splits at file level
+     * ```
+     */
+    static aggregateByFile(graph: {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }): {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    };
+    /**
+     * Validate that a graph is suitable for MinCut analysis.
+     *
+     * @param graph - Graph to validate
+     * @returns Validation result with error messages
+     *
+     * @example
+     * ```typescript
+     * const validation = GraphAdapter.validateGraph(graph);
+     * if (!validation.valid) {
+     *   console.error('Invalid graph:', validation.errors);
+     * }
+     * ```
+     */
+    static validateGraph(graph: {
+        nodes: GraphNode[];
+        edges: GraphEdge[];
+    }): {
+        valid: boolean;
+        errors: string[];
+    };
+}
+//# sourceMappingURL=GraphAdapter.d.ts.map

package/dist/code-intelligence/analysis/mincut/GraphAdapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphAdapter.d.ts","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/GraphAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAa,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,yDAAyD;IACzD,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAC;IAE1C,yDAAyD;IACzD,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAC;IAE1C,kDAAkD;IAClD,QAAQ,CAAC,EAAE,OAAO,CAAC;IAEnB,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAqBD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,YAAY;IACvB;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,cAAc,CACnB,KAAK,EAAE;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,EACjD,OAAO,GAAE,mBAAwB,GAChC,gBAAgB;IAkFnB;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM;IAU/C;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM;IAIpD;;;;;;;;;;;;;;;;;;;OAmBG;IACH,MAAM,CAAC,mBAAmB,CACxB,KAAK,EAAE;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,EACjD,SAAS,EAAE,MAAM,EAAE,GAClB;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE;IAyB7C;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,eAAe,CACpB,KAAK,EAAE;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,GAChD;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE;IA6E7C;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,aAAa,CAClB,KAAK,EAAE;QAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAAC,KAAK,EAAE,SAAS,EAAE,CAAA;KAAE,GAChD;QAAE,KAAK,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;CAkCxC"}