@jterrats/smart-deployment 1.0.3

package/lib/dependencies/dependency-resolver.js

@@ -0,0 +1,298 @@
+/**
+ * Dependency Resolver
+ * Resolves component dependencies and generates deployment order
+ *
+ * @ac US-033-AC-1: Resolve direct dependencies
+ * @ac US-033-AC-2: Resolve transitive dependencies
+ * @ac US-033-AC-3: Handle optional dependencies
+ * @ac US-033-AC-4: Skip managed package dependencies
+ * @ac US-033-AC-5: Report unresolved dependencies
+ * @ac US-033-AC-6: Generate dependency report
+ *
+ * @issue #33
+ */
+import { getLogger } from '../utils/logger.js';
+const logger = getLogger('DependencyResolver');
+/**
+ * Dependency Resolver
+ *
+ * Resolves dependencies and generates deployment order using topological sort.
+ * Handles circular dependencies, optional dependencies, and managed packages.
+ *
+ * Performance: O(V + E) using Kahn's algorithm
+ *
+ * @example
+ * const resolver = new DependencyResolver(graph, components);
+ * const result = resolver.resolve();
+ * console.log(`Deployment order: ${result.deploymentOrder.join(' → ')}`);
+ * console.log(`Unresolved: ${result.unresolved.length}`);
+ */
+export class DependencyResolver {
+    graph;
+    components;
+    options;
+    constructor(graph, components, options = {}) {
+        this.graph = graph;
+        this.components = components;
+        this.options = {
+            includeOptional: options.includeOptional ?? false,
+            skipManaged: options.skipManaged ?? true,
+            circularDependencies: options.circularDependencies ?? [],
+            orderingConstraints: options.orderingConstraints ?? [],
+        };
+        logger.debug('Initialized DependencyResolver', {
+            components: this.components.size,
+            includeOptional: this.options.includeOptional,
+            skipManaged: this.options.skipManaged,
+            circularDeps: this.options.circularDependencies.length,
+        });
+    }
+    /**
+     * Resolve all dependencies and generate deployment order
+     *
+     * @ac US-033-AC-1: Resolve direct dependencies
+     * @ac US-033-AC-2: Resolve transitive dependencies
+     * @ac US-033-AC-6: Generate dependency report
+     */
+    resolve() {
+        const startTime = Date.now();
+        // Build filtered graph
+        const filteredGraph = this.buildFilteredGraph();
+        // Perform topological sort
+        const { deploymentOrder, unresolved } = this.topologicalSort(filteredGraph);
+        // Build resolved dependencies map
+        const resolved = this.buildResolvedMap(deploymentOrder, filteredGraph);
+        // Categorize components
+        const optional = this.findOptionalDependencies();
+        const managed = this.findManagedPackages();
+        // Generate report
+        const report = this.generateReport(resolved, unresolved, optional, managed);
+        const duration = Date.now() - startTime;
+        logger.info('Dependency resolution completed', {
+            totalComponents: this.components.size,
+            resolved: resolved.size,
+            unresolved: unresolved.length,
+            deploymentLevels: report.deploymentLevels,
+            durationMs: duration,
+        });
+        return {
+            resolved,
+            deploymentOrder,
+            unresolved,
+            optional,
+            managed,
+            circular: this.options.circularDependencies,
+            report,
+        };
+    }
+    /**
+     * Build filtered graph based on options
+     */
+    buildFilteredGraph() {
+        const filtered = new Map();
+        for (const [nodeId, deps] of this.graph.entries()) {
+            // Skip managed packages if configured
+            if (this.options.skipManaged && this.isManagedPackage(nodeId)) {
+                continue;
+            }
+            const filteredDeps = new Set();
+            for (const dep of deps) {
+                // Skip managed dependencies
+                if (this.options.skipManaged && this.isManagedPackage(dep)) {
+                    continue;
+                }
+                // Handle optional dependencies
+                if (this.isOptionalDependency()) {
+                    if (this.options.includeOptional) {
+                        filteredDeps.add(dep);
+                    }
+                    continue;
+                }
+                filteredDeps.add(dep);
+            }
+            filtered.set(nodeId, filteredDeps);
+        }
+        // Apply ordering constraints
+        this.applyOrderingConstraints(filtered);
+        return filtered;
+    }
+    /**
+     * Apply manual ordering constraints to the graph
+     *
+     * @ac US-033-AC-5: Support manual ordering constraints
+     */
+    applyOrderingConstraints(graph) {
+        for (const { before, after } of this.options.orderingConstraints) {
+            // Ensure 'before' depends on 'after' (before must be deployed after 'after')
+            if (!graph.has(before)) {
+                graph.set(before, new Set());
+            }
+            graph.get(before).add(after);
+        }
+    }
+    /**
+     * Perform topological sort using Kahn's algorithm
+     */
+    topologicalSort(graph) {
+        const deploymentOrder = [];
+        const unresolved = [];
+        // Calculate in-degree for each node
+        const inDegree = new Map();
+        for (const nodeId of graph.keys()) {
+            inDegree.set(nodeId, 0);
+        }
+        for (const deps of graph.values()) {
+            for (const dep of deps) {
+                if (!inDegree.has(dep)) {
+                    // Dependency not in graph - external/missing
+                    continue;
+                }
+                inDegree.set(dep, (inDegree.get(dep) ?? 0) + 1);
+            }
+        }
+        // Start with nodes that have no dependencies (in-degree = 0)
+        const queue = [];
+        for (const [nodeId, degree] of inDegree.entries()) {
+            if (degree === 0) {
+                queue.push(nodeId);
+            }
+        }
+        // Process nodes in topological order
+        while (queue.length > 0) {
+            const nodeId = queue.shift();
+            deploymentOrder.push(nodeId);
+            const deps = graph.get(nodeId) ?? new Set();
+            for (const dep of deps) {
+                if (!inDegree.has(dep)) {
+                    continue; // External dependency
+                }
+                const newDegree = (inDegree.get(dep) ?? 0) - 1;
+                inDegree.set(dep, newDegree);
+                if (newDegree === 0) {
+                    queue.push(dep);
+                }
+            }
+        }
+        // Check for unresolved dependencies (cycles or missing)
+        for (const [nodeId, degree] of inDegree.entries()) {
+            if (degree > 0) {
+                // Node not processed - part of cycle or has missing deps
+                const missingDeps = this.findMissingDependencies(nodeId, graph);
+                unresolved.push({ nodeId, missingDependencies: missingDeps });
+            }
+        }
+        return { deploymentOrder, unresolved };
+    }
+    /**
+     * Find missing dependencies for a node
+     */
+    findMissingDependencies(nodeId, graph) {
+        const deps = graph.get(nodeId) ?? new Set();
+        const missing = [];
+        for (const dep of deps) {
+            if (!graph.has(dep)) {
+                missing.push(dep);
+            }
+        }
+        return missing;
+    }
+    /**
+     * Build resolved dependencies map with deployment order
+     */
+    buildResolvedMap(deploymentOrder, graph) {
+        const resolved = new Map();
+        for (let i = 0; i < deploymentOrder.length; i++) {
+            const nodeId = deploymentOrder[i];
+            const deps = Array.from(graph.get(nodeId) ?? []);
+            resolved.set(nodeId, {
+                nodeId,
+                dependencies: deps,
+                status: 'resolved',
+                order: i,
+            });
+        }
+        return resolved;
+    }
+    /**
+     * @ac US-033-AC-3: Handle optional dependencies
+     * Note: Current MetadataComponent doesn't track dependency types
+     */
+    findOptionalDependencies() {
+        // TODO: When MetadataComponent includes dependency types, implement this properly
+        return [];
+    }
+    /**
+     * @ac US-033-AC-4: Skip managed package dependencies
+     */
+    findManagedPackages() {
+        const managed = [];
+        for (const nodeId of this.components.keys()) {
+            if (this.isManagedPackage(nodeId)) {
+                managed.push(nodeId);
+            }
+        }
+        return managed;
+    }
+    /**
+     * Check if a component is from a managed package
+     */
+    isManagedPackage(nodeId) {
+        // Check for namespace prefix (e.g., "ns__ObjectName")
+        return nodeId.includes('__') || (this.components.get(nodeId)?.name.includes('__') ?? false);
+    }
+    /**
+     * Check if a dependency is optional (soft dependency)
+     * Note: Current MetadataComponent uses Set<string> for dependencies
+     * For now, we'll return false as type info is not available
+     */
+    isOptionalDependency() {
+        // TODO: When MetadataComponent includes dependency types, implement this properly
+        return false;
+    }
+    /**
+     * @ac US-033-AC-6: Generate dependency report
+     */
+    generateReport(resolved, unresolved, optional, managed) {
+        // Calculate deployment levels
+        let maxOrder = 0;
+        for (const dep of resolved.values()) {
+            maxOrder = Math.max(maxOrder, dep.order);
+        }
+        return {
+            totalComponents: this.components.size,
+            resolvedCount: resolved.size,
+            unresolvedCount: unresolved.length,
+            optionalCount: optional.length,
+            managedCount: managed.length,
+            circularCount: this.options.circularDependencies.length,
+            deploymentLevels: maxOrder + 1,
+        };
+    }
+    /**
+     * Get resolution status for a specific component
+     */
+    getResolution(nodeId) {
+        const result = this.resolve();
+        return result.resolved.get(nodeId);
+    }
+    /**
+     * Check if a component can be resolved
+     */
+    canResolve(nodeId) {
+        const result = this.resolve();
+        return result.resolved.has(nodeId);
+    }
+    /**
+     * Get deployment order for specific components
+     */
+    getDeploymentOrder(nodeIds) {
+        const result = this.resolve();
+        const orderMap = new Map();
+        for (const dep of result.resolved.values()) {
+            orderMap.set(dep.nodeId, dep.order);
+        }
+        // Sort by order
+        return nodeIds.filter((id) => orderMap.has(id)).sort((a, b) => (orderMap.get(a) ?? 0) - (orderMap.get(b) ?? 0));
+    }
+}
+//# sourceMappingURL=dependency-resolver.js.map

