@synth-deploy/server 0.1.0

package/dist/graph/graph-executor.js

@@ -0,0 +1,348 @@
+// ---------------------------------------------------------------------------
+// Topological sort — Kahn's algorithm
+// ---------------------------------------------------------------------------
+export function topologicalSort(nodes, edges) {
+    const inDegree = new Map();
+    const adjacency = new Map();
+    for (const node of nodes) {
+        inDegree.set(node.id, 0);
+        adjacency.set(node.id, []);
+    }
+    for (const edge of edges) {
+        inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);
+        adjacency.get(edge.from)?.push(edge.to);
+    }
+    const queue = nodes
+        .filter((n) => (inDegree.get(n.id) ?? 0) === 0)
+        .map((n) => n.id);
+    const result = [];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        result.push(current);
+        for (const neighbor of adjacency.get(current) ?? []) {
+            const deg = (inDegree.get(neighbor) ?? 1) - 1;
+            inDegree.set(neighbor, deg);
+            if (deg === 0)
+                queue.push(neighbor);
+        }
+    }
+    if (result.length !== nodes.length) {
+        throw new Error("Cycle detected in deployment graph — topological sort is impossible");
+    }
+    return result;
+}
+// ---------------------------------------------------------------------------
+// Depth computation — group nodes by distance from roots for parallel exec
+// ---------------------------------------------------------------------------
+export function computeDepths(nodes, edges) {
+    const depths = new Map();
+    const inEdges = new Map(); // nodeId -> list of "from" nodeIds
+    for (const node of nodes) {
+        depths.set(node.id, 0);
+        inEdges.set(node.id, []);
+    }
+    for (const edge of edges) {
+        inEdges.get(edge.to)?.push(edge.from);
+    }
+    // BFS to compute max depth
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const node of nodes) {
+            const parents = inEdges.get(node.id) ?? [];
+            const maxParent = Math.max(0, ...parents.map((p) => depths.get(p) ?? 0));
+            const newDepth = parents.length > 0 ? maxParent + 1 : 0;
+            if (newDepth > (depths.get(node.id) ?? 0)) {
+                depths.set(node.id, newDepth);
+                changed = true;
+            }
+        }
+    }
+    return depths;
+}
+// ---------------------------------------------------------------------------
+// Downstream node computation — find all transitive dependents of a node
+// ---------------------------------------------------------------------------
+function getDownstreamNodeIds(nodeId, edges) {
+    const downstream = new Set();
+    const adjacency = new Map();
+    for (const edge of edges) {
+        if (!adjacency.has(edge.from))
+            adjacency.set(edge.from, []);
+        adjacency.get(edge.from).push(edge.to);
+    }
+    const queue = [nodeId];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        for (const child of adjacency.get(current) ?? []) {
+            if (!downstream.has(child)) {
+                downstream.add(child);
+                queue.push(child);
+            }
+        }
+    }
+    return downstream;
+}
+// ---------------------------------------------------------------------------
+// GraphExecutor — depth-based parallel execution
+// ---------------------------------------------------------------------------
+export class GraphExecutor {
+    envoyRegistry;
+    createClient;
+    constructor(envoyRegistry, createClient) {
+        this.envoyRegistry = envoyRegistry;
+        this.createClient = createClient;
+    }
+    /**
+     * Execute a deployment graph with depth-based parallelism.
+     * Nodes at the same depth run concurrently via Promise.allSettled().
+     * If a node fails, all its downstream dependents are skipped,
+     * but sibling nodes at the same depth continue executing.
+     */
+    async *execute(graph, plans, partitionVariables) {
+        // Validate topological order (detects cycles)
+        topologicalSort(graph.nodes, graph.edges);
+        const depths = computeDepths(graph.nodes, graph.edges);
+        const completed = new Map();
+        let completedCount = 0;
+        let failedCount = 0;
+        const skippedNodes = new Set();
+        // Group nodes by depth
+        const maxDepth = Math.max(0, ...Array.from(depths.values()));
+        const depthGroups = [];
+        for (let d = 0; d <= maxDepth; d++) {
+            depthGroups.push(graph.nodes.filter((n) => (depths.get(n.id) ?? 0) === d));
+        }
+        for (const group of depthGroups) {
+            // Filter out nodes that should be skipped (downstream of failed nodes)
+            const executableNodes = group.filter((n) => !skippedNodes.has(n.id));
+            if (executableNodes.length === 0)
+                continue;
+            // Collect events from parallel execution, then yield them after
+            const levelEvents = [];
+            const executingCount = executableNodes.length;
+            // Execute all nodes at this depth concurrently
+            const results = await Promise.allSettled(executableNodes.map(async (node) => {
+                // Resolve input bindings from completed upstream outputs
+                const resolvedVars = {};
+                // Merge partition variables first (input bindings override)
+                if (partitionVariables) {
+                    Object.assign(resolvedVars, partitionVariables);
+                }
+                for (const binding of node.inputBindings ?? []) {
+                    const upstreamOutputs = completed.get(binding.sourceNodeId);
+                    if (upstreamOutputs?.[binding.sourceOutputName]) {
+                        resolvedVars[binding.variable] =
+                            upstreamOutputs[binding.sourceOutputName];
+                        binding.resolvedValue =
+                            upstreamOutputs[binding.sourceOutputName];
+                    }
+                }
+                levelEvents.push({
+                    type: "node-started",
+                    nodeId: node.id,
+                    graphId: graph.id,
+                    progress: {
+                        completed: completedCount,
+                        total: graph.nodes.length,
+                        executing: executingCount,
+                        failed: failedCount,
+                    },
+                });
+                const entry = this.envoyRegistry.get(node.envoyId);
+                if (!entry) {
+                    throw new Error(`Envoy not found: ${node.envoyId}`);
+                }
+                const plan = plans.get(node.id);
+                if (!plan) {
+                    throw new Error(`No plan found for node: ${node.id}`);
+                }
+                const client = this.createClient(entry.url, 60_000);
+                // Inject resolved variables into the plan's reasoning for traceability
+                const enrichedPlan = Object.keys(resolvedVars).length > 0
+                    ? {
+                        ...plan,
+                        reasoning: `${plan.reasoning}\n\nResolved variables from upstream: ${JSON.stringify(resolvedVars)}`,
+                    }
+                    : plan;
+                const result = await client.executeApprovedPlan({
+                    deploymentId: node.deploymentId ?? node.id,
+                    plan: enrichedPlan,
+                    rollbackPlan: {
+                        steps: [],
+                        reasoning: "No rollback plan provided",
+                    },
+                    artifactType: "graph-node",
+                    artifactName: node.artifactId,
+                    environmentId: "",
+                });
+                // Capture outputs from step results
+                const outputs = {};
+                for (const binding of node.outputBindings ?? []) {
+                    if (binding.source === "plan_step_output" &&
+                        binding.stepIndex != null &&
+                        binding.outputKey) {
+                        const stepResult = result.debriefEntries?.[binding.stepIndex];
+                        if (stepResult) {
+                            outputs[binding.name] = String(stepResult.context?.[binding.outputKey] ?? "");
+                        }
+                    }
+                    else if (binding.source === "manual" && binding.value) {
+                        outputs[binding.name] = binding.value;
+                    }
+                }
+                return { nodeId: node.id, outputs };
+            }));
+            // Process results: update state and collect events
+            for (let i = 0; i < results.length; i++) {
+                const result = results[i];
+                const node = executableNodes[i];
+                if (result.status === "fulfilled") {
+                    completed.set(result.value.nodeId, result.value.outputs);
+                    completedCount++;
+                    levelEvents.push({
+                        type: "node-completed",
+                        nodeId: node.id,
+                        graphId: graph.id,
+                        outputCapture: result.value.outputs,
+                        progress: {
+                            completed: completedCount,
+                            total: graph.nodes.length,
+                            executing: 0,
+                            failed: failedCount,
+                        },
+                    });
+                }
+                else {
+                    failedCount++;
+                    const message = result.reason instanceof Error
+                        ? result.reason.message
+                        : String(result.reason);
+                    levelEvents.push({
+                        type: "node-failed",
+                        nodeId: node.id,
+                        graphId: graph.id,
+                        error: message,
+                        progress: {
+                            completed: completedCount,
+                            total: graph.nodes.length,
+                            executing: 0,
+                            failed: failedCount,
+                        },
+                    });
+                    // Mark all downstream nodes as skipped
+                    const downstream = getDownstreamNodeIds(node.id, graph.edges);
+                    for (const downId of downstream) {
+                        skippedNodes.add(downId);
+                    }
+                }
+            }
+            // Yield all events from this depth level
+            for (const event of levelEvents) {
+                yield event;
+            }
+            // Yield skipped events for nodes in future depth levels that were just marked
+            for (const node of graph.nodes) {
+                if (skippedNodes.has(node.id) && !completed.has(node.id)) {
+                    // Only yield skipped event once — remove from set tracking after yield
+                    // We'll check depth to avoid yielding for nodes not yet reached
+                    const nodeDepth = depths.get(node.id) ?? 0;
+                    const currentDepth = depths.get(group[0].id) ?? 0;
+                    if (nodeDepth === currentDepth + 1) {
+                        // Don't yield yet — will be handled when we reach that depth level
+                    }
+                }
+            }
+        }
+        // Yield skip events for any remaining skipped nodes
+        for (const nodeId of skippedNodes) {
+            if (!completed.has(nodeId)) {
+                yield {
+                    type: "node-skipped",
+                    nodeId,
+                    graphId: graph.id,
+                    error: "Skipped due to upstream failure",
+                    progress: {
+                        completed: completedCount,
+                        total: graph.nodes.length,
+                        executing: 0,
+                        failed: failedCount,
+                    },
+                };
+            }
+        }
+        if (failedCount === 0) {
+            yield {
+                type: "graph-completed",
+                graphId: graph.id,
+                progress: {
+                    completed: completedCount,
+                    total: graph.nodes.length,
+                    executing: 0,
+                    failed: 0,
+                },
+            };
+        }
+        else {
+            yield {
+                type: "graph-failed",
+                graphId: graph.id,
+                progress: {
+                    completed: completedCount,
+                    total: graph.nodes.length,
+                    executing: 0,
+                    failed: failedCount,
+                },
+            };
+        }
+    }
+    /**
+     * Rollback completed nodes in reverse topological order.
+     * Only rolls back nodes that completed successfully.
+     */
+    async *rollback(graph, rollbackPlans) {
+        const sorted = topologicalSort(graph.nodes, graph.edges).reverse();
+        let rolledBack = 0;
+        let rollbackFailed = 0;
+        for (const nodeId of sorted) {
+            const node = graph.nodes.find((n) => n.id === nodeId);
+            if (node.status !== "completed")
+                continue;
+            const plan = rollbackPlans.get(nodeId);
+            if (!plan)
+                continue;
+            const entry = this.envoyRegistry.get(node.envoyId);
+            if (!entry)
+                continue;
+            const client = this.createClient(entry.url, 60_000);
+            try {
+                await client.executeApprovedPlan({
+                    deploymentId: node.deploymentId ?? nodeId,
+                    plan,
+                    rollbackPlan: {
+                        steps: [],
+                        reasoning: "Rollback of rollback not supported",
+                    },
+                    artifactType: "graph-node-rollback",
+                    artifactName: node.artifactId,
+                    environmentId: "",
+                });
+                rolledBack++;
+            }
+            catch {
+                rollbackFailed++;
+            }
+        }
+        yield {
+            type: rollbackFailed === 0 ? "graph-completed" : "graph-failed",
+            graphId: graph.id,
+            progress: {
+                completed: rolledBack,
+                total: graph.nodes.filter((n) => n.status === "completed").length,
+                executing: 0,
+                failed: rollbackFailed,
+            },
+        };
+    }
+}
+//# sourceMappingURL=graph-executor.js.map

