@notmrabhi/flowforge 0.1.57 → 0.1.59

package/dist/{WorkflowExecutionHistory-DsrLtY5i.js → WorkflowExecutionHistory-Bpw-YeJU.js}

@@ -1,22 +1,22 @@
-import { jsxs as v, jsx as u, Fragment as be } from "react/jsx-runtime";
-import B, { useRef as _t, useEffect as re, useState as M, useCallback as Y, useMemo as K } from "react";
-import Dn, { useStore as Bn, useReactFlow as An, Background as Wn, Controls as $n, MiniMap as Gn } from "reactflow";
+import { jsxs as v, jsx as u, Fragment as ye } from "react/jsx-runtime";
+import D, { useRef as _t, useEffect as re, useState as M, useCallback as Y, useMemo as K } from "react";
+import Bn, { useStore as Wn, useReactFlow as $n, Background as Gn, Controls as Yn, MiniMap as Kn } from "reactflow";
 import "reactflow/dist/style.css";
-import { e as Yn, G as Kn, E as Hn, P as Vn, L as Un, d as Xn, f as qn } from "./GatewayBranchEdge-PsxBbEky.js";
-import { Dialog as Jn, Box as Q, Drawer as Zn, IconButton as St, Button as Ne, CircularProgress as Qn } from "@mui/material";
-import er from "react-select";
-import { MdClose as tr, MdCalendarToday as nr, MdBolt as rr, MdArrowBack as Kt, MdChevronRight as Ht, MdAddCircleOutline as or, MdApps as ir, MdErrorOutline as sr, MdAccountTree as lr, MdAdd as dr, MdSearch as ar, MdCategory as cr, MdCancel as Vt, MdError as Ut, MdCheckCircle as Xt, MdPlayArrow as qt, MdHourglassEmpty as fr, MdSchedule as Nt, MdPerson as ur, MdExpandLess as hr, MdExpandMore as gr } from "react-icons/md";
-import { GrTrigger as pr } from "react-icons/gr";
-import { BiCollapse as br, BiExpand as yr } from "react-icons/bi";
-import { j as mr, b as vr, O as wr } from "./index-D-ObmLY1.js";
-import { m as Er } from "./messages-CRZgWFU-.js";
-import { T as xr, E as ee } from "./canvasTokens-CAD6G24b.js";
-var Jt = Object.defineProperty, kr = (e, t, n) => t in e ? Jt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, _r = (e, t) => {
-  for (var n in t) Jt(e, n, { get: t[n], enumerable: !0 });
-}, Sr = (e, t, n) => kr(e, t + "", n), Zt = {};
-_r(Zt, { Graph: () => H, alg: () => Ze, json: () => en, version: () => Cr });
-var Nr = Object.defineProperty, Qt = (e, t) => {
-  for (var n in t) Nr(e, n, { get: t[n], enumerable: !0 });
+import { e as Hn, G as Vn, E as Un, P as Xn, L as qn, d as Jn, f as Zn } from "./GatewayBranchEdge-PsxBbEky.js";
+import { Dialog as Qn, Box as Q, Drawer as er, IconButton as St, Button as Ne, CircularProgress as tr } from "@mui/material";
+import nr from "react-select";
+import { MdClose as rr, MdCalendarToday as or, MdBolt as ir, MdArrowBack as Vt, MdChevronRight as Ut, MdAddCircleOutline as sr, MdApps as lr, MdErrorOutline as dr, MdAccountTree as ar, MdAdd as cr, MdSearch as fr, MdCategory as ur, MdCancel as Xt, MdError as qt, MdCheckCircle as Jt, MdPlayArrow as Zt, MdHourglassEmpty as hr, MdSchedule as Nt, MdPerson as gr, MdExpandLess as pr, MdExpandMore as yr } from "react-icons/md";
+import { GrTrigger as br } from "react-icons/gr";
+import { BiCollapse as mr, BiExpand as vr } from "react-icons/bi";
+import { j as wr, b as Er, O as xr } from "./index-CicT49Ft.js";
+import { m as kr } from "./messages-CRZgWFU-.js";
+import { T as _r, E as ee } from "./canvasTokens-CAD6G24b.js";
+var Qt = Object.defineProperty, Sr = (e, t, n) => t in e ? Qt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, Nr = (e, t) => {
+  for (var n in t) Qt(e, n, { get: t[n], enumerable: !0 });
+}, Tr = (e, t, n) => Sr(e, t + "", n), en = {};
+Nr(en, { Graph: () => H, alg: () => Ze, json: () => nn, version: () => Or });
+var Cr = Object.defineProperty, tn = (e, t) => {
+  for (var n in t) Cr(e, n, { get: t[n], enumerable: !0 });
 }, H = class {
   constructor(e) {
     this._isDirected = !0, this._isMultigraph = !1, this._isCompound = !1, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
@@ -154,11 +154,11 @@ var Nr = Object.defineProperty, Qt = (e, t) => {
     if (d in this._edgeLabels) return a && (this._edgeLabels[d] = l), this;
     if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
     this.setNode(o), this.setNode(i), this._edgeLabels[d] = a ? l : this._defaultEdgeLabelFn(o, i, s);
-    let c = Tr(this._isDirected, o, i, s);
+    let c = Ir(this._isDirected, o, i, s);
     return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[d] = c, Tt(this._preds[i], o), Tt(this._sucs[o], i), this._in[i][d] = c, this._out[o][d] = c, this._edgeCount++, this;
   }
   edge(e, t, n) {
-    let r = arguments.length === 1 ? De(this._isDirected, e) : pe(this._isDirected, e, t, n);
+    let r = arguments.length === 1 ? Ae(this._isDirected, e) : pe(this._isDirected, e, t, n);
     return this._edgeLabels[r];
   }
   edgeAsObj(e, t, n) {
@@ -166,10 +166,10 @@ var Nr = Object.defineProperty, Qt = (e, t) => {
     return typeof r != "object" ? { label: r } : r;
   }
   hasEdge(e, t, n) {
-    return (arguments.length === 1 ? De(this._isDirected, e) : pe(this._isDirected, e, t, n)) in this._edgeLabels;
+    return (arguments.length === 1 ? Ae(this._isDirected, e) : pe(this._isDirected, e, t, n)) in this._edgeLabels;
   }
   removeEdge(e, t, n) {
-    let r = arguments.length === 1 ? De(this._isDirected, e) : pe(this._isDirected, e, t, n), o = this._edgeObjs[r];
+    let r = arguments.length === 1 ? Ae(this._isDirected, e) : pe(this._isDirected, e, t, n), o = this._edgeObjs[r];
     if (o) {
       let i = o.v, s = o.w;
       delete this._edgeLabels[r], delete this._edgeObjs[r], Ct(this._preds[s], i), Ct(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--;
@@ -208,7 +208,7 @@ function pe(e, t, n, r) {
   }
   return o + "
" + i + "
" + (r === void 0 ? "\0" : r);
 }
-function Tr(e, t, n, r) {
+function Ir(e, t, n, r) {
   let o = "" + t, i = "" + n;
   if (!e && o > i) {
     let l = o;
@@ -217,28 +217,28 @@ function Tr(e, t, n, r) {
   let s = { v: o, w: i };
   return r && (s.name = r), s;
 }
-function De(e, t) {
+function Ae(e, t) {
   return pe(e, t.v, t.w, t.name);
 }
-var Cr = "4.0.1", en = {};
-Qt(en, { read: () => jr, write: () => Ir });
-function Ir(e) {
-  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Or(e), edges: Mr(e) }, n = e.graph();
+var Or = "4.0.1", nn = {};
+tn(nn, { read: () => Lr, write: () => Mr });
+function Mr(e) {
+  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: jr(e), edges: zr(e) }, n = e.graph();
   return n !== void 0 && (t.value = structuredClone(n)), t;
 }
-function Or(e) {
+function jr(e) {
   return e.nodes().map((t) => {
     let n = e.node(t), r = e.parent(t), o = { v: t };
     return n !== void 0 && (o.value = n), r !== void 0 && (o.parent = r), o;
   });
 }
-function Mr(e) {
+function zr(e) {
   return e.edges().map((t) => {
     let n = e.edge(t), r = { v: t.v, w: t.w };
     return t.name !== void 0 && (r.name = t.name), n !== void 0 && (r.value = n), r;
   });
 }
-function jr(e) {
+function Lr(e) {
   let t = new H(e.options);
   return e.value !== void 0 && t.setGraph(e.value), e.nodes.forEach((n) => {
     t.setNode(n.v, n.value), n.parent && t.setParent(n.v, n.parent);
@@ -247,14 +247,14 @@ function jr(e) {
   }), t;
 }
 var Ze = {};
-Qt(Ze, { CycleException: () => Ce, bellmanFord: () => tn, components: () => Pr, dijkstra: () => Te, dijkstraAll: () => Dr, findCycles: () => Br, floydWarshall: () => Wr, isAcyclic: () => Gr, postorder: () => Kr, preorder: () => Hr, prim: () => Vr, shortestPaths: () => Ur, tarjan: () => rn, topsort: () => on });
-var zr = () => 1;
-function tn(e, t, n, r) {
-  return Lr(e, String(t), n || zr, r || function(o) {
+tn(Ze, { CycleException: () => Ce, bellmanFord: () => rn, components: () => Fr, dijkstra: () => Te, dijkstraAll: () => Br, findCycles: () => Wr, floydWarshall: () => Gr, isAcyclic: () => Kr, postorder: () => Vr, preorder: () => Ur, prim: () => Xr, shortestPaths: () => qr, tarjan: () => sn, topsort: () => ln });
+var Pr = () => 1;
+function rn(e, t, n, r) {
+  return Rr(e, String(t), n || Pr, r || function(o) {
     return e.outEdges(o);
   });
 }
-function Lr(e, t, n, r) {
+function Rr(e, t, n, r) {
   let o = {}, i, s = 0, l = e.nodes(), a = function(f) {
     let h = n(f);
     o[f.v].distance + h < o[f.w].distance && (o[f.w] = { distance: o[f.v].distance + h, predecessor: f.v }, i = !0);
@@ -275,7 +275,7 @@ function Lr(e, t, n, r) {
   if (s === c - 1 && (i = !1, d(), i)) throw new Error("The graph contains a negative weight cycle");
   return o;
 }
-function Pr(e) {
+function Fr(e) {
   let t = {}, n = [], r;
   function o(i) {
     i in t || (t[i] = !0, r.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
@@ -284,7 +284,7 @@ function Pr(e) {
     r = [], o(i), r.length && n.push(r);
   }), n;
 }
-var nn = class {
+var on = class {
   constructor() {
     this._arr = [], this._keyIndices = {};
   }
@@ -337,15 +337,15 @@ var nn = class {
     let n = this._arr, r = this._keyIndices, o = n[e], i = n[t];
     n[e] = i, n[t] = o, r[i.key] = e, r[o.key] = t;
   }
-}, Rr = () => 1;
+}, Ar = () => 1;
 function Te(e, t, n, r) {
   let o = function(i) {
     return e.outEdges(i);
   };
-  return Fr(e, String(t), n || Rr, r || o);
+  return Dr(e, String(t), n || Ar, r || o);
 }
-function Fr(e, t, n, r) {
-  let o = {}, i = new nn(), s, l, a = function(d) {
+function Dr(e, t, n, r) {
+  let o = {}, i = new on(), s, l, a = function(d) {
     let c = d.v !== s ? d.v : d.w, f = o[c], h = n(d), g = l.distance + h;
     if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + d + " Weight: " + h);
     g < f.distance && (f.distance = g, f.predecessor = s, i.decrease(c, g));
@@ -356,12 +356,12 @@ function Fr(e, t, n, r) {
   }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) r(s).forEach(a);
   return o;
 }
-function Dr(e, t, n) {
+function Br(e, t, n) {
   return e.nodes().reduce(function(r, o) {
     return r[o] = Te(e, o, t, n), r;
   }, {});
 }
-function rn(e) {
+function sn(e) {
   let t = 0, n = [], r = {}, o = [];
   function i(s) {
     let l = r[s] = { onStack: !0, lowlink: t, index: t++ };
@@ -379,18 +379,18 @@ function rn(e) {
     s in r || i(s);
   }), o;
 }
-function Br(e) {
-  return rn(e).filter(function(t) {
+function Wr(e) {
+  return sn(e).filter(function(t) {
     return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
   });
 }
-var Ar = () => 1;
-function Wr(e, t, n) {
-  return $r(e, t || Ar, n || function(r) {
+var $r = () => 1;
+function Gr(e, t, n) {
+  return Yr(e, t || $r, n || function(r) {
     return e.outEdges(r);
   });
 }
-function $r(e, t, n) {
+function Yr(e, t, n) {
   let r = {}, o = e.nodes();
   return o.forEach(function(i) {
     r[i] = {}, r[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
@@ -415,7 +415,7 @@ var Ce = class extends Error {
     super(...e);
   }
 };
-function on(e) {
+function ln(e) {
   let t = {}, n = {}, r = [];
   function o(i) {
     if (i in n) throw new Ce();
@@ -424,16 +424,16 @@ function on(e) {
   if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Ce();
   return r;
 }
-function Gr(e) {
+function Kr(e) {
   try {
-    on(e);
+    ln(e);
   } catch (t) {
     if (t instanceof Ce) return !1;
     throw t;
   }
   return !0;
 }
-function Yr(e, t, n, r, o) {
+function Hr(e, t, n, r, o) {
   Array.isArray(t) || (t = [t]);
   let i = (l) => {
     var a;
@@ -441,27 +441,27 @@ function Yr(e, t, n, r, o) {
   }, s = {};
   return t.forEach(function(l) {
     if (!e.hasNode(l)) throw new Error("Graph does not have node: " + l);
-    o = sn(e, l, n === "post", s, i, r, o);
+    o = dn(e, l, n === "post", s, i, r, o);
   }), o;
 }
-function sn(e, t, n, r, o, i, s) {
+function dn(e, t, n, r, o, i, s) {
   return t in r || (r[t] = !0, n || (s = i(s, t)), o(t).forEach(function(l) {
-    s = sn(e, l, n, r, o, i, s);
+    s = dn(e, l, n, r, o, i, s);
   }), n && (s = i(s, t))), s;
 }
-function ln(e, t, n) {
-  return Yr(e, t, n, function(r, o) {
+function an(e, t, n) {
+  return Hr(e, t, n, function(r, o) {
     return r.push(o), r;
   }, []);
 }
-function Kr(e, t) {
-  return ln(e, t, "post");
+function Vr(e, t) {
+  return an(e, t, "post");
 }
-function Hr(e, t) {
-  return ln(e, t, "pre");
+function Ur(e, t) {
+  return an(e, t, "pre");
 }
-function Vr(e, t) {
-  let n = new H(), r = {}, o = new nn(), i;
+function Xr(e, t) {
+  let n = new H(), r = {}, o = new on(), i;
   function s(a) {
     let d = a.v === i ? a.w : a.v, c = o.priority(d);
     if (c !== void 0) {
@@ -484,13 +484,13 @@ function Vr(e, t) {
   }
   return n;
 }
-function Ur(e, t, n, r) {
-  return Xr(e, t, n, r ?? ((o) => {
+function qr(e, t, n, r) {
+  return Jr(e, t, n, r ?? ((o) => {
     let i = e.outEdges(o);
     return i ?? [];
   }));
 }
-function Xr(e, t, n, r) {
+function Jr(e, t, n, r) {
   if (n === void 0) return Te(e, t, n, r);
   let o = !1, i = e.nodes();
   for (let s = 0; s < i.length; s++) {
@@ -499,7 +499,7 @@ function Xr(e, t, n, r) {
       let d = l[a], c = d.v === i[s] ? d.v : d.w, f = c === d.v ? d.w : d.v;
       n({ v: c, w: f }) < 0 && (o = !0);
     }
-    if (o) return tn(e, t, n, r);
+    if (o) return rn(e, t, n, r);
   }
   return Te(e, t, n, r);
 }
@@ -508,14 +508,14 @@ function ue(e, t, n, r) {
   for (; e.hasNode(o); ) o = Qe(r);
   return n.dummy = t, e.setNode(o, n), o;
 }
-function qr(e) {
+function Zr(e) {
   let t = new H().setGraph(e.graph());
   return e.nodes().forEach((n) => t.setNode(n, e.node(n))), e.edges().forEach((n) => {
     let r = t.edge(n.v, n.w) || { weight: 0, minlen: 1 }, o = e.edge(n);
     t.setEdge(n.v, n.w, { weight: r.weight + o.weight, minlen: Math.max(r.minlen, o.minlen) });
   }), t;
 }
-function dn(e) {
+function cn(e) {
   let t = new H({ multigraph: e.isMultigraph() }).setGraph(e.graph());
   return e.nodes().forEach((n) => {
     e.children(n).length || t.setNode(n, e.node(n));
@@ -530,13 +530,13 @@ function It(e, t) {
   return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), a = l * o / i, d = l) : (o < 0 && (s = -s), a = s, d = s * i / o), { x: n + a, y: r + d };
 }
 function ve(e) {
-  let t = ye(cn(e) + 1).map(() => []);
+  let t = be(un(e) + 1).map(() => []);
   return e.nodes().forEach((n) => {
     let r = e.node(n), o = r.rank;
     o !== void 0 && (t[o] || (t[o] = []), t[o][r.order] = n);
   }), t;
 }
-function Jr(e) {
+function Qr(e) {
   let t = e.nodes().map((r) => {
     let o = e.node(r).rank;
     return o === void 0 ? Number.MAX_VALUE : o;
@@ -546,7 +546,7 @@ function Jr(e) {
     Object.hasOwn(o, "rank") && (o.rank -= n);
   });
 }
-function Zr(e) {
+function eo(e) {
   let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), n = q(Math.min, t), r = [];
   e.nodes().forEach((s) => {
     let l = e.node(s).rank - n;
@@ -561,7 +561,7 @@ function Ot(e, t, n, r) {
   let o = { width: 0, height: 0 };
   return arguments.length >= 4 && (o.rank = n, o.order = r), ue(e, "border", o, t);
 }
-function Qr(e, t = an) {
+function to(e, t = fn) {
   let n = [];
   for (let r = 0; r < e.length; r += t) {
     let o = e.slice(r, r + t);
@@ -569,27 +569,27 @@ function Qr(e, t = an) {
   }
   return n;
 }
-var an = 65535;
+var fn = 65535;
 function q(e, t) {
-  if (t.length > an) {
-    let n = Qr(t);
+  if (t.length > fn) {
+    let n = to(t);
     return e(...n.map((r) => e(...r)));
   } else return e(...t);
 }
-function cn(e) {
+function un(e) {
   let t = e.nodes().map((n) => {
     let r = e.node(n).rank;
     return r === void 0 ? Number.MIN_VALUE : r;
   });
   return q(Math.max, t);
 }
-function eo(e, t) {
+function no(e, t) {
   let n = { lhs: [], rhs: [] };
   return e.forEach((r) => {
     t(r) ? n.lhs.push(r) : n.rhs.push(r);
   }), n;
 }
-function fn(e, t) {
+function hn(e, t) {
   let n = Date.now();
   try {
     return t();
@@ -597,15 +597,15 @@ function fn(e, t) {
     console.log(e + " time: " + (Date.now() - n) + "ms");
   }
 }
-function un(e, t) {
+function gn(e, t) {
   return t();
 }
-var to = 0;
+var ro = 0;
 function Qe(e) {
-  let t = ++to;
+  let t = ++ro;
   return e + ("" + t);
 }
-function ye(e, t, n = 1) {
+function be(e, t, n = 1) {
   t == null && (t = e, e = 0);
   let r = (i) => i < t;
   n < 0 && (r = (i) => t < i);
@@ -622,12 +622,12 @@ function Oe(e, t) {
   let n;
   return typeof t == "string" ? n = (r) => r[t] : n = t, Object.entries(e).reduce((r, [o, i]) => (r[o] = n(i, o), r), {});
 }
-function no(e, t) {
+function oo(e, t) {
   return e.reduce((n, r, o) => (n[r] = t[o], n), {});
 }
-var Me = "\0", ro = "3.0.0", oo = class {
+var Me = "\0", io = "3.0.0", so = class {
   constructor() {
-    Sr(this, "_sentinel");
+    Tr(this, "_sentinel");
     let e = {};
     e._next = e._prev = e, this._sentinel = e;
   }
@@ -641,38 +641,38 @@ var Me = "\0", ro = "3.0.0", oo = class {
   }
   toString() {
     let e = [], t = this._sentinel, n = t._prev;
-    for (; n !== t; ) e.push(JSON.stringify(n, io)), n = n._prev;
+    for (; n !== t; ) e.push(JSON.stringify(n, lo)), n = n._prev;
     return "[" + e.join(", ") + "]";
   }
 };
 function Mt(e) {
   e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function io(e, t) {
+function lo(e, t) {
   if (e !== "_next" && e !== "_prev") return t;
 }
-var so = oo, lo = () => 1;
-function ao(e, t) {
+var ao = so, co = () => 1;
+function fo(e, t) {
   if (e.nodeCount() <= 1) return [];
-  let n = fo(e, t || lo);
-  return co(n.graph, n.buckets, n.zeroIdx).flatMap((r) => e.outEdges(r.v, r.w) || []);
+  let n = ho(e, t || co);
+  return uo(n.graph, n.buckets, n.zeroIdx).flatMap((r) => e.outEdges(r.v, r.w) || []);
 }
-function co(e, t, n) {
+function uo(e, t, n) {
   var r;
   let o = [], i = t[t.length - 1], s = t[0], l;
   for (; e.nodeCount(); ) {
-    for (; l = s.dequeue(); ) Be(e, t, n, l);
-    for (; l = i.dequeue(); ) Be(e, t, n, l);
+    for (; l = s.dequeue(); ) De(e, t, n, l);
+    for (; l = i.dequeue(); ) De(e, t, n, l);
     if (e.nodeCount()) {
       for (let a = t.length - 2; a > 0; --a) if (l = (r = t[a]) == null ? void 0 : r.dequeue(), l) {
-        o = o.concat(Be(e, t, n, l, !0) || []);
+        o = o.concat(De(e, t, n, l, !0) || []);
         break;
       }
     }
   }
   return o;
 }
-function Be(e, t, n, r, o) {
+function De(e, t, n, r, o) {
   let i = [], s = o ? i : void 0;
   return (e.inEdges(r.v) || []).forEach((l) => {
     let a = e.edge(l), d = e.node(l.v);
@@ -682,7 +682,7 @@ function Be(e, t, n, r, o) {
     c.in -= a, Ve(t, n, c);
   }), e.removeNode(r.v), s;
 }
-function fo(e, t) {
+function ho(e, t) {
   let n = new H(), r = 0, o = 0;
   e.nodes().forEach((l) => {
     n.setNode(l, { v: l, in: 0, out: 0 });
@@ -692,7 +692,7 @@ function fo(e, t) {
     let f = n.node(l.v), h = n.node(l.w);
     o = Math.max(o, f.out += d), r = Math.max(r, h.in += d);
   });
-  let i = uo(o + r + 3).map(() => new so()), s = r + 1;
+  let i = go(o + r + 3).map(() => new ao()), s = r + 1;
   return n.nodes().forEach((l) => {
     Ve(i, s, n.node(l));
   }), { graph: n, buckets: i, zeroIdx: s };
@@ -701,13 +701,13 @@ function Ve(e, t, n) {
   var r, o, i;
   n.out ? n.in ? (i = e[n.out - n.in + t]) == null || i.enqueue(n) : (o = e[e.length - 1]) == null || o.enqueue(n) : (r = e[0]) == null || r.enqueue(n);
 }
-function uo(e) {
+function go(e) {
   let t = [];
   for (let n = 0; n < e; n++) t.push(n);
   return t;
 }
-function ho(e) {
-  (e.graph().acyclicer === "greedy" ? ao(e, t(e)) : go(e)).forEach((n) => {
+function po(e) {
+  (e.graph().acyclicer === "greedy" ? fo(e, t(e)) : yo(e)).forEach((n) => {
     let r = e.edge(n);
     e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r, Qe("rev"));
   });
@@ -715,7 +715,7 @@ function ho(e) {
     return (r) => n.edge(r).weight;
   }
 }
-function go(e) {
+function yo(e) {
   let t = [], n = {}, r = {};
   function o(i) {
     Object.hasOwn(r, i) || (r[i] = !0, n[i] = !0, e.outEdges(i).forEach((s) => {
@@ -724,7 +724,7 @@ function go(e) {
   }
   return e.nodes().forEach(o), t;
 }
-function po(e) {
+function bo(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.reversed) {
@@ -734,10 +734,10 @@ function po(e) {
     }
   });
 }
-function bo(e) {
-  e.graph().dummyChains = [], e.edges().forEach((t) => yo(e, t));
+function mo(e) {
+  e.graph().dummyChains = [], e.edges().forEach((t) => vo(e, t));
 }
-function yo(e, t) {
+function vo(e, t) {
   let n = t.v, r = e.node(n).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), a = l.labelRank;
   if (i === r + 1) return;
   e.removeEdge(t);
@@ -745,7 +745,7 @@ function yo(e, t) {
   for (f = 0, ++r; r < i; ++f, ++r) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, d = ue(e, "edge", c, "_d"), r === a && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(n, d, { weight: l.weight }, s), f === 0 && e.graph().dummyChains.push(d), n = d;
   e.setEdge(n, o, { weight: l.weight }, s);
 }
-function mo(e) {
+function wo(e) {
   e.graph().dummyChains.forEach((t) => {
     let n = e.node(t), r = n.edgeLabel, o;
     for (e.setEdge(n.edgeObj, r); n.dummy; ) o = e.successors(t)[0], e.removeNode(t), r.points.push({ x: n.x, y: n.y }), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), t = o, n = e.node(t);
@@ -765,17 +765,17 @@ function et(e) {
 function fe(e, t) {
   return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var hn = vo;
-function vo(e) {
+var pn = Eo;
+function Eo(e) {
   let t = new H({ directed: !1 }), n = e.nodes();
   if (n.length === 0) throw new Error("Graph must have at least one node");
   let r = n[0], o = e.nodeCount();
   t.setNode(r, {});
   let i, s;
-  for (; wo(t, e) < o && (i = Eo(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), xo(t, e, s);
+  for (; xo(t, e) < o && (i = ko(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), _o(t, e, s);
   return t;
 }
-function wo(e, t) {
+function xo(e, t) {
   function n(r) {
     let o = t.nodeEdges(r);
     o && o.forEach((i) => {
@@ -785,38 +785,38 @@ function wo(e, t) {
   }
   return e.nodes().forEach(n), e.nodeCount();
 }
-function Eo(e, t) {
+function ko(e, t) {
   return t.edges().reduce((n, r) => {
     let o = Number.POSITIVE_INFINITY;
     return e.hasNode(r.v) !== e.hasNode(r.w) && (o = fe(t, r)), o < n[0] ? [o, r] : n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function xo(e, t, n) {
+function _o(e, t, n) {
   e.nodes().forEach((r) => t.node(r).rank += n);
 }
-var { preorder: ko, postorder: _o } = Ze, So = de;
+var { preorder: So, postorder: No } = Ze, To = de;
 de.initLowLimValues = nt;
 de.initCutValues = tt;
-de.calcCutValue = gn;
-de.leaveEdge = bn;
-de.enterEdge = yn;
-de.exchangeEdges = mn;
+de.calcCutValue = yn;
+de.leaveEdge = mn;
+de.enterEdge = vn;
+de.exchangeEdges = wn;
 function de(e) {
-  e = qr(e), et(e);
-  let t = hn(e);
+  e = Zr(e), et(e);
+  let t = pn(e);
   nt(t), tt(t, e);
   let n, r;
-  for (; n = bn(t); ) r = yn(t, e, n), mn(t, e, n, r);
+  for (; n = mn(t); ) r = vn(t, e, n), wn(t, e, n, r);
 }
 function tt(e, t) {
-  let n = _o(e, e.nodes());
-  n = n.slice(0, n.length - 1), n.forEach((r) => No(e, t, r));
+  let n = No(e, e.nodes());
+  n = n.slice(0, n.length - 1), n.forEach((r) => Co(e, t, r));
 }
-function No(e, t, n) {
+function Co(e, t, n) {
   let r = e.node(n).parent, o = e.edge(n, r);
-  o.cutvalue = gn(e, t, n);
+  o.cutvalue = yn(e, t, n);
 }
-function gn(e, t, n) {
+function yn(e, t, n) {
   let r = e.node(n).parent, o = !0, i = t.edge(n, r), s = 0;
   i || (o = !1, i = t.edge(r, n)), s = i.weight;
   let l = t.nodeEdges(n);
@@ -824,7 +824,7 @@ function gn(e, t, n) {
     let d = a.v === n, c = d ? a.w : a.v;
     if (c !== r) {
       let f = d === o, h = t.edge(a).weight;
-      if (s += f ? h : -h, Co(e, n, c)) {
+      if (s += f ? h : -h, Oo(e, n, c)) {
         let g = e.edge(n, c).cutvalue;
         s += f ? -g : g;
       }
@@ -832,46 +832,46 @@ function gn(e, t, n) {
   }), s;
 }
 function nt(e, t) {
-  arguments.length < 2 && (t = e.nodes()[0]), pn(e, {}, 1, t);
+  arguments.length < 2 && (t = e.nodes()[0]), bn(e, {}, 1, t);
 }
-function pn(e, t, n, r, o) {
+function bn(e, t, n, r, o) {
   let i = n, s = e.node(r);
   t[r] = !0;
   let l = e.neighbors(r);
   return l && l.forEach((a) => {
-    Object.hasOwn(t, a) || (n = pn(e, t, n, a, r));
+    Object.hasOwn(t, a) || (n = bn(e, t, n, a, r));
   }), s.low = i, s.lim = n++, o ? s.parent = o : delete s.parent, n;
 }
-function bn(e) {
+function mn(e) {
   return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function yn(e, t, n) {
+function vn(e, t, n) {
   let r = n.v, o = n.w;
   t.hasEdge(r, o) || (r = n.w, o = n.v);
   let i = e.node(r), s = e.node(o), l = i, a = !1;
   return i.lim > s.lim && (l = s, a = !0), t.edges().filter((d) => a === jt(e, e.node(d.v), l) && a !== jt(e, e.node(d.w), l)).reduce((d, c) => fe(t, c) < fe(t, d) ? c : d);
 }
-function mn(e, t, n, r) {
+function wn(e, t, n, r) {
   let o = n.v, i = n.w;
-  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), nt(e), tt(e, t), To(e, t);
+  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), nt(e), tt(e, t), Io(e, t);
 }
-function To(e, t) {
+function Io(e, t) {
   let n = e.nodes().find((o) => !e.node(o).parent);
   if (!n) return;
-  let r = ko(e, [n]);
+  let r = So(e, [n]);
   r = r.slice(1), r.forEach((o) => {
     let i = e.node(o).parent, s = t.edge(o, i), l = !1;
     s || (s = t.edge(i, o), l = !0), t.node(o).rank = t.node(i).rank + (l ? s.minlen : -s.minlen);
   });
 }
-function Co(e, t, n) {
+function Oo(e, t, n) {
   return e.hasEdge(t, n);
 }
 function jt(e, t, n) {
   return n.low <= t.lim && t.lim <= n.lim;
 }
-var Io = Oo;
-function Oo(e) {
+var Mo = jo;
+function jo(e) {
   let t = e.graph().ranker;
   if (typeof t == "function") return t(e);
   switch (t) {
@@ -879,10 +879,10 @@ function Oo(e) {
       zt(e);
       break;
     case "tight-tree":
-      jo(e);
+      Lo(e);
       break;
     case "longest-path":
-      Mo(e);
+      zo(e);
       break;
     case "none":
       break;
@@ -890,18 +890,18 @@ function Oo(e) {
       zt(e);
   }
 }
-var Mo = et;
-function jo(e) {
-  et(e), hn(e);
+var zo = et;
+function Lo(e) {
+  et(e), pn(e);
 }
 function zt(e) {
-  So(e);
+  To(e);
 }
-var zo = Lo;
-function Lo(e) {
-  let t = Ro(e);
+var Po = Ro;
+function Ro(e) {
+  let t = Ao(e);
   e.graph().dummyChains.forEach((n) => {
-    let r = e.node(n), o = r.edgeObj, i = Po(e, t, o.v, o.w), s = i.path, l = i.lca, a = 0, d = s[a], c = !0;
+    let r = e.node(n), o = r.edgeObj, i = Fo(e, t, o.v, o.w), s = i.path, l = i.lca, a = 0, d = s[a], c = !0;
     for (; n !== o.w; ) {
       if (r = e.node(n), c) {
         for (; (d = s[a]) !== l && e.node(d).maxRank < r.rank; ) a++;
@@ -915,7 +915,7 @@ function Lo(e) {
     }
   });
 }
-function Po(e, t, n, r) {
+function Fo(e, t, n, r) {
   let o = [], i = [], s = Math.min(t[n].low, t[r].low), l = Math.max(t[n].lim, t[r].lim), a;
   a = n;
   do
@@ -925,7 +925,7 @@ function Po(e, t, n, r) {
   for (; (c = e.parent(c)) !== d; ) i.push(c);
   return { path: o.concat(i.reverse()), lca: d };
 }
-function Ro(e) {
+function Ao(e) {
   let t = {}, n = 0;
   function r(o) {
     let i = n;
@@ -933,13 +933,13 @@ function Ro(e) {
   }
   return e.children(Me).forEach(r), t;
 }
-function Fo(e) {
-  let t = ue(e, "root", {}, "_root"), n = Do(e), r = Object.values(n), o = q(Math.max, r) - 1, i = 2 * o + 1;
+function Do(e) {
+  let t = ue(e, "root", {}, "_root"), n = Bo(e), r = Object.values(n), o = q(Math.max, r) - 1, i = 2 * o + 1;
   e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
-  let s = Bo(e) + 1;
-  e.children(Me).forEach((l) => vn(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
+  let s = Wo(e) + 1;
+  e.children(Me).forEach((l) => En(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
 }
-function vn(e, t, n, r, o, i, s) {
+function En(e, t, n, r, o, i, s) {
   var l;
   let a = e.children(s);
   if (!a.length) {
@@ -949,12 +949,12 @@ function vn(e, t, n, r, o, i, s) {
   let d = Ot(e, "_bt"), c = Ot(e, "_bb"), f = e.node(s);
   e.setParent(d, s), f.borderTop = d, e.setParent(c, s), f.borderBottom = c, a.forEach((h) => {
     var g;
-    vn(e, t, n, r, o, i, h);
-    let p = e.node(h), E = p.borderTop ? p.borderTop : h, b = p.borderBottom ? p.borderBottom : h, k = p.borderTop ? r : 2 * r, N = E !== b ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
-    e.setEdge(d, E, { weight: k, minlen: N, nestingEdge: !0 }), e.setEdge(b, c, { weight: k, minlen: N, nestingEdge: !0 });
+    En(e, t, n, r, o, i, h);
+    let p = e.node(h), E = p.borderTop ? p.borderTop : h, y = p.borderBottom ? p.borderBottom : h, k = p.borderTop ? r : 2 * r, N = E !== y ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
+    e.setEdge(d, E, { weight: k, minlen: N, nestingEdge: !0 }), e.setEdge(y, c, { weight: k, minlen: N, nestingEdge: !0 });
   }), e.parent(s) || e.setEdge(t, d, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
 }
-function Do(e) {
+function Bo(e) {
   let t = {};
   function n(r, o) {
     let i = e.children(r);
@@ -962,17 +962,17 @@ function Do(e) {
   }
   return e.children(Me).forEach((r) => n(r, 1)), t;
 }
-function Bo(e) {
+function Wo(e) {
   return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
 }
-function Ao(e) {
+function $o(e) {
   let t = e.graph();
   e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((n) => {
     e.edge(n).nestingEdge && e.removeEdge(n);
   });
 }
-var Wo = $o;
-function $o(e) {
+var Go = Yo;
+function Yo(e) {
   function t(n) {
     let r = e.children(n), o = e.node(n);
     if (r.length && r.forEach(t), Object.hasOwn(o, "minRank")) {
@@ -986,34 +986,34 @@ function Lt(e, t, n, r, o, i) {
   let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], a = ue(e, "border", s, n);
   o[t][i] = a, e.setParent(a, r), l && e.setEdge(l, a, { weight: 1 });
 }
-function Go(e) {
+function Ko(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "lr" || n === "rl") && wn(e);
+  (n === "lr" || n === "rl") && xn(e);
 }
-function Yo(e) {
+function Ho(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "bt" || n === "rl") && Ko(e), (n === "lr" || n === "rl") && (Ho(e), wn(e));
+  (n === "bt" || n === "rl") && Vo(e), (n === "lr" || n === "rl") && (Uo(e), xn(e));
 }
-function wn(e) {
+function xn(e) {
   e.nodes().forEach((t) => Pt(e.node(t))), e.edges().forEach((t) => Pt(e.edge(t)));
 }
 function Pt(e) {
   let t = e.width;
   e.width = e.height, e.height = t;
 }
-function Ko(e) {
-  e.nodes().forEach((t) => Ae(e.node(t))), e.edges().forEach((t) => {
+function Vo(e) {
+  e.nodes().forEach((t) => Be(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
-    (n = r.points) == null || n.forEach(Ae), Object.hasOwn(r, "y") && Ae(r);
+    (n = r.points) == null || n.forEach(Be), Object.hasOwn(r, "y") && Be(r);
   });
 }
-function Ae(e) {
+function Be(e) {
   e.y = -e.y;
 }
-function Ho(e) {
+function Uo(e) {
   e.nodes().forEach((t) => We(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
@@ -1024,8 +1024,8 @@ function We(e) {
   let t = e.x;
   e.x = e.y, e.y = t;
 }
-function Vo(e) {
-  let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = q(Math.max, r), i = ye(o + 1).map(() => []);
+function Xo(e) {
+  let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = q(Math.max, r), i = be(o + 1).map(() => []);
   function s(l) {
     if (t[l]) return;
     t[l] = !0;
@@ -1036,13 +1036,13 @@ function Vo(e) {
   }
   return n.sort((l, a) => e.node(l).rank - e.node(a).rank).forEach(s), i;
 }
-function Uo(e, t) {
+function qo(e, t) {
   let n = 0;
-  for (let r = 1; r < t.length; ++r) n += Xo(e, t[r - 1], t[r]);
+  for (let r = 1; r < t.length; ++r) n += Jo(e, t[r - 1], t[r]);
   return n;
 }
-function Xo(e, t, n) {
-  let r = no(n, n.map((d, c) => c)), o = t.flatMap((d) => {
+function Jo(e, t, n) {
+  let r = oo(n, n.map((d, c) => c)), o = t.flatMap((d) => {
     let c = e.outEdges(d);
     return c ? c.map((f) => ({ pos: r[f.w], weight: e.edge(f).weight })).sort((f, h) => f.pos - h.pos) : [];
   }), i = 1;
@@ -1058,7 +1058,7 @@ function Xo(e, t, n) {
     a += d.weight * f;
   }), a;
 }
-function qo(e, t = []) {
+function Zo(e, t = []) {
   return t.map((n) => {
     let r = e.inEdges(n);
     if (!r || !r.length) return { v: n };
@@ -1071,7 +1071,7 @@ function qo(e, t = []) {
     }
   });
 }
-function Jo(e, t) {
+function Qo(e, t) {
   let n = {};
   e.forEach((o, i) => {
     let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
@@ -1081,13 +1081,13 @@ function Jo(e, t) {
     i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
   });
   let r = Object.values(n).filter((o) => !o.indegree);
-  return Zo(r);
+  return ei(r);
 }
-function Zo(e) {
+function ei(e) {
   let t = [];
   function n(o) {
     return (i) => {
-      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Qo(o, i);
+      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && ti(o, i);
     };
   }
   function r(o) {
@@ -1101,13 +1101,13 @@ function Zo(e) {
   }
   return t.filter((o) => !o.merged).map((o) => Ie(o, ["vs", "i", "barycenter", "weight"]));
 }
-function Qo(e, t) {
+function ti(e, t) {
   let n = 0, r = 0;
   e.weight && (n += e.barycenter * e.weight, r += e.weight), t.weight && (n += t.barycenter * t.weight, r += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = n / r, e.weight = r, e.i = Math.min(t.i, e.i), t.merged = !0;
 }
-function ei(e, t) {
-  let n = eo(e, (c) => Object.hasOwn(c, "barycenter")), r = n.lhs, o = n.rhs.sort((c, f) => f.i - c.i), i = [], s = 0, l = 0, a = 0;
-  r.sort(ti(!!t)), a = Rt(i, o, a), r.forEach((c) => {
+function ni(e, t) {
+  let n = no(e, (c) => Object.hasOwn(c, "barycenter")), r = n.lhs, o = n.rhs.sort((c, f) => f.i - c.i), i = [], s = 0, l = 0, a = 0;
+  r.sort(ri(!!t)), a = Rt(i, o, a), r.forEach((c) => {
     a += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, a = Rt(i, o, a);
   });
   let d = { vs: i.flat(1) };
@@ -1118,22 +1118,22 @@ function Rt(e, t, n) {
   for (; t.length && (r = t[t.length - 1]).i <= n; ) t.pop(), e.push(r.vs), n++;
   return n;
 }
-function ti(e) {
+function ri(e) {
   return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
 }
-function En(e, t, n, r) {
+function kn(e, t, n, r) {
   let o = e.children(t), i = e.node(t), s = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, a = {};
   s && (o = o.filter((h) => h !== s && h !== l));
-  let d = qo(e, o);
+  let d = Zo(e, o);
   d.forEach((h) => {
     if (e.children(h.v).length) {
-      let g = En(e, h.v, n, r);
-      a[h.v] = g, Object.hasOwn(g, "barycenter") && ri(h, g);
+      let g = kn(e, h.v, n, r);
+      a[h.v] = g, Object.hasOwn(g, "barycenter") && ii(h, g);
     }
   });
-  let c = Jo(d, n);
-  ni(c, a);
-  let f = ei(c, r);
+  let c = Qo(d, n);
+  oi(c, a);
+  let f = ni(c, r);
   if (s && l) {
     f.vs = [s, f.vs, l].flat(1);
     let h = e.predecessors(s);
@@ -1144,17 +1144,17 @@ function En(e, t, n, r) {
   }
   return f;
 }
-function ni(e, t) {
+function oi(e, t) {
   e.forEach((n) => {
     n.vs = n.vs.flatMap((r) => t[r] ? t[r].vs : r);
   });
 }
-function ri(e, t) {
+function ii(e, t) {
   e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight) : (e.barycenter = t.barycenter, e.weight = t.weight);
 }
-function oi(e, t, n, r) {
+function si(e, t, n, r) {
   r || (r = e.nodes());
-  let o = ii(e), i = new H({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
+  let o = li(e), i = new H({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
   return r.forEach((s) => {
     let l = e.node(s), a = e.parent(s);
     if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
@@ -1167,12 +1167,12 @@ function oi(e, t, n, r) {
     }
   }), i;
 }
-function ii(e) {
+function li(e) {
   let t;
   for (; e.hasNode(t = Qe("_root")); ) ;
   return t;
 }
-function si(e, t, n) {
+function di(e, t, n) {
   let r = {}, o;
   n.forEach((i) => {
     let s = e.parent(i), l, a;
@@ -1185,20 +1185,20 @@ function si(e, t, n) {
     }
   });
 }
-function xn(e, t = {}) {
+function _n(e, t = {}) {
   if (typeof t.customOrder == "function") {
-    t.customOrder(e, xn);
+    t.customOrder(e, _n);
     return;
   }
-  let n = cn(e), r = Ft(e, ye(1, n + 1), "inEdges"), o = Ft(e, ye(n - 1, -1, -1), "outEdges"), i = Vo(e);
-  if (Dt(e, i), t.disableOptimalOrderHeuristic) return;
+  let n = un(e), r = Ft(e, be(1, n + 1), "inEdges"), o = Ft(e, be(n - 1, -1, -1), "outEdges"), i = Xo(e);
+  if (At(e, i), t.disableOptimalOrderHeuristic) return;
   let s = Number.POSITIVE_INFINITY, l, a = t.constraints || [];
   for (let d = 0, c = 0; c < 4; ++d, ++c) {
-    li(d % 2 ? r : o, d % 4 >= 2, a), i = ve(e);
-    let f = Uo(e, i);
+    ai(d % 2 ? r : o, d % 4 >= 2, a), i = ve(e);
+    let f = qo(e, i);
     f < s ? (c = 0, l = Object.assign({}, i), s = f) : f === s && (l = structuredClone(i));
   }
-  Dt(e, l);
+  At(e, l);
 }
 function Ft(e, t, n) {
   let r = /* @__PURE__ */ new Map(), o = (i, s) => {
@@ -1209,48 +1209,48 @@ function Ft(e, t, n) {
     if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let l = s.minRank; l <= s.maxRank; l++) l !== s.rank && o(l, i);
   }
   return t.map(function(i) {
-    return oi(e, i, n, r.get(i) || []);
+    return si(e, i, n, r.get(i) || []);
   });
 }
-function li(e, t, n) {
+function ai(e, t, n) {
   let r = new H();
   e.forEach(function(o) {
     n.forEach((l) => r.setEdge(l.left, l.right));
-    let i = o.graph().root, s = En(o, i, r, t);
-    s.vs.forEach((l, a) => o.node(l).order = a), si(o, r, s.vs);
+    let i = o.graph().root, s = kn(o, i, r, t);
+    s.vs.forEach((l, a) => o.node(l).order = a), di(o, r, s.vs);
   });
 }
-function Dt(e, t) {
+function At(e, t) {
   Object.values(t).forEach((n) => n.forEach((r, o) => e.node(r).order = o));
 }
-function di(e, t) {
+function ci(e, t) {
   let n = {};
   function r(o, i) {
     let s = 0, l = 0, a = o.length, d = i[i.length - 1];
     return i.forEach((c, f) => {
-      let h = ci(e, c), g = h ? e.node(h).order : a;
+      let h = ui(e, c), g = h ? e.node(h).order : a;
       (h || c === d) && (i.slice(l, f + 1).forEach((p) => {
         let E = e.predecessors(p);
-        E && E.forEach((b) => {
-          let k = e.node(b), N = k.order;
-          (N < s || g < N) && !(k.dummy && e.node(p).dummy) && kn(n, b, p);
+        E && E.forEach((y) => {
+          let k = e.node(y), N = k.order;
+          (N < s || g < N) && !(k.dummy && e.node(p).dummy) && Sn(n, y, p);
         });
       }), l = f + 1, s = g);
     }), i;
   }
   return t.length && t.reduce(r), n;
 }
-function ai(e, t) {
+function fi(e, t) {
   let n = {};
   function r(i, s, l, a, d) {
-    ye(s, l).forEach((c) => {
+    be(s, l).forEach((c) => {
       let f = i[c];
       if (f !== void 0 && e.node(f).dummy) {
         let h = e.predecessors(f);
         h && h.forEach((g) => {
           if (g === void 0) return;
           let p = e.node(g);
-          p.dummy && (p.order < a || p.order > d) && kn(n, g, f);
+          p.dummy && (p.order < a || p.order > d) && Sn(n, g, f);
         });
       }
     });
@@ -1271,13 +1271,13 @@ function ai(e, t) {
   }
   return t.length && t.reduce(o), n;
 }
-function ci(e, t) {
+function ui(e, t) {
   if (e.node(t).dummy) {
     let n = e.predecessors(t);
     if (n) return n.find((r) => e.node(r).dummy);
   }
 }
-function kn(e, t, n) {
+function Sn(e, t, n) {
   if (t > n) {
     let o = t;
     t = n, n = o;
@@ -1285,7 +1285,7 @@ function kn(e, t, n) {
   let r = e[t];
   r || (e[t] = r = {}), r[n] = !0;
 }
-function fi(e, t, n) {
+function hi(e, t, n) {
   if (t > n) {
     let o = t;
     t = n, n = o;
@@ -1293,7 +1293,7 @@ function fi(e, t, n) {
   let r = e[t];
   return r !== void 0 && Object.hasOwn(r, n);
 }
-function ui(e, t, n, r) {
+function gi(e, t, n, r) {
   let o = {}, i = {}, s = {};
   return t.forEach((l) => {
     l.forEach((a, d) => {
@@ -1305,30 +1305,30 @@ function ui(e, t, n, r) {
       let c = r(d);
       if (c && c.length) {
         let f = c.sort((g, p) => {
-          let E = s[g], b = s[p];
-          return (E !== void 0 ? E : 0) - (b !== void 0 ? b : 0);
+          let E = s[g], y = s[p];
+          return (E !== void 0 ? E : 0) - (y !== void 0 ? y : 0);
         }), h = (f.length - 1) / 2;
         for (let g = Math.floor(h), p = Math.ceil(h); g <= p; ++g) {
           let E = f[g];
           if (E === void 0) continue;
-          let b = s[E];
-          if (b !== void 0 && i[d] === d && a < b && !fi(n, d, E)) {
+          let y = s[E];
+          if (y !== void 0 && i[d] === d && a < y && !hi(n, d, E)) {
             let k = o[E];
-            k !== void 0 && (i[E] = d, i[d] = o[d] = k, a = b);
+            k !== void 0 && (i[E] = d, i[d] = o[d] = k, a = y);
           }
         }
       }
     });
   }), { root: o, align: i };
 }
-function hi(e, t, n, r, o = !1) {
-  let i = {}, s = gi(e, t, n, o), l = o ? "borderLeft" : "borderRight";
+function pi(e, t, n, r, o = !1) {
+  let i = {}, s = yi(e, t, n, o), l = o ? "borderLeft" : "borderRight";
   function a(g, p) {
-    let E = s.nodes().slice(), b = {}, k = E.pop();
+    let E = s.nodes().slice(), y = {}, k = E.pop();
     for (; k; ) {
-      if (b[k]) g(k);
+      if (y[k]) g(k);
       else {
-        b[k] = !0, E.push(k);
+        y[k] = !0, E.push(k);
         for (let N of p(k)) E.push(N);
       }
       k = E.pop();
@@ -1336,9 +1336,9 @@ function hi(e, t, n, r, o = !1) {
   }
   function d(g) {
     let p = s.inEdges(g);
-    p ? i[g] = p.reduce((E, b) => {
+    p ? i[g] = p.reduce((E, y) => {
       var k;
-      let N = (k = i[b.v]) != null ? k : 0, O = s.edge(b);
+      let N = (k = i[y.v]) != null ? k : 0, O = s.edge(y);
       return Math.max(E, N + (O !== void 0 ? O : 0));
     }, 0) : i[g] = 0;
   }
@@ -1348,8 +1348,8 @@ function hi(e, t, n, r, o = !1) {
       let O = i[N.w], j = s.edge(N);
       return Math.min(k, (O !== void 0 ? O : 0) - (j !== void 0 ? j : 0));
     }, Number.POSITIVE_INFINITY));
-    let b = e.node(g);
-    E !== Number.POSITIVE_INFINITY && b.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, E));
+    let y = e.node(g);
+    E !== Number.POSITIVE_INFINITY && y.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, E));
   }
   function f(g) {
     return s.predecessors(g) || [];
@@ -1363,8 +1363,8 @@ function hi(e, t, n, r, o = !1) {
     E !== void 0 && (i[g] = (p = i[E]) != null ? p : 0);
   }), i;
 }
-function gi(e, t, n, r) {
-  let o = new H(), i = e.graph(), s = vi(i.nodesep, i.edgesep, r);
+function yi(e, t, n, r) {
+  let o = new H(), i = e.graph(), s = Ei(i.nodesep, i.edgesep, r);
   return t.forEach((l) => {
     let a;
     l.forEach((d) => {
@@ -1382,18 +1382,18 @@ function gi(e, t, n, r) {
     });
   }), o;
 }
-function pi(e, t) {
+function bi(e, t) {
   return Object.values(t).reduce((n, r) => {
     let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
     Object.entries(r).forEach(([l, a]) => {
-      let d = wi(e, l) / 2;
+      let d = xi(e, l) / 2;
       o = Math.max(a + d, o), i = Math.min(a - d, i);
     });
     let s = o - i;
     return s < n[0] && (n = [s, r]), n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function bi(e, t) {
+function mi(e, t) {
   let n = Object.values(t), r = q(Math.min, n), o = q(Math.max, n);
   ["u", "d"].forEach((i) => {
     ["l", "r"].forEach((s) => {
@@ -1404,7 +1404,7 @@ function bi(e, t) {
     });
   });
 }
-function yi(e, t = void 0) {
+function vi(e, t = void 0) {
   let n = e.ul;
   return n ? Oe(n, (r, o) => {
     var i, s;
@@ -1419,19 +1419,19 @@ function yi(e, t = void 0) {
     return (((i = l[1]) != null ? i : 0) + ((s = l[2]) != null ? s : 0)) / 2;
   }) : {};
 }
-function mi(e) {
-  let t = ve(e), n = Object.assign(di(e, t), ai(e, t)), r = {}, o;
+function wi(e) {
+  let t = ve(e), n = Object.assign(ci(e, t), fi(e, t)), r = {}, o;
   ["u", "d"].forEach((s) => {
     o = s === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
       l === "r" && (o = o.map((c) => Object.values(c).reverse()));
-      let a = ui(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), d = hi(e, o, a.root, a.align, l === "r");
+      let a = gi(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), d = pi(e, o, a.root, a.align, l === "r");
       l === "r" && (d = Oe(d, (c) => -c)), r[s + l] = d;
     });
   });
-  let i = pi(e, r);
-  return bi(r, i), yi(r, e.graph().align);
+  let i = bi(e, r);
+  return mi(r, i), vi(r, e.graph().align);
 }
-function vi(e, t, n) {
+function Ei(e, t, n) {
   return (r, o, i) => {
     let s = r.node(o), l = r.node(i), a = 0, d;
     if (a += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
@@ -1453,13 +1453,13 @@ function vi(e, t, n) {
     return d && (a += n ? d : -d), a;
   };
 }
-function wi(e, t) {
+function xi(e, t) {
   return e.node(t).width;
 }
-function Ei(e) {
-  e = dn(e), xi(e), Object.entries(mi(e)).forEach(([t, n]) => e.node(t).x = n);
+function ki(e) {
+  e = cn(e), _i(e), Object.entries(wi(e)).forEach(([t, n]) => e.node(t).x = n);
 }
-function xi(e) {
+function _i(e) {
   let t = ve(e), n = e.graph(), r = n.ranksep, o = n.rankalign, i = 0;
   t.forEach((s) => {
     let l = s.reduce((a, d) => {
@@ -1473,17 +1473,17 @@ function xi(e) {
     }), i += l + r;
   });
 }
-function ki(e, t = {}) {
-  let n = t.debugTiming ? fn : un;
+function Si(e, t = {}) {
+  let n = t.debugTiming ? hn : gn;
   return n("layout", () => {
-    let r = n("  buildLayoutGraph", () => zi(e));
-    return n("  runLayout", () => _i(r, n, t)), n("  updateInputGraph", () => Si(e, r)), r;
+    let r = n("  buildLayoutGraph", () => Pi(e));
+    return n("  runLayout", () => Ni(r, n, t)), n("  updateInputGraph", () => Ti(e, r)), r;
   });
 }
-function _i(e, t, n) {
-  t("    makeSpaceForEdgeLabels", () => Li(e)), t("    removeSelfEdges", () => Gi(e)), t("    acyclic", () => ho(e)), t("    nestingGraph.run", () => Fo(e)), t("    rank", () => Io(dn(e))), t("    injectEdgeLabelProxies", () => Pi(e)), t("    removeEmptyRanks", () => Zr(e)), t("    nestingGraph.cleanup", () => Ao(e)), t("    normalizeRanks", () => Jr(e)), t("    assignRankMinMax", () => Ri(e)), t("    removeEdgeLabelProxies", () => Fi(e)), t("    normalize.run", () => bo(e)), t("    parentDummyChains", () => zo(e)), t("    addBorderSegments", () => Wo(e)), t("    order", () => xn(e, n)), t("    insertSelfEdges", () => Yi(e)), t("    adjustCoordinateSystem", () => Go(e)), t("    position", () => Ei(e)), t("    positionSelfEdges", () => Ki(e)), t("    removeBorderNodes", () => $i(e)), t("    normalize.undo", () => mo(e)), t("    fixupEdgeLabelCoords", () => Ai(e)), t("    undoCoordinateSystem", () => Yo(e)), t("    translateGraph", () => Di(e)), t("    assignNodeIntersects", () => Bi(e)), t("    reversePoints", () => Wi(e)), t("    acyclic.undo", () => po(e));
+function Ni(e, t, n) {
+  t("    makeSpaceForEdgeLabels", () => Ri(e)), t("    removeSelfEdges", () => Ki(e)), t("    acyclic", () => po(e)), t("    nestingGraph.run", () => Do(e)), t("    rank", () => Mo(cn(e))), t("    injectEdgeLabelProxies", () => Fi(e)), t("    removeEmptyRanks", () => eo(e)), t("    nestingGraph.cleanup", () => $o(e)), t("    normalizeRanks", () => Qr(e)), t("    assignRankMinMax", () => Ai(e)), t("    removeEdgeLabelProxies", () => Di(e)), t("    normalize.run", () => mo(e)), t("    parentDummyChains", () => Po(e)), t("    addBorderSegments", () => Go(e)), t("    order", () => _n(e, n)), t("    insertSelfEdges", () => Hi(e)), t("    adjustCoordinateSystem", () => Ko(e)), t("    position", () => ki(e)), t("    positionSelfEdges", () => Vi(e)), t("    removeBorderNodes", () => Yi(e)), t("    normalize.undo", () => wo(e)), t("    fixupEdgeLabelCoords", () => $i(e)), t("    undoCoordinateSystem", () => Ho(e)), t("    translateGraph", () => Bi(e)), t("    assignNodeIntersects", () => Wi(e)), t("    reversePoints", () => Gi(e)), t("    acyclic.undo", () => bo(e));
 }
-function Si(e, t) {
+function Ti(e, t) {
   e.nodes().forEach((n) => {
     let r = e.node(n), o = t.node(n);
     r && (r.x = o.x, r.y = o.y, r.order = o.order, r.rank = o.rank, t.children(n).length && (r.width = o.width, r.height = o.height));
@@ -1492,29 +1492,29 @@ function Si(e, t) {
     r.points = o.points, Object.hasOwn(o, "x") && (r.x = o.x, r.y = o.y);
   }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
 }
-var Ni = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Ti = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, Ci = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Ii = ["width", "height", "rank"], Bt = { width: 0, height: 0 }, Oi = ["minlen", "weight", "width", "height", "labeloffset"], Mi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, ji = ["labelpos"];
-function zi(e) {
+var Ci = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Ii = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, Oi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Mi = ["width", "height", "rank"], Dt = { width: 0, height: 0 }, ji = ["minlen", "weight", "width", "height", "labeloffset"], zi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Li = ["labelpos"];
+function Pi(e) {
   let t = new H({ multigraph: !0, compound: !0 }), n = Ge(e.graph());
-  return t.setGraph(Object.assign({}, Ti, $e(n, Ni), Ie(n, Ci))), e.nodes().forEach((r) => {
-    let o = Ge(e.node(r)), i = $e(o, Ii);
-    Object.keys(Bt).forEach((l) => {
-      i[l] === void 0 && (i[l] = Bt[l]);
+  return t.setGraph(Object.assign({}, Ii, $e(n, Ci), Ie(n, Oi))), e.nodes().forEach((r) => {
+    let o = Ge(e.node(r)), i = $e(o, Mi);
+    Object.keys(Dt).forEach((l) => {
+      i[l] === void 0 && (i[l] = Dt[l]);
     }), t.setNode(r, i);
     let s = e.parent(r);
     s !== void 0 && t.setParent(r, s);
   }), e.edges().forEach((r) => {
     let o = Ge(e.edge(r));
-    t.setEdge(r, Object.assign({}, Mi, $e(o, Oi), Ie(o, ji)));
+    t.setEdge(r, Object.assign({}, zi, $e(o, ji), Ie(o, Li)));
   }), t;
 }
-function Li(e) {
+function Ri(e) {
   let t = e.graph();
   t.ranksep /= 2, e.edges().forEach((n) => {
     let r = e.edge(n);
     r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
   });
 }
-function Pi(e) {
+function Fi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.width && n.height) {
@@ -1523,14 +1523,14 @@ function Pi(e) {
     }
   });
 }
-function Ri(e) {
+function Ai(e) {
   let t = 0;
   e.nodes().forEach((n) => {
     let r = e.node(n);
     r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = Math.max(t, r.maxRank));
   }), e.graph().maxRank = t;
 }
-function Fi(e) {
+function Di(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     if (n.dummy === "edge-proxy") {
@@ -1539,7 +1539,7 @@ function Fi(e) {
     }
   });
 }
-function Di(e) {
+function Bi(e) {
   let t = Number.POSITIVE_INFINITY, n = 0, r = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, l = i.marginy || 0;
   function a(d) {
     let c = d.x, f = d.y, h = d.width, g = d.height;
@@ -1558,13 +1558,13 @@ function Di(e) {
     }), Object.hasOwn(c, "x") && (c.x -= t), Object.hasOwn(c, "y") && (c.y -= r);
   }), i.width = n - t + s, i.height = o - r + l;
 }
-function Bi(e) {
+function Wi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t), r = e.node(t.v), o = e.node(t.w), i, s;
     n.points ? (i = n.points[0], s = n.points[n.points.length - 1]) : (n.points = [], i = o, s = r), n.points.unshift(It(r, i)), n.points.push(It(o, s));
   });
 }
-function Ai(e) {
+function $i(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (Object.hasOwn(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
@@ -1577,13 +1577,13 @@ function Ai(e) {
     }
   });
 }
-function Wi(e) {
+function Gi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     n.reversed && n.points.reverse();
   });
 }
-function $i(e) {
+function Yi(e) {
   e.nodes().forEach((t) => {
     if (e.children(t).length) {
       let n = e.node(t), r = e.node(n.borderTop), o = e.node(n.borderBottom), i = e.node(n.borderLeft[n.borderLeft.length - 1]), s = e.node(n.borderRight[n.borderRight.length - 1]);
@@ -1593,7 +1593,7 @@ function $i(e) {
     e.node(t).dummy === "border" && e.removeNode(t);
   });
 }
-function Gi(e) {
+function Ki(e) {
   e.edges().forEach((t) => {
     if (t.v === t.w) {
       let n = e.node(t.v);
@@ -1601,7 +1601,7 @@ function Gi(e) {
     }
   });
 }
-function Yi(e) {
+function Hi(e) {
   ve(e).forEach((t) => {
     let n = 0;
     t.forEach((r, o) => {
@@ -1612,7 +1612,7 @@ function Yi(e) {
     });
   });
 }
-function Ki(e) {
+function Vi(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     if (n.dummy === "selfedge") {
@@ -1630,7 +1630,7 @@ function Ge(e) {
     typeof n == "string" && (n = n.toLowerCase()), t[n] = r;
   }), t;
 }
-function Hi(e) {
+function Ui(e) {
   let t = ve(e), n = new H({ compound: !0, multigraph: !0 }).setGraph({});
   return e.nodes().forEach((r) => {
     n.setNode(r, { label: r }), n.setParent(r, "layer" + e.node(r).rank);
@@ -1639,15 +1639,15 @@ function Hi(e) {
     n.setNode(i, { rank: "same" }), r.reduce((s, l) => (n.setEdge(s, l, { style: "invis" }), l));
   }), n;
 }
-var Vi = { graphlib: Zt, version: ro, layout: ki, debug: Hi, util: { time: fn, notime: un } }, At = Vi;
+var Xi = { graphlib: en, version: io, layout: Si, debug: Ui, util: { time: hn, notime: gn } }, Bt = Xi;
 /*! For license information please see dagre.esm.js.LEGAL.txt */
-const Ui = (e) => {
+const qi = (e) => {
   const t = [];
   return e.nodeInternals.forEach((n, r) => t.push(`${r}:${n.height ?? 0}`)), t.join(",");
-}, Xi = ({ onHeightsReady: e, nodeCount: t }) => {
-  const n = Bn(Ui), r = _t("");
+}, Ji = ({ onHeightsReady: e, nodeCount: t }) => {
+  const n = Wn(qi), r = _t("");
   _t(0);
-  const { fitView: o } = An();
+  const { fitView: o } = $n();
   return re(() => {
     if (!n || n === r.current) return;
     const i = {};
@@ -1657,13 +1657,13 @@ const Ui = (e) => {
     }
     Object.keys(i).length !== 0 && (r.current = n, e(i));
   }, [n]), null;
-}, qi = {
+}, Zi = {
   gray: { bg: "#f1f5f9", fg: "#475569" },
   green: { bg: "#dcfce7", fg: "#166534" },
   amber: { bg: "#fef3c7", fg: "#92400e" },
   red: { bg: "#fee2e2", fg: "#991b1b" }
 };
-function Ji({
+function Qi({
   workflowName: e,
   onWorkflowNameChange: t,
   status: n,
@@ -1673,8 +1673,8 @@ function Ji({
   saveLabel: s = "Save",
   saveDisabled: l = !1
 }) {
-  const [a, d] = B.useState(!1), [c, f] = B.useState(!1), [h, g] = B.useState(e ?? "");
-  B.useEffect(() => {
+  const [a, d] = D.useState(!1), [c, f] = D.useState(!1), [h, g] = D.useState(e ?? "");
+  D.useEffect(() => {
     g(e ?? "");
   }, [e]);
   const p = async () => {
@@ -1686,7 +1686,7 @@ function Ji({
         d(!1);
       }
     }
-  }, E = qi[r] ?? {
+  }, E = Zi[r] ?? {
     bg: r,
     fg: "#fff"
   };
@@ -1708,12 +1708,12 @@ function Ji({
             "input",
             {
               value: h,
-              onChange: (b) => g(b.target.value),
+              onChange: (y) => g(y.target.value),
               onBlur: () => {
                 f(!1), h !== e && t(h);
               },
-              onKeyDown: (b) => {
-                b.key === "Enter" && b.target.blur(), b.key === "Escape" && (g(e ?? ""), f(!1));
+              onKeyDown: (y) => {
+                y.key === "Enter" && y.target.blur(), y.key === "Escape" && (g(e ?? ""), f(!1));
               },
               autoFocus: !0,
               style: {
@@ -1816,15 +1816,15 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   const [l, a] = M(!1), d = () => a((h) => !h), c = () => /* @__PURE__ */ v(Q, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
     r && /* @__PURE__ */ u(Q, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" }, children: r }),
     /* @__PURE__ */ u("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 500, color: "#212121" }, children: n }),
-    /* @__PURE__ */ u(St, { onClick: d, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(br, {}) : /* @__PURE__ */ u(yr, {}) }),
-    /* @__PURE__ */ u(St, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(tr, {}) })
+    /* @__PURE__ */ u(St, { onClick: d, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(mr, {}) : /* @__PURE__ */ u(vr, {}) }),
+    /* @__PURE__ */ u(St, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(rr, {}) })
   ] }), f = () => i ? /* @__PURE__ */ u(Q, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
-  return l ? /* @__PURE__ */ v(Jn, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
+  return l ? /* @__PURE__ */ v(Qn, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
     /* @__PURE__ */ u(c, {}),
     /* @__PURE__ */ u(Q, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
     /* @__PURE__ */ u(f, {})
   ] }) : /* @__PURE__ */ v(
-    Zn,
+    er,
     {
       anchor: "right",
       open: e,
@@ -1854,7 +1854,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ]
     }
   );
-}, Zi = ({
+}, es = ({
   open: e,
   templates: t,
   messages: n,
@@ -1862,7 +1862,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   onClose: o,
   loadTriggerSources: i
 }) => {
-  const [s, l] = M("trigger"), [a, d] = M(null), [c, f] = M([]), [h, g] = M([]), [p, E] = M(!1), [b, k] = M(null);
+  const [s, l] = M("trigger"), [a, d] = M(null), [c, f] = M([]), [h, g] = M([]), [p, E] = M(!1), [y, k] = M(null);
   re(() => {
     e || (l("trigger"), d(null), f([]), g([]), E(!1), k(null));
   }, [e]);
@@ -1873,14 +1873,14 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
     }
     d(L), E(!0), k(null);
     try {
-      const D = await i(L.triggerKey);
-      if (!D || D.length === 0) {
+      const A = await i(L.triggerKey);
+      if (!A || A.length === 0) {
         r(L);
         return;
       }
-      f(D), l("sources");
-    } catch (D) {
-      k(D instanceof Error ? D.message : "Failed to load sources.");
+      f(A), l("sources");
+    } catch (A) {
+      k(A instanceof Error ? A.message : "Failed to load sources.");
     } finally {
       E(!1);
     }
@@ -1888,7 +1888,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
     l("trigger"), d(null), f([]), g([]), k(null);
   }, j = () => {
     a && r(a, h);
-  }, z = s === "sources" && a, W = z ? /* @__PURE__ */ v(be, { children: [
+  }, z = s === "sources" && a, W = z ? /* @__PURE__ */ v(ye, { children: [
     /* @__PURE__ */ u(Ne, { type: "button", variant: "outlined", size: "small", onClick: O, children: n.cancel ?? "Back" }),
     /* @__PURE__ */ u(
       Ne,
@@ -1908,11 +1908,11 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: o,
       title: z ? a.label : n.addTriggerTitle,
-      icon: /* @__PURE__ */ u(pr, {}),
+      icon: /* @__PURE__ */ u(br, {}),
       width: 500,
       footer: W,
       children: /* @__PURE__ */ v(Q, { sx: { p: 2 }, children: [
-        !z && /* @__PURE__ */ v(be, { children: [
+        !z && /* @__PURE__ */ v(ye, { children: [
           /* @__PURE__ */ u("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: n.chooseTrigger }),
           /* @__PURE__ */ v("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: [
             t.map((L) => /* @__PURE__ */ v(
@@ -1923,17 +1923,17 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
                 onClick: () => !p && N(L),
                 role: "button",
                 tabIndex: 0,
-                onKeyDown: (D) => {
-                  D.key === "Enter" && !p && N(L);
+                onKeyDown: (A) => {
+                  A.key === "Enter" && !p && N(L);
                 },
-                onMouseEnter: (D) => {
-                  p || (D.currentTarget.style.background = "#f5f5f5");
+                onMouseEnter: (A) => {
+                  p || (A.currentTarget.style.background = "#f5f5f5");
                 },
-                onMouseLeave: (D) => {
-                  D.currentTarget.style.background = "";
+                onMouseLeave: (A) => {
+                  A.currentTarget.style.background = "";
                 },
                 children: [
-                  /* @__PURE__ */ u("div", { style: { color: L.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: L.triggerCategory === "scheduler" ? /* @__PURE__ */ u(nr, { size: 18 }) : /* @__PURE__ */ u(rr, { size: 18 }) }),
+                  /* @__PURE__ */ u("div", { style: { color: L.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: L.triggerCategory === "scheduler" ? /* @__PURE__ */ u(or, { size: 18 }) : /* @__PURE__ */ u(ir, { size: 18 }) }),
                   /* @__PURE__ */ v("div", { children: [
                     /* @__PURE__ */ u("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: L.label }),
                     L.description && /* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: L.description })
@@ -1945,12 +1945,12 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
             t.length === 0 && /* @__PURE__ */ u("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 }, children: n.noTriggers })
           ] }),
           p && /* @__PURE__ */ v(Q, { sx: { display: "flex", alignItems: "center", gap: 1, mt: 2, fontSize: 12, color: "#64748b" }, children: [
-            /* @__PURE__ */ u(Qn, { size: 14 }),
+            /* @__PURE__ */ u(tr, { size: 14 }),
             /* @__PURE__ */ u("span", { children: "Loading sources for the selected trigger…" })
           ] }),
-          b && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: b })
+          y && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: y })
         ] }),
-        z && /* @__PURE__ */ v(be, { children: [
+        z && /* @__PURE__ */ v(ye, { children: [
           /* @__PURE__ */ v(
             "div",
             {
@@ -1963,7 +1963,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
               className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
               style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
               children: [
-                /* @__PURE__ */ u(Kt, { size: 16 }),
+                /* @__PURE__ */ u(Vt, { size: 16 }),
                 /* @__PURE__ */ u("span", { children: n.addTriggerTitle })
               ]
             }
@@ -1974,7 +1974,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
             ":"
           ] }),
           /* @__PURE__ */ u(
-            er,
+            nr,
             {
               isMulti: !0,
               options: c,
@@ -1983,7 +1983,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
               placeholder: "Select sources…",
               menuPosition: "fixed",
               menuPortalTarget: typeof document < "u" ? document.body : void 0,
-              styles: mr(!1, !0)
+              styles: wr(!1, !0)
             }
           )
         ] })
@@ -1993,7 +1993,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
 }, Ye = {
   cursor: "pointer",
   transition: "background 0.15s"
-}, Ke = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Qi = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
+}, Ke = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", ts = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
   const { apps: i, ungrouped: s } = K(() => {
     const f = /* @__PURE__ */ new Map(), h = [];
     for (const g of t)
@@ -2022,7 +2022,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: o,
       title: c ? n.addStepTitle : d.label,
-      icon: c ? /* @__PURE__ */ u(or, {}) : d.icon ?? /* @__PURE__ */ u(ir, {}),
+      icon: c ? /* @__PURE__ */ u(sr, {}) : d.icon ?? /* @__PURE__ */ u(lr, {}),
       width: 500,
       children: /* @__PURE__ */ v(Q, { sx: { p: 2 }, children: [
         !c && /* @__PURE__ */ v(
@@ -2037,13 +2037,13 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
             className: "ff-d-flex ff-align-items-center ff-gap-1 ff-mb-3",
             style: { cursor: "pointer", color: "#0066cc", fontSize: 13, fontWeight: 500, width: "fit-content" },
             children: [
-              /* @__PURE__ */ u(Kt, { size: 16 }),
+              /* @__PURE__ */ u(Vt, { size: 16 }),
               /* @__PURE__ */ u("span", { children: n.addStepTitle })
             ]
           }
         ),
         /* @__PURE__ */ u("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: c ? n.chooseAction : `Pick an action from ${d.label}` }),
-        /* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ v(be, { children: [
+        /* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ v(ye, { children: [
           i.map((f) => /* @__PURE__ */ v(
             "div",
             {
@@ -2067,7 +2067,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
                   /* @__PURE__ */ u("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: f.label }),
                   /* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: f.description ?? `${f.descriptors.length} action${f.descriptors.length === 1 ? "" : "s"}` })
                 ] }),
-                /* @__PURE__ */ u(Ht, { size: 18, color: "#9e9e9e" })
+                /* @__PURE__ */ u(Ut, { size: 18, color: "#9e9e9e" })
               ]
             },
             `app-${f.key}`
@@ -2127,26 +2127,36 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, Wt = "_conditionConfig", es = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: s }) => {
-  const [l, a] = M([]), [d, c] = M(!1), [f, h] = M(null), [g, p] = M({});
+}, Wt = "_conditionConfig";
+function $t(e) {
+  return Array.isArray(e) ? { layout: "flat", fields: e } : e && typeof e == "object" ? e : { layout: "flat", fields: [] };
+}
+function Gt(e) {
+  return e.layout === "stepper" ? Array.isArray(e.steps) && e.steps.some((t) => {
+    var n;
+    return ((n = t.fields) == null ? void 0 : n.length) > 0;
+  }) : Array.isArray(e.fields) && e.fields.length > 0;
+}
+const ns = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: s }) => {
+  const [l, a] = M({ layout: "flat", fields: [] }), [d, c] = M(!1), [f, h] = M(null), [g, p] = M({});
   re(() => {
     p((r == null ? void 0 : r[Wt]) ?? {});
   }, [r, t]), re(() => {
     let N = !1;
     if (h(null), !n || !t) {
-      a([]), c(!1);
+      a({ layout: "flat", fields: [] }), c(!1);
       return;
     }
     const O = n.formSchema;
     return typeof O == "function" ? (c(!0), O(t).then((j) => {
-      N || (a(j), c(!1));
+      N || (a($t(j)), c(!1));
     }).catch((j) => {
-      N || (a([]), h(j instanceof Error ? j.message : "Unable to load configuration."), c(!1));
-    })) : (a(O), c(!1)), () => {
+      N || (a({ layout: "flat", fields: [] }), h(j instanceof Error ? j.message : "Unable to load configuration."), c(!1));
+    })) : (a($t(O)), c(!1)), () => {
       N = !0;
     };
   }, [n, t]);
-  const E = t ? `node-config-form-${t}` : "node-config-form", b = !d && !f && l.length > 0, k = b ? /* @__PURE__ */ v(be, { children: [
+  const E = t ? `node-config-form-${t}` : "node-config-form", y = !d && !f && Gt(l), k = y ? /* @__PURE__ */ v(ye, { children: [
     /* @__PURE__ */ u(Ne, { type: "button", variant: "outlined", size: "small", onClick: s, children: o.cancel }),
     /* @__PURE__ */ u(Ne, { type: "submit", form: E, variant: "contained", size: "small", children: o.save })
   ] }) : null;
@@ -2162,11 +2172,11 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       children: /* @__PURE__ */ v(Q, { sx: { p: 2 }, children: [
         d && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
         !d && f && /* @__PURE__ */ u("p", { style: { fontSize: 13, color: "#d32f2f" }, children: f }),
-        !d && !f && l.length === 0 && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
-        b && /* @__PURE__ */ u(
-          vr,
+        !d && !f && !Gt(l) && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
+        y && /* @__PURE__ */ u(
+          Er,
           {
-            schema: { layout: "flat", fields: l },
+            schema: l,
             initialValues: r ?? {},
             formId: E,
             conditionConfig: g,
@@ -2181,7 +2191,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, ts = ({
+}, rs = ({
   isOpen: e,
   onClose: t,
   workflowId: n,
@@ -2201,7 +2211,7 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: t,
       title: r ? `Preview: ${r}` : "Sub-Workflow Preview",
-      icon: /* @__PURE__ */ u(lr, { size: 18, color: "#00695c" }),
+      icon: /* @__PURE__ */ u(ar, { size: 18, color: "#00695c" }),
       width: 700,
       children: /* @__PURE__ */ v("div", { style: { height: "100%", display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", padding: 24 }, children: [
         i.status === "idle" && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", fontSize: 14 }, children: "Select a workflow to preview" }),
@@ -2211,18 +2221,18 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
           /* @__PURE__ */ u("style", { children: "@keyframes spin { to { transform: rotate(360deg); } }" })
         ] }),
         i.status === "error" && /* @__PURE__ */ v("div", { style: { textAlign: "center", color: "#c62828" }, children: [
-          /* @__PURE__ */ u(sr, { size: 32, style: { marginBottom: 8 } }),
+          /* @__PURE__ */ u(dr, { size: 32, style: { marginBottom: 8 } }),
           /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: i.message })
         ] }),
-        i.status === "loaded" && /* @__PURE__ */ u("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ u(ns, { state: i.state }) })
+        i.status === "loaded" && /* @__PURE__ */ u("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ u(os, { state: i.state }) })
       ] })
     }
   );
-}, ns = ({ state: e }) => {
+}, os = ({ state: e }) => {
   const [t, n] = M(null), [r, o] = M(null);
   return re(() => {
     Promise.all([
-      Promise.resolve().then(() => ds).then((i) => i.default),
+      Promise.resolve().then(() => cs).then((i) => i.default),
       import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
       import("./templateRegistry.js").then((i) => i.templateRegistry)
     ]).then(([i, s, l]) => {
@@ -2247,48 +2257,48 @@ const je = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   approvalNode: 90,
   delayNode: 80,
   notificationNode: 80
-}, rs = {
-  plusEdge: Xn,
-  labelPlusEdge: Un,
-  plainEdge: Vn,
-  edgeWithPlusLabel: Hn,
-  gatewayBranchEdge: Kn
+}, is = {
+  plusEdge: Jn,
+  labelPlusEdge: qn,
+  plainEdge: Xn,
+  edgeWithPlusLabel: Un,
+  gatewayBranchEdge: Vn
 };
-function $t() {
+function Yt() {
   return [
     { id: "start", kind: "start", reactFlowType: "startNode" },
     { id: "addTrigger", kind: "addTrigger", reactFlowType: "addTriggerNode" },
     { id: "end", kind: "end", reactFlowType: "endNode" }
   ];
 }
-function os(e, t, n, r = "TB") {
-  const o = new At.graphlib.Graph();
+function ss(e, t, n, r = "TB") {
+  const o = new Bt.graphlib.Graph();
   return o.setGraph({ rankdir: r, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
     const s = n[i.id] ?? { width: me, height: qe[i.type ?? ""] ?? 80 };
     o.setNode(i.id, { width: s.width, height: s.height });
-  }), t.forEach((i) => o.setEdge(i.source, i.target)), At.layout(o), e.map((i) => {
+  }), t.forEach((i) => o.setEdge(i.source, i.target)), Bt.layout(o), e.map((i) => {
     var d, c;
     const s = o.node(i.id), l = ((d = n[i.id]) == null ? void 0 : d.width) ?? me, a = ((c = n[i.id]) == null ? void 0 : c.height) ?? qe[i.type ?? ""] ?? 80;
     return { ...i, position: { x: s.x - l / 2, y: s.y - a / 2 } };
   });
 }
 const le = (e) => e === "filter" || e === "approval";
-function is(e, t, n, r) {
+function ls(e, t, n, r) {
   const s = Ue, l = 30, a = 30, d = {}, c = {}, f = /* @__PURE__ */ new Map();
-  for (const b of e) f.set(b.id, b);
-  for (const b of Object.values(t))
-    for (const k of Object.values(b))
+  for (const y of e) f.set(y.id, y);
+  for (const y of Object.values(t))
+    for (const k of Object.values(y))
       for (const N of k) f.set(N.id, N);
-  const h = (b, k, N) => {
-    const O = r[b] ?? { width: me, height: 80 };
-    return d[b] = { x: k - O.width / 2, y: N }, N + O.height;
-  }, g = (b, k, N) => {
+  const h = (y, k, N) => {
+    const O = r[y] ?? { width: me, height: 80 };
+    return d[y] = { x: k - O.width / 2, y: N }, N + O.height;
+  }, g = (y, k, N) => {
     let O = N;
-    for (const j of b)
+    for (const j of y)
       O = h(j.id, k, O) + s, le(j.kind) && t[j.id] && (O = p(j.id, k, O));
     return O;
-  }, p = (b, k, N) => {
-    const O = k + 180, j = t[b], z = Object.keys(j), W = f.get(b), L = (W == null ? void 0 : W.branchLabels) ?? { pass: "Pass", fail: "Fail" }, D = d[b], $ = r[b] ?? { height: 80 }, we = D.y + $.height, Ee = [];
+  }, p = (y, k, N) => {
+    const O = k + 180, j = t[y], z = Object.keys(j), W = f.get(y), L = (W == null ? void 0 : W.branchLabels) ?? { pass: "Pass", fail: "Fail" }, A = d[y], $ = r[y] ?? { height: 80 }, we = A.y + $.height, Ee = [];
     let te = N;
     return z.forEach((he, xe) => {
       const ze = j[he], Le = te;
@@ -2297,21 +2307,21 @@ function is(e, t, n, r) {
         label: L[he] ?? he,
         isPass: xe === 0
       }), te = g(ze, O, te + a), xe < z.length - 1 && (te += l);
-    }), c[b] = {
+    }), c[y] = {
       branches: Ee,
       height: te - we,
       indent: 180
     }, te;
   };
   let E = Xe;
-  for (const b of e)
-    E = h(b.id, 400, E) + s, le(b.kind) && t[b.id] && (E = p(b.id, 400, E));
+  for (const y of e)
+    E = h(y.id, 400, E) + s, le(y.kind) && t[y.id] && (E = p(y.id, 400, E));
   return {
-    nodes: n.map((b) => d[b.id] ? { ...b, position: d[b.id] } : b),
+    nodes: n.map((y) => d[y.id] ? { ...y, position: d[y.id] } : y),
     railSpecs: c
   };
 }
-function Gt(e) {
+function Kt(e) {
   return {
     id: e.id,
     type: e.reactFlowType,
@@ -2321,7 +2331,7 @@ function Gt(e) {
     selectable: !1
   };
 }
-function ss(e, t, n, r, o) {
+function ds(e, t, n, r, o) {
   return {
     id: `e-${e.id}-${t.id}`,
     source: e.id,
@@ -2335,44 +2345,44 @@ function ss(e, t, n, r, o) {
     }
   };
 }
-function ls(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
+function as(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
   const l = o.edgeColor ?? "#b0bec5", a = [], d = [], c = (p, E) => {
-    const b = t[p];
-    if (!b) return;
-    const N = E ?? { pass: "Pass", fail: "Fail" }, O = Object.keys(b), j = (z, W, L, D) => {
+    const y = t[p];
+    if (!y) return;
+    const N = E ?? { pass: "Pass", fail: "Fail" }, O = Object.keys(y), j = (z, W, L, A) => {
       if (z.length !== 0) {
-        z.forEach(($) => a.push(Gt($))), d.push({
+        z.forEach(($) => a.push(Kt($))), d.push({
           id: `e-${p}-${W}-start`,
           source: p,
           target: z[0].id,
           type: "gatewayBranchEdge",
           style: { stroke: l },
-          data: { branch: W, filterId: p, label: L, isFirst: D === 0, onAddStepClick: n, verticalRouting: s === "vertical" }
+          data: { branch: W, filterId: p, label: L, isFirst: A === 0, onAddStepClick: n, verticalRouting: s === "vertical" }
         });
         for (let $ = 1; $ < z.length; $++)
-          le(z[$ - 1].kind) || d.push(ss(z[$ - 1], z[$], l, n, { filterId: p, branch: W }));
+          le(z[$ - 1].kind) || d.push(ds(z[$ - 1], z[$], l, n, { filterId: p, branch: W }));
         for (const $ of z)
           le($.kind) && t[$.id] && c($.id, $.branchLabels);
       }
     };
     O.forEach((z, W) => {
-      j(b[z], z, N[z] ?? z, W);
+      j(y[z], z, N[z] ?? z, W);
     });
   };
   for (let p = 0; p < e.length; p++) {
     const E = e[p];
-    if (a.push(Gt(E)), p > 0) {
-      const b = e[p - 1], k = b.kind === "start" || b.kind === "addTrigger";
-      if (b.kind === "filter" || b.kind === "approval") continue;
+    if (a.push(Kt(E)), p > 0) {
+      const y = e[p - 1], k = y.kind === "start" || y.kind === "addTrigger";
+      if (y.kind === "filter" || y.kind === "approval") continue;
       d.push({
-        id: `e-${b.id}-${E.id}`,
-        source: b.id,
+        id: `e-${y.id}-${E.id}`,
+        source: y.id,
         target: E.id,
         type: k ? "plainEdge" : "plusEdge",
         style: { stroke: l },
         data: k ? {} : {
           onAddStepClick: n,
-          referenceNodeType: b.reactFlowType
+          referenceNodeType: y.reactFlowType
         }
       });
     }
@@ -2400,14 +2410,14 @@ function ls(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
     }), edges: d };
   }
   if (s === "vertical") {
-    const { nodes: p, railSpecs: E } = is(e, t, a, f);
+    const { nodes: p, railSpecs: E } = ls(e, t, a, f);
     return { nodes: p.map(
       (k) => E[k.id] ? { ...k, data: { ...k.data, _branchRail: E[k.id] } } : k
     ), edges: d };
   }
-  return { nodes: os(a, d, f, i), edges: d };
+  return { nodes: ss(a, d, f, i), edges: d };
 }
-const Yt = ({
+const Ht = ({
   nodeRegistry: e,
   templateRegistry: t,
   initialValue: n,
@@ -2424,7 +2434,7 @@ const Yt = ({
   renderNodeConfig: g,
   onNodeClick: p,
   maxNodes: E,
-  layoutDirection: b = "TB",
+  layoutDirection: y = "TB",
   executionRecord: k,
   onFetchWorkflow: N,
   hideHeader: O = !1,
@@ -2432,7 +2442,7 @@ const Yt = ({
   onWorkflowNameChange: z,
   onCancel: W,
   workflowStatus: L,
-  workflowStatusColor: D,
+  workflowStatusColor: A,
   saveLabel: $,
   optionsResolvers: we
 }) => {
@@ -2443,46 +2453,46 @@ const Yt = ({
     showMiniMap: xe = !1,
     panOnScroll: ze = !0,
     zoomOnScroll: Le = !1,
-    minZoom: Sn = 0.25,
-    maxZoom: Nn = 2,
-    snapToGrid: Tn = !1,
-    snapGrid: Cn = [15, 15],
+    minZoom: Tn = 0.25,
+    maxZoom: Cn = 2,
+    snapToGrid: In = !1,
+    snapGrid: On = [15, 15],
     branchLayout: rt = "horizontal",
     nodeBody: ot = "full"
-  } = d, ge = K(() => Er(a), [a]), [P, oe] = M(() => (n == null ? void 0 : n.slots) ?? $t()), [G, J] = M(() => (n == null ? void 0 : n.branches) ?? {}), [ae, V] = M(null), [Pe, it] = M(null), [U, ke] = M(null), [ie, st] = M(null), [_e, lt] = M(null), [X, dt] = M(() => {
-    const y = n == null ? void 0 : n.slots.find((S) => S.kind === "triggerFixed"), w = y != null && y.id.startsWith("trigger-") ? y.id.slice(8) : void 0;
+  } = d, ge = K(() => kr(a), [a]), [P, oe] = M(() => (n == null ? void 0 : n.slots) ?? Yt()), [G, J] = M(() => (n == null ? void 0 : n.branches) ?? {}), [ae, V] = M(null), [Pe, it] = M(null), [U, ke] = M(null), [ie, st] = M(null), [_e, lt] = M(null), [X, dt] = M(() => {
+    const b = n == null ? void 0 : n.slots.find((S) => S.kind === "triggerFixed"), w = b != null && b.id.startsWith("trigger-") ? b.id.slice(8) : void 0;
     return w ? t.lookup(w) ?? null : null;
-  }), [at, In] = M({}), On = Y((y) => {
-    In(y);
-  }, []), Mn = K(() => ({ ...Yn, ...r }), [r]), jn = K(() => ({ ...rs, ...o }), [o]), zn = K(() => {
-    const y = P.filter((S) => S.kind === "userTask").length, w = Object.values(G).flatMap((S) => Object.values(S).flat()).filter((S) => S.kind === "userTask").length;
-    return y + w;
-  }, [P, G]), ct = E ?? (X == null ? void 0 : X.maxTasks), ft = ct !== void 0 && zn >= ct, se = Y((y) => {
-    const w = P.find((S) => S.id === y);
+  }), [at, Mn] = M({}), jn = Y((b) => {
+    Mn(b);
+  }, []), zn = K(() => ({ ...Hn, ...r }), [r]), Ln = K(() => ({ ...is, ...o }), [o]), Pn = K(() => {
+    const b = P.filter((S) => S.kind === "userTask").length, w = Object.values(G).flatMap((S) => Object.values(S).flat()).filter((S) => S.kind === "userTask").length;
+    return b + w;
+  }, [P, G]), ct = E ?? (X == null ? void 0 : X.maxTasks), ft = ct !== void 0 && Pn >= ct, se = Y((b) => {
+    const w = P.find((S) => S.id === b);
     if (w) return w;
     for (const S of Object.values(G)) {
-      const x = Object.values(S).flat().find((I) => I.id === y);
+      const x = Object.values(S).flat().find((I) => I.id === b);
       if (x) return x;
     }
     return null;
-  }, [P, G]), Re = Y((y) => {
-    s || (it(y), V("nodeConfig"));
-  }, [s]), ut = Y((y) => {
+  }, [P, G]), Re = Y((b) => {
+    s || (it(b), V("nodeConfig"));
+  }, [s]), ut = Y((b) => {
     if (!s) {
-      if (P.some((w) => w.id === y)) {
-        const w = P.find((S) => S.id === y);
+      if (P.some((w) => w.id === b)) {
+        const w = P.find((S) => S.id === b);
         if ((w == null ? void 0 : w.kind) === "triggerFixed") {
-          oe($t()), J({}), dt(null);
+          oe(Yt()), J({}), dt(null);
           return;
         }
         oe((S) => {
-          const x = S.filter((I) => I.id !== y);
+          const x = S.filter((I) => I.id !== b);
           return le((w == null ? void 0 : w.kind) ?? "") && !x.some((I) => I.kind === "end") ? [...x, { id: "end", kind: "end", reactFlowType: "endNode" }] : x;
         }), J((S) => {
           const x = { ...S }, I = (m) => {
             x[m] && (Object.values(x[m]).flat().filter((_) => le(_.kind)).forEach((_) => I(_.id)), delete x[m]);
           };
-          return I(y), x;
+          return I(b), x;
         });
         return;
       }
@@ -2495,30 +2505,30 @@ const Yt = ({
         }, x = { ...w };
         for (const I of Object.keys(x))
           for (const m of Object.keys(x[I])) {
-            const _ = x[I][m], C = _.findIndex((R) => R.id === y);
+            const _ = x[I][m], C = _.findIndex((R) => R.id === b);
             if (C === -1 || _[C].kind === "end") continue;
             const T = _[C];
-            let F = _.filter((R) => R.id !== y);
-            return T.kind === "filter" && ((T.id in x ? S([T], x) : []).forEach((A) => delete x[A]), delete x[T.id], F.some((A) => A.kind === "end") || (F = [...F, { id: `end-${I}-${m}`, kind: "end", reactFlowType: "endNode" }])), x[I] = { ...x[I], [m]: F }, x;
+            let F = _.filter((R) => R.id !== b);
+            return T.kind === "filter" && ((T.id in x ? S([T], x) : []).forEach((B) => delete x[B]), delete x[T.id], F.some((B) => B.kind === "end") || (F = [...F, { id: `end-${I}-${m}`, kind: "end", reactFlowType: "endNode" }])), x[I] = { ...x[I], [m]: F }, x;
           }
         return x;
       });
     }
   }, [s, P]), Fe = Y(() => {
     s || V("triggerSelect");
-  }, [s]), ht = Y((y, w) => {
-    s || ft || (ke(y), st(w.filterId && w.branch ? { filterId: w.filterId, branch: w.branch } : null), V("nodePicker"));
-  }, [s, ft]), gt = Y((y, w) => {
-    if (dt(y), V(null), y.skeletonState) {
-      const x = Array.isArray(w) && w.length > 0, I = (y.skeletonState.slots ?? []).map((m) => m.kind !== "triggerFixed" ? m : {
+  }, [s]), ht = Y((b, w) => {
+    s || ft || (ke(b), st(w.filterId && w.branch ? { filterId: w.filterId, branch: w.branch } : null), V("nodePicker"));
+  }, [s, ft]), gt = Y((b, w) => {
+    if (dt(b), V(null), b.skeletonState) {
+      const x = Array.isArray(w) && w.length > 0, I = (b.skeletonState.slots ?? []).map((m) => m.kind !== "triggerFixed" ? m : {
         ...m,
         nodeData: {
-          label: y.label,
+          label: b.label,
           ...m.nodeData ?? {},
           ...x && { sources: w }
         }
       });
-      J(y.skeletonState.branches ?? {}), oe(I);
+      J(b.skeletonState.branches ?? {}), oe(I);
       return;
     }
     J({});
@@ -2526,14 +2536,14 @@ const Yt = ({
     oe([
       { id: "start", kind: "start", reactFlowType: "startNode" },
       {
-        id: `trigger-${y.triggerKey}`,
+        id: `trigger-${b.triggerKey}`,
         kind: "triggerFixed",
         reactFlowType: "triggerNode",
         nodeData: {
-          label: y.label,
-          source: y.source,
-          eventType: y.triggerKey,
-          type: y.triggerCategory === "scheduler" ? "scheduler" : "event",
+          label: b.label,
+          source: b.source,
+          eventType: b.triggerKey,
+          type: b.triggerCategory === "scheduler" ? "scheduler" : "event",
           ...S && { sources: w }
         },
         deletable: !1
@@ -2542,36 +2552,36 @@ const Yt = ({
     ]);
   }, []), pt = Y(() => {
     var S;
-    const y = {
+    const b = {
       insertAfterSlot: null,
       upstreamSlots: [],
       downstreamSlots: [],
       branch: ie,
       template: X
     };
-    if (!U) return y;
+    if (!U) return b;
     if (ie) {
       const { filterId: x, branch: I } = ie, m = P.findIndex((R) => R.id === x), _ = m >= 0 ? P.slice(0, m + 1) : [], C = ((S = G[x]) == null ? void 0 : S[I]) ?? [], T = C.findIndex((R) => R.id === U), F = T >= 0 ? C.slice(0, T + 1) : [];
-      return y.upstreamSlots = [..._, ...F], y.downstreamSlots = T >= 0 ? C.slice(T + 1) : C, y.insertAfterSlot = F[F.length - 1] ?? null, y;
+      return b.upstreamSlots = [..._, ...F], b.downstreamSlots = T >= 0 ? C.slice(T + 1) : C, b.insertAfterSlot = F[F.length - 1] ?? null, b;
     }
     const w = P.findIndex((x) => x.id === U);
-    return y.upstreamSlots = w >= 0 ? P.slice(0, w + 1) : [], y.downstreamSlots = w >= 0 ? P.slice(w + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
-  }, [P, G, U, ie, X]), bt = (y, w) => y.descriptorType === w || y.id === w || y.kind === w, yt = Y(() => {
-    const y = e.list(), w = X != null && X.availableTasks ? y.filter((x) => X.availableTasks.includes(x.type)) : y, S = pt();
+    return b.upstreamSlots = w >= 0 ? P.slice(0, w + 1) : [], b.downstreamSlots = w >= 0 ? P.slice(w + 1) : [], b.insertAfterSlot = b.upstreamSlots[b.upstreamSlots.length - 1] ?? null, b;
+  }, [P, G, U, ie, X]), yt = (b, w) => b.descriptorType === w || b.id === w || b.kind === w, bt = Y(() => {
+    const b = e.list(), w = X != null && X.availableTasks ? b.filter((x) => X.availableTasks.includes(x.type)) : b, S = pt();
     return w.filter((x) => x.maxPerWorkflow !== void 0 && P.filter((m) => m.descriptorType === x.type).length + Object.values(G).flatMap((m) => Object.values(m).flat()).filter((m) => m.descriptorType === x.type).length >= x.maxPerWorkflow ? !1 : x.canInsert ? x.canInsert(S) : !(x.insertAfter && x.insertAfter.length > 0 && !S.upstreamSlots.some(
-      (m) => x.insertAfter.some((_) => bt(m, _))
+      (m) => x.insertAfter.some((_) => yt(m, _))
     ) || x.insertBefore && x.insertBefore.length > 0 && !S.downstreamSlots.some(
-      (m) => x.insertBefore.some((_) => bt(m, _))
+      (m) => x.insertBefore.some((_) => yt(m, _))
     )));
-  }, [e, X, P, G, pt]), mt = Y((y) => {
+  }, [e, X, P, G, pt]), mt = Y((b) => {
     if (!U) return;
-    const w = `${y.type}-${Date.now()}`, S = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", x = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, I = {
+    const w = `${b.type}-${Date.now()}`, S = b.reactFlowType === "filterNode" || b.reactFlowType === "approvalNode" || b.reactFlowType === "conditionBranchNode", x = b.branchLabels ?? { pass: "Pass", fail: "Fail" }, I = {
       id: w,
-      kind: S ? y.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
-      reactFlowType: y.reactFlowType,
-      descriptorType: y.type,
+      kind: S ? b.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
+      reactFlowType: b.reactFlowType,
+      descriptorType: b.type,
       formData: {},
-      nodeData: { title: y.label },
+      nodeData: { title: b.label },
       deletable: !0,
       branchLabels: x
     };
@@ -2580,8 +2590,8 @@ const Yt = ({
       J((C) => {
         const T = [...C[m][_]];
         if (S) {
-          const ne = T.filter((ce) => ce.kind !== "end"), kt = ne.findIndex((ce) => ce.id === U), Fn = kt === -1 ? ne.length : kt + 1;
-          return ne.splice(Fn, 0, I), {
+          const ne = T.filter((ce) => ce.kind !== "end"), kt = ne.findIndex((ce) => ce.id === U), Dn = kt === -1 ? ne.length : kt + 1;
+          return ne.splice(Dn, 0, I), {
             ...C,
             [m]: { ...C[m], [_]: ne },
             [w]: Object.fromEntries(
@@ -2589,8 +2599,8 @@ const Yt = ({
             )
           };
         }
-        const F = T.findIndex((ne) => ne.id === U), R = T.findIndex((ne) => ne.kind === "end"), A = F === -1 ? R === -1 ? T.length : R : F + 1;
-        return T.splice(A, 0, I), { ...C, [m]: { ...C[m], [_]: T } };
+        const F = T.findIndex((ne) => ne.id === U), R = T.findIndex((ne) => ne.kind === "end"), B = F === -1 ? R === -1 ? T.length : R : F + 1;
+        return T.splice(B, 0, I), { ...C, [m]: { ...C[m], [_]: T } };
       });
     } else
       S ? (oe((m) => {
@@ -2606,7 +2616,7 @@ const Yt = ({
         return _ === -1 ? m : [...m.slice(0, _ + 1), I, ...m.slice(_ + 1)];
       });
     ke(null), st(null), it(w), V("nodeConfig");
-  }, [U, ie]), vt = Y((y, w) => {
+  }, [U, ie]), vt = Y((b, w) => {
     const S = (m) => {
       const _ = m.label || m.key;
       switch (m.kind) {
@@ -2620,14 +2630,14 @@ const Yt = ({
           return _;
       }
     }, x = (m) => {
-      const _ = se(y);
+      const _ = se(b);
       if ((_ == null ? void 0 : _.descriptorType) !== "conditionBranch") return m;
-      const T = (w.branchConfigs ?? []).map((A) => A.key).filter(Boolean);
+      const T = (w.branchConfigs ?? []).map((B) => B.key).filter(Boolean);
       if (T.length === 0) return m;
-      const F = m[y] ?? {}, R = {};
-      return T.forEach((A) => {
-        R[A] = F[A] ?? [{ id: `end-${y}-${A}`, kind: "end", reactFlowType: "endNode" }];
-      }), { ...m, [y]: R };
+      const F = m[b] ?? {}, R = {};
+      return T.forEach((B) => {
+        R[B] = F[B] ?? [{ id: `end-${b}-${B}`, kind: "end", reactFlowType: "endNode" }];
+      }), { ...m, [b]: R };
     }, I = (m, _) => {
       if (m.descriptorType !== "conditionBranch") return { ...m, formData: _ };
       const C = _.branchConfigs ?? [], T = {};
@@ -2635,12 +2645,12 @@ const Yt = ({
         F.key && (T[F.key] = S(F));
       }), { ...m, formData: _, branchLabels: T };
     };
-    if (P.some((m) => m.id === y)) {
+    if (P.some((m) => m.id === b)) {
       J((m) => {
         const _ = x(m);
         return oe(
           (C) => C.map(
-            (T) => T.id === y ? I(T, w) : T
+            (T) => T.id === b ? I(T, w) : T
           )
         ), _;
       });
@@ -2649,22 +2659,22 @@ const Yt = ({
     J((m) => {
       const C = { ...x(m) };
       for (const T of Object.keys(C)) {
-        const F = (R) => R.map((A) => A.id === y ? I(A, w) : A);
+        const F = (R) => R.map((B) => B.id === b ? I(B, w) : B);
         for (const R of Object.keys(C[T]))
-          if (C[T][R].some((A) => A.id === y))
+          if (C[T][R].some((B) => B.id === b))
             return C[T] = { ...C[T], [R]: F(C[T][R]) }, C;
       }
       return C;
     });
-  }, [P, G, se]), Z = K(() => se(Pe ?? ""), [se, Pe]), wt = K(() => Z != null && Z.descriptorType ? e.forType(Z.descriptorType) ?? null : null, [Z, e]), { nodes: Et, edges: Ln } = K(
-    () => ls(P, G, s ? null : ht, at, l, b, rt),
-    [P, G, s, ht, at, l, b, rt]
+  }, [P, G, se]), Z = K(() => se(Pe ?? ""), [se, Pe]), wt = K(() => Z != null && Z.descriptorType ? e.forType(Z.descriptorType) ?? null : null, [Z, e]), { nodes: Et, edges: Rn } = K(
+    () => as(P, G, s ? null : ht, at, l, y, rt),
+    [P, G, s, ht, at, l, y, rt]
   ), xt = K(() => {
-    const y = k ? new Map(k.steps.map((w) => [w.nodeId, w])) : null;
+    const b = k ? new Map(k.steps.map((w) => [w.nodeId, w])) : null;
     return Et.map((w) => {
       let S = {};
-      if (y) {
-        const x = y.get(w.id);
+      if (b) {
+        const x = b.get(w.id);
         x && (S = { _executionStatus: x.status, _executionError: x.error });
       }
       return w.type === "subWorkflowNode" && N && (S.onPreview = (x) => {
@@ -2673,11 +2683,11 @@ const Yt = ({
         lt({ workflowId: x, workflowLabel: ((m = I == null ? void 0 : I.formData) == null ? void 0 : m.workflowLabel) ?? void 0 });
       }), Object.keys(S).length > 0 ? { ...w, data: { ...w.data, ...S } } : w;
     });
-  }, [Et, k, N, se]), Pn = K(() => ({ onEditNode: Re, onDeleteNode: ut, onAddStep: () => {
-  }, onClickAddTrigger: Fe, messages: ge, nodeRegistry: e, nodeBody: ot }), [Re, ut, Fe, ge, e, ot]), Rn = Y(async () => {
+  }, [Et, k, N, se]), Fn = K(() => ({ onEditNode: Re, onDeleteNode: ut, onAddStep: () => {
+  }, onClickAddTrigger: Fe, messages: ge, nodeRegistry: e, nodeBody: ot }), [Re, ut, Fe, ge, e, ot]), An = Y(async () => {
     i && await i({ slots: P, branches: G });
   }, [i, P, G]);
-  return /* @__PURE__ */ u(wr, { resolvers: we, children: /* @__PURE__ */ u(qn.Provider, { value: Pn, children: /* @__PURE__ */ v(
+  return /* @__PURE__ */ u(xr, { resolvers: we, children: /* @__PURE__ */ u(Zn.Provider, { value: Fn, children: /* @__PURE__ */ v(
     "div",
     {
       className: "flowforge-canvas",
@@ -2700,64 +2710,64 @@ const Yt = ({
       },
       children: [
         !O && (i || W || j) && /* @__PURE__ */ u(
-          Ji,
+          Qi,
           {
             workflowName: j,
             onWorkflowNameChange: z,
             status: L,
-            statusColor: D,
-            onSave: i ? Rn : void 0,
+            statusColor: A,
+            onSave: i ? An : void 0,
             onCancel: W,
             saveLabel: $
           }
         ),
         /* @__PURE__ */ v("div", { style: { flex: 1, minHeight: 0, position: "relative" }, children: [
           /* @__PURE__ */ v(
-            Dn,
+            Bn,
             {
               nodes: xt,
-              edges: Ln,
-              nodeTypes: Mn,
-              edgeTypes: jn,
+              edges: Rn,
+              nodeTypes: zn,
+              edgeTypes: Ln,
               fitView: Ee,
               fitViewOptions: { padding: te },
               nodesDraggable: !1,
               nodesConnectable: !1,
               panOnScroll: ze,
               zoomOnScroll: Le,
-              minZoom: Sn,
-              maxZoom: Nn,
-              snapToGrid: Tn,
-              snapGrid: Cn,
+              minZoom: Tn,
+              maxZoom: Cn,
+              snapToGrid: In,
+              snapGrid: On,
               proOptions: { hideAttribution: !0 },
-              onNodeClick: (y, w) => {
+              onNodeClick: (b, w) => {
                 const S = se(w.id);
                 S && (p != null && p(S) || (S.kind === "addTrigger" || S.kind === "triggerFixed" ? Fe() : (S.kind === "userTask" || S.kind === "filter" || S.kind === "approval") && Re(w.id)));
               },
               children: [
                 l.background !== "none" && /* @__PURE__ */ u(
-                  Wn,
+                  Gn,
                   {
                     variant: l.background,
                     color: l.backgroundColor ?? "#e0e0e0",
                     gap: 20
                   }
                 ),
-                he && /* @__PURE__ */ u($n, { showInteractive: !1 }),
-                xe && /* @__PURE__ */ u(Gn, { zoomable: !0, pannable: !0 }),
-                /* @__PURE__ */ u(Xi, { onHeightsReady: On, nodeCount: xt.length })
+                he && /* @__PURE__ */ u(Yn, { showInteractive: !1 }),
+                xe && /* @__PURE__ */ u(Kn, { zoomable: !0, pannable: !0 }),
+                /* @__PURE__ */ u(Ji, { onHeightsReady: jn, nodeCount: xt.length })
               ]
             }
           ),
-          c ? ae === "triggerSelect" && c(t.list(), gt, () => V(null)) : /* @__PURE__ */ u(Zi, { open: ae === "triggerSelect", templates: t.list(), messages: ge, onSelect: gt, onClose: () => V(null), loadTriggerSources: f }),
-          h ? ae === "nodePicker" && h(yt(), mt, () => {
+          c ? ae === "triggerSelect" && c(t.list(), gt, () => V(null)) : /* @__PURE__ */ u(es, { open: ae === "triggerSelect", templates: t.list(), messages: ge, onSelect: gt, onClose: () => V(null), loadTriggerSources: f }),
+          h ? ae === "nodePicker" && h(bt(), mt, () => {
             V(null), ke(null);
-          }) : /* @__PURE__ */ u(Qi, { open: ae === "nodePicker", availableDescriptors: yt(), messages: ge, onSelect: mt, onClose: () => {
+          }) : /* @__PURE__ */ u(ts, { open: ae === "nodePicker", availableDescriptors: bt(), messages: ge, onSelect: mt, onClose: () => {
             V(null), ke(null);
           } }),
-          g ? ae === "nodeConfig" && g(wt ?? void 0, Z, vt, () => V(null)) : /* @__PURE__ */ u(es, { open: ae === "nodeConfig", nodeId: Pe, descriptor: wt, initialValues: Z == null ? void 0 : Z.formData, messages: ge, onSave: vt, onClose: () => V(null) }),
+          g ? ae === "nodeConfig" && g(wt ?? void 0, Z, vt, () => V(null)) : /* @__PURE__ */ u(ns, { open: ae === "nodeConfig", nodeId: Pe, descriptor: wt, initialValues: Z == null ? void 0 : Z.formData, messages: ge, onSave: vt, onClose: () => V(null) }),
           N && _e && /* @__PURE__ */ u(
-            ts,
+            rs,
             {
               isOpen: !!_e,
               onClose: () => lt(null),
@@ -2770,14 +2780,14 @@ const Yt = ({
       ]
     }
   ) }) });
-}, ds = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+}, cs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  WorkflowCanvas: Yt,
-  default: Yt
+  WorkflowCanvas: Ht,
+  default: Ht
 }, Symbol.toStringTag, { value: "Module" })), He = "All";
-function as({ template: e, onSelect: t }) {
+function fs({ template: e, onSelect: t }) {
   var o, i;
-  const n = e.triggerCategory ? xr[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
+  const n = e.triggerCategory ? _r[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
   return /* @__PURE__ */ v(
     "div",
     {
@@ -2830,7 +2840,7 @@ function as({ template: e, onSelect: t }) {
     }
   );
 }
-const Ns = ({
+const Cs = ({
   templates: e,
   onSelectTemplate: t,
   onStartFromScratch: n
@@ -2866,14 +2876,14 @@ const Ns = ({
             onClick: n,
             style: { display: "flex", alignItems: "center", gap: 6, padding: "8px 16px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 13, fontWeight: 600, cursor: "pointer" },
             children: [
-              /* @__PURE__ */ u(dr, { size: 16 }),
+              /* @__PURE__ */ u(cr, { size: 16 }),
               "Start from Scratch"
             ]
           }
         )
       ] }),
       /* @__PURE__ */ v("div", { style: { display: "flex", alignItems: "center", gap: 8, background: "#f5f5f5", borderRadius: 8, padding: "8px 12px", marginBottom: 12 }, children: [
-        /* @__PURE__ */ u(ar, { size: 18, color: "#9e9e9e" }),
+        /* @__PURE__ */ u(fr, { size: 18, color: "#9e9e9e" }),
         /* @__PURE__ */ u(
           "input",
           {
@@ -2905,21 +2915,21 @@ const Ns = ({
       )) })
     ] }),
     /* @__PURE__ */ u("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: a.length === 0 ? /* @__PURE__ */ v("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
-      /* @__PURE__ */ u(cr, { size: 36, style: { marginBottom: 8 } }),
+      /* @__PURE__ */ u(ur, { size: 36, style: { marginBottom: 8 } }),
       /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
-    ] }) : /* @__PURE__ */ u("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: a.map((d) => /* @__PURE__ */ u(as, { template: d, onSelect: () => t(d) }, d.triggerKey)) }) })
+    ] }) : /* @__PURE__ */ u("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: a.map((d) => /* @__PURE__ */ u(fs, { template: d, onSelect: () => t(d) }, d.triggerKey)) }) })
   ] });
 }, Se = {
-  running: { label: "Running", color: ee.running, icon: B.createElement(qt, { size: 14 }) },
-  success: { label: "Success", color: ee.success, icon: B.createElement(Xt, { size: 14 }) },
-  failed: { label: "Failed", color: ee.failed, icon: B.createElement(Ut, { size: 14 }) },
-  cancelled: { label: "Cancelled", color: ee.cancelled, icon: B.createElement(Vt, { size: 14 }) }
-}, cs = {
-  pending: { color: ee.pending, icon: B.createElement(fr, { size: 14 }) },
-  running: { color: ee.running, icon: B.createElement(qt, { size: 14 }) },
-  success: { color: ee.success, icon: B.createElement(Xt, { size: 14 }) },
-  failed: { color: ee.failed, icon: B.createElement(Ut, { size: 14 }) },
-  skipped: { color: ee.skipped, icon: B.createElement(Vt, { size: 14 }) }
+  running: { label: "Running", color: ee.running, icon: D.createElement(Zt, { size: 14 }) },
+  success: { label: "Success", color: ee.success, icon: D.createElement(Jt, { size: 14 }) },
+  failed: { label: "Failed", color: ee.failed, icon: D.createElement(qt, { size: 14 }) },
+  cancelled: { label: "Cancelled", color: ee.cancelled, icon: D.createElement(Xt, { size: 14 }) }
+}, us = {
+  pending: { color: ee.pending, icon: D.createElement(hr, { size: 14 }) },
+  running: { color: ee.running, icon: D.createElement(Zt, { size: 14 }) },
+  success: { color: ee.success, icon: D.createElement(Jt, { size: 14 }) },
+  failed: { color: ee.failed, icon: D.createElement(qt, { size: 14 }) },
+  skipped: { color: ee.skipped, icon: D.createElement(Xt, { size: 14 }) }
 };
 function Je(e) {
   try {
@@ -2928,7 +2938,7 @@ function Je(e) {
     return e;
   }
 }
-function _n(e, t) {
+function Nn(e, t) {
   try {
     const n = new Date(t ?? (/* @__PURE__ */ new Date()).toISOString()).getTime() - new Date(e).getTime();
     return n < 1e3 ? `${n}ms` : n < 6e4 ? `${(n / 1e3).toFixed(1)}s` : `${Math.floor(n / 6e4)}m ${Math.floor(n % 6e4 / 1e3)}s`;
@@ -2936,8 +2946,8 @@ function _n(e, t) {
     return "—";
   }
 }
-function fs({ step: e }) {
-  const [t, n] = M(!1), r = cs[e.status], o = !!(e.inputs || e.outputs || e.error);
+function hs({ step: e }) {
+  const [t, n] = M(!1), r = us[e.status], o = !!(e.inputs || e.outputs || e.error);
   return /* @__PURE__ */ v("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
     /* @__PURE__ */ v(
       "div",
@@ -2952,11 +2962,11 @@ function fs({ step: e }) {
           o && (i.key === "Enter" || i.key === " ") && n((s) => !s);
         },
         children: [
-          /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: B.cloneElement(r.icon, { color: r.color }) }),
+          /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: D.cloneElement(r.icon, { color: r.color }) }),
           /* @__PURE__ */ u("span", { style: { flex: 1, fontSize: 13, color: "#212121" }, children: e.label || e.nodeId }),
           e.branchTaken && /* @__PURE__ */ u("span", { style: { fontSize: 10, padding: "1px 6px", borderRadius: 10, background: "#e3f2fd", color: "#1565c0", fontWeight: 600 }, children: e.branchTaken }),
-          /* @__PURE__ */ u("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 }, children: e.startedAt ? _n(e.startedAt, e.completedAt) : "—" }),
-          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? B.createElement(hr, { size: 16 }) : B.createElement(gr, { size: 16 }) })
+          /* @__PURE__ */ u("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 }, children: e.startedAt ? Nn(e.startedAt, e.completedAt) : "—" }),
+          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? D.createElement(pr, { size: 16 }) : D.createElement(yr, { size: 16 }) })
         ]
       }
     ),
@@ -2973,7 +2983,7 @@ function fs({ step: e }) {
     ] })
   ] });
 }
-function us({ record: e, selected: t, onSelect: n }) {
+function gs({ record: e, selected: t, onSelect: n }) {
   const r = Se[e.status];
   return /* @__PURE__ */ v(
     "div",
@@ -2995,7 +3005,7 @@ function us({ record: e, selected: t, onSelect: n }) {
         outline: "none"
       },
       children: [
-        /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: B.cloneElement(r.icon, { color: r.color, size: 16 }) }),
+        /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: D.cloneElement(r.icon, { color: r.color, size: 16 }) }),
         /* @__PURE__ */ v("div", { style: { flex: 1, minWidth: 0 }, children: [
           /* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children: Je(e.triggeredAt) }),
           /* @__PURE__ */ v("div", { style: { fontSize: 11, color: "#9e9e9e" }, children: [
@@ -3007,12 +3017,12 @@ function us({ record: e, selected: t, onSelect: n }) {
           ] })
         ] }),
         /* @__PURE__ */ u("span", { style: { fontSize: 11, fontWeight: 600, color: r.color, flexShrink: 0 }, children: r.label }),
-        /* @__PURE__ */ u(Ht, { size: 14, color: "#bdbdbd" })
+        /* @__PURE__ */ u(Ut, { size: 14, color: "#bdbdbd" })
       ]
     }
   );
 }
-const Ts = ({ records: e, onViewOnCanvas: t }) => {
+const Is = ({ records: e, onViewOnCanvas: t }) => {
   var s;
   const [n, r] = M(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === n) ?? null, i = [...e].sort((l, a) => new Date(a.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
   return e.length === 0 ? /* @__PURE__ */ v("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
@@ -3026,13 +3036,13 @@ const Ts = ({ records: e, onViewOnCanvas: t }) => {
         e.length,
         ")"
       ] }),
-      i.map((l) => /* @__PURE__ */ u(us, { record: l, selected: l.id === n, onSelect: () => r(l.id) }, l.id))
+      i.map((l) => /* @__PURE__ */ u(gs, { record: l, selected: l.id === n, onSelect: () => r(l.id) }, l.id))
     ] }),
     /* @__PURE__ */ u("div", { style: { flex: 1, overflowY: "auto" }, children: o ? /* @__PURE__ */ v("div", { children: [
       /* @__PURE__ */ v("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
         /* @__PURE__ */ v("div", { children: [
           /* @__PURE__ */ v("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 }, children: [
-            B.cloneElement(Se[o.status].icon, { color: Se[o.status].color, size: 18 }),
+            D.cloneElement(Se[o.status].icon, { color: Se[o.status].color, size: 18 }),
             /* @__PURE__ */ u("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: Se[o.status].label })
           ] }),
           /* @__PURE__ */ v("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 }, children: [
@@ -3040,10 +3050,10 @@ const Ts = ({ records: e, onViewOnCanvas: t }) => {
               /* @__PURE__ */ u(Nt, { size: 13 }),
               " ",
               Je(o.triggeredAt),
-              o.completedAt && ` → ${Je(o.completedAt)} (${_n(o.triggeredAt, o.completedAt)})`
+              o.completedAt && ` → ${Je(o.completedAt)} (${Nn(o.triggeredAt, o.completedAt)})`
             ] }),
             o.triggeredBy && /* @__PURE__ */ v("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
-              /* @__PURE__ */ u(ur, { size: 13 }),
+              /* @__PURE__ */ u(gr, { size: 13 }),
               " ",
               o.triggeredBy
             ] })
@@ -3065,7 +3075,7 @@ const Ts = ({ records: e, onViewOnCanvas: t }) => {
           o.steps.length,
           ")"
         ] }),
-        o.steps.map((l, a) => /* @__PURE__ */ u(fs, { step: l }, `${l.nodeId}-${a}`))
+        o.steps.map((l, a) => /* @__PURE__ */ u(hs, { step: l }, `${l.nodeId}-${a}`))
       ] }),
       o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ u("div", { style: { padding: "10px 16px" }, children: /* @__PURE__ */ v("details", { children: [
         /* @__PURE__ */ u("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 }, children: "TRIGGER INPUTS" }),
@@ -3075,10 +3085,10 @@ const Ts = ({ records: e, onViewOnCanvas: t }) => {
   ] });
 };
 export {
-  Yt as F,
-  ts as S,
-  Ts as W,
-  Ji as a,
-  Ns as b
+  Ht as F,
+  rs as S,
+  Is as W,
+  Qi as a,
+  Cs as b
 };
-//# sourceMappingURL=WorkflowExecutionHistory-DsrLtY5i.js.map
+//# sourceMappingURL=WorkflowExecutionHistory-Bpw-YeJU.js.map