package/lib/dependencies/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../src/dependencies/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAI/C,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,CAAC;AA0D/C;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,kBAAkB;IACrB,KAAK,CAAkB;IACvB,UAAU,CAAiC;IAC3C,OAAO,CAA4B;IAE3C,YACE,KAAsB,EACtB,UAA0C,EAC1C,UAA2B,EAAE;QAE7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG;YACb,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,KAAK;YACjD,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI;YACxC,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,IAAI,EAAE;YACxD,mBAAmB,EAAE,OAAO,CAAC,mBAAmB,IAAI,EAAE;SACvD,CAAC;QAEF,MAAM,CAAC,KAAK,CAAC,gCAAgC,EAAE;YAC7C,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAChC,eAAe,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe;YAC7C,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW;YACrC,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,MAAM;SACvD,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,OAAO;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,uBAAuB;QACvB,MAAM,aAAa,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAEhD,2BAA2B;QAC3B,MAAM,EAAE,eAAe,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAE5E,kCAAkC;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;QAEvE,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAE3C,kBAAkB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAE5E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,iCAAiC,EAAE;YAC7C,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACrC,QAAQ,EAAE,QAAQ,CAAC,IAAI;YACvB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;YACzC,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;QAEH,OAAO;YACL,QAAQ;YACR,eAAe;YACf,UAAU;YACV,QAAQ;YACR,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,oBAAoB;YAC3C,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,MAAM,QAAQ,GAAoB,IAAI,GAAG,EAAE,CAAC;QAE5C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,sCAAsC;YACtC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9D,SAAS;YACX,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;YAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,4BAA4B;gBAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC3D,SAAS;gBACX,CAAC;gBAED,+BAA+B;gBAC/B,IAAI,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;oBAChC,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC;wBACjC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxB,CAAC;oBACD,SAAS;gBACX,CAAC;gBAED,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC;YAED,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACrC,CAAC;QAED,6BAA6B;QAC7B,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QAExC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,wBAAwB,CAAC,KAAsB;QACrD,KAAK,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;YACjE,6EAA6E;YAC7E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAsB;QAI5C,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,MAAM,UAAU,GAA6D,EAAE,CAAC;QAEhF,oCAAoC;QACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,6CAA6C;oBAC7C,SAAS;gBACX,CAAC;gBACD,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAE7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,SAAS,CAAC,sBAAsB;gBAClC,CAAC;gBAED,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;gBAE7B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,yDAAyD;gBACzD,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAChE,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,mBAAmB,EAAE,WAAW,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,MAAc,EAAE,KAAsB;QACpE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,eAAyB,EAAE,KAAsB;QACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;QAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YAEjD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE;gBACnB,MAAM;gBACN,YAAY,EAAE,IAAI;gBAClB,MAAM,EAAE,UAAU;gBAClB,KAAK,EAAE,CAAC;aACT,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,wBAAwB;QAC9B,kFAAkF;QAClF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACK,mBAAmB;QACzB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAc;QACrC,sDAAsD;QACtD,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9F,CAAC;IAED;;;;OAIG;IACK,oBAAoB;QAC1B,kFAAkF;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,QAAyC,EACzC,UAAoE,EACpE,QAAkB,EAClB,OAAiB;QAEjB,8BAA8B;QAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACrC,aAAa,EAAE,QAAQ,CAAC,IAAI;YAC5B,eAAe,EAAE,UAAU,CAAC,MAAM;YAClC,aAAa,EAAE,QAAQ,CAAC,MAAM;YAC9B,YAAY,EAAE,OAAO,CAAC,MAAM;YAC5B,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC,MAAM;YACvD,gBAAgB,EAAE,QAAQ,GAAG,CAAC;SAC/B,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,MAAc;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,MAAc;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,kBAAkB,CAAC,OAAiB;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC;QAED,gBAAgB;QAChB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClH,CAAC;CACF"}