package/dist/graph/graph-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-executor.js","sourceRoot":"","sources":["../../src/graph/graph-executor.ts"],"names":[],"mappings":"AAiCA,8EAA8E;AAC9E,sCAAsC;AACtC,8EAA8E;AAE9E,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,KAA4B;IAE5B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,KAAK,GAAG,KAAK;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErB,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC5B,IAAI,GAAG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,qEAAqE,CACtE,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,2EAA2E;AAC3E,8EAA8E;AAE9E,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,KAA4B;IAE5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,mCAAmC;IAChF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,2BAA2B;IAC3B,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,IAAI,QAAQ,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC9B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,yEAAyE;AACzE,8EAA8E;AAE9E,SAAS,oBAAoB,CAC3B,MAAc,EACd,KAA4B;IAE5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5D,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,8EAA8E;AAC9E,iDAAiD;AACjD,8EAA8E;AAE9E,MAAM,OAAO,aAAa;IAEd;IACA;IAFV,YACU,aAA4B,EAC5B,YAA6D;QAD7D,kBAAa,GAAb,aAAa,CAAe;QAC5B,iBAAY,GAAZ,YAAY,CAAiD;IACpE,CAAC;IAEJ;;;;;OAKG;IACH,KAAK,CAAC,CAAC,OAAO,CACZ,KAAsB,EACtB,KAAkC,EAClC,kBAA2C;QAE3C,8CAA8C;QAC9C,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkC,CAAC;QAC5D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QAEvC,uBAAuB;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,WAAW,GAA4B,EAAE,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,WAAW,CAAC,IAAI,CACd,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CACzD,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,uEAAuE;YACvE,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAErE,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE3C,gEAAgE;YAChE,MAAM,WAAW,GAAyB,EAAE,CAAC;YAC7C,MAAM,cAAc,GAAG,eAAe,CAAC,MAAM,CAAC;YAE9C,+CAA+C;YAC/C,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CACtC,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;gBACjC,yDAAyD;gBACzD,MAAM,YAAY,GAA2B,EAAE,CAAC;gBAEhD,4DAA4D;gBAC5D,IAAI,kBAAkB,EAAE,CAAC;oBACvB,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAC;gBAClD,CAAC;gBAED,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,IAAI,EAAE,EAAE,CAAC;oBAC/C,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;oBAC5D,IAAI,eAAe,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,CAAC;wBAChD,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC;4BAC5B,eAAe,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;wBAC5C,OAAO,CAAC,aAAa;4BACnB,eAAe,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;oBAC9C,CAAC;gBACH,CAAC;gBAED,WAAW,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,cAAc;oBACpB,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,QAAQ,EAAE;wBACR,SAAS,EAAE,cAAc;wBACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;wBACzB,SAAS,EAAE,cAAc;wBACzB,MAAM,EAAE,WAAW;qBACpB;iBACF,CAAC,CAAC;gBAEH,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnD,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;gBACtD,CAAC;gBAED,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChC,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;gBACxD,CAAC;gBAED,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;gBAEpD,uEAAuE;gBACvE,MAAM,YAAY,GAChB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,GAAG,CAAC;oBAClC,CAAC,CAAC;wBACE,GAAG,IAAI;wBACP,SAAS,EAAE,GAAG,IAAI,CAAC,SAAS,yCAAyC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAAE;qBACpG;oBACH,CAAC,CAAC,IAAI,CAAC;gBAEX,MAAM,MAAM,GAAsB,MAAM,MAAM,CAAC,mBAAmB,CAAC;oBACjE,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,EAAE;oBAC1C,IAAI,EAAE,YAAY;oBAClB,YAAY,EAAE;wBACZ,KAAK,EAAE,EAAE;wBACT,SAAS,EAAE,2BAA2B;qBACvC;oBACD,YAAY,EAAE,YAAY;oBAC1B,YAAY,EAAE,IAAI,CAAC,UAAU;oBAC7B,aAAa,EAAE,EAAE;iBAClB,CAAC,CAAC;gBAEH,oCAAoC;gBACpC,MAAM,OAAO,GAA2B,EAAE,CAAC;gBAC3C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,cAAc,IAAI,EAAE,EAAE,CAAC;oBAChD,IACE,OAAO,CAAC,MAAM,KAAK,kBAAkB;wBACrC,OAAO,CAAC,SAAS,IAAI,IAAI;wBACzB,OAAO,CAAC,SAAS,EACjB,CAAC;wBACD,MAAM,UAAU,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;wBAC9D,IAAI,UAAU,EAAE,CAAC;4BACf,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAC3B,UAAU,CAAC,OAAmC,EAAE,CAC/C,OAAO,CAAC,SAAS,CAClB,IAAI,EAAE,CACR,CAAC;wBACJ,CAAC;oBACH,CAAC;yBAAM,IAAI,OAAO,CAAC,MAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBACxD,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;oBACxC,CAAC;gBACH,CAAC;gBAED,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC;YACtC,CAAC,CAAC,CACH,CAAC;YAEF,mDAAmD;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEhC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAClC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;oBACzD,cAAc,EAAE,CAAC;oBAEjB,WAAW,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,gBAAgB;wBACtB,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,OAAO,EAAE,KAAK,CAAC,EAAE;wBACjB,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO;wBACnC,QAAQ,EAAE;4BACR,SAAS,EAAE,cAAc;4BACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;4BACzB,SAAS,EAAE,CAAC;4BACZ,MAAM,EAAE,WAAW;yBACpB;qBACF,CAAC,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACN,WAAW,EAAE,CAAC;oBACd,MAAM,OAAO,GACX,MAAM,CAAC,MAAM,YAAY,KAAK;wBAC5B,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO;wBACvB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAE5B,WAAW,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,aAAa;wBACnB,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,OAAO,EAAE,KAAK,CAAC,EAAE;wBACjB,KAAK,EAAE,OAAO;wBACd,QAAQ,EAAE;4BACR,SAAS,EAAE,cAAc;4BACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;4BACzB,SAAS,EAAE,CAAC;4BACZ,MAAM,EAAE,WAAW;yBACpB;qBACF,CAAC,CAAC;oBAEH,uCAAuC;oBACvC,MAAM,UAAU,GAAG,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;oBAC9D,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;wBAChC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,yCAAyC;YACzC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;gBAChC,MAAM,KAAK,CAAC;YACd,CAAC;YAED,8EAA8E;YAC9E,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACzD,uEAAuE;oBACvE,gEAAgE;oBAChE,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;oBAC3C,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;oBAClD,IAAI,SAAS,KAAK,YAAY,GAAG,CAAC,EAAE,CAAC;wBACnC,mEAAmE;oBACrE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3B,MAAM;oBACJ,IAAI,EAAE,cAAc;oBACpB,MAAM;oBACN,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,KAAK,EAAE,iCAAiC;oBACxC,QAAQ,EAAE;wBACR,SAAS,EAAE,cAAc;wBACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;wBACzB,SAAS,EAAE,CAAC;wBACZ,MAAM,EAAE,WAAW;qBACpB;iBACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM;gBACJ,IAAI,EAAE,iBAAiB;gBACvB,OAAO,EAAE,KAAK,CAAC,EAAE;gBACjB,QAAQ,EAAE;oBACR,SAAS,EAAE,cAAc;oBACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;oBACzB,SAAS,EAAE,CAAC;oBACZ,MAAM,EAAE,CAAC;iBACV;aACF,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM;gBACJ,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,KAAK,CAAC,EAAE;gBACjB,QAAQ,EAAE;oBACR,SAAS,EAAE,cAAc;oBACzB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;oBACzB,SAAS,EAAE,CAAC;oBACZ,MAAM,EAAE,WAAW;iBACpB;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,CAAC,QAAQ,CACb,KAAsB,EACtB,aAA0C;QAE1C,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACnE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAC;YACvD,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW;gBAAE,SAAS;YAE1C,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAEpD,IAAI,CAAC;gBACH,MAAM,MAAM,CAAC,mBAAmB,CAAC;oBAC/B,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,MAAM;oBACzC,IAAI;oBACJ,YAAY,EAAE;wBACZ,KAAK,EAAE,EAAE;wBACT,SAAS,EAAE,oCAAoC;qBAChD;oBACD,YAAY,EAAE,qBAAqB;oBACnC,YAAY,EAAE,IAAI,CAAC,UAAU;oBAC7B,aAAa,EAAE,EAAE;iBAClB,CAAC,CAAC;gBACH,UAAU,EAAE,CAAC;YACf,CAAC;YAAC,MAAM,CAAC;gBACP,cAAc,EAAE,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM;YACJ,IAAI,EAAE,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc;YAC/D,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,QAAQ,EAAE;gBACR,SAAS,EAAE,UAAU;gBACrB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM;gBACjE,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,cAAc;aACvB;SACF,CAAC;IACJ,CAAC;CACF"}

