agentic-qe 2.6.5 → 2.6.6

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

@@ -0,0 +1,434 @@
+"use strict";
+/**
+ * Module Coupling Analyzer
+ *
+ * High-level analyzer for module coupling that provides actionable insights
+ * for code quality improvement. Uses MinCut analysis to identify optimal
+ * module boundaries and coupling reduction points.
+ *
+ * @example
+ * ```typescript
+ * const graph = graphBuilder.exportGraph();
+ * const analyzer = new ModuleCouplingAnalyzer(graph, {
+ *   moduleGrouping: 'directory',
+ *   minCouplingThreshold: 0.1
+ * });
+ *
+ * // Analyze coupling between two modules
+ * const result = await analyzer.analyzeCoupling('src/auth', 'src/user');
+ * console.log('Coupling strength:', result.couplingStrength);
+ * console.log('Recommendations:', result.recommendations);
+ *
+ * // Find all highly coupled module pairs
+ * const coupled = await analyzer.findHighlyCoupledModules(0.7);
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ModuleCouplingAnalyzer = 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();
+/**
+ * ModuleCouplingAnalyzer - High-level analyzer for module coupling
+ *
+ * Provides actionable insights about module coupling and recommendations
+ * for improving code quality through better module boundaries.
+ */
+class ModuleCouplingAnalyzer {
+    /**
+     * Create a new ModuleCouplingAnalyzer
+     *
+     * @param graph - Code graph to analyze (from GraphBuilder.exportGraph())
+     * @param options - Analysis options
+     */
+    constructor(graph, options = {}) {
+        this.graph = graph;
+        this.analyzer = new MinCutAnalyzer_js_1.MinCutAnalyzer(options.minCutConfig);
+        this.options = {
+            minCutConfig: options.minCutConfig || {},
+            moduleGrouping: options.moduleGrouping || 'directory',
+            customModuleExtractor: options.customModuleExtractor || this.defaultModuleExtractor.bind(this),
+            minCouplingThreshold: options.minCouplingThreshold || 0.1,
+        };
+        logger.info('ModuleCouplingAnalyzer initialized', {
+            nodeCount: graph.nodes.size,
+            edgeCount: graph.edges.size,
+            moduleGrouping: this.options.moduleGrouping,
+        });
+    }
+    /**
+     * Analyze coupling between two specific modules
+     *
+     * @param module1Path - Path to first module
+     * @param module2Path - Path to second module
+     * @returns Promise resolving to coupling analysis result
+     *
+     * @example
+     * ```typescript
+     * const result = await analyzer.analyzeCoupling('src/auth', 'src/user');
+     * if (result.couplingStrength > 0.7) {
+     *   console.log('High coupling detected!');
+     *   console.log('Recommendations:', result.recommendations);
+     * }
+     * ```
+     */
+    async analyzeCoupling(module1Path, module2Path) {
+        logger.debug('Analyzing coupling', { module1Path, module2Path });
+        // 1. Extract nodes for both modules
+        const module1Nodes = this.getModuleNodes(module1Path);
+        const module2Nodes = this.getModuleNodes(module2Path);
+        if (module1Nodes.length === 0 || module2Nodes.length === 0) {
+            logger.warn('One or both modules have no nodes', {
+                module1Count: module1Nodes.length,
+                module2Count: module2Nodes.length,
+            });
+            return {
+                module1: module1Path,
+                module2: module2Path,
+                couplingStrength: 0,
+                sharedDependencies: [],
+                circularDependency: false,
+                cutEdges: [],
+                recommendations: ['One or both modules not found in the code graph'],
+            };
+        }
+        // 2. Build subgraph containing only these modules
+        const subgraph = this.extractModuleSubgraph(module1Nodes, module2Nodes);
+        // 3. Run MinCut analysis
+        const minCutInput = GraphAdapter_js_1.GraphAdapter.toMinCutFormat(subgraph, {
+            normalizeWeights: true,
+            directed: false,
+        });
+        let result;
+        try {
+            result = await this.analyzer.computeMinCut(minCutInput);
+        }
+        catch (error) {
+            logger.error('MinCut computation failed', { error });
+            return {
+                module1: module1Path,
+                module2: module2Path,
+                couplingStrength: 0,
+                sharedDependencies: [],
+                circularDependency: false,
+                cutEdges: [],
+                recommendations: ['Failed to compute minimum cut - graph may be too large or disconnected'],
+            };
+        }
+        // 4. Calculate coupling strength
+        const couplingStrength = this.calculateCouplingStrength(result, subgraph);
+        // 5. Check for circular dependency
+        const circular = this.hasCircularDependency(module1Nodes, module2Nodes);
+        // 6. Find shared dependencies
+        const shared = this.findSharedDependencies(module1Nodes, module2Nodes);
+        // 7. Generate recommendations
+        const recommendations = this.generateRecommendations(couplingStrength, circular, result.cutEdges);
+        logger.debug('Coupling analysis complete', {
+            module1Path,
+            module2Path,
+            couplingStrength,
+            circularDependency: circular,
+        });
+        return {
+            module1: module1Path,
+            module2: module2Path,
+            couplingStrength,
+            sharedDependencies: shared,
+            circularDependency: circular,
+            cutEdges: result.cutEdges,
+            recommendations,
+        };
+    }
+    /**
+     * Find all highly coupled module pairs
+     *
+     * @param threshold - Minimum coupling strength to include (0-1, default 0.7)
+     * @returns Promise resolving to array of coupling results, sorted by strength
+     *
+     * @example
+     * ```typescript
+     * const coupled = await analyzer.findHighlyCoupledModules(0.7);
+     * for (const pair of coupled) {
+     *   console.log(`${pair.module1} <-> ${pair.module2}: ${pair.couplingStrength}`);
+     * }
+     * ```
+     */
+    async findHighlyCoupledModules(threshold = 0.7) {
+        const modules = this.getUniqueModules();
+        const results = [];
+        logger.info('Finding highly coupled modules', {
+            moduleCount: modules.length,
+            threshold,
+        });
+        // Analyze all module pairs
+        for (let i = 0; i < modules.length; i++) {
+            for (let j = i + 1; j < modules.length; j++) {
+                const result = await this.analyzeCoupling(modules[i], modules[j]);
+                // Only include if above minimum threshold AND above requested threshold
+                if (result.couplingStrength >= this.options.minCouplingThreshold &&
+                    result.couplingStrength >= threshold) {
+                    results.push(result);
+                }
+            }
+        }
+        // Sort by coupling strength (highest first)
+        results.sort((a, b) => b.couplingStrength - a.couplingStrength);
+        logger.info('Found highly coupled modules', { count: results.length });
+        return results;
+    }
+    /**
+     * Get a coupling summary for the entire codebase
+     *
+     * @returns Promise resolving to overall coupling statistics and recommendations
+     *
+     * @example
+     * ```typescript
+     * const overview = await analyzer.getCouplingOverview();
+     * console.log('Average coupling:', overview.averageCoupling);
+     * console.log('Recommendations:', overview.recommendations);
+     * ```
+     */
+    async getCouplingOverview() {
+        logger.info('Computing coupling overview');
+        // Analyze all module pairs (no threshold filter)
+        const allResults = await this.findHighlyCoupledModules(0);
+        if (allResults.length === 0) {
+            return {
+                averageCoupling: 0,
+                maxCoupling: 0,
+                highlyCoupledPairs: 0,
+                circularDependencies: 0,
+                recommendations: ['No module coupling found - graph may be disconnected or too small'],
+            };
+        }
+        const average = allResults.reduce((sum, r) => sum + r.couplingStrength, 0) / allResults.length;
+        const max = Math.max(...allResults.map(r => r.couplingStrength));
+        const highlyPaired = allResults.filter(r => r.couplingStrength > 0.7).length;
+        const circular = allResults.filter(r => r.circularDependency).length;
+        const recommendations = [];
+        if (average > 0.5) {
+            recommendations.push('Consider breaking up large modules into smaller, focused units');
+        }
+        if (circular > 0) {
+            recommendations.push(`Found ${circular} circular dependencies - consider introducing abstraction layers`);
+        }
+        if (highlyPaired > 0) {
+            recommendations.push(`Found ${highlyPaired} highly coupled module pairs - review for potential merging or refactoring`);
+        }
+        if (average < 0.3 && highlyPaired === 0) {
+            recommendations.push('Module coupling is low - good separation of concerns');
+        }
+        logger.info('Coupling overview complete', {
+            averageCoupling: average,
+            maxCoupling: max,
+            highlyCoupledPairs: highlyPaired,
+            circularDependencies: circular,
+        });
+        return {
+            averageCoupling: average,
+            maxCoupling: max,
+            highlyCoupledPairs: highlyPaired,
+            circularDependencies: circular,
+            recommendations,
+        };
+    }
+    /**
+     * Get all nodes belonging to a module
+     */
+    getModuleNodes(modulePath) {
+        const nodes = [];
+        for (const node of this.graph.nodes.values()) {
+            const nodeModule = this.extractModulePath(node.filePath);
+            if (nodeModule === modulePath) {
+                nodes.push(node);
+            }
+        }
+        return nodes;
+    }
+    /**
+     * Extract module subgraph containing only specified nodes
+     */
+    extractModuleSubgraph(nodes1, nodes2) {
+        const allNodes = [...nodes1, ...nodes2];
+        const nodeIdSet = new Set(allNodes.map(n => n.id));
+        // Filter edges to only those connecting nodes in the subgraph
+        const edges = [];
+        for (const edge of this.graph.edges.values()) {
+            if (nodeIdSet.has(edge.source) && nodeIdSet.has(edge.target)) {
+                edges.push(edge);
+            }
+        }
+        return { nodes: allNodes, edges };
+    }
+    /**
+     * Calculate coupling strength from MinCut result
+     *
+     * Coupling strength is calculated as:
+     * - If cutValue is 0: coupling = 0 (no connection)
+     * - Otherwise: coupling = normalized based on cut edges and graph structure
+     */
+    calculateCouplingStrength(result, graph) {
+        if (result.cutValue === 0 || graph.edges.length === 0) {
+            return 0;
+        }
+        // Calculate total possible weight (all edges)
+        const totalWeight = graph.edges.reduce((sum, e) => sum + e.weight, 0);
+        if (totalWeight === 0) {
+            return 0;
+        }
+        // Coupling strength is the ratio of cut value to total weight
+        // Cut edges represent the coupling between modules
+        const rawStrength = result.cutValue / totalWeight;
+        // Cap at 1.0 and ensure it's in [0, 1] range
+        return Math.min(1.0, Math.max(0, rawStrength));
+    }
+    /**
+     * Check if there's a circular dependency between module nodes
+     */
+    hasCircularDependency(nodes1, nodes2) {
+        const nodeIds1 = new Set(nodes1.map(n => n.id));
+        const nodeIds2 = new Set(nodes2.map(n => n.id));
+        // Check if there are edges in both directions
+        let hasForward = false;
+        let hasBackward = false;
+        for (const edge of this.graph.edges.values()) {
+            // Forward: module1 -> module2
+            if (nodeIds1.has(edge.source) && nodeIds2.has(edge.target)) {
+                hasForward = true;
+            }
+            // Backward: module2 -> module1
+            if (nodeIds2.has(edge.source) && nodeIds1.has(edge.target)) {
+                hasBackward = true;
+            }
+            if (hasForward && hasBackward) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Find dependencies shared by both modules
+     */
+    findSharedDependencies(nodes1, nodes2) {
+        const nodeIds1 = new Set(nodes1.map(n => n.id));
+        const nodeIds2 = new Set(nodes2.map(n => n.id));
+        // Find external dependencies for each module
+        const deps1 = new Set();
+        const deps2 = new Set();
+        for (const edge of this.graph.edges.values()) {
+            // Dependencies of module 1 (exclude internal and module 2)
+            if (nodeIds1.has(edge.source) &&
+                !nodeIds1.has(edge.target) &&
+                !nodeIds2.has(edge.target)) {
+                deps1.add(edge.target);
+            }
+            // Dependencies of module 2 (exclude internal and module 1)
+            if (nodeIds2.has(edge.source) &&
+                !nodeIds2.has(edge.target) &&
+                !nodeIds1.has(edge.target)) {
+                deps2.add(edge.target);
+            }
+        }
+        // Find intersection
+        const shared = [];
+        for (const dep of deps1) {
+            if (deps2.has(dep)) {
+                shared.push(dep);
+            }
+        }
+        return shared;
+    }
+    /**
+     * Generate actionable recommendations based on coupling analysis
+     */
+    generateRecommendations(strength, circular, edges) {
+        const recommendations = [];
+        // Recommendations based on coupling strength
+        if (strength > 0.8) {
+            recommendations.push('Very high coupling detected - strongly consider merging these modules');
+            recommendations.push('If merging is not appropriate, extract shared functionality to a separate module');
+        }
+        else if (strength > 0.6) {
+            recommendations.push('High coupling detected - review for potential refactoring');
+            recommendations.push('Consider extracting shared functionality to reduce interdependence');
+        }
+        else if (strength > 0.4) {
+            recommendations.push('Moderate coupling - acceptable for closely related modules');
+            recommendations.push('Monitor for further increases in coupling');
+        }
+        else if (strength < 0.2) {
+            recommendations.push('Low coupling - modules are well-isolated');
+            recommendations.push('No immediate action needed');
+        }
+        // Recommendations for circular dependencies
+        if (circular) {
+            recommendations.push('⚠️ Circular dependency detected - this should be resolved');
+            recommendations.push('Break the cycle by:');
+            recommendations.push('  1. Introducing an interface/abstraction layer');
+            recommendations.push('  2. Moving shared code to a third module');
+            recommendations.push('  3. Using dependency injection');
+            recommendations.push('  4. Applying the Dependency Inversion Principle');
+        }
+        // Recommendations for specific edges to break
+        if (edges.length > 0 && edges.length <= 5) {
+            recommendations.push(`Consider breaking these ${edges.length} key dependencies:`);
+            for (const edge of edges.slice(0, 5)) {
+                recommendations.push(`  - ${edge.source} -> ${edge.target}`);
+            }
+        }
+        else if (edges.length > 5) {
+            recommendations.push(`Many dependencies found (${edges.length} total)`);
+            recommendations.push('Review the top dependencies and extract common patterns');
+        }
+        return recommendations;
+    }
+    /**
+     * Get unique module identifiers from the graph
+     */
+    getUniqueModules() {
+        const modules = new Set();
+        for (const node of this.graph.nodes.values()) {
+            const modulePath = this.extractModulePath(node.filePath);
+            modules.add(modulePath);
+        }
+        return Array.from(modules).sort();
+    }
+    /**
+     * Extract module path from file path based on grouping strategy
+     */
+    extractModulePath(filePath) {
+        if (this.options.moduleGrouping === 'custom') {
+            return this.options.customModuleExtractor(filePath);
+        }
+        if (this.options.moduleGrouping === 'file') {
+            return filePath;
+        }
+        // 'directory' mode - extract directory path
+        return this.defaultModuleExtractor(filePath);
+    }
+    /**
+     * Default module extractor - extracts directory path
+     */
+    defaultModuleExtractor(filePath) {
+        const parts = filePath.split('/');
+        // Remove filename
+        parts.pop();
+        // Return directory path, or filename if no directory
+        return parts.length > 0 ? parts.join('/') : filePath;
+    }
+    /**
+     * Get current analysis options
+     */
+    getOptions() {
+        return { ...this.options };
+    }
+    /**
+     * Get the underlying graph
+     */
+    getGraph() {
+        return this.graph;
+    }
+}
+exports.ModuleCouplingAnalyzer = ModuleCouplingAnalyzer;
+//# sourceMappingURL=ModuleCouplingAnalyzer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ModuleCouplingAnalyzer.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/ModuleCouplingAnalyzer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;;;AAEH,2DAAqD;AACrD,uDAAiD;AAGjD,wDAAkD;AAElD,MAAM,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;AAmBpC;;;;;GAKG;AACH,MAAa,sBAAsB;IAKjC;;;;;OAKG;IACH,YAAY,KAAgB,EAAE,UAAiC,EAAE;QAC/D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,kCAAc,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,GAAG;YACb,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,EAAE;YACxC,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,WAAW;YACrD,qBAAqB,EAAE,OAAO,CAAC,qBAAqB,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9F,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,IAAI,GAAG;SAC1D,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,oCAAoC,EAAE;YAChD,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI;YAC3B,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI;YAC3B,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,cAAc;SAC5C,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,eAAe,CACnB,WAAmB,EACnB,WAAmB;QAEnB,MAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC,CAAC;QAEjE,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAEtD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE;gBAC/C,YAAY,EAAE,YAAY,CAAC,MAAM;gBACjC,YAAY,EAAE,YAAY,CAAC,MAAM;aAClC,CAAC,CAAC;YAEH,OAAO;gBACL,OAAO,EAAE,WAAW;gBACpB,OAAO,EAAE,WAAW;gBACpB,gBAAgB,EAAE,CAAC;gBACnB,kBAAkB,EAAE,EAAE;gBACtB,kBAAkB,EAAE,KAAK;gBACzB,QAAQ,EAAE,EAAE;gBACZ,eAAe,EAAE,CAAC,iDAAiD,CAAC;aACrE,CAAC;QACJ,CAAC;QAED,kDAAkD;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QAExE,yBAAyB;QACzB,MAAM,WAAW,GAAG,8BAAY,CAAC,cAAc,CAAC,QAAQ,EAAE;YACxD,gBAAgB,EAAE,IAAI;YACtB,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;QAEH,IAAI,MAAoB,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAC1D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,2BAA2B,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YACrD,OAAO;gBACL,OAAO,EAAE,WAAW;gBACpB,OAAO,EAAE,WAAW;gBACpB,gBAAgB,EAAE,CAAC;gBACnB,kBAAkB,EAAE,EAAE;gBACtB,kBAAkB,EAAE,KAAK;gBACzB,QAAQ,EAAE,EAAE;gBACZ,eAAe,EAAE,CAAC,wEAAwE,CAAC;aAC5F,CAAC;QACJ,CAAC;QAED,iCAAiC;QACjC,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAE1E,mCAAmC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QAExE,8BAA8B;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QAEvE,8BAA8B;QAC9B,MAAM,eAAe,GAAG,IAAI,CAAC,uBAAuB,CAClD,gBAAgB,EAChB,QAAQ,EACR,MAAM,CAAC,QAAQ,CAChB,CAAC;QAEF,MAAM,CAAC,KAAK,CAAC,4BAA4B,EAAE;YACzC,WAAW;YACX,WAAW;YACX,gBAAgB;YAChB,kBAAkB,EAAE,QAAQ;SAC7B,CAAC,CAAC;QAEH,OAAO;YACL,OAAO,EAAE,WAAW;YACpB,OAAO,EAAE,WAAW;YACpB,gBAAgB;YAChB,kBAAkB,EAAE,MAAM;YAC1B,kBAAkB,EAAE,QAAQ;YAC5B,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,wBAAwB,CAC5B,SAAS,GAAG,GAAG;QAEf,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxC,MAAM,OAAO,GAA2B,EAAE,CAAC;QAE3C,MAAM,CAAC,IAAI,CAAC,gCAAgC,EAAE;YAC5C,WAAW,EAAE,OAAO,CAAC,MAAM;YAC3B,SAAS;SACV,CAAC,CAAC;QAEH,2BAA2B;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAElE,wEAAwE;gBACxE,IAAI,MAAM,CAAC,gBAAgB,IAAI,IAAI,CAAC,OAAO,CAAC,oBAAoB;oBAC5D,MAAM,CAAC,gBAAgB,IAAI,SAAS,EAAE,CAAC;oBACzC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;QAEhE,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAEvE,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,mBAAmB;QAOvB,MAAM,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAE3C,iDAAiD;QACjD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO;gBACL,eAAe,EAAE,CAAC;gBAClB,WAAW,EAAE,CAAC;gBACd,kBAAkB,EAAE,CAAC;gBACrB,oBAAoB,EAAE,CAAC;gBACvB,eAAe,EAAE,CAAC,mEAAmE,CAAC;aACvF,CAAC;QACJ,CAAC;QAED,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;QAC/F,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACjE,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;QAC7E,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC;QAErE,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;YAClB,eAAe,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;QACzF,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,eAAe,CAAC,IAAI,CAAC,SAAS,QAAQ,kEAAkE,CAAC,CAAC;QAC5G,CAAC;QAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,eAAe,CAAC,IAAI,CAAC,SAAS,YAAY,4EAA4E,CAAC,CAAC;QAC1H,CAAC;QAED,IAAI,OAAO,GAAG,GAAG,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACxC,eAAe,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;QAC/E,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,4BAA4B,EAAE;YACxC,eAAe,EAAE,OAAO;YACxB,WAAW,EAAE,GAAG;YAChB,kBAAkB,EAAE,YAAY;YAChC,oBAAoB,EAAE,QAAQ;SAC/B,CAAC,CAAC;QAEH,OAAO;YACL,eAAe,EAAE,OAAO;YACxB,WAAW,EAAE,GAAG;YAChB,kBAAkB,EAAE,YAAY;YAChC,oBAAoB,EAAE,QAAQ;YAC9B,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,UAAkB;QACvC,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,MAAmB,EACnB,MAAmB;QAEnB,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnD,8DAA8D;QAC9D,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACK,yBAAyB,CAC/B,MAAoB,EACpB,KAAiD;QAEjD,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,8CAA8C;QAC9C,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEtE,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,8DAA8D;QAC9D,mDAAmD;QACnD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,GAAG,WAAW,CAAC;QAElD,6CAA6C;QAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,MAAmB,EACnB,MAAmB;QAEnB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhD,8CAA8C;QAC9C,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,8BAA8B;YAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3D,UAAU,GAAG,IAAI,CAAC;YACpB,CAAC;YAED,+BAA+B;YAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3D,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;YAED,IAAI,UAAU,IAAI,WAAW,EAAE,CAAC;gBAC9B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,MAAmB,EACnB,MAAmB;QAEnB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhD,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,2DAA2D;YAC3D,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBACzB,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC1B,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzB,CAAC;YAED,2DAA2D;YAC3D,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBACzB,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC1B,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,QAAgB,EAChB,QAAiB,EACjB,KAAgD;QAEhD,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,6CAA6C;QAC7C,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YACnB,eAAe,CAAC,IAAI,CAAC,uEAAuE,CAAC,CAAC;YAC9F,eAAe,CAAC,IAAI,CAAC,kFAAkF,CAAC,CAAC;QAC3G,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;YAClF,eAAe,CAAC,IAAI,CAAC,oEAAoE,CAAC,CAAC;QAC7F,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;YACnF,eAAe,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QACpE,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;YACjE,eAAe,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QACrD,CAAC;QAED,4CAA4C;QAC5C,IAAI,QAAQ,EAAE,CAAC;YACb,eAAe,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;YAClF,eAAe,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;YAC5C,eAAe,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;YACxE,eAAe,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;YAClE,eAAe,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;YACxD,eAAe,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;QAC3E,CAAC;QAED,8CAA8C;QAC9C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1C,eAAe,CAAC,IAAI,CAAC,2BAA2B,KAAK,CAAC,MAAM,oBAAoB,CAAC,CAAC;YAClF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACrC,eAAe,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,eAAe,CAAC,IAAI,CAAC,4BAA4B,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC;YACxE,eAAe,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;QAClF,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IACpC,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,QAAgB;QACxC,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,KAAK,QAAQ,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,KAAK,MAAM,EAAE,CAAC;YAC3C,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,4CAA4C;QAC5C,OAAO,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,QAAgB;QAC7C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAElC,kBAAkB;QAClB,KAAK,CAAC,GAAG,EAAE,CAAC;QAEZ,qDAAqD;QACrD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACvD,CAAC;IAED;;OAEG;IACI,UAAU;QACf,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF;AA/eD,wDA+eC"}

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

@@ -0,0 +1,12 @@
+/**
+ * MinCut Analysis Module
+ *
+ * Provides minimum cut analysis for code dependency graphs.
+ * Used to identify optimal module boundaries and coupling reduction points.
+ */
+export { GraphAdapter, GraphAdapterOptions } from './GraphAdapter.js';
+export { MinCutAnalyzer } from './MinCutAnalyzer.js';
+export { CircularDependencyDetector } from './CircularDependencyDetector.js';
+export { ModuleCouplingAnalyzer, ModuleCouplingOptions } from './ModuleCouplingAnalyzer.js';
+export { MinCutGraphInput, MinCutResult, MinCutConfig, DEFAULT_MINCUT_CONFIG, CutEdge, CircularDependencyResult, BreakPoint, ModuleCouplingResult, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,0BAA0B,EAAE,MAAM,iCAAiC,CAAC;AAC7E,OAAO,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAC5F,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,YAAY,EACZ,qBAAqB,EACrB,OAAO,EACP,wBAAwB,EACxB,UAAU,EACV,oBAAoB,GACrB,MAAM,YAAY,CAAC"}

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

@@ -0,0 +1,20 @@
+"use strict";
+/**
+ * MinCut Analysis Module
+ *
+ * Provides minimum cut analysis for code dependency graphs.
+ * Used to identify optimal module boundaries and coupling reduction points.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_MINCUT_CONFIG = exports.ModuleCouplingAnalyzer = exports.CircularDependencyDetector = exports.MinCutAnalyzer = exports.GraphAdapter = void 0;
+var GraphAdapter_js_1 = require("./GraphAdapter.js");
+Object.defineProperty(exports, "GraphAdapter", { enumerable: true, get: function () { return GraphAdapter_js_1.GraphAdapter; } });
+var MinCutAnalyzer_js_1 = require("./MinCutAnalyzer.js");
+Object.defineProperty(exports, "MinCutAnalyzer", { enumerable: true, get: function () { return MinCutAnalyzer_js_1.MinCutAnalyzer; } });
+var CircularDependencyDetector_js_1 = require("./CircularDependencyDetector.js");
+Object.defineProperty(exports, "CircularDependencyDetector", { enumerable: true, get: function () { return CircularDependencyDetector_js_1.CircularDependencyDetector; } });
+var ModuleCouplingAnalyzer_js_1 = require("./ModuleCouplingAnalyzer.js");
+Object.defineProperty(exports, "ModuleCouplingAnalyzer", { enumerable: true, get: function () { return ModuleCouplingAnalyzer_js_1.ModuleCouplingAnalyzer; } });
+var types_js_1 = require("./types.js");
+Object.defineProperty(exports, "DEFAULT_MINCUT_CONFIG", { enumerable: true, get: function () { return types_js_1.DEFAULT_MINCUT_CONFIG; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/index.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,qDAAsE;AAA7D,+GAAA,YAAY,OAAA;AACrB,yDAAqD;AAA5C,mHAAA,cAAc,OAAA;AACvB,iFAA6E;AAApE,2IAAA,0BAA0B,OAAA;AACnC,yEAA4F;AAAnF,mIAAA,sBAAsB,OAAA;AAC/B,uCASoB;AALlB,iHAAA,qBAAqB,OAAA"}

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

@@ -0,0 +1,145 @@
+import { EdgeType } from '../../graph/types.js';
+/**
+ * Result of a minimum cut computation
+ */
+export interface MinCutResult {
+    /** The value (total weight) of the minimum cut */
+    cutValue: number;
+    /** Node IDs in the first partition */
+    partition1: string[];
+    /** Node IDs in the second partition */
+    partition2: string[];
+    /** Edges that were cut to separate the partitions */
+    cutEdges: CutEdge[];
+    /** Algorithm used for computation (currently only stoer-wagner is implemented) */
+    algorithmUsed: 'stoer-wagner';
+    /** Time taken to compute the cut in milliseconds */
+    computationTimeMs: number;
+}
+/**
+ * An edge that crosses the minimum cut
+ */
+export interface CutEdge {
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    target: string;
+    /** Edge weight */
+    weight: number;
+    /** Optional edge type from the knowledge graph */
+    edgeType?: EdgeType;
+}
+/**
+ * Input graph format for MinCut computation
+ */
+export interface MinCutGraphInput {
+    /** Graph nodes */
+    nodes: Array<{
+        id: string;
+        label: string;
+        properties?: Record<string, unknown>;
+    }>;
+    /** Graph edges with weights */
+    edges: Array<{
+        source: string;
+        target: string;
+        weight: number;
+        edgeType?: EdgeType;
+    }>;
+    /** Whether the graph is directed (MinCut works on undirected graphs) */
+    directed: boolean;
+}
+/**
+ * Configuration for MinCut analyzer
+ */
+export interface MinCutConfig {
+    /**
+     * Algorithm selection.
+     * Currently only 'stoer-wagner' is supported (pure JavaScript implementation).
+     * The 'auto' option is kept for backwards compatibility but uses stoer-wagner.
+     */
+    algorithm: 'stoer-wagner' | 'auto';
+    /** Maximum number of nodes before rejecting the graph (recommended: 500 for performance) */
+    maxNodes: number;
+    /** Timeout in milliseconds for computation */
+    timeout: number;
+    /** Whether to normalize edge weights to [0, 1] */
+    normalizeWeights: boolean;
+}
+/**
+ * Default configuration for MinCut analyzer
+ *
+ * Uses Stoer-Wagner algorithm with a 10,000 node limit and 30 second timeout.
+ * For optimal performance, graphs should have < 500 nodes.
+ */
+export declare const DEFAULT_MINCUT_CONFIG: MinCutConfig;
+/**
+ * Internal representation of the graph for MinCut algorithms
+ */
+export interface MinCutGraph {
+    /** Adjacency list: nodeId -> { neighborId: weight } */
+    adjacency: Map<string, Map<string, number>>;
+    /** All node IDs */
+    nodes: string[];
+    /** Total number of nodes */
+    nodeCount: number;
+}
+/**
+ * Result of a single phase in the Stoer-Wagner algorithm
+ */
+export interface StoerWagnerPhase {
+    /** The s-t cut value from this phase */
+    cutValue: number;
+    /** The node that was merged (t) */
+    mergedNode: string;
+    /** The node it was merged into (s) */
+    targetNode: string;
+}
+/**
+ * Result of module coupling analysis
+ */
+export interface ModuleCouplingResult {
+    /** First module (file or directory path) */
+    module1: string;
+    /** Second module (file or directory path) */
+    module2: string;
+    /** Coupling strength (0-1, higher = more coupled) */
+    couplingStrength: number;
+    /** Shared dependencies between modules */
+    sharedDependencies: string[];
+    /** Whether a circular dependency exists */
+    circularDependency: boolean;
+    /** Edges that were cut */
+    cutEdges: CutEdge[];
+    /** Actionable recommendations for reducing coupling */
+    recommendations: string[];
+}
+/**
+ * Result of circular dependency detection
+ */
+export interface CircularDependencyResult {
+    /** Files involved in the circular dependency */
+    cycle: string[];
+    /** Suggested break points to resolve the cycle */
+    breakPoints: BreakPoint[];
+    /** Severity of the circular dependency */
+    severity: 'low' | 'medium' | 'high';
+    /** Recommendations for fixing the cycle */
+    recommendations: string[];
+}
+/**
+ * A suggested point to break a circular dependency
+ */
+export interface BreakPoint {
+    /** Source file/entity in the dependency */
+    source: string;
+    /** Target file/entity in the dependency */
+    target: string;
+    /** Type of edge that should be broken */
+    edgeType: string;
+    /** Estimated effort to break this dependency */
+    effort: 'low' | 'medium' | 'high';
+    /** Specific suggestion for how to break the dependency */
+    suggestion: string;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,kDAAkD;IAClD,QAAQ,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,uCAAuC;IACvC,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,qDAAqD;IACrD,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,kFAAkF;IAClF,aAAa,EAAE,cAAc,CAAC;IAC9B,oDAAoD;IACpD,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,OAAO;IACtB,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,kBAAkB;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,kDAAkD;IAClD,QAAQ,CAAC,EAAE,QAAQ,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,kBAAkB;IAClB,KAAK,EAAE,KAAK,CAAC;QACX,EAAE,EAAE,MAAM,CAAC;QACX,KAAK,EAAE,MAAM,CAAC;QACd,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACtC,CAAC,CAAC;IACH,+BAA+B;IAC/B,KAAK,EAAE,KAAK,CAAC;QACX,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,QAAQ,CAAC;KACrB,CAAC,CAAC;IACH,wEAAwE;IACxE,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,SAAS,EAAE,cAAc,GAAG,MAAM,CAAC;IACnC,4FAA4F;IAC5F,QAAQ,EAAE,MAAM,CAAC;IACjB,8CAA8C;IAC9C,OAAO,EAAE,MAAM,CAAC;IAChB,kDAAkD;IAClD,gBAAgB,EAAE,OAAO,CAAC;CAC3B;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,YAKnC,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,uDAAuD;IACvD,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5C,mBAAmB;IACnB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,4BAA4B;IAC5B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,wCAAwC;IACxC,QAAQ,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,UAAU,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,4CAA4C;IAC5C,OAAO,EAAE,MAAM,CAAC;IAChB,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAC;IAChB,qDAAqD;IACrD,gBAAgB,EAAE,MAAM,CAAC;IACzB,0CAA0C;IAC1C,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,2CAA2C;IAC3C,kBAAkB,EAAE,OAAO,CAAC;IAC5B,0BAA0B;IAC1B,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,uDAAuD;IACvD,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,gDAAgD;IAChD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,kDAAkD;IAClD,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,0CAA0C;IAC1C,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACpC,2CAA2C;IAC3C,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,2CAA2C;IAC3C,MAAM,EAAE,MAAM,CAAC;IACf,2CAA2C;IAC3C,MAAM,EAAE,MAAM,CAAC;IACf,yCAAyC;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,gDAAgD;IAChD,MAAM,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IAClC,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;CACpB"}

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

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_MINCUT_CONFIG = void 0;
+/**
+ * Default configuration for MinCut analyzer
+ *
+ * Uses Stoer-Wagner algorithm with a 10,000 node limit and 30 second timeout.
+ * For optimal performance, graphs should have < 500 nodes.
+ */
+exports.DEFAULT_MINCUT_CONFIG = {
+    algorithm: 'stoer-wagner',
+    maxNodes: 10000,
+    timeout: 30000,
+    normalizeWeights: true,
+};
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/code-intelligence/analysis/mincut/types.ts"],"names":[],"mappings":";;;AAyEA;;;;;GAKG;AACU,QAAA,qBAAqB,GAAiB;IACjD,SAAS,EAAE,cAAc;IACzB,QAAQ,EAAE,KAAK;IACf,OAAO,EAAE,KAAK;IACd,gBAAgB,EAAE,IAAI;CACvB,CAAC"}