package/lib/dependencies/dependency-validator.d.ts

@@ -0,0 +1,123 @@
+/**
+ * Dependency Validator
+ * Validates the dependency graph for correctness and consistency
+ *
+ * @ac US-034-AC-1: Validate no dangling references
+ * @ac US-034-AC-2: Validate all nodes have types
+ * @ac US-034-AC-3: Validate no self-loops (except cycles)
+ * @ac US-034-AC-4: Validate edge consistency
+ * @ac US-034-AC-5: Generate validation report
+ * @ac US-034-AC-6: Fail on critical issues
+ *
+ * @issue #34
+ */
+import type { NodeId, DependencyGraph, CircularDependency } from '../types/dependency.js';
+import type { MetadataComponent } from '../types/metadata.js';
+/**
+ * Validation severity
+ */
+export type ValidationSeverity = 'info' | 'warning' | 'error' | 'critical';
+/**
+ * Validation issue
+ */
+export type ValidationIssue = {
+    severity: ValidationSeverity;
+    code: string;
+    message: string;
+    nodeId?: NodeId;
+    relatedNodes?: NodeId[];
+    suggestion?: string;
+};
+/**
+ * Validation result
+ */
+export type ValidationResult = {
+    isValid: boolean;
+    issues: ValidationIssue[];
+    errors: ValidationIssue[];
+    warnings: ValidationIssue[];
+    critical: ValidationIssue[];
+    stats: ValidationStats;
+};
+/**
+ * Validation statistics
+ */
+export type ValidationStats = {
+    totalNodes: number;
+    totalEdges: number;
+    danglingReferences: number;
+    selfLoops: number;
+    invalidNodes: number;
+    edgeInconsistencies: number;
+};
+/**
+ * Validator options
+ */
+export type ValidatorOptions = {
+    /** Fail on warnings (not just errors) */
+    strictMode?: boolean;
+    /** Known circular dependencies to ignore for self-loop checks */
+    circularDependencies?: CircularDependency[];
+    /** Allow self-loops in specific node types */
+    allowSelfLoops?: boolean;
+};
+/**
+ * Dependency Validator
+ *
+ * Validates dependency graph integrity:
+ * - No dangling references (edges to non-existent nodes)
+ * - All nodes have valid types
+ * - No self-loops (unless in known cycles)
+ * - Edge consistency (graph ↔ components)
+ *
+ * Performance: O(V + E)
+ *
+ * @example
+ * const validator = new DependencyValidator(graph, components);
+ * const result = validator.validate();
+ * if (!result.isValid) {
+ *   console.error(`Found ${result.errors.length} errors`);
+ *   result.errors.forEach(e => console.error(e.message));
+ * }
+ */
+export declare class DependencyValidator {
+    private graph;
+    private components;
+    private options;
+    constructor(graph: DependencyGraph, components: Map<NodeId, MetadataComponent>, options?: ValidatorOptions);
+    /**
+     * Validate the dependency graph
+     *
+     * @ac US-034-AC-5: Generate validation report
+     * @ac US-034-AC-6: Fail on critical issues
+     */
+    validate(): ValidationResult;
+    /**
+     * @ac US-034-AC-1: Validate no dangling references
+     */
+    private validateDanglingReferences;
+    /**
+     * @ac US-034-AC-2: Validate all nodes have types
+     */
+    private validateNodeTypes;
+    /**
+     * @ac US-034-AC-3: Validate no self-loops (except cycles)
+     */
+    private validateSelfLoops;
+    /**
+     * @ac US-034-AC-4: Validate edge consistency
+     */
+    private validateEdgeConsistency;
+    /**
+     * Calculate validation statistics
+     */
+    private calculateStats;
+    /**
+     * Validate a specific component
+     */
+    validateComponent(nodeId: NodeId): ValidationIssue[];
+    /**
+     * Check if validation would pass
+     */
+    isValid(): boolean;
+}