package/dist/graph/graph-inference.d.ts

@@ -0,0 +1,22 @@
+import type { DeploymentGraph } from "@synth-deploy/core";
+import type { LlmClient, IArtifactStore } from "@synth-deploy/core";
+interface InferGraphParams {
+    artifactIds: string[];
+    envoyAssignments: Record<string, string>;
+    partitionId?: string;
+    graphName?: string;
+}
+export declare class GraphInferenceEngine {
+    private llm;
+    private artifactStore;
+    constructor(llm: LlmClient, artifactStore: IArtifactStore);
+    /**
+     * Infer a deployment graph from a set of artifacts and their envoy assignments.
+     * Uses the LLM to reason about ordering and data flow when available.
+     * Falls back to a flat graph (all parallel) when LLM is unavailable.
+     */
+    inferGraph(params: InferGraphParams): Promise<DeploymentGraph>;
+    private _inferEdgesWithLlm;
+}
+export {};
+//# sourceMappingURL=graph-inference.d.ts.map

package/dist/graph/graph-inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-inference.d.ts","sourceRoot":"","sources":["../../src/graph/graph-inference.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,eAAe,EAGhB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,SAAS,EAAa,cAAc,EAAE,MAAM,oBAAoB,CAAC;AA0B/E,UAAU,gBAAgB;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAyBD,qBAAa,oBAAoB;IAE7B,OAAO,CAAC,GAAG;IACX,OAAO,CAAC,aAAa;gBADb,GAAG,EAAE,SAAS,EACd,aAAa,EAAE,cAAc;IAGvC;;;;OAIG;IACG,UAAU,CAAC,MAAM,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;YAwCtD,kBAAkB;CAqEjC"}

