@decaf-ts/integrations 0.3.0 → 0.3.2

package/lib/esm/graph/planning/GraphExecutionPlanner.js

@@ -0,0 +1,192 @@
+import { graphDefinitionOf } from "@decaf-ts/ui-decorators/graph";
+import { GRAPH_WORKFLOW_BOUNDARY } from "./../constants.js";
+import { GraphCycleError } from "./../errors/GraphCycleError.js";
+import { GraphTopologyError } from "./../errors/GraphTopologyError.js";
+import { GraphRelationResolver } from "./GraphRelationResolver.js";
+/**
+ * Planner that turns a {@link GraphWorkflowDefinition} into a
+ * {@link GraphExecutionPlan} with topological layers.
+ */
+export class GraphExecutionPlanner {
+    constructor(resolver) {
+        this.resolver = resolver ?? new GraphRelationResolver();
+    }
+    /**
+     * Plans a workflow for execution.
+     *
+     * @param workflow - The workflow definition to plan.
+     * @returns The execution plan with nodes, edges, layers, and maps.
+     * @throws {GraphTopologyError} when node IDs are not unique.
+     * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
+     */
+    plan(workflow) {
+        this.validateUniqueNodeIds(workflow);
+        const nodes = this.resolveNodes(workflow);
+        const edges = this.resolver.resolve(workflow);
+        const incomingByNode = this.buildIncomingMap(edges);
+        const outgoingByNode = this.buildOutgoingMap(edges);
+        const layers = this.topologicalLayers(nodes, edges);
+        return {
+            workflow,
+            workflowId: workflow.name,
+            nodes,
+            edges,
+            layers,
+            incomingByNode,
+            outgoingByNode,
+        };
+    }
+    /**
+     * Validates that all workflow node IDs are unique.
+     */
+    validateUniqueNodeIds(workflow) {
+        const seen = new Set();
+        for (const node of workflow.nodes ?? []) {
+            if (seen.has(node.id)) {
+                throw new GraphTopologyError(`Duplicate node id '${node.id}' in workflow '${workflow.name}'`, { nodeId: node.id, workflowId: workflow.name });
+            }
+            seen.add(node.id);
+        }
+    }
+    /**
+     * Resolves workflow node metadata into plan nodes with full definitions.
+     */
+    resolveNodes(workflow) {
+        const result = [];
+        for (const nodeMeta of workflow.nodes ?? []) {
+            const definition = this.resolveDefinition(nodeMeta);
+            const inputPorts = (definition.ports ?? [])
+                .filter((p) => p.direction === "input")
+                .map((p) => p.name);
+            const outputPorts = (definition.ports ?? [])
+                .filter((p) => p.direction === "output")
+                .map((p) => p.name);
+            result.push({
+                id: nodeMeta.id,
+                kind: nodeMeta.kind ?? definition.kind ?? nodeMeta.id,
+                label: nodeMeta.label,
+                source: nodeMeta,
+                definition,
+                inputPorts,
+                outputPorts,
+                metadata: nodeMeta.metadata,
+            });
+        }
+        return result;
+    }
+    /**
+     * Attempts to resolve the full graph node definition from metadata.
+     *
+     * Accepts either a decorated Model class/instance (resolved via
+     * `graphDefinitionOf`) or a plain `GraphNodeDefinition`-shaped object
+     * (useful for serialized workflows that inline node definitions).
+     */
+    resolveDefinition(nodeMeta) {
+        if (nodeMeta.node) {
+            if (this.isRawDefinition(nodeMeta.node)) {
+                return nodeMeta.node;
+            }
+            try {
+                return graphDefinitionOf(nodeMeta.node);
+            }
+            catch {
+                // fall through to stub
+            }
+        }
+        // Return a minimal stub definition so planning can proceed
+        return {
+            name: nodeMeta.id,
+            tag: nodeMeta.id,
+            kind: nodeMeta.kind ?? nodeMeta.id,
+            labels: [],
+            ports: [],
+        };
+    }
+    /**
+     * Returns `true` when a value looks like a raw {@link GraphNodeDefinition}
+     * (a plain object with a `ports` array and a `name` string).
+     */
+    isRawDefinition(value) {
+        return (typeof value === "object" &&
+            value !== null &&
+            !Array.isArray(value) &&
+            typeof value.name === "string" &&
+            Array.isArray(value.ports));
+    }
+    /**
+     * Builds a map of node id -> incoming edges.
+     */
+    buildIncomingMap(edges) {
+        const map = new Map();
+        for (const edge of edges) {
+            const list = map.get(edge.targetNodeId) ?? [];
+            list.push(edge);
+            map.set(edge.targetNodeId, list);
+        }
+        return map;
+    }
+    /**
+     * Builds a map of node id -> outgoing edges.
+     */
+    buildOutgoingMap(edges) {
+        const map = new Map();
+        for (const edge of edges) {
+            const list = map.get(edge.sourceNodeId) ?? [];
+            list.push(edge);
+            map.set(edge.sourceNodeId, list);
+        }
+        return map;
+    }
+    /**
+     * Produces topological layers using Kahn's algorithm.
+     *
+     * Workflow boundary edges do not count as executable-node dependencies.
+     */
+    topologicalLayers(nodes, edges) {
+        const executableNodes = nodes.filter((n) => n.id !== GRAPH_WORKFLOW_BOUNDARY);
+        const nodeIds = new Set(executableNodes.map((n) => n.id));
+        // Only edges between two executable nodes count as dependencies
+        const execEdges = edges.filter((e) => nodeIds.has(e.sourceNodeId) && nodeIds.has(e.targetNodeId));
+        // Compute in-degree
+        const indegree = new Map();
+        for (const node of executableNodes)
+            indegree.set(node.id, 0);
+        for (const edge of execEdges) {
+            indegree.set(edge.targetNodeId, (indegree.get(edge.targetNodeId) ?? 0) + 1);
+        }
+        const layers = [];
+        const planned = new Set();
+        let ready = executableNodes.filter((n) => (indegree.get(n.id) ?? 0) === 0);
+        let layerIndex = 0;
+        while (ready.length > 0) {
+            const layer = { index: layerIndex++, nodes: ready };
+            layers.push(layer);
+            const nextReady = [];
+            for (const node of ready) {
+                planned.add(node.id);
+                const outgoing = execEdges.filter((e) => e.sourceNodeId === node.id);
+                for (const edge of outgoing) {
+                    const deg = (indegree.get(edge.targetNodeId) ?? 1) - 1;
+                    indegree.set(edge.targetNodeId, deg);
+                    if (deg === 0 && !planned.has(edge.targetNodeId)) {
+                        const next = executableNodes.find((n) => n.id === edge.targetNodeId);
+                        if (next)
+                            nextReady.push(next);
+                    }
+                }
+            }
+            ready = nextReady;
+        }
+        if (planned.size !== executableNodes.length) {
+            const unplanned = executableNodes
+                .filter((n) => !planned.has(n.id))
+                .map((n) => n.id);
+            throw new GraphCycleError({
+                unplannedNodes: unplanned,
+                workflowId: nodes[0]?.definition?.name,
+            });
+        }
+        return layers;
+    }
+}
+//# sourceMappingURL=GraphExecutionPlanner.js.map

