@jterrats/smart-deployment 1.0.3

package/lib/dependencies/dependency-graph-builder.js

@@ -0,0 +1,411 @@
+/**
+ * Dependency Graph Builder
+ * Builds a dependency graph from parsed metadata components
+ *
+ * @ac US-028-AC-1: Add nodes for each component
+ * @ac US-028-AC-2: Add edges for each dependency
+ * @ac US-028-AC-3: Handle bidirectional dependencies
+ * @ac US-028-AC-4: Track dependency types (hard, soft)
+ * @ac US-028-AC-5: Support incremental graph building
+ * @ac US-028-AC-6: Validate graph structure
+ *
+ * @issue #28
+ */
+import { getLogger } from '../utils/logger.js';
+const logger = getLogger('DependencyGraphBuilder');
+/**
+ * Dependency Graph Builder
+ *
+ * Performance optimized for 10,000+ nodes:
+ * - Uses Map/Set for O(1) lookups
+ * - Lazy validation
+ * - Incremental building support
+ *
+ * @example
+ * const builder = new DependencyGraphBuilder();
+ * builder.addComponent(apexClassComponent);
+ * builder.addComponent(triggerComponent);
+ * const result = builder.build();
+ * console.log(result.stats.totalComponents); // 2
+ */
+export class DependencyGraphBuilder {
+    // Private properties
+    components = new Map();
+    graph = new Map();
+    reverseGraph = new Map();
+    edges = new Map(); // "from->to" => edge
+    options;
+    // Constructor
+    constructor(options = {}) {
+        this.options = {
+            trackDependencyTypes: options.trackDependencyTypes ?? true,
+            validateStructure: options.validateStructure ?? true,
+            maxNodes: options.maxNodes ?? 50_000,
+        };
+        logger.debug('Initialized DependencyGraphBuilder', {
+            options: this.options,
+        });
+    }
+    // Public getters
+    /**
+     * Get current size of the graph
+     */
+    get size() {
+        return this.components.size;
+    }
+    /**
+     * Check if graph is empty
+     */
+    get isEmpty() {
+        return this.components.size === 0;
+    }
+    // Private static methods
+    /**
+     * Create a node ID from type and name
+     */
+    static createNodeId(type, name) {
+        return `${type}:${name}`;
+    }
+    // Public methods
+    /**
+     * Add a metadata component to the graph
+     *
+     * @ac US-028-AC-1: Add nodes for each component
+     * @ac US-028-AC-5: Support incremental graph building
+     */
+    addComponent(component) {
+        const nodeId = DependencyGraphBuilder.createNodeId(component.type, component.name);
+        // Warn on large graphs
+        if (this.components.size >= this.options.maxNodes) {
+            logger.warn('Graph size exceeds recommended maximum', {
+                current: this.components.size,
+                max: this.options.maxNodes,
+            });
+        }
+        // Add/update component
+        this.components.set(nodeId, component);
+        // Initialize graph entry if not exists
+        if (!this.graph.has(nodeId)) {
+            this.graph.set(nodeId, new Set());
+        }
+        if (!this.reverseGraph.has(nodeId)) {
+            this.reverseGraph.set(nodeId, new Set());
+        }
+        // Add edges from dependencies
+        for (const depId of component.dependencies) {
+            this.addEdge(nodeId, depId, 'hard', 'Declared dependency');
+        }
+        logger.debug('Added component to graph', {
+            nodeId,
+            dependencies: component.dependencies.size,
+        });
+    }
+    /**
+     * Add multiple components at once
+     *
+     * @ac US-028-AC-5: Support incremental graph building
+     */
+    addComponents(components) {
+        const startTime = Date.now();
+        for (const component of components) {
+            this.addComponent(component);
+        }
+        const duration = Date.now() - startTime;
+        logger.info('Added multiple components', {
+            count: components.length,
+            totalNodes: this.components.size,
+            durationMs: duration,
+        });
+    }
+    /**
+     * Add a dependency edge between two nodes
+     *
+     * @ac US-028-AC-2: Add edges for each dependency
+     * @ac US-028-AC-3: Handle bidirectional dependencies
+     * @ac US-028-AC-4: Track dependency types
+     */
+    addEdge(from, to, type = 'hard', reason) {
+        // Add forward edge (A depends on B)
+        if (!this.graph.has(from)) {
+            this.graph.set(from, new Set());
+        }
+        this.graph.get(from).add(to);
+        // Add reverse edge (B is depended on by A)
+        if (!this.reverseGraph.has(to)) {
+            this.reverseGraph.set(to, new Set());
+        }
+        this.reverseGraph.get(to).add(from);
+        // Track edge metadata
+        if (this.options.trackDependencyTypes) {
+            const edgeKey = `${from}->${to}`;
+            this.edges.set(edgeKey, { from, to, type, reason });
+        }
+        logger.debug('Added dependency edge', { from, to, type });
+    }
+    /**
+     * Remove a component and its edges from the graph
+     */
+    removeComponent(nodeId) {
+        if (!this.components.has(nodeId)) {
+            return false;
+        }
+        // Remove component
+        this.components.delete(nodeId);
+        // Remove outgoing edges
+        const outgoing = this.graph.get(nodeId);
+        if (outgoing) {
+            for (const to of outgoing) {
+                this.reverseGraph.get(to)?.delete(nodeId);
+            }
+            this.graph.delete(nodeId);
+        }
+        // Remove incoming edges
+        const incoming = this.reverseGraph.get(nodeId);
+        if (incoming) {
+            for (const from of incoming) {
+                this.graph.get(from)?.delete(nodeId);
+            }
+            this.reverseGraph.delete(nodeId);
+        }
+        logger.debug('Removed component from graph', { nodeId });
+        return true;
+    }
+    /**
+     * Get all dependencies of a component (outgoing edges)
+     */
+    getDependencies(nodeId) {
+        return this.graph.get(nodeId) ?? new Set();
+    }
+    /**
+     * Get all dependents of a component (incoming edges)
+     */
+    getDependents(nodeId) {
+        return this.reverseGraph.get(nodeId) ?? new Set();
+    }
+    /**
+     * Check if there's a direct dependency between two nodes
+     */
+    hasDependency(from, to) {
+        return this.graph.get(from)?.has(to) ?? false;
+    }
+    /**
+     * Build the final dependency analysis result
+     *
+     * @ac US-028-AC-6: Validate graph structure
+     */
+    build() {
+        const startTime = Date.now();
+        logger.info('Building dependency analysis result', {
+            components: this.components.size,
+            edges: this.countEdges(),
+        });
+        // Validate if enabled
+        if (this.options.validateStructure) {
+            this.validate();
+        }
+        // Detect circular dependencies
+        const circularDependencies = this.detectCircularDependencies();
+        // Find isolated components
+        const isolatedComponents = this.findIsolatedComponents();
+        // Generate statistics
+        const stats = this.generateStats();
+        const duration = Date.now() - startTime;
+        logger.info('Dependency graph built successfully', {
+            totalComponents: stats.totalComponents,
+            totalDependencies: stats.totalDependencies,
+            circularDeps: circularDependencies.length,
+            isolated: isolatedComponents.length,
+            durationMs: duration,
+        });
+        return {
+            components: new Map(this.components),
+            graph: new Map(this.graph),
+            reverseGraph: new Map(this.reverseGraph),
+            circularDependencies,
+            isolatedComponents,
+            stats,
+        };
+    }
+    /**
+     * Clear the entire graph
+     */
+    clear() {
+        this.components.clear();
+        this.graph.clear();
+        this.reverseGraph.clear();
+        this.edges.clear();
+        logger.debug('Graph cleared');
+    }
+    // Private methods
+    /**
+     * Validate graph structure
+     *
+     * @ac US-028-AC-6: Validate graph structure
+     */
+    validate() {
+        const errors = [];
+        // Check for dangling references
+        for (const [nodeId, deps] of this.graph.entries()) {
+            for (const depId of deps) {
+                // It's OK if dependency doesn't exist (could be managed package, etc.)
+                // Just log a warning
+                if (!this.components.has(depId) && !this.graph.has(depId)) {
+                    logger.warn('Dangling reference detected', {
+                        from: nodeId,
+                        to: depId,
+                    });
+                }
+            }
+        }
+        // Check for self-loops
+        for (const [nodeId, deps] of this.graph.entries()) {
+            if (deps.has(nodeId)) {
+                errors.push(`Self-loop detected: ${nodeId}`);
+            }
+        }
+        if (errors.length > 0) {
+            logger.error('Graph validation failed', { errors });
+            throw new Error(`Graph validation failed:\n${errors.join('\n')}`);
+        }
+        logger.debug('Graph validation passed');
+    }
+    /**
+     * Detect circular dependencies using DFS
+     */
+    detectCircularDependencies() {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const currentPath = [];
+        const dfs = (nodeId) => {
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            currentPath.push(nodeId);
+            const deps = this.graph.get(nodeId) ?? new Set();
+            for (const depId of deps) {
+                if (!visited.has(depId)) {
+                    dfs(depId);
+                }
+                else if (recursionStack.has(depId)) {
+                    // Found a cycle
+                    const cycleStart = currentPath.indexOf(depId);
+                    const cycle = currentPath.slice(cycleStart);
+                    cycles.push({
+                        cycle,
+                        severity: 'warning',
+                        message: `Circular dependency detected: ${cycle.join(' → ')} → ${depId}`,
+                    });
+                }
+            }
+            recursionStack.delete(nodeId);
+            currentPath.pop();
+        };
+        for (const nodeId of this.graph.keys()) {
+            if (!visited.has(nodeId)) {
+                dfs(nodeId);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Find components with no dependencies or dependents
+     */
+    findIsolatedComponents() {
+        const isolated = [];
+        for (const nodeId of this.components.keys()) {
+            const deps = this.graph.get(nodeId)?.size ?? 0;
+            const dependents = this.reverseGraph.get(nodeId)?.size ?? 0;
+            if (deps === 0 && dependents === 0) {
+                isolated.push(nodeId);
+            }
+        }
+        return isolated;
+    }
+    /**
+     * Generate graph statistics
+     */
+    generateStats() {
+        const componentsByType = {};
+        const dependencyCounts = new Map();
+        const dependentCounts = new Map();
+        // Count by type
+        for (const component of this.components.values()) {
+            componentsByType[component.type] = (componentsByType[component.type] ?? 0) + 1;
+        }
+        // Count dependencies and dependents
+        for (const [nodeId, deps] of this.graph.entries()) {
+            dependencyCounts.set(nodeId, deps.size);
+        }
+        for (const [nodeId, dependents] of this.reverseGraph.entries()) {
+            dependentCounts.set(nodeId, dependents.size);
+        }
+        // Find most depended
+        let mostDepended = { nodeId: '', count: 0 };
+        for (const [nodeId, count] of dependentCounts.entries()) {
+            if (count > mostDepended.count) {
+                mostDepended = { nodeId, count };
+            }
+        }
+        // Find node with most dependencies
+        let mostDependencies = { nodeId: '', count: 0 };
+        for (const [nodeId, count] of dependencyCounts.entries()) {
+            if (count > mostDependencies.count) {
+                mostDependencies = { nodeId, count };
+            }
+        }
+        // Calculate max depth (simplified - would need topological sort for accurate depth)
+        const maxDepth = this.calculateMaxDepth();
+        return {
+            totalComponents: this.components.size,
+            totalDependencies: this.countEdges(),
+            componentsByType,
+            maxDepth,
+            mostDepended,
+            mostDependencies,
+        };
+    }
+    /**
+     * Calculate maximum dependency depth (simplified BFS)
+     */
+    calculateMaxDepth() {
+        let maxDepth = 0;
+        for (const startNode of this.components.keys()) {
+            const depth = this.bfsDepth(startNode);
+            maxDepth = Math.max(maxDepth, depth);
+        }
+        return maxDepth;
+    }
+    /**
+     * BFS to calculate depth from a starting node
+     */
+    bfsDepth(startNode) {
+        const visited = new Set();
+        const queue = [{ node: startNode, depth: 0 }];
+        let maxDepth = 0;
+        while (queue.length > 0) {
+            const { node, depth } = queue.shift();
+            if (visited.has(node))
+                continue;
+            visited.add(node);
+            maxDepth = Math.max(maxDepth, depth);
+            const deps = this.graph.get(node) ?? new Set();
+            for (const depId of deps) {
+                if (!visited.has(depId)) {
+                    queue.push({ node: depId, depth: depth + 1 });
+                }
+            }
+        }
+        return maxDepth;
+    }
+    /**
+     * Count total edges in the graph
+     */
+    countEdges() {
+        let count = 0;
+        for (const deps of this.graph.values()) {
+            count += deps.size;
+        }
+        return count;
+    }
+}
+//# sourceMappingURL=dependency-graph-builder.js.map

package/lib/dependencies/dependency-graph-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph-builder.js","sourceRoot":"","sources":["../../src/dependencies/dependency-graph-builder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAW/C,MAAM,MAAM,GAAG,SAAS,CAAC,wBAAwB,CAAC,CAAC;AA6BnD;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,sBAAsB;IACjC,qBAAqB;IACb,UAAU,GAAmC,IAAI,GAAG,EAAE,CAAC;IACvD,KAAK,GAAoB,IAAI,GAAG,EAAE,CAAC;IACnC,YAAY,GAAiB,IAAI,GAAG,EAAE,CAAC;IACvC,KAAK,GAAgC,IAAI,GAAG,EAAE,CAAC,CAAC,qBAAqB;IACrE,OAAO,CAAgC;IAE/C,cAAc;IACd,YAAmB,UAA+B,EAAE;QAClD,IAAI,CAAC,OAAO,GAAG;YACb,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,IAAI,IAAI;YAC1D,iBAAiB,EAAE,OAAO,CAAC,iBAAiB,IAAI,IAAI;YACpD,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,MAAM;SACrC,CAAC;QAEF,MAAM,CAAC,KAAK,CAAC,oCAAoC,EAAE;YACjD,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB,CAAC,CAAC;IACL,CAAC;IAED,iBAAiB;IACjB;;OAEG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,yBAAyB;IACzB;;OAEG;IACK,MAAM,CAAC,YAAY,CAAC,IAAkB,EAAE,IAAY;QAC1D,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,iBAAiB;IACjB;;;;;OAKG;IACI,YAAY,CAAC,SAA4B;QAC9C,MAAM,MAAM,GAAG,sBAAsB,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAEnF,uBAAuB;QACvB,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,wCAAwC,EAAE;gBACpD,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;gBAC7B,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ;aAC3B,CAAC,CAAC;QACL,CAAC;QAED,uBAAuB;QACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAEvC,uCAAuC;QACvC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC;QAED,8BAA8B;QAC9B,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,qBAAqB,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,0BAA0B,EAAE;YACvC,MAAM;YACN,YAAY,EAAE,SAAS,CAAC,YAAY,CAAC,IAAI;SAC1C,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,UAA+B;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE;YACvC,KAAK,EAAE,UAAU,CAAC,MAAM;YACxB,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAChC,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,OAAuB,MAAM,EAAE,MAAe;QACrF,oCAAoC;QACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAE9B,2CAA2C;QAC3C,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAErC,sBAAsB;QACtB,IAAI,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC;YACtC,MAAM,OAAO,GAAG,GAAG,IAAI,KAAK,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,MAAc;QACnC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mBAAmB;QACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE/B,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QAED,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACvC,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,MAAc;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,MAAc;QACjC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IACpD,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,IAAY,EAAE,EAAU;QAC3C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,MAAM,CAAC,IAAI,CAAC,qCAAqC,EAAE;YACjD,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAChC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE;SACzB,CAAC,CAAC;QAEH,sBAAsB;QACtB,IAAI,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACnC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAED,+BAA+B;QAC/B,MAAM,oBAAoB,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAE/D,2BAA2B;QAC3B,MAAM,kBAAkB,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAEzD,sBAAsB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAEnC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,qCAAqC,EAAE;YACjD,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;YAC1C,YAAY,EAAE,oBAAoB,CAAC,MAAM;YACzC,QAAQ,EAAE,kBAAkB,CAAC,MAAM;YACnC,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;QAEH,OAAO;YACL,UAAU,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC;YACpC,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC;YAC1B,YAAY,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;YACxC,oBAAoB;YACpB,kBAAkB;YAClB,KAAK;SACN,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAChC,CAAC;IAED,kBAAkB;IAClB;;;;OAIG;IACK,QAAQ;QACd,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,gCAAgC;QAChC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,uEAAuE;gBACvE,qBAAqB;gBACrB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1D,MAAM,CAAC,IAAI,CAAC,6BAA6B,EAAE;wBACzC,IAAI,EAAE,MAAM;wBACZ,EAAE,EAAE,KAAK;qBACV,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,uBAAuB,MAAM,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,yBAAyB,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACpD,MAAM,IAAI,KAAK,CAAC,6BAA6B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,0BAA0B;QAChC,MAAM,MAAM,GAAyB,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAQ,EAAE;YACnC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YACjD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,GAAG,CAAC,KAAK,CAAC,CAAC;gBACb,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,gBAAgB;oBAChB,MAAM,UAAU,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBAC9C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAC5C,MAAM,CAAC,IAAI,CAAC;wBACV,KAAK;wBACL,QAAQ,EAAE,SAAS;wBACnB,OAAO,EAAE,iCAAiC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE;qBACzE,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,sBAAsB;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YAE5D,IAAI,IAAI,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;gBACnC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,aAAa;QACnB,MAAM,gBAAgB,GAA2B,EAAE,CAAC;QACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;QAElD,gBAAgB;QAChB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjF,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,gBAAgB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/D,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;QAC/C,CAAC;QAED,qBAAqB;QACrB,IAAI,YAAY,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YACxD,IAAI,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC;gBAC/B,YAAY,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YACnC,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,gBAAgB,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAChD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;YACzD,IAAI,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC;gBACnC,gBAAgB,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;YACvC,CAAC;QACH,CAAC;QAED,oFAAoF;QACpF,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE1C,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACrC,iBAAiB,EAAE,IAAI,CAAC,UAAU,EAAE;YACpC,gBAAgB;YAChB,QAAQ;YACR,YAAY;YACZ,gBAAgB;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACvC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,SAAiB;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACtF,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEvC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAErC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,UAAU;QAChB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/lib/dependencies/dependency-impact-analyzer.d.ts

@@ -0,0 +1,145 @@
+/**
+ * Dependency Impact Analyzer
+ * Analyzes the impact of changes to components in the dependency graph
+ *
+ * @ac US-032-AC-1: Given a component, find all dependents
+ * @ac US-032-AC-2: Calculate impact radius
+ * @ac US-032-AC-3: Identify critical components
+ * @ac US-032-AC-4: Generate impact report
+ * @ac US-032-AC-5: Suggest test scope based on impact
+ *
+ * @issue #32
+ */
+import type { NodeId, DependencyGraph } from '../types/dependency.js';
+/**
+ * Impact level classification
+ */
+export type ImpactLevel = 'minimal' | 'low' | 'medium' | 'high' | 'critical';
+/**
+ * Component impact information
+ */
+export type ComponentImpact = {
+    nodeId: NodeId;
+    directDependents: NodeId[];
+    totalAffected: number;
+    impactRadius: number;
+    impactLevel: ImpactLevel;
+    riskScore: number;
+    isCritical: boolean;
+};
+/**
+ * Impact analysis result
+ */
+export type ImpactAnalysisResult = {
+    changedComponents: NodeId[];
+    impacts: Map<NodeId, ComponentImpact>;
+    totalAffected: number;
+    overallImpactLevel: ImpactLevel;
+    criticalComponents: NodeId[];
+    testScope: TestScope;
+};
+/**
+ * Test scope recommendation
+ */
+export type TestScope = {
+    requiredTests: NodeId[];
+    recommendedTests: NodeId[];
+    optionalTests: NodeId[];
+    estimatedTestCount: number;
+    priority: 'low' | 'medium' | 'high';
+};
+/**
+ * Options for impact analysis
+ */
+export type ImpactAnalysisOptions = {
+    /** Maximum depth to traverse for impact (default: unlimited) */
+    maxDepth?: number;
+    /** Include test classes in impact analysis */
+    includeTests?: boolean;
+    /** Critical threshold: components with > N dependents */
+    criticalThreshold?: number;
+};
+/**
+ * Dependency Impact Analyzer
+ *
+ * Analyzes the impact of changes to determine:
+ * - Which components are affected
+ * - Impact radius and severity
+ * - Critical components
+ * - Test scope recommendations
+ *
+ * Performance: O(V + E) using BFS
+ *
+ * @example
+ * const analyzer = new DependencyImpactAnalyzer(graph, reverseGraph);
+ * const result = analyzer.analyze(['ApexClass:AccountService']);
+ * console.log(`Total affected: ${result.totalAffected}`);
+ * console.log(`Impact level: ${result.overallImpactLevel}`);
+ * console.log(`Tests required: ${result.testScope.requiredTests.length}`);
+ */
+export declare class DependencyImpactAnalyzer {
+    private graph;
+    private reverseGraph;
+    private options;
+    constructor(graph: DependencyGraph, reverseGraph: DependencyGraph, options?: ImpactAnalysisOptions);
+    /**
+     * Analyze impact of changes to one or more components
+     *
+     * @ac US-032-AC-1: Given a component, find all dependents
+     * @ac US-032-AC-2: Calculate impact radius
+     * @ac US-032-AC-4: Generate impact report
+     */
+    analyze(changedComponents: NodeId[]): ImpactAnalysisResult;
+    /**
+     * Calculate impact for a single component
+     */
+    private calculateImpact;
+    /**
+     * Find all dependents (transitive closure) of a component using BFS
+     */
+    private findAllDependents;
+    /**
+     * Calculate impact radius (maximum distance to affected component)
+     */
+    private calculateImpactRadius;
+    /**
+     * Calculate risk score (0-100) based on number of affected components
+     */
+    private calculateRiskScore;
+    /**
+     * Get impact level based on risk score
+     */
+    private static getImpactLevel;
+    /**
+     * @ac US-032-AC-3: Identify critical components
+     *
+     * Find components with many dependents
+     */
+    private identifyCriticalComponents;
+    /**
+     * Calculate overall impact level from individual impacts
+     */
+    private calculateOverallImpactLevel;
+    /**
+     * @ac US-032-AC-5: Suggest test scope based on impact
+     *
+     * Generate test scope recommendations
+     */
+    private generateTestScope;
+    /**
+     * Check if a component is a test class
+     */
+    private isTestClass;
+    /**
+     * Find associated test class for a component
+     */
+    private findTestClass;
+    /**
+     * Get impact for a specific component
+     */
+    getImpact(nodeId: NodeId): ComponentImpact;
+    /**
+     * Get all critical components
+     */
+    getCriticalComponents(): NodeId[];
+}