package/dist/graph/graph-inference.js

@@ -0,0 +1,149 @@
+import crypto from "node:crypto";
+import { z } from "zod";
+import { sanitizeForPrompt } from "@synth-deploy/core";
+// ---------------------------------------------------------------------------
+// Zod schema for LLM graph inference response validation
+// ---------------------------------------------------------------------------
+const InferredEdgeSchema = z.object({
+    from: z.string(),
+    to: z.string(),
+    type: z.enum(["depends_on", "data_flow"]),
+    dataBinding: z.object({
+        outputName: z.string(),
+        inputVariable: z.string(),
+    }).optional(),
+});
+const GraphInferenceResponseSchema = z.object({
+    edges: z.array(InferredEdgeSchema),
+    reasoning: z.string().optional(),
+});
+const GRAPH_INFERENCE_SYSTEM_PROMPT = `You are a deployment orchestration expert. Given a set of deployment artifacts with their analyses, determine the correct execution order and any data flow between them.
+
+Your response must be valid JSON with this structure:
+{
+  "edges": [
+    {
+      "from": "<artifactId that must deploy FIRST>",
+      "to": "<artifactId that depends on it>",
+      "type": "depends_on" | "data_flow",
+      "dataBinding": { "outputName": "<name>", "inputVariable": "<var>" }  // only for data_flow edges
+    }
+  ],
+  "reasoning": "Plain-language explanation of why this ordering was chosen."
+}
+
+Rules:
+- "from" deploys BEFORE "to"
+- Only add edges where there is a genuine dependency (shared database, API dependency, config requirement)
+- Use "data_flow" when one artifact produces a value (e.g., a URL, port, hostname) that another needs
+- Use "depends_on" for ordering-only dependencies (e.g., database must be up before the app)
+- Do not create cycles
+- If artifacts are independent, return an empty edges array`;
+export class GraphInferenceEngine {
+    llm;
+    artifactStore;
+    constructor(llm, artifactStore) {
+        this.llm = llm;
+        this.artifactStore = artifactStore;
+    }
+    /**
+     * Infer a deployment graph from a set of artifacts and their envoy assignments.
+     * Uses the LLM to reason about ordering and data flow when available.
+     * Falls back to a flat graph (all parallel) when LLM is unavailable.
+     */
+    async inferGraph(params) {
+        const { artifactIds, envoyAssignments, partitionId, graphName } = params;
+        const now = new Date();
+        // Build nodes from artifact/envoy assignments
+        const nodes = artifactIds.map((artifactId) => ({
+            id: crypto.randomUUID(),
+            artifactId,
+            envoyId: envoyAssignments[artifactId] ?? "",
+            outputBindings: [],
+            inputBindings: [],
+            status: "pending",
+        }));
+        // Map from artifactId to nodeId for edge resolution
+        const artifactToNodeId = new Map();
+        for (const node of nodes) {
+            artifactToNodeId.set(node.artifactId, node.id);
+        }
+        let edges = [];
+        // Attempt LLM inference
+        if (this.llm.isAvailable() && artifactIds.length > 1) {
+            edges = await this._inferEdgesWithLlm(artifactIds, artifactToNodeId);
+        }
+        return {
+            id: crypto.randomUUID(),
+            name: graphName ?? `Graph ${now.toISOString().slice(0, 19)}`,
+            partitionId,
+            nodes,
+            edges,
+            status: "draft",
+            approvalMode: "graph",
+            createdAt: now,
+            updatedAt: now,
+        };
+    }
+    async _inferEdgesWithLlm(artifactIds, artifactToNodeId) {
+        // Build context from artifact analyses
+        const artifactContext = [];
+        for (const artifactId of artifactIds) {
+            const artifact = this.artifactStore.get(artifactId);
+            if (!artifact) {
+                artifactContext.push(`- ${artifactId}: (artifact not found)`);
+                continue;
+            }
+            artifactContext.push(`- ID: ${artifactId}\n` +
+                `  Name: ${sanitizeForPrompt(artifact.name)}\n` +
+                `  Type: ${sanitizeForPrompt(artifact.type)}\n` +
+                `  Summary: ${sanitizeForPrompt(artifact.analysis.summary)}\n` +
+                `  Dependencies: ${sanitizeForPrompt(JSON.stringify(artifact.analysis.dependencies))}\n` +
+                `  Config expectations: ${sanitizeForPrompt(JSON.stringify(artifact.analysis.configurationExpectations))}\n` +
+                `  Deployment intent: ${sanitizeForPrompt(artifact.analysis.deploymentIntent ?? "unknown")}`);
+        }
+        const prompt = `Determine the deployment ordering for these artifacts:\n\n${artifactContext.join("\n\n")}\n\nArtifact IDs to use in edges: ${JSON.stringify(artifactIds)}`;
+        let result;
+        try {
+            result = await this.llm.reason({
+                prompt,
+                systemPrompt: GRAPH_INFERENCE_SYSTEM_PROMPT,
+                promptSummary: `Graph inference for ${artifactIds.length} artifacts`,
+            });
+        }
+        catch {
+            return [];
+        }
+        if (!result.ok)
+            return [];
+        try {
+            const jsonMatch = result.text.match(/\{[\s\S]*\}/);
+            if (!jsonMatch)
+                return [];
+            const raw = JSON.parse(jsonMatch[0]);
+            const parseResult = GraphInferenceResponseSchema.safeParse(raw);
+            if (!parseResult.success)
+                return [];
+            const parsed = parseResult.data;
+            // Convert artifact-level edges to node-level edges
+            const graphEdges = [];
+            for (const edge of parsed.edges) {
+                const fromNodeId = artifactToNodeId.get(edge.from);
+                const toNodeId = artifactToNodeId.get(edge.to);
+                if (!fromNodeId || !toNodeId)
+                    continue;
+                graphEdges.push({
+                    from: fromNodeId,
+                    to: toNodeId,
+                    type: edge.type === "data_flow" ? "data_flow" : "depends_on",
+                    dataBinding: edge.dataBinding,
+                });
+            }
+            return graphEdges;
+        }
+        catch {
+            return [];
+        }
+    }
+}
+//# sourceMappingURL=graph-inference.js.map