package/lib/esm/graph/planning/GraphExecutionPlanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanner.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphExecutionPlanner.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AACvD,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,0CAAqC;AAKlE,OAAO,EAAE,qBAAqB,EAAE,mCAAgC;AAEhE;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAGhC,YAAY,QAAgC;QAC1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,qBAAqB,EAAE,CAAC;IAC1D,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,QAAiC;QACpC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAErC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAE9C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEpD,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,KAAK;YACL,KAAK;YACL,MAAM;YACN,cAAc;YACd,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,QAAiC;QAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,kBAAkB,CAC1B,sBAAsB,IAAI,CAAC,EAAE,kBAAkB,QAAQ,CAAC,IAAI,GAAG,EAC/D,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,CAC/C,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,QAAiC;QAEjC,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC;iBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACzC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC;iBACvC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,QAAQ,CAAC,EAAE;gBACf,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;gBACrD,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,MAAM,EAAE,QAAQ;gBAChB,UAAU;gBACV,UAAU;gBACV,WAAW;gBACX,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aAC5B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,QAIzB;QACC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,OAAO,QAAQ,CAAC,IAA2B,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC;gBACH,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAW,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,uBAAuB;YACzB,CAAC;QACH,CAAC;QACD,2DAA2D;QAC3D,OAAO;YACL,IAAI,EAAE,QAAQ,CAAC,EAAE;YACjB,GAAG,EAAE,QAAQ,CAAC,EAAE;YAChB,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;YAClC,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,EAAE;SACV,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,KAAc;QACpC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,OAAQ,KAA4B,CAAC,IAAI,KAAK,QAAQ;YACtD,KAAK,CAAC,OAAO,CAAE,KAA6B,CAAC,KAAK,CAAC,CACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CACvB,KAA+B,EAC/B,KAA+B;QAE/B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,uBAAuB,CACxC,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,gEAAgE;QAChE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAClE,CAAC;QAEF,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,eAAe;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAA4B,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAC7E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,SAAS,GAA6B,EAAE,CAAC;YAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBACrC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC;wBACrE,IAAI,IAAI;4BAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,SAAS,CAAC;QACpB,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,eAAe;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,IAAI,eAAe,CAAC;gBACxB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI;aACvC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/lib/esm/graph/planning/GraphRelationResolver.js

