@open-mercato/core 0.6.6-develop.6524.1.a78cc4694e → 0.6.6-develop.6525.1.e9a4b56963

package/dist/modules/workflows/lib/graph-utils.js

@@ -240,9 +240,9 @@ function calculateSmartLayout(steps, transitions, spacing) {
   while (queue.length > 0) {
     const { id, level } = queue.shift();
     const currentLevel = levels.get(id);
-    if (currentLevel === void 0 || level > currentLevel) {
-      levels.set(id, level);
-    }
+    if (currentLevel !== void 0 && level <= currentLevel) continue;
+    levels.set(id, level);
+    if (level > steps.length) continue;
     const children = outgoing.get(id) || [];
     for (const child of children) {
       queue.push({ id: child, level: level + 1 });

package/dist/modules/workflows/lib/graph-utils.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../src/modules/workflows/lib/graph-utils.ts"],
-  "sourcesContent": ["import type { Node, Edge } from '@xyflow/react'\nimport type { WorkflowDefinition } from '../data/entities'\n\n/**\n * Graph Utilities for Visual Workflow Editor\n *\n * Converts between ReactFlow graph representation and workflow definition JSON\n */\n\nexport interface GraphToDefinitionOptions {\n  includePositions?: boolean\n}\n\nexport interface DefinitionToGraphOptions {\n  autoLayout?: boolean\n  layoutSpacing?: { vertical: number; horizontal: number }\n}\n\n/**\n * Convert ReactFlow graph (nodes + edges) to workflow definition JSON\n */\nexport function graphToDefinition(\n  nodes: Node[],\n  edges: Edge[],\n  options: GraphToDefinitionOptions = {}\n): WorkflowDefinition['definition'] {\n  // Extract steps from nodes\n  const steps = nodes.map((node) => {\n    const step: any = {\n      stepId: node.id,\n      stepName: node.data.label || node.id,\n      stepType: mapNodeTypeToStepType(node.type || 'automated'),\n    }\n\n    // Add step-specific configuration\n    if (node.data.description) {\n      step.description = node.data.description\n    }\n\n    // Add timeout if present\n    if (node.data.timeout) {\n      step.timeout = node.data.timeout\n    }\n\n    // Add retryPolicy if present\n    if (node.data.retryPolicy) {\n      step.retryPolicy = node.data.retryPolicy\n    }\n\n    // Add generic config if present\n    if (node.data.config) {\n      step.config = node.data.config\n    }\n\n    // User task configuration\n    if (node.type === 'userTask' && node.data) {\n      step.userTaskConfig = {\n        assignedTo: node.data.assignedTo,\n        assignedToRoles: node.data.assignedToRoles || [],\n        formKey: node.data.formKey,\n        allowedActions: node.data.allowedActions || ['complete', 'cancel'],\n      }\n\n      // Add form schema if present\n      if ((node.data as any).formSchema || (node.data as any).userTaskConfig?.formSchema) {\n        step.userTaskConfig.formSchema = (node.data as any).formSchema || (node.data as any).userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if ((node.data as any).assignmentRule || (node.data as any).userTaskConfig?.assignmentRule) {\n        step.userTaskConfig.assignmentRule = (node.data as any).assignmentRule || (node.data as any).userTaskConfig.assignmentRule\n      }\n\n      if ((node.data as any).slaDuration || (node.data as any).userTaskConfig?.slaDuration) {\n        step.userTaskConfig.slaDuration = (node.data as any).slaDuration || (node.data as any).userTaskConfig.slaDuration\n      }\n\n      if ((node.data as any).escalationRules || (node.data as any).userTaskConfig?.escalationRules) {\n        step.userTaskConfig.escalationRules = (node.data as any).escalationRules || (node.data as any).userTaskConfig.escalationRules\n      }\n    }\n\n    // Wait for signal configuration\n    if (node.type === 'waitForSignal' && node.data.signalConfig) {\n      step.signalConfig = node.data.signalConfig\n    }\n\n    // Step activities (for AUTOMATED steps)\n    if (node.type === 'automated' && node.data.activities) {\n      step.activities = node.data.activities\n    }\n\n    // Pre-conditions (for START steps)\n    if (node.type === 'start' && (node.data as any).preConditions && (node.data as any).preConditions.length > 0) {\n      step.preConditions = (node.data as any).preConditions\n    }\n\n    // Store position for visual editor\n    if (options.includePositions && node.position) {\n      step._editorPosition = {\n        x: node.position.x,\n        y: node.position.y,\n      }\n    }\n\n    return step\n  })\n\n  // Extract transitions from edges\n  const transitions = edges.map((edge) => {\n    const edgeData = edge.data as any\n    const transition: any = {\n      transitionId: edge.id,\n      fromStepId: edge.source,\n      toStepId: edge.target,\n      trigger: edgeData?.trigger || 'auto',\n    }\n\n    // Add transition name if present\n    if (edgeData?.transitionName) {\n      transition.transitionName = edgeData.transitionName\n    }\n\n    // Add priority if present (default 0)\n    if (edgeData?.priority !== undefined) {\n      transition.priority = edgeData.priority\n    }\n\n    // Add continueOnActivityFailure if present (default false)\n    if (edgeData?.continueOnActivityFailure !== undefined) {\n      transition.continueOnActivityFailure = edgeData.continueOnActivityFailure\n    }\n\n    // Add conditions if present\n    if (edgeData?.preConditions && edgeData.preConditions.length > 0) {\n      transition.preConditions = edgeData.preConditions\n    }\n\n    if (edgeData?.postConditions && edgeData.postConditions.length > 0) {\n      transition.postConditions = edgeData.postConditions\n    }\n\n    // Add activities if present in edge data\n    if (edgeData?.activities && edgeData.activities.length > 0) {\n      transition.activities = edgeData.activities.map((activity: any) => ({\n        activityId: activity.activityId,\n        activityName: activity.activityName,\n        activityType: activity.activityType,\n        config: activity.config || {},\n        // Include all optional fields\n        ...(activity.async !== undefined && { async: activity.async }),\n        ...(activity.timeout && { timeout: activity.timeout }),\n        ...(activity.retryPolicy && { retryPolicy: activity.retryPolicy }),\n        ...(activity.compensate !== undefined && { compensate: activity.compensate }),\n      }))\n    } else {\n      // Check if source node is automated and has activity data\n      // If so, place the activity in this transition\n      const sourceNode = nodes.find(n => n.id === edge.source)\n      if (sourceNode && sourceNode.type === 'automated' && sourceNode.data) {\n        if (sourceNode.data.activityType || sourceNode.data.activityId) {\n          const activity: any = {\n            activityId: sourceNode.data.activityId || `activity_${sourceNode.id}`,\n            activityName: sourceNode.data.activityName || sourceNode.data.label || 'Automated Activity',\n            activityType: sourceNode.data.activityType || 'CALL_API',\n            config: sourceNode.data.activityConfig || {},\n          }\n          // Include optional activity fields from node data\n          if ((sourceNode.data as any).activityAsync !== undefined) {\n            activity.async = (sourceNode.data as any).activityAsync\n          }\n          if ((sourceNode.data as any).activityTimeout) {\n            activity.timeout = (sourceNode.data as any).activityTimeout\n          }\n          if ((sourceNode.data as any).activityRetryPolicy) {\n            activity.retryPolicy = (sourceNode.data as any).activityRetryPolicy\n          }\n          if ((sourceNode.data as any).activityCompensate !== undefined) {\n            activity.compensate = (sourceNode.data as any).activityCompensate\n          }\n          transition.activities = [activity]\n        }\n      }\n    }\n\n    // Add label if present (legacy field, transitionName is preferred)\n    if (edgeData?.label && !transition.transitionName) {\n      transition.transitionName = edgeData.label\n    }\n\n    return transition\n  })\n\n  return {\n    steps,\n    transitions,\n    activities: [], // Global activities can be added later\n  }\n}\n\n/**\n * Convert workflow definition JSON to ReactFlow graph (nodes + edges)\n */\nexport function definitionToGraph(\n  definition: WorkflowDefinition['definition'],\n  options: DefinitionToGraphOptions = {}\n): { nodes: Node[]; edges: Edge[] } {\n  const { autoLayout = true, layoutSpacing = { vertical: 200, horizontal: 300 } } = options\n\n  // Build step map for quick lookup\n  const stepMap = new Map(definition.steps.map(step => [step.stepId, step]))\n\n  // Calculate smart layout positions if autoLayout is enabled\n  const positions = autoLayout\n    ? calculateSmartLayout(definition.steps, definition.transitions, layoutSpacing)\n    : null\n\n  // Convert steps to nodes\n  const nodes: Node[] = definition.steps.map((step, index) => {\n    // Determine position\n    let position = positions?.get(step.stepId) || { x: 250, y: 50 + index * layoutSpacing.vertical }\n\n    // Use stored position if available and not auto-layouting\n    if (!autoLayout && (step as any)._editorPosition) {\n      position = (step as any)._editorPosition\n    }\n\n    // Map step type to node type\n    const nodeType = mapStepTypeToNodeType(step.stepType)\n\n    // Build node data\n    const nodeData: any = {\n      label: step.stepName,\n      description: (step as any).description,\n      stepNumber: index > 0 ? index : undefined,\n    }\n\n    // Add timeout if present\n    if ((step as any).timeout) {\n      nodeData.timeout = (step as any).timeout\n    }\n\n    // Add retryPolicy if present\n    if ((step as any).retryPolicy) {\n      nodeData.retryPolicy = (step as any).retryPolicy\n    }\n\n    // Add generic config if present\n    if ((step as any).config) {\n      nodeData.config = (step as any).config\n    }\n\n    // Add user task data\n    if (step.stepType === 'USER_TASK' && step.userTaskConfig) {\n      nodeData.assignedTo = step.userTaskConfig.assignedTo\n      nodeData.assignedToRoles = step.userTaskConfig.assignedToRoles || []\n      nodeData.formKey = step.userTaskConfig.formKey\n      nodeData.allowedActions = step.userTaskConfig.allowedActions\n\n      // Store full userTaskConfig for advanced fields\n      nodeData.userTaskConfig = step.userTaskConfig\n\n      // Add form schema if present\n      if (step.userTaskConfig.formSchema) {\n        nodeData.formSchema = step.userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if (step.userTaskConfig.assignmentRule) {\n        nodeData.assignmentRule = step.userTaskConfig.assignmentRule\n      }\n\n      if (step.userTaskConfig.slaDuration) {\n        nodeData.slaDuration = step.userTaskConfig.slaDuration\n      }\n\n      if (step.userTaskConfig.escalationRules) {\n        nodeData.escalationRules = step.userTaskConfig.escalationRules\n      }\n    }\n\n    // Add wait for signal data\n    if (step.stepType === 'WAIT_FOR_SIGNAL' && (step as any).signalConfig) {\n      nodeData.signalConfig = (step as any).signalConfig\n    }\n\n    // Add step activities data (for AUTOMATED steps)\n    if (step.stepType === 'AUTOMATED' && (step as any).activities) {\n      nodeData.activities = (step as any).activities\n    }\n\n    // Add pre-conditions data (for START steps)\n    if (step.stepType === 'START' && (step as any).preConditions) {\n      nodeData.preConditions = (step as any).preConditions\n    }\n\n    // Set badge based on type\n    nodeData.badge = getBadgeForNodeType(nodeType)\n\n    // Default status is pending\n    nodeData.status = 'pending'\n\n    return {\n      id: step.stepId,\n      type: nodeType,\n      position,\n      data: nodeData,\n    }\n  })\n\n  // Convert transitions to edges\n  const edges: Edge[] = definition.transitions.map((transition) => {\n    return {\n      id: transition.transitionId,\n      source: transition.fromStepId,\n      target: transition.toStepId,\n      type: 'workflowTransition',\n      data: {\n        trigger: transition.trigger,\n        transitionName: (transition as any).transitionName,\n        priority: (transition as any).priority !== undefined ? (transition as any).priority : 0,\n        continueOnActivityFailure: (transition as any).continueOnActivityFailure !== undefined\n          ? (transition as any).continueOnActivityFailure\n          : false,\n        preConditions: transition.preConditions || [],\n        postConditions: transition.postConditions || [],\n        activities: transition.activities || [],\n        label: (transition as any).transitionName || (transition as any).label, // Backward compat\n        state: (transition as any).state || 'pending', // Default edge state\n      },\n    }\n  })\n\n  return { nodes, edges }\n}\n\n/**\n * Calculate smart layout positions for workflow nodes\n * Uses a layered/hierarchical layout algorithm that:\n * 1. Assigns levels (ranks) to nodes based on graph topology\n * 2. Spreads sibling nodes horizontally at the same level\n * 3. Centers merge points below their incoming nodes\n */\nfunction calculateSmartLayout(\n  steps: any[],\n  transitions: any[],\n  spacing: { vertical: number; horizontal: number }\n): Map<string, { x: number; y: number }> {\n  const positions = new Map<string, { x: number; y: number }>()\n\n  if (steps.length === 0) return positions\n\n  // Build adjacency lists\n  const outgoing = new Map<string, string[]>() // node -> children\n  const incoming = new Map<string, string[]>() // node -> parents\n\n  for (const step of steps) {\n    outgoing.set(step.stepId, [])\n    incoming.set(step.stepId, [])\n  }\n\n  for (const t of transitions) {\n    const children = outgoing.get(t.fromStepId) || []\n    children.push(t.toStepId)\n    outgoing.set(t.fromStepId, children)\n\n    const parents = incoming.get(t.toStepId) || []\n    parents.push(t.fromStepId)\n    incoming.set(t.toStepId, parents)\n  }\n\n  // Find start node(s) - nodes with no incoming edges\n  const startNodes = steps.filter(s => (incoming.get(s.stepId) || []).length === 0)\n  if (startNodes.length === 0) {\n    // Fallback: use first step as start\n    startNodes.push(steps[0])\n  }\n\n  // Assign levels using BFS (longest path from start)\n  const levels = new Map<string, number>()\n  const queue: Array<{ id: string; level: number }> = []\n\n  for (const start of startNodes) {\n    queue.push({ id: start.stepId, level: 0 })\n  }\n\n  while (queue.length > 0) {\n    const { id, level } = queue.shift()!\n    const currentLevel = levels.get(id)\n\n    // Take the maximum level (longest path)\n    if (currentLevel === undefined || level > currentLevel) {\n      levels.set(id, level)\n    }\n\n    const children = outgoing.get(id) || []\n    for (const child of children) {\n      queue.push({ id: child, level: level + 1 })\n    }\n  }\n\n  // Group nodes by level\n  const nodesByLevel = new Map<number, string[]>()\n  for (const [nodeId, level] of levels) {\n    const nodesAtLevel = nodesByLevel.get(level) || []\n    nodesAtLevel.push(nodeId)\n    nodesByLevel.set(level, nodesAtLevel)\n  }\n\n  // Calculate positions\n  const centerX = 400 // Center line for the graph\n  const startY = 50\n\n  for (const [level, nodeIds] of nodesByLevel) {\n    const count = nodeIds.length\n    const y = startY + level * spacing.vertical\n\n    if (count === 1) {\n      // Single node at this level - center it\n      positions.set(nodeIds[0], { x: centerX, y })\n    } else {\n      // Multiple nodes at this level - spread them horizontally\n      const totalWidth = (count - 1) * spacing.horizontal\n      const startX = centerX - totalWidth / 2\n\n      // Sort nodes by their parent's position for consistent ordering\n      nodeIds.sort((a, b) => {\n        const parentsA = incoming.get(a) || []\n        const parentsB = incoming.get(b) || []\n        const parentPosA = parentsA.length > 0 ? (positions.get(parentsA[0])?.x || 0) : 0\n        const parentPosB = parentsB.length > 0 ? (positions.get(parentsB[0])?.x || 0) : 0\n        return parentPosA - parentPosB\n      })\n\n      nodeIds.forEach((nodeId, idx) => {\n        positions.set(nodeId, { x: startX + idx * spacing.horizontal, y })\n      })\n    }\n  }\n\n  return positions\n}\n\n/**\n * Map node type to step type (for graph \u2192 definition)\n */\nfunction mapNodeTypeToStepType(nodeType: string): string {\n  const mapping: Record<string, string> = {\n    start: 'START',\n    end: 'END',\n    userTask: 'USER_TASK',\n    automated: 'AUTOMATED',\n    decision: 'DECISION',\n    waitForSignal: 'WAIT_FOR_SIGNAL',\n    waitForTimer: 'WAIT_FOR_TIMER',\n  }\n  return mapping[nodeType] || 'AUTOMATED'\n}\n\n/**\n * Map step type to node type (for definition \u2192 graph)\n */\nfunction mapStepTypeToNodeType(stepType: string): string {\n  const mapping: Record<string, string> = {\n    START: 'start',\n    END: 'end',\n    USER_TASK: 'userTask',\n    AUTOMATED: 'automated',\n    DECISION: 'decision',\n    WAIT_FOR_SIGNAL: 'waitForSignal',\n    WAIT_FOR_TIMER: 'waitForTimer',\n  }\n  return mapping[stepType] || 'automated'\n}\n\n/**\n * Get badge text for node type\n */\nfunction getBadgeForNodeType(nodeType: string): string {\n  const badges: Record<string, string> = {\n    start: 'Start',\n    end: 'End',\n    userTask: 'User Task',\n    automated: 'Automated',\n    decision: 'Decision',\n    waitForSignal: 'Wait for Signal',\n    waitForTimer: 'Wait for Timer',\n  }\n  return badges[nodeType] || 'Task'\n}\n\n/**\n * Validate workflow graph\n */\nexport interface ValidationError {\n  type: 'error' | 'warning'\n  message: string\n  nodeId?: string\n  edgeId?: string\n}\n\nexport function validateWorkflowGraph(nodes: Node[], edges: Edge[]): ValidationError[] {\n  const errors: ValidationError[] = []\n\n  // Check for at least one start node\n  const startNodes = nodes.filter((n) => n.type === 'start')\n  if (startNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one START node',\n    })\n  }\n  if (startNodes.length > 1) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow has multiple START nodes',\n    })\n  }\n\n  // Check for at least one end node\n  const endNodes = nodes.filter((n) => n.type === 'end')\n  if (endNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one END node',\n    })\n  }\n\n  // Check for orphan nodes (no incoming or outgoing edges)\n  for (const node of nodes) {\n    if (node.type === 'start') continue // Start nodes don't need incoming edges\n    if (node.type === 'end') continue // End nodes don't need outgoing edges\n\n    const hasIncoming = edges.some((e) => e.target === node.id)\n    const hasOutgoing = edges.some((e) => e.source === node.id)\n\n    if (!hasIncoming && !hasOutgoing) {\n      errors.push({\n        type: 'error',\n        message: `Node \"${node.data.label}\" is disconnected`,\n        nodeId: node.id,\n      })\n    } else if (!hasIncoming) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no incoming connections`,\n        nodeId: node.id,\n      })\n    } else if (!hasOutgoing) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no outgoing connections`,\n        nodeId: node.id,\n      })\n    }\n  }\n\n  // Check for cycles (simple detection)\n  const hasCycle = detectCycle(nodes, edges)\n  if (hasCycle) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow contains cycles (loops)',\n    })\n  }\n\n  // Check for duplicate step IDs\n  const stepIds = new Set<string>()\n  for (const node of nodes) {\n    if (stepIds.has(node.id)) {\n      errors.push({\n        type: 'error',\n        message: `Duplicate step ID: ${node.id}`,\n        nodeId: node.id,\n      })\n    }\n    stepIds.add(node.id)\n  }\n\n  return errors\n}\n\n/**\n * Simple cycle detection using DFS\n */\nfunction detectCycle(nodes: Node[], edges: Edge[]): boolean {\n  const adjList = new Map<string, string[]>()\n\n  // Build adjacency list\n  for (const node of nodes) {\n    adjList.set(node.id, [])\n  }\n  for (const edge of edges) {\n    const neighbors = adjList.get(edge.source) || []\n    neighbors.push(edge.target)\n    adjList.set(edge.source, neighbors)\n  }\n\n  const visited = new Set<string>()\n  const recStack = new Set<string>()\n\n  function dfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    recStack.add(nodeId)\n\n    const neighbors = adjList.get(nodeId) || []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (dfs(neighbor)) return true\n      } else if (recStack.has(neighbor)) {\n        return true // Cycle detected\n      }\n    }\n\n    recStack.delete(nodeId)\n    return false\n  }\n\n  for (const node of nodes) {\n    if (!visited.has(node.id)) {\n      if (dfs(node.id)) return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Sanitize ID to match schema regex: /^[a-z0-9_-]+$/\n * Converts to lowercase, replaces invalid characters with underscores\n */\nexport function sanitizeId(input: string): string {\n  return input\n    .toLowerCase()\n    .replace(/[^a-z0-9_-]/g, '_')\n    .replace(/_{2,}/g, '_') // Replace multiple underscores with single\n    .replace(/(?:^_|_$)/g, '') // Remove leading/trailing underscores\n}\n\n/**\n * Validate ID matches schema regex: /^[a-z0-9_-]+$/\n */\nexport function validateId(id: string): boolean {\n  return /^[a-z0-9_-]+$/.test(id)\n}\n\n/**\n * Generate unique step ID\n */\nexport function generateStepId(prefix: string = 'step'): string {\n  const id = `${prefix}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`\n  return sanitizeId(id)\n}\n\n/**\n * Generate unique transition ID\n */\nexport function generateTransitionId(fromStepId: string, toStepId: string): string {\n  const id = `e_${fromStepId}_${toStepId}`\n  return sanitizeId(id)\n}\n\n/**\n * Append a new edge to the list, skipping duplicate connections.\n *\n * A plain-data replacement for React Flow's `addEdge` so the visual editor\n * page does not pull the `@xyflow/react` runtime out of its lazy boundary\n * (#3169). Mirrors `addEdge`'s dedup rule: an edge is dropped when one with\n * the same source/target endpoints (and handles) already exists.\n */\nexport function appendWorkflowEdge(edges: Edge[], edge: Edge): Edge[] {\n  const isDuplicate = edges.some(\n    (existing) =>\n      existing.source === edge.source &&\n      existing.target === edge.target &&\n      // Match addEdge: empty-string and nullish handles are equivalent.\n      (existing.sourceHandle || null) === (edge.sourceHandle || null) &&\n      (existing.targetHandle || null) === (edge.targetHandle || null),\n  )\n  return isDuplicate ? edges : [...edges, edge]\n}\n"],
-  "mappings": "AAqBO,SAAS,kBACd,OACA,OACA,UAAoC,CAAC,GACH;AAElC,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS;AAChC,UAAM,OAAY;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK,KAAK,SAAS,KAAK;AAAA,MAClC,UAAU,sBAAsB,KAAK,QAAQ,WAAW;AAAA,IAC1D;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,SAAS;AACrB,WAAK,UAAU,KAAK,KAAK;AAAA,IAC3B;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,QAAQ;AACpB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAGA,QAAI,KAAK,SAAS,cAAc,KAAK,MAAM;AACzC,WAAK,iBAAiB;AAAA,QACpB,YAAY,KAAK,KAAK;AAAA,QACtB,iBAAiB,KAAK,KAAK,mBAAmB,CAAC;AAAA,QAC/C,SAAS,KAAK,KAAK;AAAA,QACnB,gBAAgB,KAAK,KAAK,kBAAkB,CAAC,YAAY,QAAQ;AAAA,MACnE;AAGA,UAAK,KAAK,KAAa,cAAe,KAAK,KAAa,gBAAgB,YAAY;AAClF,aAAK,eAAe,aAAc,KAAK,KAAa,cAAe,KAAK,KAAa,eAAe;AAAA,MACtG;AAGA,UAAK,KAAK,KAAa,kBAAmB,KAAK,KAAa,gBAAgB,gBAAgB;AAC1F,aAAK,eAAe,iBAAkB,KAAK,KAAa,kBAAmB,KAAK,KAAa,eAAe;AAAA,MAC9G;AAEA,UAAK,KAAK,KAAa,eAAgB,KAAK,KAAa,gBAAgB,aAAa;AACpF,aAAK,eAAe,cAAe,KAAK,KAAa,eAAgB,KAAK,KAAa,eAAe;AAAA,MACxG;AAEA,UAAK,KAAK,KAAa,mBAAoB,KAAK,KAAa,gBAAgB,iBAAiB;AAC5F,aAAK,eAAe,kBAAmB,KAAK,KAAa,mBAAoB,KAAK,KAAa,eAAe;AAAA,MAChH;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,mBAAmB,KAAK,KAAK,cAAc;AAC3D,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAGA,QAAI,KAAK,SAAS,eAAe,KAAK,KAAK,YAAY;AACrD,WAAK,aAAa,KAAK,KAAK;AAAA,IAC9B;AAGA,QAAI,KAAK,SAAS,WAAY,KAAK,KAAa,iBAAkB,KAAK,KAAa,cAAc,SAAS,GAAG;AAC5G,WAAK,gBAAiB,KAAK,KAAa;AAAA,IAC1C;AAGA,QAAI,QAAQ,oBAAoB,KAAK,UAAU;AAC7C,WAAK,kBAAkB;AAAA,QACrB,GAAG,KAAK,SAAS;AAAA,QACjB,GAAG,KAAK,SAAS;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,QAAM,cAAc,MAAM,IAAI,CAAC,SAAS;AACtC,UAAM,WAAW,KAAK;AACtB,UAAM,aAAkB;AAAA,MACtB,cAAc,KAAK;AAAA,MACnB,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,MACf,SAAS,UAAU,WAAW;AAAA,IAChC;AAGA,QAAI,UAAU,gBAAgB;AAC5B,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,aAAa,QAAW;AACpC,iBAAW,WAAW,SAAS;AAAA,IACjC;AAGA,QAAI,UAAU,8BAA8B,QAAW;AACrD,iBAAW,4BAA4B,SAAS;AAAA,IAClD;AAGA,QAAI,UAAU,iBAAiB,SAAS,cAAc,SAAS,GAAG;AAChE,iBAAW,gBAAgB,SAAS;AAAA,IACtC;AAEA,QAAI,UAAU,kBAAkB,SAAS,eAAe,SAAS,GAAG;AAClE,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,cAAc,SAAS,WAAW,SAAS,GAAG;AAC1D,iBAAW,aAAa,SAAS,WAAW,IAAI,CAAC,cAAmB;AAAA,QAClE,YAAY,SAAS;AAAA,QACrB,cAAc,SAAS;AAAA,QACvB,cAAc,SAAS;AAAA,QACvB,QAAQ,SAAS,UAAU,CAAC;AAAA;AAAA,QAE5B,GAAI,SAAS,UAAU,UAAa,EAAE,OAAO,SAAS,MAAM;AAAA,QAC5D,GAAI,SAAS,WAAW,EAAE,SAAS,SAAS,QAAQ;AAAA,QACpD,GAAI,SAAS,eAAe,EAAE,aAAa,SAAS,YAAY;AAAA,QAChE,GAAI,SAAS,eAAe,UAAa,EAAE,YAAY,SAAS,WAAW;AAAA,MAC7E,EAAE;AAAA,IACJ,OAAO;AAGL,YAAM,aAAa,MAAM,KAAK,OAAK,EAAE,OAAO,KAAK,MAAM;AACvD,UAAI,cAAc,WAAW,SAAS,eAAe,WAAW,MAAM;AACpE,YAAI,WAAW,KAAK,gBAAgB,WAAW,KAAK,YAAY;AAC9D,gBAAM,WAAgB;AAAA,YACpB,YAAY,WAAW,KAAK,cAAc,YAAY,WAAW,EAAE;AAAA,YACnE,cAAc,WAAW,KAAK,gBAAgB,WAAW,KAAK,SAAS;AAAA,YACvE,cAAc,WAAW,KAAK,gBAAgB;AAAA,YAC9C,QAAQ,WAAW,KAAK,kBAAkB,CAAC;AAAA,UAC7C;AAEA,cAAK,WAAW,KAAa,kBAAkB,QAAW;AACxD,qBAAS,QAAS,WAAW,KAAa;AAAA,UAC5C;AACA,cAAK,WAAW,KAAa,iBAAiB;AAC5C,qBAAS,UAAW,WAAW,KAAa;AAAA,UAC9C;AACA,cAAK,WAAW,KAAa,qBAAqB;AAChD,qBAAS,cAAe,WAAW,KAAa;AAAA,UAClD;AACA,cAAK,WAAW,KAAa,uBAAuB,QAAW;AAC7D,qBAAS,aAAc,WAAW,KAAa;AAAA,UACjD;AACA,qBAAW,aAAa,CAAC,QAAQ;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,UAAU,SAAS,CAAC,WAAW,gBAAgB;AACjD,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,CAAC;AAAA;AAAA,EACf;AACF;AAKO,SAAS,kBACd,YACA,UAAoC,CAAC,GACH;AAClC,QAAM,EAAE,aAAa,MAAM,gBAAgB,EAAE,UAAU,KAAK,YAAY,IAAI,EAAE,IAAI;AAGlF,QAAM,UAAU,IAAI,IAAI,WAAW,MAAM,IAAI,UAAQ,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAGzE,QAAM,YAAY,aACd,qBAAqB,WAAW,OAAO,WAAW,aAAa,aAAa,IAC5E;AAGJ,QAAM,QAAgB,WAAW,MAAM,IAAI,CAAC,MAAM,UAAU;AAE1D,QAAI,WAAW,WAAW,IAAI,KAAK,MAAM,KAAK,EAAE,GAAG,KAAK,GAAG,KAAK,QAAQ,cAAc,SAAS;AAG/F,QAAI,CAAC,cAAe,KAAa,iBAAiB;AAChD,iBAAY,KAAa;AAAA,IAC3B;AAGA,UAAM,WAAW,sBAAsB,KAAK,QAAQ;AAGpD,UAAM,WAAgB;AAAA,MACpB,OAAO,KAAK;AAAA,MACZ,aAAc,KAAa;AAAA,MAC3B,YAAY,QAAQ,IAAI,QAAQ;AAAA,IAClC;AAGA,QAAK,KAAa,SAAS;AACzB,eAAS,UAAW,KAAa;AAAA,IACnC;AAGA,QAAK,KAAa,aAAa;AAC7B,eAAS,cAAe,KAAa;AAAA,IACvC;AAGA,QAAK,KAAa,QAAQ;AACxB,eAAS,SAAU,KAAa;AAAA,IAClC;AAGA,QAAI,KAAK,aAAa,eAAe,KAAK,gBAAgB;AACxD,eAAS,aAAa,KAAK,eAAe;AAC1C,eAAS,kBAAkB,KAAK,eAAe,mBAAmB,CAAC;AACnE,eAAS,UAAU,KAAK,eAAe;AACvC,eAAS,iBAAiB,KAAK,eAAe;AAG9C,eAAS,iBAAiB,KAAK;AAG/B,UAAI,KAAK,eAAe,YAAY;AAClC,iBAAS,aAAa,KAAK,eAAe;AAAA,MAC5C;AAGA,UAAI,KAAK,eAAe,gBAAgB;AACtC,iBAAS,iBAAiB,KAAK,eAAe;AAAA,MAChD;AAEA,UAAI,KAAK,eAAe,aAAa;AACnC,iBAAS,cAAc,KAAK,eAAe;AAAA,MAC7C;AAEA,UAAI,KAAK,eAAe,iBAAiB;AACvC,iBAAS,kBAAkB,KAAK,eAAe;AAAA,MACjD;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,qBAAsB,KAAa,cAAc;AACrE,eAAS,eAAgB,KAAa;AAAA,IACxC;AAGA,QAAI,KAAK,aAAa,eAAgB,KAAa,YAAY;AAC7D,eAAS,aAAc,KAAa;AAAA,IACtC;AAGA,QAAI,KAAK,aAAa,WAAY,KAAa,eAAe;AAC5D,eAAS,gBAAiB,KAAa;AAAA,IACzC;AAGA,aAAS,QAAQ,oBAAoB,QAAQ;AAG7C,aAAS,SAAS;AAElB,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF,CAAC;AAGD,QAAM,QAAgB,WAAW,YAAY,IAAI,CAAC,eAAe;AAC/D,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,QAAQ,WAAW;AAAA,MACnB,MAAM;AAAA,MACN,MAAM;AAAA,QACJ,SAAS,WAAW;AAAA,QACpB,gBAAiB,WAAmB;AAAA,QACpC,UAAW,WAAmB,aAAa,SAAa,WAAmB,WAAW;AAAA,QACtF,2BAA4B,WAAmB,8BAA8B,SACxE,WAAmB,4BACpB;AAAA,QACJ,eAAe,WAAW,iBAAiB,CAAC;AAAA,QAC5C,gBAAgB,WAAW,kBAAkB,CAAC;AAAA,QAC9C,YAAY,WAAW,cAAc,CAAC;AAAA,QACtC,OAAQ,WAAmB,kBAAmB,WAAmB;AAAA;AAAA,QACjE,OAAQ,WAAmB,SAAS;AAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO,EAAE,OAAO,MAAM;AACxB;AASA,SAAS,qBACP,OACA,aACA,SACuC;AACvC,QAAM,YAAY,oBAAI,IAAsC;AAE5D,MAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,QAAM,WAAW,oBAAI,IAAsB;AAC3C,QAAM,WAAW,oBAAI,IAAsB;AAE3C,aAAW,QAAQ,OAAO;AACxB,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAC5B,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,EAC9B;AAEA,aAAW,KAAK,aAAa;AAC3B,UAAM,WAAW,SAAS,IAAI,EAAE,UAAU,KAAK,CAAC;AAChD,aAAS,KAAK,EAAE,QAAQ;AACxB,aAAS,IAAI,EAAE,YAAY,QAAQ;AAEnC,UAAM,UAAU,SAAS,IAAI,EAAE,QAAQ,KAAK,CAAC;AAC7C,YAAQ,KAAK,EAAE,UAAU;AACzB,aAAS,IAAI,EAAE,UAAU,OAAO;AAAA,EAClC;AAGA,QAAM,aAAa,MAAM,OAAO,QAAM,SAAS,IAAI,EAAE,MAAM,KAAK,CAAC,GAAG,WAAW,CAAC;AAChF,MAAI,WAAW,WAAW,GAAG;AAE3B,eAAW,KAAK,MAAM,CAAC,CAAC;AAAA,EAC1B;AAGA,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,QAA8C,CAAC;AAErD,aAAW,SAAS,YAAY;AAC9B,UAAM,KAAK,EAAE,IAAI,MAAM,QAAQ,OAAO,EAAE,CAAC;AAAA,EAC3C;AAEA,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,EAAE,IAAI,MAAM,IAAI,MAAM,MAAM;AAClC,UAAM,eAAe,OAAO,IAAI,EAAE;AAGlC,QAAI,iBAAiB,UAAa,QAAQ,cAAc;AACtD,aAAO,IAAI,IAAI,KAAK;AAAA,IACtB;AAEA,UAAM,WAAW,SAAS,IAAI,EAAE,KAAK,CAAC;AACtC,eAAW,SAAS,UAAU;AAC5B,YAAM,KAAK,EAAE,IAAI,OAAO,OAAO,QAAQ,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,CAAC,QAAQ,KAAK,KAAK,QAAQ;AACpC,UAAM,eAAe,aAAa,IAAI,KAAK,KAAK,CAAC;AACjD,iBAAa,KAAK,MAAM;AACxB,iBAAa,IAAI,OAAO,YAAY;AAAA,EACtC;AAGA,QAAM,UAAU;AAChB,QAAM,SAAS;AAEf,aAAW,CAAC,OAAO,OAAO,KAAK,cAAc;AAC3C,UAAM,QAAQ,QAAQ;AACtB,UAAM,IAAI,SAAS,QAAQ,QAAQ;AAEnC,QAAI,UAAU,GAAG;AAEf,gBAAU,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;AAAA,IAC7C,OAAO;AAEL,YAAM,cAAc,QAAQ,KAAK,QAAQ;AACzC,YAAM,SAAS,UAAU,aAAa;AAGtC,cAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,eAAO,aAAa;AAAA,MACtB,CAAC;AAED,cAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAC/B,kBAAU,IAAI,QAAQ,EAAE,GAAG,SAAS,MAAM,QAAQ,YAAY,EAAE,CAAC;AAAA,MACnE,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,WAAW;AAAA,IACX,WAAW;AAAA,IACX,UAAU;AAAA,IACV,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,EAClB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,oBAAoB,UAA0B;AACrD,QAAM,SAAiC;AAAA,IACrC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,OAAO,QAAQ,KAAK;AAC7B;AAYO,SAAS,sBAAsB,OAAe,OAAkC;AACrF,QAAM,SAA4B,CAAC;AAGnC,QAAM,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK;AACrD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,QAAS;AAC3B,QAAI,KAAK,SAAS,MAAO;AAEzB,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAC1D,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAE1D,QAAI,CAAC,eAAe,CAAC,aAAa;AAChC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAW,YAAY,OAAO,KAAK;AACzC,MAAI,UAAU;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,OAAO;AACxB,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,sBAAsB,KAAK,EAAE;AAAA,QACtC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AACA,YAAQ,IAAI,KAAK,EAAE;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAAS,YAAY,OAAe,OAAwB;AAC1D,QAAM,UAAU,oBAAI,IAAsB;AAG1C,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACzB;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,QAAQ,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,cAAU,KAAK,KAAK,MAAM;AAC1B,YAAQ,IAAI,KAAK,QAAQ,SAAS;AAAA,EACpC;AAEA,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,IAAI,QAAyB;AACpC,YAAQ,IAAI,MAAM;AAClB,aAAS,IAAI,MAAM;AAEnB,UAAM,YAAY,QAAQ,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAW,YAAY,WAAW;AAChC,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,YAAI,IAAI,QAAQ,EAAG,QAAO;AAAA,MAC5B,WAAW,SAAS,IAAI,QAAQ,GAAG;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,OAAO,MAAM;AACtB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,GAAG;AACzB,UAAI,IAAI,KAAK,EAAE,EAAG,QAAO;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,WAAW,OAAuB;AAChD,SAAO,MACJ,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,UAAU,GAAG,EACrB,QAAQ,cAAc,EAAE;AAC7B;AAKO,SAAS,WAAW,IAAqB;AAC9C,SAAO,gBAAgB,KAAK,EAAE;AAChC;AAKO,SAAS,eAAe,SAAiB,QAAgB;AAC9D,QAAM,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAC7E,SAAO,WAAW,EAAE;AACtB;AAKO,SAAS,qBAAqB,YAAoB,UAA0B;AACjF,QAAM,KAAK,KAAK,UAAU,IAAI,QAAQ;AACtC,SAAO,WAAW,EAAE;AACtB;AAUO,SAAS,mBAAmB,OAAe,MAAoB;AACpE,QAAM,cAAc,MAAM;AAAA,IACxB,CAAC,aACC,SAAS,WAAW,KAAK,UACzB,SAAS,WAAW,KAAK;AAAA,KAExB,SAAS,gBAAgB,WAAW,KAAK,gBAAgB,UACzD,SAAS,gBAAgB,WAAW,KAAK,gBAAgB;AAAA,EAC9D;AACA,SAAO,cAAc,QAAQ,CAAC,GAAG,OAAO,IAAI;AAC9C;",
+  "sourcesContent": ["import type { Node, Edge } from '@xyflow/react'\nimport type { WorkflowDefinition } from '../data/entities'\n\n/**\n * Graph Utilities for Visual Workflow Editor\n *\n * Converts between ReactFlow graph representation and workflow definition JSON\n */\n\nexport interface GraphToDefinitionOptions {\n  includePositions?: boolean\n}\n\nexport interface DefinitionToGraphOptions {\n  autoLayout?: boolean\n  layoutSpacing?: { vertical: number; horizontal: number }\n}\n\n/**\n * Convert ReactFlow graph (nodes + edges) to workflow definition JSON\n */\nexport function graphToDefinition(\n  nodes: Node[],\n  edges: Edge[],\n  options: GraphToDefinitionOptions = {}\n): WorkflowDefinition['definition'] {\n  // Extract steps from nodes\n  const steps = nodes.map((node) => {\n    const step: any = {\n      stepId: node.id,\n      stepName: node.data.label || node.id,\n      stepType: mapNodeTypeToStepType(node.type || 'automated'),\n    }\n\n    // Add step-specific configuration\n    if (node.data.description) {\n      step.description = node.data.description\n    }\n\n    // Add timeout if present\n    if (node.data.timeout) {\n      step.timeout = node.data.timeout\n    }\n\n    // Add retryPolicy if present\n    if (node.data.retryPolicy) {\n      step.retryPolicy = node.data.retryPolicy\n    }\n\n    // Add generic config if present\n    if (node.data.config) {\n      step.config = node.data.config\n    }\n\n    // User task configuration\n    if (node.type === 'userTask' && node.data) {\n      step.userTaskConfig = {\n        assignedTo: node.data.assignedTo,\n        assignedToRoles: node.data.assignedToRoles || [],\n        formKey: node.data.formKey,\n        allowedActions: node.data.allowedActions || ['complete', 'cancel'],\n      }\n\n      // Add form schema if present\n      if ((node.data as any).formSchema || (node.data as any).userTaskConfig?.formSchema) {\n        step.userTaskConfig.formSchema = (node.data as any).formSchema || (node.data as any).userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if ((node.data as any).assignmentRule || (node.data as any).userTaskConfig?.assignmentRule) {\n        step.userTaskConfig.assignmentRule = (node.data as any).assignmentRule || (node.data as any).userTaskConfig.assignmentRule\n      }\n\n      if ((node.data as any).slaDuration || (node.data as any).userTaskConfig?.slaDuration) {\n        step.userTaskConfig.slaDuration = (node.data as any).slaDuration || (node.data as any).userTaskConfig.slaDuration\n      }\n\n      if ((node.data as any).escalationRules || (node.data as any).userTaskConfig?.escalationRules) {\n        step.userTaskConfig.escalationRules = (node.data as any).escalationRules || (node.data as any).userTaskConfig.escalationRules\n      }\n    }\n\n    // Wait for signal configuration\n    if (node.type === 'waitForSignal' && node.data.signalConfig) {\n      step.signalConfig = node.data.signalConfig\n    }\n\n    // Step activities (for AUTOMATED steps)\n    if (node.type === 'automated' && node.data.activities) {\n      step.activities = node.data.activities\n    }\n\n    // Pre-conditions (for START steps)\n    if (node.type === 'start' && (node.data as any).preConditions && (node.data as any).preConditions.length > 0) {\n      step.preConditions = (node.data as any).preConditions\n    }\n\n    // Store position for visual editor\n    if (options.includePositions && node.position) {\n      step._editorPosition = {\n        x: node.position.x,\n        y: node.position.y,\n      }\n    }\n\n    return step\n  })\n\n  // Extract transitions from edges\n  const transitions = edges.map((edge) => {\n    const edgeData = edge.data as any\n    const transition: any = {\n      transitionId: edge.id,\n      fromStepId: edge.source,\n      toStepId: edge.target,\n      trigger: edgeData?.trigger || 'auto',\n    }\n\n    // Add transition name if present\n    if (edgeData?.transitionName) {\n      transition.transitionName = edgeData.transitionName\n    }\n\n    // Add priority if present (default 0)\n    if (edgeData?.priority !== undefined) {\n      transition.priority = edgeData.priority\n    }\n\n    // Add continueOnActivityFailure if present (default false)\n    if (edgeData?.continueOnActivityFailure !== undefined) {\n      transition.continueOnActivityFailure = edgeData.continueOnActivityFailure\n    }\n\n    // Add conditions if present\n    if (edgeData?.preConditions && edgeData.preConditions.length > 0) {\n      transition.preConditions = edgeData.preConditions\n    }\n\n    if (edgeData?.postConditions && edgeData.postConditions.length > 0) {\n      transition.postConditions = edgeData.postConditions\n    }\n\n    // Add activities if present in edge data\n    if (edgeData?.activities && edgeData.activities.length > 0) {\n      transition.activities = edgeData.activities.map((activity: any) => ({\n        activityId: activity.activityId,\n        activityName: activity.activityName,\n        activityType: activity.activityType,\n        config: activity.config || {},\n        // Include all optional fields\n        ...(activity.async !== undefined && { async: activity.async }),\n        ...(activity.timeout && { timeout: activity.timeout }),\n        ...(activity.retryPolicy && { retryPolicy: activity.retryPolicy }),\n        ...(activity.compensate !== undefined && { compensate: activity.compensate }),\n      }))\n    } else {\n      // Check if source node is automated and has activity data\n      // If so, place the activity in this transition\n      const sourceNode = nodes.find(n => n.id === edge.source)\n      if (sourceNode && sourceNode.type === 'automated' && sourceNode.data) {\n        if (sourceNode.data.activityType || sourceNode.data.activityId) {\n          const activity: any = {\n            activityId: sourceNode.data.activityId || `activity_${sourceNode.id}`,\n            activityName: sourceNode.data.activityName || sourceNode.data.label || 'Automated Activity',\n            activityType: sourceNode.data.activityType || 'CALL_API',\n            config: sourceNode.data.activityConfig || {},\n          }\n          // Include optional activity fields from node data\n          if ((sourceNode.data as any).activityAsync !== undefined) {\n            activity.async = (sourceNode.data as any).activityAsync\n          }\n          if ((sourceNode.data as any).activityTimeout) {\n            activity.timeout = (sourceNode.data as any).activityTimeout\n          }\n          if ((sourceNode.data as any).activityRetryPolicy) {\n            activity.retryPolicy = (sourceNode.data as any).activityRetryPolicy\n          }\n          if ((sourceNode.data as any).activityCompensate !== undefined) {\n            activity.compensate = (sourceNode.data as any).activityCompensate\n          }\n          transition.activities = [activity]\n        }\n      }\n    }\n\n    // Add label if present (legacy field, transitionName is preferred)\n    if (edgeData?.label && !transition.transitionName) {\n      transition.transitionName = edgeData.label\n    }\n\n    return transition\n  })\n\n  return {\n    steps,\n    transitions,\n    activities: [], // Global activities can be added later\n  }\n}\n\n/**\n * Convert workflow definition JSON to ReactFlow graph (nodes + edges)\n */\nexport function definitionToGraph(\n  definition: WorkflowDefinition['definition'],\n  options: DefinitionToGraphOptions = {}\n): { nodes: Node[]; edges: Edge[] } {\n  const { autoLayout = true, layoutSpacing = { vertical: 200, horizontal: 300 } } = options\n\n  // Build step map for quick lookup\n  const stepMap = new Map(definition.steps.map(step => [step.stepId, step]))\n\n  // Calculate smart layout positions if autoLayout is enabled\n  const positions = autoLayout\n    ? calculateSmartLayout(definition.steps, definition.transitions, layoutSpacing)\n    : null\n\n  // Convert steps to nodes\n  const nodes: Node[] = definition.steps.map((step, index) => {\n    // Determine position\n    let position = positions?.get(step.stepId) || { x: 250, y: 50 + index * layoutSpacing.vertical }\n\n    // Use stored position if available and not auto-layouting\n    if (!autoLayout && (step as any)._editorPosition) {\n      position = (step as any)._editorPosition\n    }\n\n    // Map step type to node type\n    const nodeType = mapStepTypeToNodeType(step.stepType)\n\n    // Build node data\n    const nodeData: any = {\n      label: step.stepName,\n      description: (step as any).description,\n      stepNumber: index > 0 ? index : undefined,\n    }\n\n    // Add timeout if present\n    if ((step as any).timeout) {\n      nodeData.timeout = (step as any).timeout\n    }\n\n    // Add retryPolicy if present\n    if ((step as any).retryPolicy) {\n      nodeData.retryPolicy = (step as any).retryPolicy\n    }\n\n    // Add generic config if present\n    if ((step as any).config) {\n      nodeData.config = (step as any).config\n    }\n\n    // Add user task data\n    if (step.stepType === 'USER_TASK' && step.userTaskConfig) {\n      nodeData.assignedTo = step.userTaskConfig.assignedTo\n      nodeData.assignedToRoles = step.userTaskConfig.assignedToRoles || []\n      nodeData.formKey = step.userTaskConfig.formKey\n      nodeData.allowedActions = step.userTaskConfig.allowedActions\n\n      // Store full userTaskConfig for advanced fields\n      nodeData.userTaskConfig = step.userTaskConfig\n\n      // Add form schema if present\n      if (step.userTaskConfig.formSchema) {\n        nodeData.formSchema = step.userTaskConfig.formSchema\n      }\n\n      // Add advanced fields if present\n      if (step.userTaskConfig.assignmentRule) {\n        nodeData.assignmentRule = step.userTaskConfig.assignmentRule\n      }\n\n      if (step.userTaskConfig.slaDuration) {\n        nodeData.slaDuration = step.userTaskConfig.slaDuration\n      }\n\n      if (step.userTaskConfig.escalationRules) {\n        nodeData.escalationRules = step.userTaskConfig.escalationRules\n      }\n    }\n\n    // Add wait for signal data\n    if (step.stepType === 'WAIT_FOR_SIGNAL' && (step as any).signalConfig) {\n      nodeData.signalConfig = (step as any).signalConfig\n    }\n\n    // Add step activities data (for AUTOMATED steps)\n    if (step.stepType === 'AUTOMATED' && (step as any).activities) {\n      nodeData.activities = (step as any).activities\n    }\n\n    // Add pre-conditions data (for START steps)\n    if (step.stepType === 'START' && (step as any).preConditions) {\n      nodeData.preConditions = (step as any).preConditions\n    }\n\n    // Set badge based on type\n    nodeData.badge = getBadgeForNodeType(nodeType)\n\n    // Default status is pending\n    nodeData.status = 'pending'\n\n    return {\n      id: step.stepId,\n      type: nodeType,\n      position,\n      data: nodeData,\n    }\n  })\n\n  // Convert transitions to edges\n  const edges: Edge[] = definition.transitions.map((transition) => {\n    return {\n      id: transition.transitionId,\n      source: transition.fromStepId,\n      target: transition.toStepId,\n      type: 'workflowTransition',\n      data: {\n        trigger: transition.trigger,\n        transitionName: (transition as any).transitionName,\n        priority: (transition as any).priority !== undefined ? (transition as any).priority : 0,\n        continueOnActivityFailure: (transition as any).continueOnActivityFailure !== undefined\n          ? (transition as any).continueOnActivityFailure\n          : false,\n        preConditions: transition.preConditions || [],\n        postConditions: transition.postConditions || [],\n        activities: transition.activities || [],\n        label: (transition as any).transitionName || (transition as any).label, // Backward compat\n        state: (transition as any).state || 'pending', // Default edge state\n      },\n    }\n  })\n\n  return { nodes, edges }\n}\n\n/**\n * Calculate smart layout positions for workflow nodes\n * Uses a layered/hierarchical layout algorithm that:\n * 1. Assigns levels (ranks) to nodes based on graph topology\n * 2. Spreads sibling nodes horizontally at the same level\n * 3. Centers merge points below their incoming nodes\n */\nfunction calculateSmartLayout(\n  steps: any[],\n  transitions: any[],\n  spacing: { vertical: number; horizontal: number }\n): Map<string, { x: number; y: number }> {\n  const positions = new Map<string, { x: number; y: number }>()\n\n  if (steps.length === 0) return positions\n\n  // Build adjacency lists\n  const outgoing = new Map<string, string[]>() // node -> children\n  const incoming = new Map<string, string[]>() // node -> parents\n\n  for (const step of steps) {\n    outgoing.set(step.stepId, [])\n    incoming.set(step.stepId, [])\n  }\n\n  for (const t of transitions) {\n    const children = outgoing.get(t.fromStepId) || []\n    children.push(t.toStepId)\n    outgoing.set(t.fromStepId, children)\n\n    const parents = incoming.get(t.toStepId) || []\n    parents.push(t.fromStepId)\n    incoming.set(t.toStepId, parents)\n  }\n\n  // Find start node(s) - nodes with no incoming edges\n  const startNodes = steps.filter(s => (incoming.get(s.stepId) || []).length === 0)\n  if (startNodes.length === 0) {\n    // Fallback: use first step as start\n    startNodes.push(steps[0])\n  }\n\n  // Assign levels using BFS (longest path from start)\n  const levels = new Map<string, number>()\n  const queue: Array<{ id: string; level: number }> = []\n\n  for (const start of startNodes) {\n    queue.push({ id: start.stepId, level: 0 })\n  }\n\n  while (queue.length > 0) {\n    const { id, level } = queue.shift()!\n    const currentLevel = levels.get(id)\n\n    // Only propagate when this path improves the node's level (longest path).\n    // Without this guard a cyclic graph (renegotiation/revision loops) keeps\n    // re-enqueuing children forever and freezes the browser (script timeout).\n    if (currentLevel !== undefined && level <= currentLevel) continue\n    levels.set(id, level)\n\n    // Safety cap: in a DAG a node's level is bounded by the node count; a\n    // higher value means we are walking a cycle, so stop descending.\n    if (level > steps.length) continue\n\n    const children = outgoing.get(id) || []\n    for (const child of children) {\n      queue.push({ id: child, level: level + 1 })\n    }\n  }\n\n  // Group nodes by level\n  const nodesByLevel = new Map<number, string[]>()\n  for (const [nodeId, level] of levels) {\n    const nodesAtLevel = nodesByLevel.get(level) || []\n    nodesAtLevel.push(nodeId)\n    nodesByLevel.set(level, nodesAtLevel)\n  }\n\n  // Calculate positions\n  const centerX = 400 // Center line for the graph\n  const startY = 50\n\n  for (const [level, nodeIds] of nodesByLevel) {\n    const count = nodeIds.length\n    const y = startY + level * spacing.vertical\n\n    if (count === 1) {\n      // Single node at this level - center it\n      positions.set(nodeIds[0], { x: centerX, y })\n    } else {\n      // Multiple nodes at this level - spread them horizontally\n      const totalWidth = (count - 1) * spacing.horizontal\n      const startX = centerX - totalWidth / 2\n\n      // Sort nodes by their parent's position for consistent ordering\n      nodeIds.sort((a, b) => {\n        const parentsA = incoming.get(a) || []\n        const parentsB = incoming.get(b) || []\n        const parentPosA = parentsA.length > 0 ? (positions.get(parentsA[0])?.x || 0) : 0\n        const parentPosB = parentsB.length > 0 ? (positions.get(parentsB[0])?.x || 0) : 0\n        return parentPosA - parentPosB\n      })\n\n      nodeIds.forEach((nodeId, idx) => {\n        positions.set(nodeId, { x: startX + idx * spacing.horizontal, y })\n      })\n    }\n  }\n\n  return positions\n}\n\n/**\n * Map node type to step type (for graph \u2192 definition)\n */\nfunction mapNodeTypeToStepType(nodeType: string): string {\n  const mapping: Record<string, string> = {\n    start: 'START',\n    end: 'END',\n    userTask: 'USER_TASK',\n    automated: 'AUTOMATED',\n    decision: 'DECISION',\n    waitForSignal: 'WAIT_FOR_SIGNAL',\n    waitForTimer: 'WAIT_FOR_TIMER',\n  }\n  return mapping[nodeType] || 'AUTOMATED'\n}\n\n/**\n * Map step type to node type (for definition \u2192 graph)\n */\nfunction mapStepTypeToNodeType(stepType: string): string {\n  const mapping: Record<string, string> = {\n    START: 'start',\n    END: 'end',\n    USER_TASK: 'userTask',\n    AUTOMATED: 'automated',\n    DECISION: 'decision',\n    WAIT_FOR_SIGNAL: 'waitForSignal',\n    WAIT_FOR_TIMER: 'waitForTimer',\n  }\n  return mapping[stepType] || 'automated'\n}\n\n/**\n * Get badge text for node type\n */\nfunction getBadgeForNodeType(nodeType: string): string {\n  const badges: Record<string, string> = {\n    start: 'Start',\n    end: 'End',\n    userTask: 'User Task',\n    automated: 'Automated',\n    decision: 'Decision',\n    waitForSignal: 'Wait for Signal',\n    waitForTimer: 'Wait for Timer',\n  }\n  return badges[nodeType] || 'Task'\n}\n\n/**\n * Validate workflow graph\n */\nexport interface ValidationError {\n  type: 'error' | 'warning'\n  message: string\n  nodeId?: string\n  edgeId?: string\n}\n\nexport function validateWorkflowGraph(nodes: Node[], edges: Edge[]): ValidationError[] {\n  const errors: ValidationError[] = []\n\n  // Check for at least one start node\n  const startNodes = nodes.filter((n) => n.type === 'start')\n  if (startNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one START node',\n    })\n  }\n  if (startNodes.length > 1) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow has multiple START nodes',\n    })\n  }\n\n  // Check for at least one end node\n  const endNodes = nodes.filter((n) => n.type === 'end')\n  if (endNodes.length === 0) {\n    errors.push({\n      type: 'error',\n      message: 'Workflow must have at least one END node',\n    })\n  }\n\n  // Check for orphan nodes (no incoming or outgoing edges)\n  for (const node of nodes) {\n    if (node.type === 'start') continue // Start nodes don't need incoming edges\n    if (node.type === 'end') continue // End nodes don't need outgoing edges\n\n    const hasIncoming = edges.some((e) => e.target === node.id)\n    const hasOutgoing = edges.some((e) => e.source === node.id)\n\n    if (!hasIncoming && !hasOutgoing) {\n      errors.push({\n        type: 'error',\n        message: `Node \"${node.data.label}\" is disconnected`,\n        nodeId: node.id,\n      })\n    } else if (!hasIncoming) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no incoming connections`,\n        nodeId: node.id,\n      })\n    } else if (!hasOutgoing) {\n      errors.push({\n        type: 'warning',\n        message: `Node \"${node.data.label}\" has no outgoing connections`,\n        nodeId: node.id,\n      })\n    }\n  }\n\n  // Check for cycles (simple detection)\n  const hasCycle = detectCycle(nodes, edges)\n  if (hasCycle) {\n    errors.push({\n      type: 'warning',\n      message: 'Workflow contains cycles (loops)',\n    })\n  }\n\n  // Check for duplicate step IDs\n  const stepIds = new Set<string>()\n  for (const node of nodes) {\n    if (stepIds.has(node.id)) {\n      errors.push({\n        type: 'error',\n        message: `Duplicate step ID: ${node.id}`,\n        nodeId: node.id,\n      })\n    }\n    stepIds.add(node.id)\n  }\n\n  return errors\n}\n\n/**\n * Simple cycle detection using DFS\n */\nfunction detectCycle(nodes: Node[], edges: Edge[]): boolean {\n  const adjList = new Map<string, string[]>()\n\n  // Build adjacency list\n  for (const node of nodes) {\n    adjList.set(node.id, [])\n  }\n  for (const edge of edges) {\n    const neighbors = adjList.get(edge.source) || []\n    neighbors.push(edge.target)\n    adjList.set(edge.source, neighbors)\n  }\n\n  const visited = new Set<string>()\n  const recStack = new Set<string>()\n\n  function dfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    recStack.add(nodeId)\n\n    const neighbors = adjList.get(nodeId) || []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (dfs(neighbor)) return true\n      } else if (recStack.has(neighbor)) {\n        return true // Cycle detected\n      }\n    }\n\n    recStack.delete(nodeId)\n    return false\n  }\n\n  for (const node of nodes) {\n    if (!visited.has(node.id)) {\n      if (dfs(node.id)) return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Sanitize ID to match schema regex: /^[a-z0-9_-]+$/\n * Converts to lowercase, replaces invalid characters with underscores\n */\nexport function sanitizeId(input: string): string {\n  return input\n    .toLowerCase()\n    .replace(/[^a-z0-9_-]/g, '_')\n    .replace(/_{2,}/g, '_') // Replace multiple underscores with single\n    .replace(/(?:^_|_$)/g, '') // Remove leading/trailing underscores\n}\n\n/**\n * Validate ID matches schema regex: /^[a-z0-9_-]+$/\n */\nexport function validateId(id: string): boolean {\n  return /^[a-z0-9_-]+$/.test(id)\n}\n\n/**\n * Generate unique step ID\n */\nexport function generateStepId(prefix: string = 'step'): string {\n  const id = `${prefix}_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`\n  return sanitizeId(id)\n}\n\n/**\n * Generate unique transition ID\n */\nexport function generateTransitionId(fromStepId: string, toStepId: string): string {\n  const id = `e_${fromStepId}_${toStepId}`\n  return sanitizeId(id)\n}\n\n/**\n * Append a new edge to the list, skipping duplicate connections.\n *\n * A plain-data replacement for React Flow's `addEdge` so the visual editor\n * page does not pull the `@xyflow/react` runtime out of its lazy boundary\n * (#3169). Mirrors `addEdge`'s dedup rule: an edge is dropped when one with\n * the same source/target endpoints (and handles) already exists.\n */\nexport function appendWorkflowEdge(edges: Edge[], edge: Edge): Edge[] {\n  const isDuplicate = edges.some(\n    (existing) =>\n      existing.source === edge.source &&\n      existing.target === edge.target &&\n      // Match addEdge: empty-string and nullish handles are equivalent.\n      (existing.sourceHandle || null) === (edge.sourceHandle || null) &&\n      (existing.targetHandle || null) === (edge.targetHandle || null),\n  )\n  return isDuplicate ? edges : [...edges, edge]\n}\n"],
+  "mappings": "AAqBO,SAAS,kBACd,OACA,OACA,UAAoC,CAAC,GACH;AAElC,QAAM,QAAQ,MAAM,IAAI,CAAC,SAAS;AAChC,UAAM,OAAY;AAAA,MAChB,QAAQ,KAAK;AAAA,MACb,UAAU,KAAK,KAAK,SAAS,KAAK;AAAA,MAClC,UAAU,sBAAsB,KAAK,QAAQ,WAAW;AAAA,IAC1D;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,SAAS;AACrB,WAAK,UAAU,KAAK,KAAK;AAAA,IAC3B;AAGA,QAAI,KAAK,KAAK,aAAa;AACzB,WAAK,cAAc,KAAK,KAAK;AAAA,IAC/B;AAGA,QAAI,KAAK,KAAK,QAAQ;AACpB,WAAK,SAAS,KAAK,KAAK;AAAA,IAC1B;AAGA,QAAI,KAAK,SAAS,cAAc,KAAK,MAAM;AACzC,WAAK,iBAAiB;AAAA,QACpB,YAAY,KAAK,KAAK;AAAA,QACtB,iBAAiB,KAAK,KAAK,mBAAmB,CAAC;AAAA,QAC/C,SAAS,KAAK,KAAK;AAAA,QACnB,gBAAgB,KAAK,KAAK,kBAAkB,CAAC,YAAY,QAAQ;AAAA,MACnE;AAGA,UAAK,KAAK,KAAa,cAAe,KAAK,KAAa,gBAAgB,YAAY;AAClF,aAAK,eAAe,aAAc,KAAK,KAAa,cAAe,KAAK,KAAa,eAAe;AAAA,MACtG;AAGA,UAAK,KAAK,KAAa,kBAAmB,KAAK,KAAa,gBAAgB,gBAAgB;AAC1F,aAAK,eAAe,iBAAkB,KAAK,KAAa,kBAAmB,KAAK,KAAa,eAAe;AAAA,MAC9G;AAEA,UAAK,KAAK,KAAa,eAAgB,KAAK,KAAa,gBAAgB,aAAa;AACpF,aAAK,eAAe,cAAe,KAAK,KAAa,eAAgB,KAAK,KAAa,eAAe;AAAA,MACxG;AAEA,UAAK,KAAK,KAAa,mBAAoB,KAAK,KAAa,gBAAgB,iBAAiB;AAC5F,aAAK,eAAe,kBAAmB,KAAK,KAAa,mBAAoB,KAAK,KAAa,eAAe;AAAA,MAChH;AAAA,IACF;AAGA,QAAI,KAAK,SAAS,mBAAmB,KAAK,KAAK,cAAc;AAC3D,WAAK,eAAe,KAAK,KAAK;AAAA,IAChC;AAGA,QAAI,KAAK,SAAS,eAAe,KAAK,KAAK,YAAY;AACrD,WAAK,aAAa,KAAK,KAAK;AAAA,IAC9B;AAGA,QAAI,KAAK,SAAS,WAAY,KAAK,KAAa,iBAAkB,KAAK,KAAa,cAAc,SAAS,GAAG;AAC5G,WAAK,gBAAiB,KAAK,KAAa;AAAA,IAC1C;AAGA,QAAI,QAAQ,oBAAoB,KAAK,UAAU;AAC7C,WAAK,kBAAkB;AAAA,QACrB,GAAG,KAAK,SAAS;AAAA,QACjB,GAAG,KAAK,SAAS;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT,CAAC;AAGD,QAAM,cAAc,MAAM,IAAI,CAAC,SAAS;AACtC,UAAM,WAAW,KAAK;AACtB,UAAM,aAAkB;AAAA,MACtB,cAAc,KAAK;AAAA,MACnB,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK;AAAA,MACf,SAAS,UAAU,WAAW;AAAA,IAChC;AAGA,QAAI,UAAU,gBAAgB;AAC5B,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,aAAa,QAAW;AACpC,iBAAW,WAAW,SAAS;AAAA,IACjC;AAGA,QAAI,UAAU,8BAA8B,QAAW;AACrD,iBAAW,4BAA4B,SAAS;AAAA,IAClD;AAGA,QAAI,UAAU,iBAAiB,SAAS,cAAc,SAAS,GAAG;AAChE,iBAAW,gBAAgB,SAAS;AAAA,IACtC;AAEA,QAAI,UAAU,kBAAkB,SAAS,eAAe,SAAS,GAAG;AAClE,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAGA,QAAI,UAAU,cAAc,SAAS,WAAW,SAAS,GAAG;AAC1D,iBAAW,aAAa,SAAS,WAAW,IAAI,CAAC,cAAmB;AAAA,QAClE,YAAY,SAAS;AAAA,QACrB,cAAc,SAAS;AAAA,QACvB,cAAc,SAAS;AAAA,QACvB,QAAQ,SAAS,UAAU,CAAC;AAAA;AAAA,QAE5B,GAAI,SAAS,UAAU,UAAa,EAAE,OAAO,SAAS,MAAM;AAAA,QAC5D,GAAI,SAAS,WAAW,EAAE,SAAS,SAAS,QAAQ;AAAA,QACpD,GAAI,SAAS,eAAe,EAAE,aAAa,SAAS,YAAY;AAAA,QAChE,GAAI,SAAS,eAAe,UAAa,EAAE,YAAY,SAAS,WAAW;AAAA,MAC7E,EAAE;AAAA,IACJ,OAAO;AAGL,YAAM,aAAa,MAAM,KAAK,OAAK,EAAE,OAAO,KAAK,MAAM;AACvD,UAAI,cAAc,WAAW,SAAS,eAAe,WAAW,MAAM;AACpE,YAAI,WAAW,KAAK,gBAAgB,WAAW,KAAK,YAAY;AAC9D,gBAAM,WAAgB;AAAA,YACpB,YAAY,WAAW,KAAK,cAAc,YAAY,WAAW,EAAE;AAAA,YACnE,cAAc,WAAW,KAAK,gBAAgB,WAAW,KAAK,SAAS;AAAA,YACvE,cAAc,WAAW,KAAK,gBAAgB;AAAA,YAC9C,QAAQ,WAAW,KAAK,kBAAkB,CAAC;AAAA,UAC7C;AAEA,cAAK,WAAW,KAAa,kBAAkB,QAAW;AACxD,qBAAS,QAAS,WAAW,KAAa;AAAA,UAC5C;AACA,cAAK,WAAW,KAAa,iBAAiB;AAC5C,qBAAS,UAAW,WAAW,KAAa;AAAA,UAC9C;AACA,cAAK,WAAW,KAAa,qBAAqB;AAChD,qBAAS,cAAe,WAAW,KAAa;AAAA,UAClD;AACA,cAAK,WAAW,KAAa,uBAAuB,QAAW;AAC7D,qBAAS,aAAc,WAAW,KAAa;AAAA,UACjD;AACA,qBAAW,aAAa,CAAC,QAAQ;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,UAAU,SAAS,CAAC,WAAW,gBAAgB;AACjD,iBAAW,iBAAiB,SAAS;AAAA,IACvC;AAEA,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY,CAAC;AAAA;AAAA,EACf;AACF;AAKO,SAAS,kBACd,YACA,UAAoC,CAAC,GACH;AAClC,QAAM,EAAE,aAAa,MAAM,gBAAgB,EAAE,UAAU,KAAK,YAAY,IAAI,EAAE,IAAI;AAGlF,QAAM,UAAU,IAAI,IAAI,WAAW,MAAM,IAAI,UAAQ,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAGzE,QAAM,YAAY,aACd,qBAAqB,WAAW,OAAO,WAAW,aAAa,aAAa,IAC5E;AAGJ,QAAM,QAAgB,WAAW,MAAM,IAAI,CAAC,MAAM,UAAU;AAE1D,QAAI,WAAW,WAAW,IAAI,KAAK,MAAM,KAAK,EAAE,GAAG,KAAK,GAAG,KAAK,QAAQ,cAAc,SAAS;AAG/F,QAAI,CAAC,cAAe,KAAa,iBAAiB;AAChD,iBAAY,KAAa;AAAA,IAC3B;AAGA,UAAM,WAAW,sBAAsB,KAAK,QAAQ;AAGpD,UAAM,WAAgB;AAAA,MACpB,OAAO,KAAK;AAAA,MACZ,aAAc,KAAa;AAAA,MAC3B,YAAY,QAAQ,IAAI,QAAQ;AAAA,IAClC;AAGA,QAAK,KAAa,SAAS;AACzB,eAAS,UAAW,KAAa;AAAA,IACnC;AAGA,QAAK,KAAa,aAAa;AAC7B,eAAS,cAAe,KAAa;AAAA,IACvC;AAGA,QAAK,KAAa,QAAQ;AACxB,eAAS,SAAU,KAAa;AAAA,IAClC;AAGA,QAAI,KAAK,aAAa,eAAe,KAAK,gBAAgB;AACxD,eAAS,aAAa,KAAK,eAAe;AAC1C,eAAS,kBAAkB,KAAK,eAAe,mBAAmB,CAAC;AACnE,eAAS,UAAU,KAAK,eAAe;AACvC,eAAS,iBAAiB,KAAK,eAAe;AAG9C,eAAS,iBAAiB,KAAK;AAG/B,UAAI,KAAK,eAAe,YAAY;AAClC,iBAAS,aAAa,KAAK,eAAe;AAAA,MAC5C;AAGA,UAAI,KAAK,eAAe,gBAAgB;AACtC,iBAAS,iBAAiB,KAAK,eAAe;AAAA,MAChD;AAEA,UAAI,KAAK,eAAe,aAAa;AACnC,iBAAS,cAAc,KAAK,eAAe;AAAA,MAC7C;AAEA,UAAI,KAAK,eAAe,iBAAiB;AACvC,iBAAS,kBAAkB,KAAK,eAAe;AAAA,MACjD;AAAA,IACF;AAGA,QAAI,KAAK,aAAa,qBAAsB,KAAa,cAAc;AACrE,eAAS,eAAgB,KAAa;AAAA,IACxC;AAGA,QAAI,KAAK,aAAa,eAAgB,KAAa,YAAY;AAC7D,eAAS,aAAc,KAAa;AAAA,IACtC;AAGA,QAAI,KAAK,aAAa,WAAY,KAAa,eAAe;AAC5D,eAAS,gBAAiB,KAAa;AAAA,IACzC;AAGA,aAAS,QAAQ,oBAAoB,QAAQ;AAG7C,aAAS,SAAS;AAElB,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF,CAAC;AAGD,QAAM,QAAgB,WAAW,YAAY,IAAI,CAAC,eAAe;AAC/D,WAAO;AAAA,MACL,IAAI,WAAW;AAAA,MACf,QAAQ,WAAW;AAAA,MACnB,QAAQ,WAAW;AAAA,MACnB,MAAM;AAAA,MACN,MAAM;AAAA,QACJ,SAAS,WAAW;AAAA,QACpB,gBAAiB,WAAmB;AAAA,QACpC,UAAW,WAAmB,aAAa,SAAa,WAAmB,WAAW;AAAA,QACtF,2BAA4B,WAAmB,8BAA8B,SACxE,WAAmB,4BACpB;AAAA,QACJ,eAAe,WAAW,iBAAiB,CAAC;AAAA,QAC5C,gBAAgB,WAAW,kBAAkB,CAAC;AAAA,QAC9C,YAAY,WAAW,cAAc,CAAC;AAAA,QACtC,OAAQ,WAAmB,kBAAmB,WAAmB;AAAA;AAAA,QACjE,OAAQ,WAAmB,SAAS;AAAA;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO,EAAE,OAAO,MAAM;AACxB;AASA,SAAS,qBACP,OACA,aACA,SACuC;AACvC,QAAM,YAAY,oBAAI,IAAsC;AAE5D,MAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,QAAM,WAAW,oBAAI,IAAsB;AAC3C,QAAM,WAAW,oBAAI,IAAsB;AAE3C,aAAW,QAAQ,OAAO;AACxB,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAC5B,aAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,EAC9B;AAEA,aAAW,KAAK,aAAa;AAC3B,UAAM,WAAW,SAAS,IAAI,EAAE,UAAU,KAAK,CAAC;AAChD,aAAS,KAAK,EAAE,QAAQ;AACxB,aAAS,IAAI,EAAE,YAAY,QAAQ;AAEnC,UAAM,UAAU,SAAS,IAAI,EAAE,QAAQ,KAAK,CAAC;AAC7C,YAAQ,KAAK,EAAE,UAAU;AACzB,aAAS,IAAI,EAAE,UAAU,OAAO;AAAA,EAClC;AAGA,QAAM,aAAa,MAAM,OAAO,QAAM,SAAS,IAAI,EAAE,MAAM,KAAK,CAAC,GAAG,WAAW,CAAC;AAChF,MAAI,WAAW,WAAW,GAAG;AAE3B,eAAW,KAAK,MAAM,CAAC,CAAC;AAAA,EAC1B;AAGA,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,QAA8C,CAAC;AAErD,aAAW,SAAS,YAAY;AAC9B,UAAM,KAAK,EAAE,IAAI,MAAM,QAAQ,OAAO,EAAE,CAAC;AAAA,EAC3C;AAEA,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,EAAE,IAAI,MAAM,IAAI,MAAM,MAAM;AAClC,UAAM,eAAe,OAAO,IAAI,EAAE;AAKlC,QAAI,iBAAiB,UAAa,SAAS,aAAc;AACzD,WAAO,IAAI,IAAI,KAAK;AAIpB,QAAI,QAAQ,MAAM,OAAQ;AAE1B,UAAM,WAAW,SAAS,IAAI,EAAE,KAAK,CAAC;AACtC,eAAW,SAAS,UAAU;AAC5B,YAAM,KAAK,EAAE,IAAI,OAAO,OAAO,QAAQ,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,eAAe,oBAAI,IAAsB;AAC/C,aAAW,CAAC,QAAQ,KAAK,KAAK,QAAQ;AACpC,UAAM,eAAe,aAAa,IAAI,KAAK,KAAK,CAAC;AACjD,iBAAa,KAAK,MAAM;AACxB,iBAAa,IAAI,OAAO,YAAY;AAAA,EACtC;AAGA,QAAM,UAAU;AAChB,QAAM,SAAS;AAEf,aAAW,CAAC,OAAO,OAAO,KAAK,cAAc;AAC3C,UAAM,QAAQ,QAAQ;AACtB,UAAM,IAAI,SAAS,QAAQ,QAAQ;AAEnC,QAAI,UAAU,GAAG;AAEf,gBAAU,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;AAAA,IAC7C,OAAO;AAEL,YAAM,cAAc,QAAQ,KAAK,QAAQ;AACzC,YAAM,SAAS,UAAU,aAAa;AAGtC,cAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,WAAW,SAAS,IAAI,CAAC,KAAK,CAAC;AACrC,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,cAAM,aAAa,SAAS,SAAS,IAAK,UAAU,IAAI,SAAS,CAAC,CAAC,GAAG,KAAK,IAAK;AAChF,eAAO,aAAa;AAAA,MACtB,CAAC;AAED,cAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAC/B,kBAAU,IAAI,QAAQ,EAAE,GAAG,SAAS,MAAM,QAAQ,YAAY,EAAE,CAAC;AAAA,MACnE,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,sBAAsB,UAA0B;AACvD,QAAM,UAAkC;AAAA,IACtC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,WAAW;AAAA,IACX,WAAW;AAAA,IACX,UAAU;AAAA,IACV,iBAAiB;AAAA,IACjB,gBAAgB;AAAA,EAClB;AACA,SAAO,QAAQ,QAAQ,KAAK;AAC9B;AAKA,SAAS,oBAAoB,UAA0B;AACrD,QAAM,SAAiC;AAAA,IACrC,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,WAAW;AAAA,IACX,UAAU;AAAA,IACV,eAAe;AAAA,IACf,cAAc;AAAA,EAChB;AACA,SAAO,OAAO,QAAQ,KAAK;AAC7B;AAYO,SAAS,sBAAsB,OAAe,OAAkC;AACrF,QAAM,SAA4B,CAAC;AAGnC,QAAM,aAAa,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK;AACrD,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,QAAS;AAC3B,QAAI,KAAK,SAAS,MAAO;AAEzB,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAC1D,UAAM,cAAc,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,KAAK,EAAE;AAE1D,QAAI,CAAC,eAAe,CAAC,aAAa;AAChC,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH,WAAW,CAAC,aAAa;AACvB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,SAAS,KAAK,KAAK,KAAK;AAAA,QACjC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,WAAW,YAAY,OAAO,KAAK;AACzC,MAAI,UAAU;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,OAAO;AACxB,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,SAAS,sBAAsB,KAAK,EAAE;AAAA,QACtC,QAAQ,KAAK;AAAA,MACf,CAAC;AAAA,IACH;AACA,YAAQ,IAAI,KAAK,EAAE;AAAA,EACrB;AAEA,SAAO;AACT;AAKA,SAAS,YAAY,OAAe,OAAwB;AAC1D,QAAM,UAAU,oBAAI,IAAsB;AAG1C,aAAW,QAAQ,OAAO;AACxB,YAAQ,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACzB;AACA,aAAW,QAAQ,OAAO;AACxB,UAAM,YAAY,QAAQ,IAAI,KAAK,MAAM,KAAK,CAAC;AAC/C,cAAU,KAAK,KAAK,MAAM;AAC1B,YAAQ,IAAI,KAAK,QAAQ,SAAS;AAAA,EACpC;AAEA,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,WAAW,oBAAI,IAAY;AAEjC,WAAS,IAAI,QAAyB;AACpC,YAAQ,IAAI,MAAM;AAClB,aAAS,IAAI,MAAM;AAEnB,UAAM,YAAY,QAAQ,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAW,YAAY,WAAW;AAChC,UAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,YAAI,IAAI,QAAQ,EAAG,QAAO;AAAA,MAC5B,WAAW,SAAS,IAAI,QAAQ,GAAG;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,OAAO,MAAM;AACtB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,GAAG;AACzB,UAAI,IAAI,KAAK,EAAE,EAAG,QAAO;AAAA,IAC3B;AAAA,EACF;AAEA,SAAO;AACT;AAMO,SAAS,WAAW,OAAuB;AAChD,SAAO,MACJ,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,UAAU,GAAG,EACrB,QAAQ,cAAc,EAAE;AAC7B;AAKO,SAAS,WAAW,IAAqB;AAC9C,SAAO,gBAAgB,KAAK,EAAE;AAChC;AAKO,SAAS,eAAe,SAAiB,QAAgB;AAC9D,QAAM,KAAK,GAAG,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAC7E,SAAO,WAAW,EAAE;AACtB;AAKO,SAAS,qBAAqB,YAAoB,UAA0B;AACjF,QAAM,KAAK,KAAK,UAAU,IAAI,QAAQ;AACtC,SAAO,WAAW,EAAE;AACtB;AAUO,SAAS,mBAAmB,OAAe,MAAoB;AACpE,QAAM,cAAc,MAAM;AAAA,IACxB,CAAC,aACC,SAAS,WAAW,KAAK,UACzB,SAAS,WAAW,KAAK;AAAA,KAExB,SAAS,gBAAgB,WAAW,KAAK,gBAAgB,UACzD,SAAS,gBAAgB,WAAW,KAAK,gBAAgB;AAAA,EAC9D;AACA,SAAO,cAAc,QAAQ,CAAC,GAAG,OAAO,IAAI;AAC9C;",
   "names": []
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@open-mercato/core",
-  "version": "0.6.6-develop.6524.1.a78cc4694e",
+  "version": "0.6.6-develop.6525.1.e9a4b56963",
   "license": "MIT",
   "type": "module",
   "main": "./dist/index.js",
@@ -253,16 +253,16 @@
     "zod": "^4.4.3"
   },
   "peerDependencies": {
-    "@open-mercato/ai-assistant": "0.6.6-develop.6524.1.a78cc4694e",
-    "@open-mercato/shared": "0.6.6-develop.6524.1.a78cc4694e",
-    "@open-mercato/ui": "0.6.6-develop.6524.1.a78cc4694e",
+    "@open-mercato/ai-assistant": "0.6.6-develop.6525.1.e9a4b56963",
+    "@open-mercato/shared": "0.6.6-develop.6525.1.e9a4b56963",
+    "@open-mercato/ui": "0.6.6-develop.6525.1.e9a4b56963",
     "react": "^19.0.0",
     "react-dom": "^19.0.0"
   },
   "devDependencies": {
-    "@open-mercato/ai-assistant": "0.6.6-develop.6524.1.a78cc4694e",
-    "@open-mercato/shared": "0.6.6-develop.6524.1.a78cc4694e",
-    "@open-mercato/ui": "0.6.6-develop.6524.1.a78cc4694e",
+    "@open-mercato/ai-assistant": "0.6.6-develop.6525.1.e9a4b56963",
+    "@open-mercato/shared": "0.6.6-develop.6525.1.e9a4b56963",
+    "@open-mercato/ui": "0.6.6-develop.6525.1.e9a4b56963",
     "@testing-library/dom": "^10.4.1",
     "@testing-library/jest-dom": "^6.9.1",
     "@testing-library/react": "^16.3.1",

package/src/modules/workflows/lib/graph-utils.ts

@@ -388,10 +388,15 @@ function calculateSmartLayout(
     const { id, level } = queue.shift()!
     const currentLevel = levels.get(id)
 
-    // Take the maximum level (longest path)
-    if (currentLevel === undefined || level > currentLevel) {
-      levels.set(id, level)
-    }
+    // Only propagate when this path improves the node's level (longest path).
+    // Without this guard a cyclic graph (renegotiation/revision loops) keeps
+    // re-enqueuing children forever and freezes the browser (script timeout).
+    if (currentLevel !== undefined && level <= currentLevel) continue
+    levels.set(id, level)
+
+    // Safety cap: in a DAG a node's level is bounded by the node count; a
+    // higher value means we are walking a cycle, so stop descending.
+    if (level > steps.length) continue
 
     const children = outgoing.get(id) || []
     for (const child of children) {