package/dist/graph/graph-inference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-inference.js","sourceRoot":"","sources":["../../src/graph/graph-inference.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAOxB,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvD,8EAA8E;AAC9E,yDAAyD;AACzD,8EAA8E;AAE9E,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IAClC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;IAChB,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE;IACd,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;IACzC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;QACpB,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;QACtB,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE;KAC1B,CAAC,CAAC,QAAQ,EAAE;CACd,CAAC,CAAC;AAEH,MAAM,4BAA4B,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC;IAClC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CACjC,CAAC,CAAC;AAaH,MAAM,6BAA6B,GAAG;;;;;;;;;;;;;;;;;;;;;4DAqBsB,CAAC;AAE7D,MAAM,OAAO,oBAAoB;IAErB;IACA;IAFV,YACU,GAAc,EACd,aAA6B;QAD7B,QAAG,GAAH,GAAG,CAAW;QACd,kBAAa,GAAb,aAAa,CAAgB;IACpC,CAAC;IAEJ;;;;OAIG;IACH,KAAK,CAAC,UAAU,CAAC,MAAwB;QACvC,MAAM,EAAE,WAAW,EAAE,gBAAgB,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;QACzE,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,8CAA8C;QAC9C,MAAM,KAAK,GAA0B,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YACpE,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,UAAU;YACV,OAAO,EAAE,gBAAgB,CAAC,UAAU,CAAC,IAAI,EAAE;YAC3C,cAAc,EAAE,EAAE;YAClB,aAAa,EAAE,EAAE;YACjB,MAAM,EAAE,SAAkB;SAC3B,CAAC,CAAC,CAAC;QAEJ,oDAAoD;QACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,KAAK,GAA0B,EAAE,CAAC;QAEtC,wBAAwB;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrD,KAAK,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAAC;QACvE,CAAC;QAED,OAAO;YACL,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;YACvB,IAAI,EAAE,SAAS,IAAI,SAAS,GAAG,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;YAC5D,WAAW;YACX,KAAK;YACL,KAAK;YACL,MAAM,EAAE,OAAO;YACf,YAAY,EAAE,OAAO;YACrB,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;SACf,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,kBAAkB,CAC9B,WAAqB,EACrB,gBAAqC;QAErC,uCAAuC;QACvC,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,eAAe,CAAC,IAAI,CAAC,KAAK,UAAU,wBAAwB,CAAC,CAAC;gBAC9D,SAAS;YACX,CAAC;YAED,eAAe,CAAC,IAAI,CAClB,SAAS,UAAU,IAAI;gBACvB,WAAW,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI;gBAC/C,WAAW,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI;gBAC/C,cAAc,iBAAiB,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI;gBAC9D,mBAAmB,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,IAAI;gBACxF,0BAA0B,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,yBAAyB,CAAC,CAAC,IAAI;gBAC5G,wBAAwB,iBAAiB,CAAC,QAAQ,CAAC,QAAQ,CAAC,gBAAgB,IAAI,SAAS,CAAC,EAAE,CAC7F,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,6DAA6D,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,qCAAqC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;QAE3K,IAAI,MAAiB,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAC7B,MAAM;gBACN,YAAY,EAAE,6BAA6B;gBAC3C,aAAa,EAAE,uBAAuB,WAAW,CAAC,MAAM,YAAY;aACrE,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC;QAE1B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YACnD,IAAI,CAAC,SAAS;gBAAE,OAAO,EAAE,CAAC;YAE1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,WAAW,GAAG,4BAA4B,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAChE,IAAI,CAAC,WAAW,CAAC,OAAO;gBAAE,OAAO,EAAE,CAAC;YAEpC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC;YAEhC,mDAAmD;YACnD,MAAM,UAAU,GAA0B,EAAE,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBAChC,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/C,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAEvC,UAAU,CAAC,IAAI,CAAC;oBACd,IAAI,EAAE,UAAU;oBAChB,EAAE,EAAE,QAAQ;oBACZ,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY;oBAC5D,WAAW,EAAE,IAAI,CAAC,WAAW;iBAC9B,CAAC,CAAC;YACL,CAAC;YAED,OAAO,UAAU,CAAC;QACpB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;CACF"}