@@ -0,0 +1,167 @@
+import { graphDefinitionOf } from "@decaf-ts/ui-decorators/graph";
+import { GRAPH_WORKFLOW_BOUNDARY } from "./../constants.js";
+import { GraphPortError } from "./../errors/GraphPortError.js";
+import { GraphTopologyError } from "./../errors/GraphTopologyError.js";
+/**
+ * Resolves raw workflow relation metadata into normalized execution edges.
+ */
+export class GraphRelationResolver {
+    /**
+     * Resolves all relations of a workflow into execution edges.
+     *
+     * @param workflow - The workflow definition.
+     * @returns Array of normalized edges.
+     * @throws {GraphTopologyError} when an endpoint is unknown or ambiguous.
+     * @throws {GraphPortError} when a referenced port is missing or unknown.
+     */
+    resolve(workflow) {
+        const nodeIds = new Set(workflow.nodes.map((n) => n.id));
+        const boundaryAliases = this.boundaryAliases(workflow);
+        const inputPorts = this.portNames(workflow.inputs);
+        const outputPorts = this.portNames(workflow.outputs);
+        const nodePortMap = this.buildNodePortMap(workflow);
+        const edges = [];
+        for (const relation of workflow.relations ?? []) {
+            const edge = this.resolveRelation(relation, nodeIds, boundaryAliases, inputPorts, outputPorts, nodePortMap);
+            edges.push(edge);
+        }
+        return edges;
+    }
+    /**
+     * Resolves a single relation into an edge.
+     */
+    resolveRelation(relation, nodeIds, boundaryAliases, inputPorts, outputPorts, nodePortMap) {
+        const sourceNodeId = this.resolveEndpoint(relation.source, nodeIds, boundaryAliases);
+        const targetNodeId = this.resolveEndpoint(relation.target, nodeIds, boundaryAliases);
+        const sourcePort = relation.sourcePort;
+        const targetPort = relation.targetPort;
+        if (!sourcePort) {
+            throw new GraphPortError(`Relation is missing sourcePort (source: ${String(relation.source)}, target: ${String(relation.target)})`, { relation });
+        }
+        if (!targetPort) {
+            throw new GraphPortError(`Relation is missing targetPort (source: ${String(relation.source)}, target: ${String(relation.target)})`, { relation });
+        }
+        this.validatePort(sourceNodeId, sourcePort, true, boundaryAliases, inputPorts, outputPorts, nodePortMap);
+        this.validatePort(targetNodeId, targetPort, false, boundaryAliases, inputPorts, outputPorts, nodePortMap);
+        return {
+            id: this.createEdgeId(sourceNodeId, sourcePort, targetNodeId, targetPort),
+            sourceNodeId,
+            sourcePort,
+            targetNodeId,
+            targetPort,
+            label: relation.label,
+            metadata: relation.metadata,
+        };
+    }
+    /**
+     * Resolves an endpoint (source or target) to a node id or the workflow boundary.
+     */
+    resolveEndpoint(endpoint, nodeIds, boundaryAliases) {
+        const name = String(endpoint);
+        if (boundaryAliases.has(name))
+            return GRAPH_WORKFLOW_BOUNDARY;
+        if (nodeIds.has(name))
+            return name;
+        throw new GraphTopologyError(`Unknown endpoint '${name}'`, { endpoint: name, knownNodes: Array.from(nodeIds) });
+    }
+    /**
+     * Validates that a port exists on the given node or boundary.
+     */
+    validatePort(nodeId, port, isSource, boundaryAliases, inputPorts, outputPorts, nodePortMap) {
+        if (nodeId === GRAPH_WORKFLOW_BOUNDARY) {
+            const ports = isSource ? inputPorts : outputPorts;
+            if (!ports.has(port)) {
+                throw new GraphPortError(`Unknown ${isSource ? "input" : "output"} port '${port}' on workflow boundary`, { nodeId, port, isSource, available: Array.from(ports) });
+            }
+            return;
+        }
+        const nodePorts = nodePortMap.get(nodeId);
+        if (!nodePorts) {
+            throw new GraphTopologyError(`No port map for node '${nodeId}'`, {
+                nodeId,
+            });
+        }
+        const ports = isSource ? nodePorts.output : nodePorts.input;
+        if (!ports.has(port)) {
+            throw new GraphPortError(`Unknown ${isSource ? "output" : "input"} port '${port}' on node '${nodeId}'`, { nodeId, port, isSource, available: Array.from(ports) });
+        }
+    }
+    /**
+     * Builds the set of boundary aliases for a workflow.
+     */
+    boundaryAliases(workflow) {
+        return new Set([
+            GRAPH_WORKFLOW_BOUNDARY,
+            "workflow",
+            "graph",
+            workflow.name,
+        ]);
+    }
+    /**
+     * Extracts port names from a list of port definitions.
+     */
+    portNames(ports) {
+        return new Set((ports ?? []).map((p) => p.name));
+    }
+    /**
+     * Builds a map of node id -> { input ports, output ports }.
+     */
+    buildNodePortMap(workflow) {
+        const map = new Map();
+        for (const nodeMeta of workflow.nodes ?? []) {
+            const input = new Set();
+            const output = new Set();
+            const def = this.resolveNodeDefinition(nodeMeta);
+            if (def) {
+                for (const port of def.ports ?? []) {
+                    if (port.direction === "input")
+                        input.add(port.name);
+                    else
+                        output.add(port.name);
+                }
+            }
+            map.set(nodeMeta.id, { input, output });
+        }
+        return map;
+    }
+    /**
+     * Attempts to resolve a node's full definition from its metadata.
+     *
+     * Accepts either a decorated Model class/instance (resolved via
+     * `graphDefinitionOf`) or a plain `GraphNodeDefinition`-shaped object
+     * (useful for serialized workflows that inline node definitions).
+     */
+    resolveNodeDefinition(nodeMeta) {
+        if (nodeMeta.node) {
+            if (this.isRawDefinition(nodeMeta.node)) {
+                return nodeMeta.node;
+            }
+            try {
+                const def = graphDefinitionOf(nodeMeta.node);
+                return def;
+            }
+            catch {
+                return undefined;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Returns `true` when a value looks like a raw {@link GraphNodeDefinition}
+     * (a plain object with a `ports` array and a `name` string).
+     */
+    isRawDefinition(value) {
+        return (typeof value === "object" &&
+            value !== null &&
+            !Array.isArray(value) &&
+            typeof value.name === "string" &&
+            Array.isArray(value.ports));
+    }
+    /**
+     * Creates a stable edge id from its endpoints and ports.
+     */
+    createEdgeId(sourceNodeId, sourcePort, targetNodeId, targetPort) {
+        return `${sourceNodeId}:${sourcePort}->${targetNodeId}:${targetPort}`;
+    }
+}
+//# sourceMappingURL=GraphRelationResolver.js.map

package/lib/esm/graph/planning/GraphRelationResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphRelationResolver.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphRelationResolver.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AACvD,OAAO,EAAE,cAAc,EAAE,sCAAiC;AAC1D,OAAO,EAAE,kBAAkB,EAAE,0CAAqC;AAGlE;;GAEG;AACH,MAAM,OAAO,qBAAqB;IAChC;;;;;;;OAOG;IACH,OAAO,CAAC,QAAiC;QACvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QACvD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEpD,MAAM,KAAK,GAA6B,EAAE,CAAC;QAE3C,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAC/B,QAAQ,EACR,OAAO,EACP,eAAe,EACf,UAAU,EACV,WAAW,EACX,WAAW,CACZ,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,QAAuC,EACvC,OAAoB,EACpB,eAA4B,EAC5B,UAAuB,EACvB,WAAwB,EACxB,WAAqE;QAErE,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CACvC,QAAQ,CAAC,MAAM,EACf,OAAO,EACP,eAAe,CAChB,CAAC;QACF,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CACvC,QAAQ,CAAC,MAAM,EACf,OAAO,EACP,eAAe,CAChB,CAAC;QAEF,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;QACvC,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;QAEvC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,cAAc,CACtB,2CAA2C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EACzG,EAAE,QAAQ,EAAE,CACb,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,IAAI,cAAc,CACtB,2CAA2C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EACzG,EAAE,QAAQ,EAAE,CACb,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,YAAY,CACf,YAAY,EACZ,UAAU,EACV,IAAI,EACJ,eAAe,EACf,UAAU,EACV,WAAW,EACX,WAAW,CACZ,CAAC;QACF,IAAI,CAAC,YAAY,CACf,YAAY,EACZ,UAAU,EACV,KAAK,EACL,eAAe,EACf,UAAU,EACV,WAAW,EACX,WAAW,CACZ,CAAC;QAEF,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,CAAC;YACzE,YAAY;YACZ,UAAU;YACV,YAAY;YACZ,UAAU;YACV,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;SAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,QAA0B,EAC1B,OAAoB,EACpB,eAA4B;QAE5B,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9B,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,uBAAuB,CAAC;QAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,MAAM,IAAI,kBAAkB,CAC1B,qBAAqB,IAAI,GAAG,EAC5B,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,MAAc,EACd,IAAY,EACZ,QAAiB,EACjB,eAA4B,EAC5B,UAAuB,EACvB,WAAwB,EACxB,WAAqE;QAErE,IAAI,MAAM,KAAK,uBAAuB,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,MAAM,IAAI,cAAc,CACtB,WAAW,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,UAAU,IAAI,wBAAwB,EAC9E,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CACzD,CAAC;YACJ,CAAC;YACD,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,kBAAkB,CAAC,yBAAyB,MAAM,GAAG,EAAE;gBAC/D,MAAM;aACP,CAAC,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;QAC5D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,cAAc,CACtB,WAAW,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,UAAU,IAAI,cAAc,MAAM,GAAG,EAC7E,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CACzD,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,QAAiC;QACvD,OAAO,IAAI,GAAG,CAAC;YACb,uBAAuB;YACvB,UAAU;YACV,OAAO;YACP,QAAQ,CAAC,IAAI;SACd,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,KAAwC;QACxD,OAAO,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,QAAiC;QAEjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuD,CAAC;QAC3E,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;oBACnC,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO;wBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;wBAChD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,qBAAqB,CAC3B,QAA2C;QAE3C,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,OAAO,QAAQ,CAAC,IAEf,CAAC;YACJ,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,iBAAiB,CAAC,QAAQ,CAAC,IAAW,CAAC,CAAC;gBACpD,OAAO,GAAU,CAAC;YACpB,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,KAAc;QACpC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,OAAQ,KAA4B,CAAC,IAAI,KAAK,QAAQ;YACtD,KAAK,CAAC,OAAO,CAAE,KAA6B,CAAC,KAAK,CAAC,CACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,YAAoB,EACpB,UAAkB,EAClB,YAAoB,EACpB,UAAkB;QAElB,OAAO,GAAG,YAAY,IAAI,UAAU,KAAK,YAAY,IAAI,UAAU,EAAE,CAAC;IACxE,CAAC;CACF"}

package/lib/esm/graph/planning/GraphTopology.js

@@ -0,0 +1,52 @@
+/**
+ * Topology utility for traversing the execution plan's edges.
+ */
+export class GraphTopology {
+    /**
+     * Returns the set of upstream node ids reachable from `nodeId` by following
+     * incoming edges. The workflow boundary node is excluded.
+     */
+    static upstreamNodes(nodeId, incomingByNode, includeBoundary = false) {
+        const visited = new Set();
+        const stack = [nodeId];
+        while (stack.length) {
+            const current = stack.pop();
+            const incoming = incomingByNode.get(current) ?? [];
+            for (const edge of incoming) {
+                if (!includeBoundary && this.isBoundary(edge.sourceNodeId))
+                    continue;
+                if (!visited.has(edge.sourceNodeId)) {
+                    visited.add(edge.sourceNodeId);
+                    stack.push(edge.sourceNodeId);
+                }
+            }
+        }
+        return visited;
+    }
+    /**
+     * Returns the set of downstream node ids reachable from `nodeId` by following
+     * outgoing edges. The workflow boundary node is excluded.
+     */
+    static downstreamNodes(nodeId, outgoingByNode, includeBoundary = false) {
+        const visited = new Set();
+        const stack = [nodeId];
+        while (stack.length) {
+            const current = stack.pop();
+            const outgoing = outgoingByNode.get(current) ?? [];
+            for (const edge of outgoing) {
+                if (!includeBoundary && this.isBoundary(edge.targetNodeId))
+                    continue;
+                if (!visited.has(edge.targetNodeId)) {
+                    visited.add(edge.targetNodeId);
+                    stack.push(edge.targetNodeId);
+                }
+            }
+        }
+        return visited;
+    }
+    /** Returns whether a node id is the workflow boundary. */
+    static isBoundary(nodeId) {
+        return nodeId === "$workflow";
+    }
+}
+//# sourceMappingURL=GraphTopology.js.map

package/lib/esm/graph/planning/GraphTopology.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphTopology.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphTopology.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,MAAM,OAAO,aAAa;IACxB;;;OAGG;IACH,MAAM,CAAC,aAAa,CAClB,MAAc,EACd,cAAqD,EACrD,eAAe,GAAG,KAAK;QAEvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC;oBAAE,SAAS;gBACrE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;oBACpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,eAAe,CACpB,MAAc,EACd,cAAqD,EACrD,eAAe,GAAG,KAAK;QAEvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC;oBAAE,SAAS;gBACrE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;oBACpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0DAA0D;IAC1D,MAAM,CAAC,UAAU,CAAC,MAAc;QAC9B,OAAO,MAAM,KAAK,WAAW,CAAC;IAChC,CAAC;CACF"}

package/lib/esm/graph/planning/index.js

@@ -0,0 +1,13 @@
+/**
+ * @module integrations/graph/planning
+ * @summary Graph execution planning.
+ * @description Re-exports the execution plan types, relation resolver, and topological planner.
+ */
+export * from "./GraphExecutionPlanNode.js";
+export * from "./GraphExecutionPlanEdge.js";
+export * from "./GraphExecutionPlanLayer.js";
+export * from "./GraphExecutionPlan.js";
+export * from "./GraphRelationResolver.js";
+export * from "./GraphExecutionPlanner.js";
+export * from "./GraphTopology.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/planning/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/graph/planning/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4CAAyC;AACzC,4CAAyC;AACzC,6CAA0C;AAC1C,wCAAqC;AACrC,2CAAwC;AACxC,2CAAwC;AACxC,mCAAgC"}

package/lib/esm/graph/registry/GraphNodeExecutorRegistry.js

@@ -0,0 +1,39 @@
+import { GraphExecutionError } from "./../errors/GraphExecutionError.js";
+/**
+ * Registry that maps node `kind` strings to {@link GraphNodeExecutor}
+ * instances.
+ */
+export class GraphNodeExecutorRegistry {
+    constructor() {
+        this.executors = new Map();
+    }
+    /** Registers an executor for the given node kind. */
+    register(kind, executor) {
+        if (!kind)
+            throw new GraphExecutionError("Graph executor kind is required");
+        this.executors.set(kind, executor);
+        return this;
+    }
+    /** Removes the executor for the given node kind. */
+    unregister(kind) {
+        this.executors.delete(kind);
+        return this;
+    }
+    /** Returns whether an executor is registered for the given kind. */
+    has(kind) {
+        return this.executors.has(kind);
+    }
+    /**
+     * Resolves the executor for the given node kind.
+     *
+     * @throws {GraphExecutionError} when no executor is registered for `kind`.
+     */
+    resolve(kind) {
+        const executor = this.executors.get(kind);
+        if (!executor) {
+            throw new GraphExecutionError(`No graph executor registered for kind '${kind}'`, "GRAPH_EXECUTOR_NOT_FOUND", { kind });
+        }
+        return executor;
+    }
+}
+//# sourceMappingURL=GraphNodeExecutorRegistry.js.map

package/lib/esm/graph/registry/GraphNodeExecutorRegistry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphNodeExecutorRegistry.js","sourceRoot":"","sources":["../../../../src/graph/registry/GraphNodeExecutorRegistry.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AAEpE;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAAtC;QACmB,cAAS,GAAG,IAAI,GAAG,EAA6B,CAAC;IAoCpE,CAAC;IAlCC,qDAAqD;IACrD,QAAQ,CAAC,IAAY,EAAE,QAA2B;QAChD,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,mBAAmB,CAAC,iCAAiC,CAAC,CAAC;QAC5E,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oDAAoD;IACpD,UAAU,CAAC,IAAY;QACrB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oEAAoE;IACpE,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,IAAY;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,mBAAmB,CAC3B,0CAA0C,IAAI,GAAG,EACjD,0BAA0B,EAC1B,EAAE,IAAI,EAAE,CACT,CAAC;QACJ,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/lib/esm/graph/registry/GraphNodeExecutorResolver.js

@@ -0,0 +1,22 @@
+/**
+ * Resolver that wraps a {@link GraphNodeExecutorRegistry} and optionally
+ * falls back to a default executor when a kind is not found.
+ */
+export class GraphNodeExecutorResolver {
+    constructor(registry, defaultExecutor) {
+        this.registry = registry;
+        this.defaultExecutor = defaultExecutor;
+    }
+    /**
+     * Resolves the executor for `kind`, falling back to the default executor
+     * when provided.
+     */
+    resolve(kind) {
+        if (this.registry.has(kind))
+            return this.registry.resolve(kind);
+        if (this.defaultExecutor)
+            return this.defaultExecutor;
+        return this.registry.resolve(kind);
+    }
+}
+//# sourceMappingURL=GraphNodeExecutorResolver.js.map

package/lib/esm/graph/registry/GraphNodeExecutorResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphNodeExecutorResolver.js","sourceRoot":"","sources":["../../../../src/graph/registry/GraphNodeExecutorResolver.ts"],"names":[],"mappings":"AAQA;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAGpC,YACmB,QAAmC,EACpD,eAAmC;QADlB,aAAQ,GAAR,QAAQ,CAA2B;QAGpD,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAY;QAClB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC,eAAe,CAAC;QACtD,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;CACF"}

package/lib/esm/graph/registry/index.js

@@ -0,0 +1,8 @@
+/**
+ * @module integrations/graph/registry
+ * @summary Graph node executor registry and resolver.
+ * @description Re-exports the executor registry and resolver.
+ */
+export * from "./GraphNodeExecutorRegistry.js";
+export * from "./GraphNodeExecutorResolver.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/registry/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/graph/registry/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,+CAA4C;AAC5C,+CAA4C"}

package/lib/esm/graph/snapshots/GraphExecutionSnapshotMapper.js

@@ -0,0 +1,48 @@
+/**
+ * @module integrations/graph/snapshots/GraphExecutionSnapshotMapper
+ * @summary Maps execution results to snapshot patches.
+ * @description Produces a GraphExecutionSnapshotPatch consumable by `@decaf-ts/ui-decorators/graph` snapshots, rather than replacing the snapshot system.
+ */
+import { GraphExecutionStatus } from "./../constants.js";
+/**
+ * Maps a {@link GraphExecutionResult} to a {@link GraphExecutionSnapshotPatch}.
+ */
+export class GraphExecutionSnapshotMapper {
+    /**
+     * Creates a snapshot patch from an execution result.
+     */
+    map(result) {
+        const nodes = {};
+        for (const [id, nodeResult] of Object.entries(result.nodeResults)) {
+            nodes[id] = {
+                status: nodeResult.status,
+                startedAt: nodeResult.startedAt?.toISOString(),
+                finishedAt: nodeResult.finishedAt?.toISOString(),
+                error: nodeResult.error,
+                outputs: nodeResult.outputs,
+                fromCache: nodeResult.fromCache,
+                pinned: nodeResult.pinned,
+            };
+        }
+        const edges = {};
+        for (const event of result.events) {
+            if (event.edgeId && event.type === "edge.valueRouted") {
+                edges[event.edgeId] = {
+                    status: GraphExecutionStatus.SUCCEEDED,
+                    lastValue: event.payload?.value,
+                    updatedAt: event.timestamp.toISOString(),
+                };
+            }
+        }
+        const events = [...result.events];
+        return {
+            runId: result.runId,
+            status: result.status,
+            nodes,
+            edges,
+            outputs: result.outputs,
+            events,
+        };
+    }
+}
+//# sourceMappingURL=GraphExecutionSnapshotMapper.js.map

package/lib/esm/graph/snapshots/GraphExecutionSnapshotMapper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionSnapshotMapper.js","sourceRoot":"","sources":["../../../../src/graph/snapshots/GraphExecutionSnapshotMapper.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,oBAAoB,EAAE,0BAAqB;AAOpD;;GAEG;AACH,MAAM,OAAO,4BAA4B;IACvC;;OAEG;IACH,GAAG,CAAC,MAA4B;QAC9B,MAAM,KAAK,GAAyC,EAAE,CAAC;QACvD,KAAK,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;YAClE,KAAK,CAAC,EAAE,CAAC,GAAG;gBACV,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,SAAS,EAAE,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE;gBAC9C,UAAU,EAAE,UAAU,CAAC,UAAU,EAAE,WAAW,EAAE;gBAChD,KAAK,EAAE,UAAU,CAAC,KAAK;gBACvB,OAAO,EAAE,UAAU,CAAC,OAAO;gBAC3B,SAAS,EAAE,UAAU,CAAC,SAAS;gBAC/B,MAAM,EAAE,UAAU,CAAC,MAAM;aAC1B,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAyC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;gBACtD,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG;oBACpB,MAAM,EAAE,oBAAoB,CAAC,SAAS;oBACtC,SAAS,EAAG,KAAK,CAAC,OAAe,EAAE,KAAK;oBACxC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,WAAW,EAAE;iBACzC,CAAC;YACJ,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAA0B,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAEzD,OAAO;YACL,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,KAAK;YACL,KAAK;YACL,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,MAAM;SACP,CAAC;IACJ,CAAC;CACF"}

package/lib/esm/graph/snapshots/index.js

@@ -0,0 +1,7 @@
+/**
+ * @module integrations/graph/snapshots
+ * @summary Graph execution snapshot mapping.
+ * @description Re-exports the snapshot patch mapper.
+ */
+export * from "./GraphExecutionSnapshotMapper.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/snapshots/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/graph/snapshots/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,kDAA+C"}

package/lib/esm/graph/store/GraphCachedValue.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphCachedValue.js.map

package/lib/esm/graph/store/GraphCachedValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphCachedValue.js","sourceRoot":"","sources":["../../../../src/graph/store/GraphCachedValue.ts"],"names":[],"mappings":""}

package/lib/esm/graph/store/GraphValueKey.js

@@ -0,0 +1,7 @@
+/**
+ * @module integrations/graph/store/GraphValueKey
+ * @summary Stable key for cached graph values.
+ * @description Identifies a cached value in the store by workflow, node, fingerprint, and optional namespace/version.
+ */
+export {};
+//# sourceMappingURL=GraphValueKey.js.map

package/lib/esm/graph/store/GraphValueKey.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphValueKey.js","sourceRoot":"","sources":["../../../../src/graph/store/GraphValueKey.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}