package/dist/graph/graph-store.d.ts

@@ -0,0 +1,12 @@
+import type { DeploymentGraph, DeploymentGraphStatus, DeploymentGraphNode } from "@synth-deploy/core";
+export declare class DeploymentGraphStore {
+    private graphs;
+    create(graph: DeploymentGraph): DeploymentGraph;
+    getById(id: string): DeploymentGraph | undefined;
+    update(id: string, updates: Partial<Pick<DeploymentGraph, "name" | "nodes" | "edges" | "status" | "approvalMode" | "partitionId">>): DeploymentGraph | undefined;
+    updateStatus(id: string, status: DeploymentGraphStatus): DeploymentGraph | undefined;
+    updateNode(graphId: string, nodeId: string, updates: Partial<Pick<DeploymentGraphNode, "status" | "deploymentId">>): DeploymentGraphNode | undefined;
+    list(): DeploymentGraph[];
+    delete(id: string): boolean;
+}
+//# sourceMappingURL=graph-store.d.ts.map

package/dist/graph/graph-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-store.d.ts","sourceRoot":"","sources":["../../src/graph/graph-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,eAAe,EACf,qBAAqB,EACrB,mBAAmB,EACpB,MAAM,oBAAoB,CAAC;AAM5B,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,MAAM,CAAsC;IAEpD,MAAM,CAAC,KAAK,EAAE,eAAe,GAAG,eAAe;IAK/C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAIhD,MAAM,CACJ,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG,cAAc,GAAG,aAAa,CAAC,CAAC,GAC9G,eAAe,GAAG,SAAS;IAe9B,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,GAAG,eAAe,GAAG,SAAS;IASpF,UAAU,CACR,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,EAAE,QAAQ,GAAG,cAAc,CAAC,CAAC,GACrE,mBAAmB,GAAG,SAAS;IAclC,IAAI,IAAI,eAAe,EAAE;IAIzB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;CAG5B"}

package/dist/graph/graph-store.js

@@ -0,0 +1,61 @@
+// ---------------------------------------------------------------------------
+// DeploymentGraphStore — in-memory store for deployment graphs
+// ---------------------------------------------------------------------------
+export class DeploymentGraphStore {
+    graphs = new Map();
+    create(graph) {
+        this.graphs.set(graph.id, graph);
+        return graph;
+    }
+    getById(id) {
+        return this.graphs.get(id);
+    }
+    update(id, updates) {
+        const existing = this.graphs.get(id);
+        if (!existing)
+            return undefined;
+        if (updates.name !== undefined)
+            existing.name = updates.name;
+        if (updates.nodes !== undefined)
+            existing.nodes = updates.nodes;
+        if (updates.edges !== undefined)
+            existing.edges = updates.edges;
+        if (updates.status !== undefined)
+            existing.status = updates.status;
+        if (updates.approvalMode !== undefined)
+            existing.approvalMode = updates.approvalMode;
+        if (updates.partitionId !== undefined)
+            existing.partitionId = updates.partitionId;
+        existing.updatedAt = new Date();
+        return existing;
+    }
+    updateStatus(id, status) {
+        const existing = this.graphs.get(id);
+        if (!existing)
+            return undefined;
+        existing.status = status;
+        existing.updatedAt = new Date();
+        return existing;
+    }
+    updateNode(graphId, nodeId, updates) {
+        const graph = this.graphs.get(graphId);
+        if (!graph)
+            return undefined;
+        const node = graph.nodes.find((n) => n.id === nodeId);
+        if (!node)
+            return undefined;
+        if (updates.status !== undefined)
+            node.status = updates.status;
+        if (updates.deploymentId !== undefined)
+            node.deploymentId = updates.deploymentId;
+        graph.updatedAt = new Date();
+        return node;
+    }
+    list() {
+        return Array.from(this.graphs.values());
+    }
+    delete(id) {
+        return this.graphs.delete(id);
+    }
+}
+//# sourceMappingURL=graph-store.js.map

package/dist/graph/graph-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-store.js","sourceRoot":"","sources":["../../src/graph/graph-store.ts"],"names":[],"mappings":"AAMA,8EAA8E;AAC9E,+DAA+D;AAC/D,8EAA8E;AAE9E,MAAM,OAAO,oBAAoB;IACvB,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAEpD,MAAM,CAAC,KAAsB;QAC3B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CACJ,EAAU,EACV,OAA+G;QAE/G,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;YAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAC7D,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAChE,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAChE,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS;YAAE,QAAQ,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QACnE,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS;YAAE,QAAQ,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;QACrF,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS;YAAE,QAAQ,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QAClF,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAEhC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,YAAY,CAAC,EAAU,EAAE,MAA6B;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;QACzB,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAChC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,UAAU,CACR,OAAe,EACf,MAAc,EACd,OAAsE;QAEtE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAE7B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAE5B,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC/D,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS;YAAE,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;QACjF,KAAK,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAE7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,EAAU;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;CACF"}

package/dist/graph/index.d.ts

@@ -0,0 +1,5 @@
+export { GraphExecutor, topologicalSort } from "./graph-executor.js";
+export type { GraphProgressEvent } from "./graph-executor.js";
+export { GraphInferenceEngine } from "./graph-inference.js";
+export { DeploymentGraphStore } from "./graph-store.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACrE,YAAY,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,4 @@
+export { GraphExecutor, topologicalSort } from "./graph-executor.js";
+export { GraphInferenceEngine } from "./graph-inference.js";
+export { DeploymentGraphStore } from "./graph-store.js";
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAErE,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}