@notmrabhi/flowforge 0.1.106 → 0.1.108

package/dist/{WorkflowExecutionHistory-DYp-l7mk.js → WorkflowExecutionHistory-BBeVPYVc.js}

@@ -1,24 +1,24 @@
-import { jsxs as w, jsx as u, Fragment as ye } from "react/jsx-runtime";
-import D, { useRef as _t, useEffect as re, useState as j, useCallback as H, useMemo as U } from "react";
+import { jsxs as w, jsx as u, Fragment as _e } from "react/jsx-runtime";
+import G, { useRef as Tt, useEffect as se, useState as L, useCallback as H, useMemo as U } from "react";
 import Wn, { useStore as $n, useReactFlow as Gn, Background as Yn, Controls as Kn, MiniMap as Hn } from "reactflow";
 import "reactflow/dist/style.css";
-import { e as Un, G as Vn, E as Xn, P as qn, L as Jn, d as Zn, h as Qn } from "./GatewayBranchEdge-BsPsPmnx.js";
-import { Dialog as er, Box as Q, Drawer as tr, IconButton as St, Button as Ce, CircularProgress as nr } from "@mui/material";
+import { e as Un, G as Vn, E as qn, P as Xn, L as Jn, d as Zn, h as Qn } from "./GatewayBranchEdge-C023FhhW.js";
+import { Dialog as er, Box as ne, Drawer as tr, IconButton as It, Button as ze, CircularProgress as nr } from "@mui/material";
 import rr from "react-select";
-import { MdClose as or, MdCalendarToday as ir, MdBolt as sr, MdArrowBack as Ut, MdChevronRight as Vt, MdAddCircleOutline as lr, MdApps as ar, MdErrorOutline as dr, MdAccountTree as cr, MdAdd as fr, MdSearch as ur, MdCategory as hr, MdCancel as Xt, MdError as qt, MdCheckCircle as Jt, MdPlayArrow as Zt, MdHourglassEmpty as gr, MdSchedule as Nt, MdPerson as pr, MdExpandLess as yr, MdExpandMore as br } from "react-icons/md";
+import { MdClose as or, MdCalendarToday as ir, MdBolt as sr, MdArrowBack as Jt, MdChevronRight as Zt, MdAddCircleOutline as lr, MdApps as ar, MdErrorOutline as dr, MdAccountTree as cr, MdAdd as fr, MdSearch as ur, MdCategory as hr, MdCancel as Qt, MdError as en, MdCheckCircle as tn, MdPlayArrow as nn, MdHourglassEmpty as gr, MdSchedule as Ot, MdPerson as pr, MdExpandLess as yr, MdExpandMore as br } from "react-icons/md";
 import { GrTrigger as mr } from "react-icons/gr";
 import { BiCollapse as vr, BiExpand as wr } from "react-icons/bi";
 import { k as Er, c as xr, O as kr } from "./index-C6t1hp3u.js";
 import { m as _r } from "./messages-CRZgWFU-.js";
 import { createTheme as Sr, ThemeProvider as Nr } from "@mui/material/styles";
-import { T as Cr, E as ee } from "./canvasTokens-CAD6G24b.js";
-var Qt = Object.defineProperty, Tr = (e, t, n) => t in e ? Qt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, Ir = (e, t) => {
-  for (var n in t) Qt(e, n, { get: t[n], enumerable: !0 });
-}, Or = (e, t, n) => Tr(e, t + "", n), en = {};
-Ir(en, { Graph: () => V, alg: () => Qe, json: () => nn, version: () => zr });
-var Mr = Object.defineProperty, tn = (e, t) => {
+import { T as Cr, E as re } from "./canvasTokens-CAD6G24b.js";
+var rn = Object.defineProperty, Tr = (e, t, n) => t in e ? rn(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, Ir = (e, t) => {
+  for (var n in t) rn(e, n, { get: t[n], enumerable: !0 });
+}, Or = (e, t, n) => Tr(e, t + "", n), on = {};
+Ir(on, { Graph: () => q, alg: () => ot, json: () => ln, version: () => zr });
+var Mr = Object.defineProperty, sn = (e, t) => {
   for (var n in t) Mr(e, n, { get: t[n], enumerable: !0 });
-}, V = class {
+}, q = 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 = () => {
     }, this._defaultEdgeLabelFn = () => {
@@ -151,15 +151,15 @@ var Mr = Object.defineProperty, tn = (e, t) => {
   setEdge(e, t, n, r) {
     let o, i, s, l, d = !1;
     typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (l = t, d = !0)) : (o = e, i = t, s = r, arguments.length > 2 && (l = n, d = !0)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
-    let a = pe(this._isDirected, o, i, s);
+    let a = ke(this._isDirected, o, i, s);
     if (a in this._edgeLabels) return d && (this._edgeLabels[a] = 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[a] = d ? l : this._defaultEdgeLabelFn(o, i, s);
     let c = jr(this._isDirected, o, i, s);
-    return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, Ct(this._preds[i], o), Ct(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
+    return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, Mt(this._preds[i], o), Mt(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
   }
   edge(e, t, n) {
-    let r = arguments.length === 1 ? Be(this._isDirected, e) : pe(this._isDirected, e, t, n);
+    let r = arguments.length === 1 ? Ye(this._isDirected, e) : ke(this._isDirected, e, t, n);
     return this._edgeLabels[r];
   }
   edgeAsObj(e, t, n) {
@@ -167,13 +167,13 @@ var Mr = Object.defineProperty, tn = (e, t) => {
     return typeof r != "object" ? { label: r } : r;
   }
   hasEdge(e, t, n) {
-    return (arguments.length === 1 ? Be(this._isDirected, e) : pe(this._isDirected, e, t, n)) in this._edgeLabels;
+    return (arguments.length === 1 ? Ye(this._isDirected, e) : ke(this._isDirected, e, t, n)) in this._edgeLabels;
   }
   removeEdge(e, t, n) {
-    let r = arguments.length === 1 ? Be(this._isDirected, e) : pe(this._isDirected, e, t, n), o = this._edgeObjs[r];
+    let r = arguments.length === 1 ? Ye(this._isDirected, e) : ke(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], Tt(this._preds[s], i), Tt(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--;
+      delete this._edgeLabels[r], delete this._edgeObjs[r], jt(this._preds[s], i), jt(this._sucs[i], s), delete this._in[s][r], delete this._out[i][r], this._edgeCount--;
     }
     return this;
   }
@@ -195,13 +195,13 @@ var Mr = Object.defineProperty, tn = (e, t) => {
     return n ? r.filter((o) => o.v === t && o.w === n || o.v === n && o.w === t) : r;
   }
 };
-function Ct(e, t) {
+function Mt(e, t) {
   e[t] ? e[t]++ : e[t] = 1;
 }
-function Tt(e, t) {
+function jt(e, t) {
   e[t] !== void 0 && !--e[t] && delete e[t];
 }
-function pe(e, t, n, r) {
+function ke(e, t, n, r) {
   let o = "" + t, i = "" + n;
   if (!e && o > i) {
     let s = o;
@@ -218,11 +218,11 @@ function jr(e, t, n, r) {
   let s = { v: o, w: i };
   return r && (s.name = r), s;
 }
-function Be(e, t) {
-  return pe(e, t.v, t.w, t.name);
+function Ye(e, t) {
+  return ke(e, t.v, t.w, t.name);
 }
-var zr = "4.0.1", nn = {};
-tn(nn, { read: () => Rr, write: () => Lr });
+var zr = "4.0.1", ln = {};
+sn(ln, { read: () => Rr, write: () => Lr });
 function Lr(e) {
   let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Pr(e), edges: Fr(e) }, n = e.graph();
   return n !== void 0 && (t.value = structuredClone(n)), t;
@@ -240,17 +240,17 @@ function Fr(e) {
   });
 }
 function Rr(e) {
-  let t = new V(e.options);
+  let t = new q(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);
   }), e.edges.forEach((n) => {
     t.setEdge({ v: n.v, w: n.w, name: n.name }, n.value);
   }), t;
 }
-var Qe = {};
-tn(Qe, { CycleException: () => Ie, bellmanFord: () => rn, components: () => Dr, dijkstra: () => Te, dijkstraAll: () => Gr, findCycles: () => Yr, floydWarshall: () => Hr, isAcyclic: () => Vr, postorder: () => qr, preorder: () => Jr, prim: () => Zr, shortestPaths: () => Qr, tarjan: () => sn, topsort: () => ln });
+var ot = {};
+sn(ot, { CycleException: () => Pe, bellmanFord: () => an, components: () => Dr, dijkstra: () => Le, dijkstraAll: () => Gr, findCycles: () => Yr, floydWarshall: () => Hr, isAcyclic: () => Vr, postorder: () => Xr, preorder: () => Jr, prim: () => Zr, shortestPaths: () => Qr, tarjan: () => cn, topsort: () => fn });
 var Ar = () => 1;
-function rn(e, t, n, r) {
+function an(e, t, n, r) {
   return Br(e, String(t), n || Ar, r || function(o) {
     return e.outEdges(o);
   });
@@ -262,8 +262,8 @@ function Br(e, t, n, r) {
   }, a = function() {
     l.forEach(function(f) {
       r(f).forEach(function(h) {
-        let g = h.v === f ? h.v : h.w, b = g === h.v ? h.w : h.v;
-        d({ v: g, w: b });
+        let g = h.v === f ? h.v : h.w, E = g === h.v ? h.w : h.v;
+        d({ v: g, w: E });
       });
     });
   };
@@ -285,7 +285,7 @@ function Dr(e) {
     r = [], o(i), r.length && n.push(r);
   }), n;
 }
-var on = class {
+var dn = class {
   constructor() {
     this._arr = [], this._keyIndices = {};
   }
@@ -339,14 +339,14 @@ var on = class {
     n[e] = i, n[t] = o, r[i.key] = e, r[o.key] = t;
   }
 }, Wr = () => 1;
-function Te(e, t, n, r) {
+function Le(e, t, n, r) {
   let o = function(i) {
     return e.outEdges(i);
   };
   return $r(e, String(t), n || Wr, r || o);
 }
 function $r(e, t, n, r) {
-  let o = {}, i = new on(), s, l, d = function(a) {
+  let o = {}, i = new dn(), s, l, d = function(a) {
     let c = a.v !== s ? a.v : a.w, f = o[c], h = n(a), g = l.distance + h;
     if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + a + " Weight: " + h);
     g < f.distance && (f.distance = g, f.predecessor = s, i.decrease(c, g));
@@ -359,10 +359,10 @@ function $r(e, t, n, r) {
 }
 function Gr(e, t, n) {
   return e.nodes().reduce(function(r, o) {
-    return r[o] = Te(e, o, t, n), r;
+    return r[o] = Le(e, o, t, n), r;
   }, {});
 }
-function sn(e) {
+function cn(e) {
   let t = 0, n = [], r = {}, o = [];
   function i(s) {
     let l = r[s] = { onStack: !0, lowlink: t, index: t++ };
@@ -381,7 +381,7 @@ function sn(e) {
   }), o;
 }
 function Yr(e) {
-  return sn(e).filter(function(t) {
+  return cn(e).filter(function(t) {
     return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
   });
 }
@@ -411,30 +411,30 @@ function Ur(e, t, n) {
     });
   }), r;
 }
-var Ie = class extends Error {
+var Pe = class extends Error {
   constructor(...e) {
     super(...e);
   }
 };
-function ln(e) {
+function fn(e) {
   let t = {}, n = {}, r = [];
   function o(i) {
-    if (i in n) throw new Ie();
+    if (i in n) throw new Pe();
     i in t || (n[i] = !0, t[i] = !0, e.predecessors(i).forEach(o), delete n[i], r.push(i));
   }
-  if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Ie();
+  if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Pe();
   return r;
 }
 function Vr(e) {
   try {
-    ln(e);
+    fn(e);
   } catch (t) {
-    if (t instanceof Ie) return !1;
+    if (t instanceof Pe) return !1;
     throw t;
   }
   return !0;
 }
-function Xr(e, t, n, r, o) {
+function qr(e, t, n, r, o) {
   Array.isArray(t) || (t = [t]);
   let i = (l) => {
     var d;
@@ -442,27 +442,27 @@ function Xr(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 = an(e, l, n === "post", s, i, r, o);
+    o = un(e, l, n === "post", s, i, r, o);
   }), o;
 }
-function an(e, t, n, r, o, i, s) {
+function un(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 = an(e, l, n, r, o, i, s);
+    s = un(e, l, n, r, o, i, s);
   }), n && (s = i(s, t))), s;
 }
-function dn(e, t, n) {
-  return Xr(e, t, n, function(r, o) {
+function hn(e, t, n) {
+  return qr(e, t, n, function(r, o) {
     return r.push(o), r;
   }, []);
 }
-function qr(e, t) {
-  return dn(e, t, "post");
+function Xr(e, t) {
+  return hn(e, t, "post");
 }
 function Jr(e, t) {
-  return dn(e, t, "pre");
+  return hn(e, t, "pre");
 }
 function Zr(e, t) {
-  let n = new V(), r = {}, o = new on(), i;
+  let n = new q(), r = {}, o = new dn(), i;
   function s(d) {
     let a = d.v === i ? d.w : d.v, c = o.priority(a);
     if (c !== void 0) {
@@ -492,7 +492,7 @@ function Qr(e, t, n, r) {
   }));
 }
 function eo(e, t, n, r) {
-  if (n === void 0) return Te(e, t, n, r);
+  if (n === void 0) return Le(e, t, n, r);
   let o = !1, i = e.nodes();
   for (let s = 0; s < i.length; s++) {
     let l = r(i[s]);
@@ -500,38 +500,38 @@ function eo(e, t, n, r) {
       let a = l[d], c = a.v === i[s] ? a.v : a.w, f = c === a.v ? a.w : a.v;
       n({ v: c, w: f }) < 0 && (o = !0);
     }
-    if (o) return rn(e, t, n, r);
+    if (o) return an(e, t, n, r);
   }
-  return Te(e, t, n, r);
+  return Le(e, t, n, r);
 }
-function ue(e, t, n, r) {
+function me(e, t, n, r) {
   let o = r;
-  for (; e.hasNode(o); ) o = et(r);
+  for (; e.hasNode(o); ) o = it(r);
   return n.dummy = t, e.setNode(o, n), o;
 }
 function to(e) {
-  let t = new V().setGraph(e.graph());
+  let t = new q().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 cn(e) {
-  let t = new V({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+function gn(e) {
+  let t = new q({ multigraph: e.isMultigraph() }).setGraph(e.graph());
   return e.nodes().forEach((n) => {
     e.children(n).length || t.setNode(n, e.node(n));
   }), e.edges().forEach((n) => {
     t.setEdge(n, e.edge(n));
   }), t;
 }
-function It(e, t) {
+function zt(e, t) {
   let n = e.x, r = e.y, o = t.x - n, i = t.y - r, s = e.width / 2, l = e.height / 2;
   if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
   let d, a;
   return Math.abs(i) * s > Math.abs(o) * l ? (i < 0 && (l = -l), d = l * o / i, a = l) : (o < 0 && (s = -s), d = s, a = s * i / o), { x: n + d, y: r + a };
 }
-function we(e) {
-  let t = be(un(e) + 1).map(() => []);
+function Te(e) {
+  let t = Se(yn(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);
@@ -541,14 +541,14 @@ function no(e) {
   let t = e.nodes().map((r) => {
     let o = e.node(r).rank;
     return o === void 0 ? Number.MAX_VALUE : o;
-  }), n = J(Math.min, t);
+  }), n = Q(Math.min, t);
   e.nodes().forEach((r) => {
     let o = e.node(r);
     Object.hasOwn(o, "rank") && (o.rank -= n);
   });
 }
 function ro(e) {
-  let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), n = J(Math.min, t), r = [];
+  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;
     r[l] || (r[l] = []), r[l].push(s);
@@ -558,11 +558,11 @@ function ro(e) {
     s === void 0 && l % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
   });
 }
-function Ot(e, t, n, r) {
+function Lt(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);
+  return arguments.length >= 4 && (o.rank = n, o.order = r), me(e, "border", o, t);
 }
-function oo(e, t = fn) {
+function oo(e, t = pn) {
   let n = [];
   for (let r = 0; r < e.length; r += t) {
     let o = e.slice(r, r + t);
@@ -570,19 +570,19 @@ function oo(e, t = fn) {
   }
   return n;
 }
-var fn = 65535;
-function J(e, t) {
-  if (t.length > fn) {
+var pn = 65535;
+function Q(e, t) {
+  if (t.length > pn) {
     let n = oo(t);
     return e(...n.map((r) => e(...r)));
   } else return e(...t);
 }
-function un(e) {
+function yn(e) {
   let t = e.nodes().map((n) => {
     let r = e.node(n).rank;
     return r === void 0 ? Number.MIN_VALUE : r;
   });
-  return J(Math.max, t);
+  return Q(Math.max, t);
 }
 function io(e, t) {
   let n = { lhs: [], rhs: [] };
@@ -590,7 +590,7 @@ function io(e, t) {
     t(r) ? n.lhs.push(r) : n.rhs.push(r);
   }), n;
 }
-function hn(e, t) {
+function bn(e, t) {
   let n = Date.now();
   try {
     return t();
@@ -598,15 +598,15 @@ function hn(e, t) {
     console.log(e + " time: " + (Date.now() - n) + "ms");
   }
 }
-function gn(e, t) {
+function mn(e, t) {
   return t();
 }
 var so = 0;
-function et(e) {
+function it(e) {
   let t = ++so;
   return e + ("" + t);
 }
-function be(e, t, n = 1) {
+function Se(e, t, n = 1) {
   t == null && (t = e, e = 0);
   let r = (i) => i < t;
   n < 0 && (r = (i) => t < i);
@@ -614,19 +614,19 @@ function be(e, t, n = 1) {
   for (let i = e; r(i); i += n) o.push(i);
   return o;
 }
-function Oe(e, t) {
+function Fe(e, t) {
   let n = {};
   for (let r of t) e[r] !== void 0 && (n[r] = e[r]);
   return n;
 }
-function Me(e, t) {
+function Re(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 lo(e, t) {
   return e.reduce((n, r, o) => (n[r] = t[o], n), {});
 }
-var je = "\0", ao = "3.0.0", co = class {
+var Ae = "\0", ao = "3.0.0", co = class {
   constructor() {
     Or(this, "_sentinel");
     let e = {};
@@ -634,11 +634,11 @@ var je = "\0", ao = "3.0.0", co = class {
   }
   dequeue() {
     let e = this._sentinel, t = e._prev;
-    if (t !== e) return Mt(t), t;
+    if (t !== e) return Pt(t), t;
   }
   enqueue(e) {
     let t = this._sentinel;
-    e._prev && e._next && Mt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+    e._prev && e._next && Pt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
   }
   toString() {
     let e = [], t = this._sentinel, n = t._prev;
@@ -646,7 +646,7 @@ var je = "\0", ao = "3.0.0", co = class {
     return "[" + e.join(", ") + "]";
   }
 };
-function Mt(e) {
+function Pt(e) {
   e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
 function fo(e, t) {
@@ -662,29 +662,29 @@ function po(e, t, n) {
   var r;
   let o = [], i = t[t.length - 1], s = t[0], l;
   for (; e.nodeCount(); ) {
-    for (; l = s.dequeue(); ) De(e, t, n, l);
-    for (; l = i.dequeue(); ) De(e, t, n, l);
+    for (; l = s.dequeue(); ) Ke(e, t, n, l);
+    for (; l = i.dequeue(); ) Ke(e, t, n, l);
     if (e.nodeCount()) {
       for (let d = t.length - 2; d > 0; --d) if (l = (r = t[d]) == null ? void 0 : r.dequeue(), l) {
-        o = o.concat(De(e, t, n, l, !0) || []);
+        o = o.concat(Ke(e, t, n, l, !0) || []);
         break;
       }
     }
   }
   return o;
 }
-function De(e, t, n, r, o) {
+function Ke(e, t, n, r, o) {
   let i = [], s = o ? i : void 0;
   return (e.inEdges(r.v) || []).forEach((l) => {
     let d = e.edge(l), a = e.node(l.v);
-    o && i.push({ v: l.v, w: l.w }), a.out -= d, Ve(t, n, a);
+    o && i.push({ v: l.v, w: l.w }), a.out -= d, Qe(t, n, a);
   }), (e.outEdges(r.v) || []).forEach((l) => {
     let d = e.edge(l), a = l.w, c = e.node(a);
-    c.in -= d, Ve(t, n, c);
+    c.in -= d, Qe(t, n, c);
   }), e.removeNode(r.v), s;
 }
 function yo(e, t) {
-  let n = new V(), r = 0, o = 0;
+  let n = new q(), r = 0, o = 0;
   e.nodes().forEach((l) => {
     n.setNode(l, { v: l, in: 0, out: 0 });
   }), e.edges().forEach((l) => {
@@ -695,10 +695,10 @@ function yo(e, t) {
   });
   let i = bo(o + r + 3).map(() => new uo()), s = r + 1;
   return n.nodes().forEach((l) => {
-    Ve(i, s, n.node(l));
+    Qe(i, s, n.node(l));
   }), { graph: n, buckets: i, zeroIdx: s };
 }
-function Ve(e, t, n) {
+function Qe(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);
 }
@@ -710,7 +710,7 @@ function bo(e) {
 function mo(e) {
   (e.graph().acyclicer === "greedy" ? go(e, t(e)) : vo(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, et("rev"));
+    e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r, it("rev"));
   });
   function t(n) {
     return (r) => n.edge(r).weight;
@@ -743,7 +743,7 @@ function xo(e, t) {
   if (i === r + 1) return;
   e.removeEdge(t);
   let a, c, f;
-  for (f = 0, ++r; r < i; ++f, ++r) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, a = ue(e, "edge", c, "_d"), r === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(n, a, { weight: l.weight }, s), f === 0 && e.graph().dummyChains.push(a), n = a;
+  for (f = 0, ++r; r < i; ++f, ++r) l.points = [], c = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, a = me(e, "edge", c, "_d"), r === d && (c.width = l.width, c.height = l.height, c.dummy = "edge-label", c.labelpos = l.labelpos), e.setEdge(n, a, { weight: l.weight }, s), f === 0 && e.graph().dummyChains.push(a), n = a;
   e.setEdge(n, o, { weight: l.weight }, s);
 }
 function ko(e) {
@@ -752,28 +752,28 @@ function ko(e) {
     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);
   });
 }
-function tt(e) {
+function st(e) {
   let t = {};
   function n(r) {
     let o = e.node(r);
     if (Object.hasOwn(t, r)) return o.rank;
     t[r] = !0;
-    let i = e.outEdges(r), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : n(d.w) - e.edge(d).minlen) : [], l = J(Math.min, s);
+    let i = e.outEdges(r), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : n(d.w) - e.edge(d).minlen) : [], l = Q(Math.min, s);
     return l === Number.POSITIVE_INFINITY && (l = 0), o.rank = l;
   }
   e.sources().forEach(n);
 }
-function fe(e, t) {
+function be(e, t) {
   return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var pn = _o;
+var vn = _o;
 function _o(e) {
-  let t = new V({ directed: !1 }), n = e.nodes();
+  let t = new q({ 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 (; So(t, e) < o && (i = No(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), Co(t, e, s);
+  for (; So(t, e) < o && (i = No(t, e), !!i); ) s = t.hasNode(i.v) ? be(e, i) : -be(e, i), Co(t, e, s);
   return t;
 }
 function So(e, t) {
@@ -781,7 +781,7 @@ function So(e, t) {
     let o = t.nodeEdges(r);
     o && o.forEach((i) => {
       let s = i.v, l = r === s ? i.w : s;
-      !e.hasNode(l) && !fe(t, i) && (e.setNode(l, {}), e.setEdge(r, l, {}), n(l));
+      !e.hasNode(l) && !be(t, i) && (e.setNode(l, {}), e.setEdge(r, l, {}), n(l));
     });
   }
   return e.nodes().forEach(n), e.nodeCount();
@@ -789,35 +789,35 @@ function So(e, t) {
 function No(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;
+    return e.hasNode(r.v) !== e.hasNode(r.w) && (o = be(t, r)), o < n[0] ? [o, r] : n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
 function Co(e, t, n) {
   e.nodes().forEach((r) => t.node(r).rank += n);
 }
-var { preorder: To, postorder: Io } = Qe, Oo = ae;
-ae.initLowLimValues = rt;
-ae.initCutValues = nt;
-ae.calcCutValue = yn;
-ae.leaveEdge = mn;
-ae.enterEdge = vn;
-ae.exchangeEdges = wn;
-function ae(e) {
-  e = to(e), tt(e);
-  let t = pn(e);
-  rt(t), nt(t, e);
+var { preorder: To, postorder: Io } = ot, Oo = ue;
+ue.initLowLimValues = at;
+ue.initCutValues = lt;
+ue.calcCutValue = wn;
+ue.leaveEdge = xn;
+ue.enterEdge = kn;
+ue.exchangeEdges = _n;
+function ue(e) {
+  e = to(e), st(e);
+  let t = vn(e);
+  at(t), lt(t, e);
   let n, r;
-  for (; n = mn(t); ) r = vn(t, e, n), wn(t, e, n, r);
+  for (; n = xn(t); ) r = kn(t, e, n), _n(t, e, n, r);
 }
-function nt(e, t) {
+function lt(e, t) {
   let n = Io(e, e.nodes());
   n = n.slice(0, n.length - 1), n.forEach((r) => Mo(e, t, r));
 }
 function Mo(e, t, n) {
   let r = e.node(n).parent, o = e.edge(n, r);
-  o.cutvalue = yn(e, t, n);
+  o.cutvalue = wn(e, t, n);
 }
-function yn(e, t, n) {
+function wn(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);
@@ -832,29 +832,29 @@ function yn(e, t, n) {
     }
   }), s;
 }
-function rt(e, t) {
-  arguments.length < 2 && (t = e.nodes()[0]), bn(e, {}, 1, t);
+function at(e, t) {
+  arguments.length < 2 && (t = e.nodes()[0]), En(e, {}, 1, t);
 }
-function bn(e, t, n, r, o) {
+function En(e, t, n, r, o) {
   let i = n, s = e.node(r);
   t[r] = !0;
   let l = e.neighbors(r);
   return l && l.forEach((d) => {
-    Object.hasOwn(t, d) || (n = bn(e, t, n, d, r));
+    Object.hasOwn(t, d) || (n = En(e, t, n, d, r));
   }), s.low = i, s.lim = n++, o ? s.parent = o : delete s.parent, n;
 }
-function mn(e) {
+function xn(e) {
   return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function vn(e, t, n) {
+function kn(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, d = !1;
-  return i.lim > s.lim && (l = s, d = !0), t.edges().filter((a) => d === jt(e, e.node(a.v), l) && d !== jt(e, e.node(a.w), l)).reduce((a, c) => fe(t, c) < fe(t, a) ? c : a);
+  return i.lim > s.lim && (l = s, d = !0), t.edges().filter((a) => d === Ft(e, e.node(a.v), l) && d !== Ft(e, e.node(a.w), l)).reduce((a, c) => be(t, c) < be(t, a) ? c : a);
 }
-function wn(e, t, n, r) {
+function _n(e, t, n, r) {
   let o = n.v, i = n.w;
-  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), rt(e), nt(e, t), jo(e, t);
+  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), at(e), lt(e, t), jo(e, t);
 }
 function jo(e, t) {
   let n = e.nodes().find((o) => !e.node(o).parent);
@@ -868,7 +868,7 @@ function jo(e, t) {
 function zo(e, t, n) {
   return e.hasEdge(t, n);
 }
-function jt(e, t, n) {
+function Ft(e, t, n) {
   return n.low <= t.lim && t.lim <= n.lim;
 }
 var Lo = Po;
@@ -877,7 +877,7 @@ function Po(e) {
   if (typeof t == "function") return t(e);
   switch (t) {
     case "network-simplex":
-      zt(e);
+      Rt(e);
       break;
     case "tight-tree":
       Ro(e);
@@ -888,14 +888,14 @@ function Po(e) {
     case "none":
       break;
     default:
-      zt(e);
+      Rt(e);
   }
 }
-var Fo = tt;
+var Fo = st;
 function Ro(e) {
-  tt(e), pn(e);
+  st(e), vn(e);
 }
-function zt(e) {
+function Rt(e) {
   Oo(e);
 }
 var Ao = Bo;
@@ -932,27 +932,27 @@ function Wo(e) {
     let i = n;
     e.children(o).forEach(r), t[o] = { low: i, lim: n++ };
   }
-  return e.children(je).forEach(r), t;
+  return e.children(Ae).forEach(r), t;
 }
 function $o(e) {
-  let t = ue(e, "root", {}, "_root"), n = Go(e), r = Object.values(n), o = J(Math.max, r) - 1, i = 2 * o + 1;
+  let t = me(e, "root", {}, "_root"), n = Go(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 = Yo(e) + 1;
-  e.children(je).forEach((l) => En(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
+  e.children(Ae).forEach((l) => Sn(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
 }
-function En(e, t, n, r, o, i, s) {
+function Sn(e, t, n, r, o, i, s) {
   var l;
   let d = e.children(s);
   if (!d.length) {
     s !== t && e.setEdge(t, s, { weight: 0, minlen: n });
     return;
   }
-  let a = Ot(e, "_bt"), c = Ot(e, "_bb"), f = e.node(s);
+  let a = Lt(e, "_bt"), c = Lt(e, "_bb"), f = e.node(s);
   e.setParent(a, s), f.borderTop = a, e.setParent(c, s), f.borderBottom = c, d.forEach((h) => {
     var g;
-    En(e, t, n, r, o, i, h);
-    let b = e.node(h), E = b.borderTop ? b.borderTop : h, m = b.borderBottom ? b.borderBottom : h, x = b.borderTop ? r : 2 * r, C = E !== m ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
-    e.setEdge(a, E, { weight: x, minlen: C, nestingEdge: !0 }), e.setEdge(m, c, { weight: x, minlen: C, nestingEdge: !0 });
+    Sn(e, t, n, r, o, i, h);
+    let E = e.node(h), m = E.borderTop ? E.borderTop : h, p = E.borderBottom ? E.borderBottom : h, k = E.borderTop ? r : 2 * r, x = m !== p ? 1 : o - ((g = i[s]) != null ? g : 0) + 1;
+    e.setEdge(a, m, { weight: k, minlen: x, nestingEdge: !0 }), e.setEdge(p, c, { weight: k, minlen: x, nestingEdge: !0 });
   }), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
 }
 function Go(e) {
@@ -961,7 +961,7 @@ function Go(e) {
     let i = e.children(r);
     i && i.length && i.forEach((s) => n(s, o + 1)), t[r] = o;
   }
-  return e.children(je).forEach((r) => n(r, 1)), t;
+  return e.children(Ae).forEach((r) => n(r, 1)), t;
 }
 function Yo(e) {
   return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
@@ -978,55 +978,55 @@ function Uo(e) {
     let r = e.children(n), o = e.node(n);
     if (r.length && r.forEach(t), Object.hasOwn(o, "minRank")) {
       o.borderLeft = [], o.borderRight = [];
-      for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) Lt(e, "borderLeft", "_bl", n, o, i), Lt(e, "borderRight", "_br", n, o, i);
+      for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) At(e, "borderLeft", "_bl", n, o, i), At(e, "borderRight", "_br", n, o, i);
     }
   }
-  e.children(je).forEach(t);
+  e.children(Ae).forEach(t);
 }
-function Lt(e, t, n, r, o, i) {
-  let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = ue(e, "border", s, n);
+function At(e, t, n, r, o, i) {
+  let s = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = me(e, "border", s, n);
   o[t][i] = d, e.setParent(d, r), l && e.setEdge(l, d, { weight: 1 });
 }
 function Vo(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "lr" || n === "rl") && xn(e);
+  (n === "lr" || n === "rl") && Nn(e);
 }
-function Xo(e) {
+function qo(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "bt" || n === "rl") && qo(e), (n === "lr" || n === "rl") && (Jo(e), xn(e));
+  (n === "bt" || n === "rl") && Xo(e), (n === "lr" || n === "rl") && (Jo(e), Nn(e));
 }
-function xn(e) {
-  e.nodes().forEach((t) => Pt(e.node(t))), e.edges().forEach((t) => Pt(e.edge(t)));
+function Nn(e) {
+  e.nodes().forEach((t) => Bt(e.node(t))), e.edges().forEach((t) => Bt(e.edge(t)));
 }
-function Pt(e) {
+function Bt(e) {
   let t = e.width;
   e.width = e.height, e.height = t;
 }
-function qo(e) {
-  e.nodes().forEach((t) => We(e.node(t))), e.edges().forEach((t) => {
+function Xo(e) {
+  e.nodes().forEach((t) => He(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
-    (n = r.points) == null || n.forEach(We), Object.hasOwn(r, "y") && We(r);
+    (n = r.points) == null || n.forEach(He), Object.hasOwn(r, "y") && He(r);
   });
 }
-function We(e) {
+function He(e) {
   e.y = -e.y;
 }
 function Jo(e) {
-  e.nodes().forEach((t) => $e(e.node(t))), e.edges().forEach((t) => {
+  e.nodes().forEach((t) => Ue(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
-    (n = r.points) == null || n.forEach($e), Object.hasOwn(r, "x") && $e(r);
+    (n = r.points) == null || n.forEach(Ue), Object.hasOwn(r, "x") && Ue(r);
   });
 }
-function $e(e) {
+function Ue(e) {
   let t = e.x;
   e.x = e.y, e.y = t;
 }
 function Zo(e) {
-  let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = J(Math.max, r), i = be(o + 1).map(() => []);
+  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 = Se(o + 1).map(() => []);
   function s(l) {
     if (t[l]) return;
     t[l] = !0;
@@ -1100,7 +1100,7 @@ function ri(e) {
     let o = e.pop();
     t.push(o), o.in.reverse().forEach(n(o)), o.out.forEach(r(o));
   }
-  return t.filter((o) => !o.merged).map((o) => Oe(o, ["vs", "i", "barycenter", "weight"]));
+  return t.filter((o) => !o.merged).map((o) => Fe(o, ["vs", "i", "barycenter", "weight"]));
 }
 function oi(e, t) {
   let n = 0, r = 0;
@@ -1108,13 +1108,13 @@ function oi(e, t) {
 }
 function ii(e, t) {
   let n = io(e, (c) => Object.hasOwn(c, "barycenter")), r = n.lhs, o = n.rhs.sort((c, f) => f.i - c.i), i = [], s = 0, l = 0, d = 0;
-  r.sort(si(!!t)), d = Ft(i, o, d), r.forEach((c) => {
-    d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = Ft(i, o, d);
+  r.sort(si(!!t)), d = Dt(i, o, d), r.forEach((c) => {
+    d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = Dt(i, o, d);
   });
   let a = { vs: i.flat(1) };
   return l && (a.barycenter = s / l, a.weight = l), a;
 }
-function Ft(e, t, n) {
+function Dt(e, t, n) {
   let r;
   for (; t.length && (r = t[t.length - 1]).i <= n; ) t.pop(), e.push(r.vs), n++;
   return n;
@@ -1122,13 +1122,13 @@ function Ft(e, t, n) {
 function si(e) {
   return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
 }
-function kn(e, t, n, r) {
+function Cn(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, d = {};
   s && (o = o.filter((h) => h !== s && h !== l));
   let a = ti(e, o);
   a.forEach((h) => {
     if (e.children(h.v).length) {
-      let g = kn(e, h.v, n, r);
+      let g = Cn(e, h.v, n, r);
       d[h.v] = g, Object.hasOwn(g, "barycenter") && ai(h, g);
     }
   });
@@ -1139,8 +1139,8 @@ function kn(e, t, n, r) {
     f.vs = [s, f.vs, l].flat(1);
     let h = e.predecessors(s);
     if (h && h.length) {
-      let g = e.node(h[0]), b = e.predecessors(l), E = e.node(b[0]);
-      Object.hasOwn(f, "barycenter") || (f.barycenter = 0, f.weight = 0), f.barycenter = (f.barycenter * f.weight + g.order + E.order) / (f.weight + 2), f.weight += 2;
+      let g = e.node(h[0]), E = e.predecessors(l), m = e.node(E[0]);
+      Object.hasOwn(f, "barycenter") || (f.barycenter = 0, f.weight = 0), f.barycenter = (f.barycenter * f.weight + g.order + m.order) / (f.weight + 2), f.weight += 2;
     }
   }
   return f;
@@ -1155,7 +1155,7 @@ function ai(e, t) {
 }
 function di(e, t, n, r) {
   r || (r = e.nodes());
-  let o = ci(e), i = new V({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
+  let o = ci(e), i = new q({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
   return r.forEach((s) => {
     let l = e.node(s), d = e.parent(s);
     if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
@@ -1170,7 +1170,7 @@ function di(e, t, n, r) {
 }
 function ci(e) {
   let t;
-  for (; e.hasNode(t = et("_root")); ) ;
+  for (; e.hasNode(t = it("_root")); ) ;
   return t;
 }
 function fi(e, t, n) {
@@ -1186,22 +1186,22 @@ function fi(e, t, n) {
     }
   });
 }
-function _n(e, t = {}) {
+function Tn(e, t = {}) {
   if (typeof t.customOrder == "function") {
-    t.customOrder(e, _n);
+    t.customOrder(e, Tn);
     return;
   }
-  let n = un(e), r = Rt(e, be(1, n + 1), "inEdges"), o = Rt(e, be(n - 1, -1, -1), "outEdges"), i = Zo(e);
-  if (At(e, i), t.disableOptimalOrderHeuristic) return;
+  let n = yn(e), r = Wt(e, Se(1, n + 1), "inEdges"), o = Wt(e, Se(n - 1, -1, -1), "outEdges"), i = Zo(e);
+  if ($t(e, i), t.disableOptimalOrderHeuristic) return;
   let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
   for (let a = 0, c = 0; c < 4; ++a, ++c) {
-    ui(a % 2 ? r : o, a % 4 >= 2, d), i = we(e);
+    ui(a % 2 ? r : o, a % 4 >= 2, d), i = Te(e);
     let f = Qo(e, i);
     f < s ? (c = 0, l = Object.assign({}, i), s = f) : f === s && (l = structuredClone(i));
   }
-  At(e, l);
+  $t(e, l);
 }
-function Rt(e, t, n) {
+function Wt(e, t, n) {
   let r = /* @__PURE__ */ new Map(), o = (i, s) => {
     r.has(i) || r.set(i, []), r.get(i).push(s);
   };
@@ -1214,14 +1214,14 @@ function Rt(e, t, n) {
   });
 }
 function ui(e, t, n) {
-  let r = new V();
+  let r = new q();
   e.forEach(function(o) {
     n.forEach((l) => r.setEdge(l.left, l.right));
-    let i = o.graph().root, s = kn(o, i, r, t);
+    let i = o.graph().root, s = Cn(o, i, r, t);
     s.vs.forEach((l, d) => o.node(l).order = d), fi(o, r, s.vs);
   });
 }
-function At(e, t) {
+function $t(e, t) {
   Object.values(t).forEach((n) => n.forEach((r, o) => e.node(r).order = o));
 }
 function hi(e, t) {
@@ -1230,11 +1230,11 @@ function hi(e, t) {
     let s = 0, l = 0, d = o.length, a = i[i.length - 1];
     return i.forEach((c, f) => {
       let h = pi(e, c), g = h ? e.node(h).order : d;
-      (h || c === a) && (i.slice(l, f + 1).forEach((b) => {
-        let E = e.predecessors(b);
-        E && E.forEach((m) => {
-          let x = e.node(m), C = x.order;
-          (C < s || g < C) && !(x.dummy && e.node(b).dummy) && Sn(n, m, b);
+      (h || c === a) && (i.slice(l, f + 1).forEach((E) => {
+        let m = e.predecessors(E);
+        m && m.forEach((p) => {
+          let k = e.node(p), x = k.order;
+          (x < s || g < x) && !(k.dummy && e.node(E).dummy) && In(n, p, E);
         });
       }), l = f + 1, s = g);
     }), i;
@@ -1244,14 +1244,14 @@ function hi(e, t) {
 function gi(e, t) {
   let n = {};
   function r(i, s, l, d, a) {
-    be(s, l).forEach((c) => {
+    Se(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 b = e.node(g);
-          b.dummy && (b.order < d || b.order > a) && Sn(n, g, f);
+          let E = e.node(g);
+          E.dummy && (E.order < d || E.order > a) && In(n, g, f);
         });
       }
     });
@@ -1278,7 +1278,7 @@ function pi(e, t) {
     if (n) return n.find((r) => e.node(r).dummy);
   }
 }
-function Sn(e, t, n) {
+function In(e, t, n) {
   if (t > n) {
     let o = t;
     t = n, n = o;
@@ -1305,17 +1305,17 @@ function bi(e, t, n, r) {
     l.forEach((a) => {
       let c = r(a);
       if (c && c.length) {
-        let f = c.sort((g, b) => {
-          let E = s[g], m = s[b];
-          return (E !== void 0 ? E : 0) - (m !== void 0 ? m : 0);
+        let f = c.sort((g, E) => {
+          let m = s[g], p = s[E];
+          return (m !== void 0 ? m : 0) - (p !== void 0 ? p : 0);
         }), h = (f.length - 1) / 2;
-        for (let g = Math.floor(h), b = Math.ceil(h); g <= b; ++g) {
-          let E = f[g];
-          if (E === void 0) continue;
-          let m = s[E];
-          if (m !== void 0 && i[a] === a && d < m && !yi(n, a, E)) {
-            let x = o[E];
-            x !== void 0 && (i[E] = a, i[a] = o[a] = x, d = m);
+        for (let g = Math.floor(h), E = Math.ceil(h); g <= E; ++g) {
+          let m = f[g];
+          if (m === void 0) continue;
+          let p = s[m];
+          if (p !== void 0 && i[a] === a && d < p && !yi(n, a, m)) {
+            let k = o[m];
+            k !== void 0 && (i[m] = a, i[a] = o[a] = k, d = p);
           }
         }
       }
@@ -1324,33 +1324,33 @@ function bi(e, t, n, r) {
 }
 function mi(e, t, n, r, o = !1) {
   let i = {}, s = vi(e, t, n, o), l = o ? "borderLeft" : "borderRight";
-  function d(g, b) {
-    let E = s.nodes().slice(), m = {}, x = E.pop();
-    for (; x; ) {
-      if (m[x]) g(x);
+  function d(g, E) {
+    let m = s.nodes().slice(), p = {}, k = m.pop();
+    for (; k; ) {
+      if (p[k]) g(k);
       else {
-        m[x] = !0, E.push(x);
-        for (let C of b(x)) E.push(C);
+        p[k] = !0, m.push(k);
+        for (let x of E(k)) m.push(x);
       }
-      x = E.pop();
+      k = m.pop();
     }
   }
   function a(g) {
-    let b = s.inEdges(g);
-    b ? i[g] = b.reduce((E, m) => {
-      var x;
-      let C = (x = i[m.v]) != null ? x : 0, M = s.edge(m);
-      return Math.max(E, C + (M !== void 0 ? M : 0));
+    let E = s.inEdges(g);
+    E ? i[g] = E.reduce((m, p) => {
+      var k;
+      let x = (k = i[p.v]) != null ? k : 0, O = s.edge(p);
+      return Math.max(m, x + (O !== void 0 ? O : 0));
     }, 0) : i[g] = 0;
   }
   function c(g) {
-    let b = s.outEdges(g), E = Number.POSITIVE_INFINITY;
-    b && (E = b.reduce((x, C) => {
-      let M = i[C.w], z = s.edge(C);
-      return Math.min(x, (M !== void 0 ? M : 0) - (z !== void 0 ? z : 0));
+    let E = s.outEdges(g), m = Number.POSITIVE_INFINITY;
+    E && (m = E.reduce((k, x) => {
+      let O = i[x.w], z = s.edge(x);
+      return Math.min(k, (O !== void 0 ? O : 0) - (z !== void 0 ? z : 0));
     }, Number.POSITIVE_INFINITY));
-    let m = e.node(g);
-    E !== Number.POSITIVE_INFINITY && m.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, E));
+    let p = e.node(g);
+    m !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, m));
   }
   function f(g) {
     return s.predecessors(g) || [];
@@ -1359,13 +1359,13 @@ function mi(e, t, n, r, o = !1) {
     return s.successors(g) || [];
   }
   return d(a, f), d(c, h), Object.keys(r).forEach((g) => {
-    var b;
-    let E = n[g];
-    E !== void 0 && (i[g] = (b = i[E]) != null ? b : 0);
+    var E;
+    let m = n[g];
+    m !== void 0 && (i[g] = (E = i[m]) != null ? E : 0);
   }), i;
 }
 function vi(e, t, n, r) {
-  let o = new V(), i = e.graph(), s = _i(i.nodesep, i.edgesep, r);
+  let o = new q(), i = e.graph(), s = _i(i.nodesep, i.edgesep, r);
   return t.forEach((l) => {
     let d;
     l.forEach((a) => {
@@ -1395,19 +1395,19 @@ function wi(e, t) {
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
 function Ei(e, t) {
-  let n = Object.values(t), r = J(Math.min, n), o = J(Math.max, n);
+  let n = Object.values(t), r = Q(Math.min, n), o = Q(Math.max, n);
   ["u", "d"].forEach((i) => {
     ["l", "r"].forEach((s) => {
       let l = i + s, d = e[l];
       if (!d || d === t) return;
-      let a = Object.values(d), c = r - J(Math.min, a);
-      s !== "l" && (c = o - J(Math.max, a)), c && (e[l] = Me(d, (f) => f + c));
+      let a = Object.values(d), c = r - Q(Math.min, a);
+      s !== "l" && (c = o - Q(Math.max, a)), c && (e[l] = Re(d, (f) => f + c));
     });
   });
 }
 function xi(e, t = void 0) {
   let n = e.ul;
-  return n ? Me(n, (r, o) => {
+  return n ? Re(n, (r, o) => {
     var i, s;
     if (t) {
       let d = t.toLowerCase(), a = e[d];
@@ -1421,12 +1421,12 @@ function xi(e, t = void 0) {
   }) : {};
 }
 function ki(e) {
-  let t = we(e), n = Object.assign(hi(e, t), gi(e, t)), r = {}, o;
+  let t = Te(e), n = Object.assign(hi(e, t), gi(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 d = bi(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = mi(e, o, d.root, d.align, l === "r");
-      l === "r" && (a = Me(a, (c) => -c)), r[s + l] = a;
+      l === "r" && (a = Re(a, (c) => -c)), r[s + l] = a;
     });
   });
   let i = wi(e, r);
@@ -1458,10 +1458,10 @@ function Si(e, t) {
   return e.node(t).width;
 }
 function Ni(e) {
-  e = cn(e), Ci(e), Object.entries(ki(e)).forEach(([t, n]) => e.node(t).x = n);
+  e = gn(e), Ci(e), Object.entries(ki(e)).forEach(([t, n]) => e.node(t).x = n);
 }
 function Ci(e) {
-  let t = we(e), n = e.graph(), r = n.ranksep, o = n.rankalign, i = 0;
+  let t = Te(e), n = e.graph(), r = n.ranksep, o = n.rankalign, i = 0;
   t.forEach((s) => {
     let l = s.reduce((d, a) => {
       var c;
@@ -1475,14 +1475,14 @@ function Ci(e) {
   });
 }
 function Ti(e, t = {}) {
-  let n = t.debugTiming ? hn : gn;
+  let n = t.debugTiming ? bn : mn;
   return n("layout", () => {
     let r = n("  buildLayoutGraph", () => Ai(e));
     return n("  runLayout", () => Ii(r, n, t)), n("  updateInputGraph", () => Oi(e, r)), r;
   });
 }
 function Ii(e, t, n) {
-  t("    makeSpaceForEdgeLabels", () => Bi(e)), t("    removeSelfEdges", () => Vi(e)), t("    acyclic", () => mo(e)), t("    nestingGraph.run", () => $o(e)), t("    rank", () => Lo(cn(e))), t("    injectEdgeLabelProxies", () => Di(e)), t("    removeEmptyRanks", () => ro(e)), t("    nestingGraph.cleanup", () => Ko(e)), t("    normalizeRanks", () => no(e)), t("    assignRankMinMax", () => Wi(e)), t("    removeEdgeLabelProxies", () => $i(e)), t("    normalize.run", () => Eo(e)), t("    parentDummyChains", () => Ao(e)), t("    addBorderSegments", () => Ho(e)), t("    order", () => _n(e, n)), t("    insertSelfEdges", () => Xi(e)), t("    adjustCoordinateSystem", () => Vo(e)), t("    position", () => Ni(e)), t("    positionSelfEdges", () => qi(e)), t("    removeBorderNodes", () => Ui(e)), t("    normalize.undo", () => ko(e)), t("    fixupEdgeLabelCoords", () => Ki(e)), t("    undoCoordinateSystem", () => Xo(e)), t("    translateGraph", () => Gi(e)), t("    assignNodeIntersects", () => Yi(e)), t("    reversePoints", () => Hi(e)), t("    acyclic.undo", () => wo(e));
+  t("    makeSpaceForEdgeLabels", () => Bi(e)), t("    removeSelfEdges", () => Vi(e)), t("    acyclic", () => mo(e)), t("    nestingGraph.run", () => $o(e)), t("    rank", () => Lo(gn(e))), t("    injectEdgeLabelProxies", () => Di(e)), t("    removeEmptyRanks", () => ro(e)), t("    nestingGraph.cleanup", () => Ko(e)), t("    normalizeRanks", () => no(e)), t("    assignRankMinMax", () => Wi(e)), t("    removeEdgeLabelProxies", () => $i(e)), t("    normalize.run", () => Eo(e)), t("    parentDummyChains", () => Ao(e)), t("    addBorderSegments", () => Ho(e)), t("    order", () => Tn(e, n)), t("    insertSelfEdges", () => qi(e)), t("    adjustCoordinateSystem", () => Vo(e)), t("    position", () => Ni(e)), t("    positionSelfEdges", () => Xi(e)), t("    removeBorderNodes", () => Ui(e)), t("    normalize.undo", () => ko(e)), t("    fixupEdgeLabelCoords", () => Ki(e)), t("    undoCoordinateSystem", () => qo(e)), t("    translateGraph", () => Gi(e)), t("    assignNodeIntersects", () => Yi(e)), t("    reversePoints", () => Hi(e)), t("    acyclic.undo", () => wo(e));
 }
 function Oi(e, t) {
   e.nodes().forEach((n) => {
@@ -1493,19 +1493,19 @@ function Oi(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 Mi = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ji = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, zi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Li = ["width", "height", "rank"], Bt = { width: 0, height: 0 }, Pi = ["minlen", "weight", "width", "height", "labeloffset"], Fi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Ri = ["labelpos"];
+var Mi = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], ji = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, zi = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Li = ["width", "height", "rank"], Gt = { width: 0, height: 0 }, Pi = ["minlen", "weight", "width", "height", "labeloffset"], Fi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Ri = ["labelpos"];
 function Ai(e) {
-  let t = new V({ multigraph: !0, compound: !0 }), n = Ye(e.graph());
-  return t.setGraph(Object.assign({}, ji, Ge(n, Mi), Oe(n, zi))), e.nodes().forEach((r) => {
-    let o = Ye(e.node(r)), i = Ge(o, Li);
-    Object.keys(Bt).forEach((l) => {
-      i[l] === void 0 && (i[l] = Bt[l]);
+  let t = new q({ multigraph: !0, compound: !0 }), n = qe(e.graph());
+  return t.setGraph(Object.assign({}, ji, Ve(n, Mi), Fe(n, zi))), e.nodes().forEach((r) => {
+    let o = qe(e.node(r)), i = Ve(o, Li);
+    Object.keys(Gt).forEach((l) => {
+      i[l] === void 0 && (i[l] = Gt[l]);
     }), t.setNode(r, i);
     let s = e.parent(r);
     s !== void 0 && t.setParent(r, s);
   }), e.edges().forEach((r) => {
-    let o = Ye(e.edge(r));
-    t.setEdge(r, Object.assign({}, Fi, Ge(o, Pi), Oe(o, Ri)));
+    let o = qe(e.edge(r));
+    t.setEdge(r, Object.assign({}, Fi, Ve(o, Pi), Fe(o, Ri)));
   }), t;
 }
 function Bi(e) {
@@ -1520,7 +1520,7 @@ function Di(e) {
     let n = e.edge(t);
     if (n.width && n.height) {
       let r = e.node(t.v), o = { rank: (e.node(t.w).rank - r.rank) / 2 + r.rank, e: t };
-      ue(e, "edge-proxy", o, "_ep");
+      me(e, "edge-proxy", o, "_ep");
     }
   });
 }
@@ -1562,7 +1562,7 @@ function Gi(e) {
 function Yi(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));
+    n.points ? (i = n.points[0], s = n.points[n.points.length - 1]) : (n.points = [], i = o, s = r), n.points.unshift(zt(r, i)), n.points.push(zt(o, s));
   });
 }
 function Ki(e) {
@@ -1602,18 +1602,18 @@ function Vi(e) {
     }
   });
 }
-function Xi(e) {
-  we(e).forEach((t) => {
+function qi(e) {
+  Te(e).forEach((t) => {
     let n = 0;
     t.forEach((r, o) => {
       let i = e.node(r);
       i.order = o + n, (i.selfEdges || []).forEach((s) => {
-        ue(e, "selfedge", { width: s.label.width, height: s.label.height, rank: i.rank, order: o + ++n, e: s.e, label: s.label }, "_se");
+        me(e, "selfedge", { width: s.label.width, height: s.label.height, rank: i.rank, order: o + ++n, e: s.e, label: s.label }, "_se");
       }), delete i.selfEdges;
     });
   });
 }
-function qi(e) {
+function Xi(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     if (n.dummy === "selfedge") {
@@ -1622,17 +1622,17 @@ function qi(e) {
     }
   });
 }
-function Ge(e, t) {
-  return Me(Oe(e, t), Number);
+function Ve(e, t) {
+  return Re(Fe(e, t), Number);
 }
-function Ye(e) {
+function qe(e) {
   let t = {};
   return e && Object.entries(e).forEach(([n, r]) => {
     typeof n == "string" && (n = n.toLowerCase()), t[n] = r;
   }), t;
 }
 function Ji(e) {
-  let t = we(e), n = new V({ compound: !0, multigraph: !0 }).setGraph({});
+  let t = Te(e), n = new q({ compound: !0, multigraph: !0 }).setGraph({});
   return e.nodes().forEach((r) => {
     n.setNode(r, { label: r }), n.setParent(r, "layer" + e.node(r).rank);
   }), e.edges().forEach((r) => n.setEdge(r.v, r.w, {}, r.name)), t.forEach((r, o) => {
@@ -1640,16 +1640,16 @@ function Ji(e) {
     n.setNode(i, { rank: "same" }), r.reduce((s, l) => (n.setEdge(s, l, { style: "invis" }), l));
   }), n;
 }
-var Zi = { graphlib: en, version: ao, layout: Ti, debug: Ji, util: { time: hn, notime: gn } }, Dt = Zi;
+var Zi = { graphlib: on, version: ao, layout: Ti, debug: Ji, util: { time: bn, notime: mn } }, Yt = Zi;
 /*! For license information please see dagre.esm.js.LEGAL.txt */
 const Qi = (e) => {
   const t = [];
   return e.nodeInternals.forEach((n, r) => t.push(`${r}:${n.height ?? 0}`)), t.join(",");
 }, es = ({ onHeightsReady: e, nodeCount: t }) => {
-  const n = $n(Qi), r = _t("");
-  _t(0);
+  const n = $n(Qi), r = Tt("");
+  Tt(0);
   const { fitView: o } = Gn();
-  return re(() => {
+  return se(() => {
     if (!n || n === r.current) return;
     const i = {};
     for (const s of n.split(",")) {
@@ -1674,11 +1674,11 @@ function ns({
   saveLabel: s = "Save",
   saveDisabled: l = !1
 }) {
-  const [d, a] = D.useState(!1), [c, f] = D.useState(!1), [h, g] = D.useState(e ?? "");
-  D.useEffect(() => {
+  const [d, a] = G.useState(!1), [c, f] = G.useState(!1), [h, g] = G.useState(e ?? "");
+  G.useEffect(() => {
     g(e ?? "");
   }, [e]);
-  const b = async () => {
+  const E = async () => {
     if (!(!o || d || l)) {
       a(!0);
       try {
@@ -1687,7 +1687,7 @@ function ns({
         a(!1);
       }
     }
-  }, E = ts[r] ?? {
+  }, m = ts[r] ?? {
     bg: r,
     fg: "#fff"
   };
@@ -1709,12 +1709,12 @@ function ns({
             "input",
             {
               value: h,
-              onChange: (m) => g(m.target.value),
+              onChange: (p) => g(p.target.value),
               onBlur: () => {
                 f(!1), h !== e && t(h);
               },
-              onKeyDown: (m) => {
-                m.key === "Enter" && m.target.blur(), m.key === "Escape" && (g(e ?? ""), f(!1));
+              onKeyDown: (p) => {
+                p.key === "Enter" && p.target.blur(), p.key === "Escape" && (g(e ?? ""), f(!1));
               },
               autoFocus: !0,
               style: {
@@ -1753,8 +1753,8 @@ function ns({
                 fontWeight: 600,
                 padding: "3px 8px",
                 borderRadius: 999,
-                background: E.bg,
-                color: E.fg,
+                background: m.bg,
+                color: m.fg,
                 textTransform: "uppercase",
                 letterSpacing: 0.4,
                 flexShrink: 0
@@ -1788,7 +1788,7 @@ function ns({
             "button",
             {
               type: "button",
-              onClick: b,
+              onClick: E,
               disabled: d || l,
               style: {
                 padding: "6px 16px",
@@ -1813,16 +1813,16 @@ function ns({
     }
   );
 }
-const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i, width: s = 720 }) => {
-  const [l, d] = j(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ w(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 }),
+const Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i, width: s = 720 }) => {
+  const [l, d] = L(!1), a = () => d((h) => !h), c = () => /* @__PURE__ */ w(ne, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 }, children: [
+    r && /* @__PURE__ */ u(ne, { 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: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(vr, {}) : /* @__PURE__ */ u(wr, {}) }),
-    /* @__PURE__ */ u(St, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(or, {}) })
-  ] }), f = () => i ? /* @__PURE__ */ u(Q, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
+    /* @__PURE__ */ u(It, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(vr, {}) : /* @__PURE__ */ u(wr, {}) }),
+    /* @__PURE__ */ u(It, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(or, {}) })
+  ] }), f = () => i ? /* @__PURE__ */ u(ne, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
   return l ? /* @__PURE__ */ w(er, { 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(ne, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
     /* @__PURE__ */ u(f, {})
   ] }) : /* @__PURE__ */ w(
     tr,
@@ -1850,7 +1850,7 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       },
       children: [
         /* @__PURE__ */ u(c, {}),
-        /* @__PURE__ */ u(Q, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
+        /* @__PURE__ */ u(ne, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
         /* @__PURE__ */ u(f, {})
       ]
     }
@@ -1863,36 +1863,36 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   onClose: o,
   loadTriggerSources: i
 }) => {
-  const [s, l] = j("trigger"), [d, a] = j(null), [c, f] = j([]), [h, g] = j([]), [b, E] = j(!1), [m, x] = j(null);
-  re(() => {
-    e || (l("trigger"), a(null), f([]), g([]), E(!1), x(null));
+  const [s, l] = L("trigger"), [d, a] = L(null), [c, f] = L([]), [h, g] = L([]), [E, m] = L(!1), [p, k] = L(null);
+  se(() => {
+    e || (l("trigger"), a(null), f([]), g([]), m(!1), k(null));
   }, [e]);
-  const C = H(async (P) => {
+  const x = H(async (P) => {
     if (!i) {
       r(P);
       return;
     }
-    a(P), E(!0), x(null);
+    a(P), m(!0), k(null);
     try {
-      const B = await i(P.triggerKey);
-      if (!B || B.length === 0) {
+      const M = await i(P.triggerKey);
+      if (!M || M.length === 0) {
         r(P);
         return;
       }
-      f(B), l("sources");
-    } catch (B) {
-      x(B instanceof Error ? B.message : "Failed to load sources.");
+      f(M), l("sources");
+    } catch (M) {
+      k(M instanceof Error ? M.message : "Failed to load sources.");
     } finally {
-      E(!1);
+      m(!1);
     }
-  }, [i, r]), M = () => {
-    l("trigger"), a(null), f([]), g([]), x(null);
+  }, [i, r]), O = () => {
+    l("trigger"), a(null), f([]), g([]), k(null);
   }, z = () => {
     d && r(d, h);
-  }, L = s === "sources" && d, $ = L ? /* @__PURE__ */ w(ye, { children: [
-    /* @__PURE__ */ u(Ce, { type: "button", variant: "outlined", size: "small", onClick: M, children: n.cancel ?? "Back" }),
+  }, W = s === "sources" && d, $ = W ? /* @__PURE__ */ w(_e, { children: [
+    /* @__PURE__ */ u(ze, { type: "button", variant: "outlined", size: "small", onClick: O, children: n.cancel ?? "Back" }),
     /* @__PURE__ */ u(
-      Ce,
+      ze,
       {
         type: "button",
         variant: "contained",
@@ -1904,34 +1904,34 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
     )
   ] }) : null;
   return /* @__PURE__ */ u(
-    me,
+    Ne,
     {
       isOpen: e,
       onClose: o,
-      title: L ? d.label : n.addTriggerTitle,
+      title: W ? d.label : n.addTriggerTitle,
       icon: /* @__PURE__ */ u(mr, {}),
       width: 500,
       footer: $,
-      children: /* @__PURE__ */ w(Q, { sx: { p: 2 }, children: [
-        !L && /* @__PURE__ */ w(ye, { children: [
+      children: /* @__PURE__ */ w(ne, { sx: { p: 2 }, children: [
+        !W && /* @__PURE__ */ w(_e, { children: [
           /* @__PURE__ */ u("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 }, children: n.chooseTrigger }),
           /* @__PURE__ */ w("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: [
             t.map((P) => /* @__PURE__ */ w(
               "div",
               {
                 className: "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-start ff-gap-3",
-                style: { cursor: b ? "wait" : "pointer", transition: "background 0.15s", opacity: b ? 0.6 : 1 },
-                onClick: () => !b && C(P),
+                style: { cursor: E ? "wait" : "pointer", transition: "background 0.15s", opacity: E ? 0.6 : 1 },
+                onClick: () => !E && x(P),
                 role: "button",
                 tabIndex: 0,
-                onKeyDown: (B) => {
-                  B.key === "Enter" && !b && C(P);
+                onKeyDown: (M) => {
+                  M.key === "Enter" && !E && x(P);
                 },
-                onMouseEnter: (B) => {
-                  b || (B.currentTarget.style.background = "#f5f5f5");
+                onMouseEnter: (M) => {
+                  E || (M.currentTarget.style.background = "#f5f5f5");
                 },
-                onMouseLeave: (B) => {
-                  B.currentTarget.style.background = "";
+                onMouseLeave: (M) => {
+                  M.currentTarget.style.background = "";
                 },
                 children: [
                   /* @__PURE__ */ u("div", { style: { color: P.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: P.triggerCategory === "scheduler" ? /* @__PURE__ */ u(ir, { size: 18 }) : /* @__PURE__ */ u(sr, { size: 18 }) }),
@@ -1945,26 +1945,26 @@ const me = ({ 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 })
           ] }),
-          b && /* @__PURE__ */ w(Q, { sx: { display: "flex", alignItems: "center", gap: 1, mt: 2, fontSize: 12, color: "#64748b" }, children: [
+          E && /* @__PURE__ */ w(ne, { sx: { display: "flex", alignItems: "center", gap: 1, mt: 2, fontSize: 12, color: "#64748b" }, children: [
             /* @__PURE__ */ u(nr, { size: 14 }),
             /* @__PURE__ */ u("span", { children: "Loading sources for the selected trigger…" })
           ] }),
-          m && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: m })
+          p && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: p })
         ] }),
-        L && /* @__PURE__ */ w(ye, { children: [
+        W && /* @__PURE__ */ w(_e, { children: [
           /* @__PURE__ */ w(
             "div",
             {
               role: "button",
               tabIndex: 0,
-              onClick: M,
+              onClick: O,
               onKeyDown: (P) => {
-                P.key === "Enter" && M();
+                P.key === "Enter" && O();
               },
               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(Ut, { size: 16 }),
+                /* @__PURE__ */ u(Jt, { size: 16 }),
                 /* @__PURE__ */ u("span", { children: n.addTriggerTitle })
               ]
             }
@@ -1991,16 +1991,16 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, Ke = {
+}, Xe = {
   cursor: "pointer",
   transition: "background 0.15s"
-}, He = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", os = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
+}, Je = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", os = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
   const { apps: i, ungrouped: s } = U(() => {
     const f = /* @__PURE__ */ new Map(), h = [];
     for (const g of t)
       if (g.app) {
-        const b = f.get(g.app.key);
-        b ? b.descriptors.push(g) : f.set(g.app.key, {
+        const E = f.get(g.app.key);
+        E ? E.descriptors.push(g) : f.set(g.app.key, {
           key: g.app.key,
           label: g.app.label,
           icon: g.app.icon,
@@ -2010,22 +2010,22 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       } else
         h.push(g);
     return { apps: [...f.values()], ungrouped: h };
-  }, [t]), [l, d] = j(null), a = l ? i.find((f) => f.key === l) ?? null : null;
-  re(() => {
+  }, [t]), [l, d] = L(null), a = l ? i.find((f) => f.key === l) ?? null : null;
+  se(() => {
     e || d(null);
-  }, [e]), re(() => {
+  }, [e]), se(() => {
     d(null);
   }, [t]);
   const c = !a;
   return /* @__PURE__ */ u(
-    me,
+    Ne,
     {
       isOpen: e,
       onClose: o,
       title: c ? n.addStepTitle : a.label,
       icon: c ? /* @__PURE__ */ u(lr, {}) : a.icon ?? /* @__PURE__ */ u(ar, {}),
       width: 500,
-      children: /* @__PURE__ */ w(Q, { sx: { p: 2 }, children: [
+      children: /* @__PURE__ */ w(ne, { sx: { p: 2 }, children: [
         !c && /* @__PURE__ */ w(
           "div",
           {
@@ -2038,18 +2038,18 @@ const me = ({ 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(Ut, { size: 16 }),
+              /* @__PURE__ */ u(Jt, { 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 ${a.label}` }),
-        /* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ w(ye, { children: [
+        /* @__PURE__ */ u("div", { className: "ff-d-flex ff-flex-column ff-gap-2", children: c ? /* @__PURE__ */ w(_e, { children: [
           i.map((f) => /* @__PURE__ */ w(
             "div",
             {
-              className: He,
-              style: Ke,
+              className: Je,
+              style: Xe,
               onClick: () => d(f.key),
               role: "button",
               tabIndex: 0,
@@ -2068,7 +2068,7 @@ const me = ({ 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(Vt, { size: 18, color: "#9e9e9e" })
+                /* @__PURE__ */ u(Zt, { size: 18, color: "#9e9e9e" })
               ]
             },
             `app-${f.key}`
@@ -2076,8 +2076,8 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
           s.map((f) => /* @__PURE__ */ w(
             "div",
             {
-              className: He,
-              style: Ke,
+              className: Je,
+              style: Xe,
               onClick: () => r(f),
               role: "button",
               tabIndex: 0,
@@ -2103,8 +2103,8 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
           a.descriptors.map((f) => /* @__PURE__ */ w(
             "div",
             {
-              className: He,
-              style: Ke,
+              className: Je,
+              style: Xe,
               onClick: () => r(f),
               role: "button",
               tabIndex: 0,
@@ -2128,42 +2128,42 @@ const me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, Wt = "_conditionConfig";
-function $t(e) {
+}, Kt = "_conditionConfig";
+function Ht(e) {
   return Array.isArray(e) ? { layout: "flat", fields: e } : e && typeof e == "object" ? e : { layout: "flat", fields: [] };
 }
-function Gt(e) {
+function Ut(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 is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: s }) => {
-  const [l, d] = j({ layout: "flat", fields: [] }), [a, c] = j(!1), [f, h] = j(null), [g, b] = j({});
-  re(() => {
-    b((r == null ? void 0 : r[Wt]) ?? {});
-  }, [r, t]), re(() => {
-    let C = !1;
+  const [l, d] = L({ layout: "flat", fields: [] }), [a, c] = L(!1), [f, h] = L(null), [g, E] = L({});
+  se(() => {
+    E((r == null ? void 0 : r[Kt]) ?? {});
+  }, [r, t]), se(() => {
+    let x = !1;
     if (h(null), !n || !t || n.customPanel) {
       d({ layout: "flat", fields: [] }), c(!1);
       return;
     }
-    const M = n.formSchema;
-    return typeof M == "function" ? (c(!0), M(t).then((z) => {
-      C || (d($t(z)), c(!1));
+    const O = n.formSchema;
+    return typeof O == "function" ? (c(!0), O(t).then((z) => {
+      x || (d(Ht(z)), c(!1));
     }).catch((z) => {
-      C || (d({ layout: "flat", fields: [] }), h(z instanceof Error ? z.message : "Unable to load configuration."), c(!1));
-    })) : (d($t(M)), c(!1)), () => {
-      C = !0;
+      x || (d({ layout: "flat", fields: [] }), h(z instanceof Error ? z.message : "Unable to load configuration."), c(!1));
+    })) : (d(Ht(O)), c(!1)), () => {
+      x = !0;
     };
   }, [n, t]);
-  const E = t ? `node-config-form-${t}` : "node-config-form", m = !a && !f && Gt(l), x = m ? /* @__PURE__ */ w(ye, { children: [
-    /* @__PURE__ */ u(Ce, { type: "button", variant: "text", size: "small", sx: { textTransform: "none", color: "#475569" }, onClick: s, children: o.cancel }),
+  const m = t ? `node-config-form-${t}` : "node-config-form", p = !a && !f && Ut(l), k = p ? /* @__PURE__ */ w(_e, { children: [
+    /* @__PURE__ */ u(ze, { type: "button", variant: "text", size: "small", sx: { textTransform: "none", color: "#475569" }, onClick: s, children: o.cancel }),
     /* @__PURE__ */ u(
-      Ce,
+      ze,
       {
         type: "submit",
-        form: E,
+        form: m,
         variant: "contained",
         size: "small",
         disableElevation: !0,
@@ -2178,38 +2178,38 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
       }
     )
   ] }) : null;
-  return n != null && n.customPanel && t ? /* @__PURE__ */ u(me, { isOpen: e, onClose: s, title: n.label ?? o.configureStep, icon: n.icon, width: 500, children: n.customPanel({
+  return n != null && n.customPanel && t ? /* @__PURE__ */ u(Ne, { isOpen: e, onClose: s, title: n.label ?? o.configureStep, icon: n.icon, width: 500, children: n.customPanel({
     nodeId: t,
     data: r ?? {},
-    onSave: (C) => {
-      i(t, C), s();
+    onSave: (x) => {
+      i(t, x), s();
     },
     onClose: s
   }) }) : /* @__PURE__ */ u(
-    me,
+    Ne,
     {
       isOpen: e,
       onClose: s,
       title: (n == null ? void 0 : n.label) ?? o.configureStep,
       icon: n == null ? void 0 : n.icon,
       width: 500,
-      footer: x,
-      children: /* @__PURE__ */ w(Q, { sx: { p: 2 }, children: [
+      footer: k,
+      children: /* @__PURE__ */ w(ne, { sx: { p: 2 }, children: [
         a && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.loadingConfiguration }),
         !a && f && /* @__PURE__ */ u("p", { style: { fontSize: 13, color: "#d32f2f" }, children: f }),
-        !a && !f && !Gt(l) && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
-        m && /* @__PURE__ */ u(
+        !a && !f && !Ut(l) && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
+        p && /* @__PURE__ */ u(
           xr,
           {
             schema: l,
             initialValues: r ?? {},
-            formId: E,
+            formId: m,
             conditionConfig: g,
-            onConditionConfigChange: b,
-            onSubmit: (C) => {
+            onConditionConfigChange: E,
+            onSubmit: (x) => {
               if (!t) return;
-              const M = Object.keys(g).length > 0;
-              i(t, { ...C, [Wt]: M ? g : void 0 }), s();
+              const O = Object.keys(g).length > 0;
+              i(t, { ...x, [Kt]: O ? g : void 0 }), s();
             }
           }
         )
@@ -2223,15 +2223,15 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
   workflowLabel: r,
   onFetchWorkflow: o
 }) => {
-  const [i, s] = j({ status: "idle" });
-  return re(() => {
+  const [i, s] = L({ status: "idle" });
+  return se(() => {
     if (!e || !n) {
       s({ status: "idle" });
       return;
     }
     s({ status: "loading" }), o(n).then((l) => s({ status: "loaded", state: l })).catch((l) => s({ status: "error", message: (l == null ? void 0 : l.message) ?? "Failed to load workflow" }));
   }, [e, n, o]), /* @__PURE__ */ u(
-    me,
+    Ne,
     {
       isOpen: e,
       onClose: t,
@@ -2254,8 +2254,8 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
     }
   );
 }, ls = ({ state: e }) => {
-  const [t, n] = j(null), [r, o] = j(null);
-  return re(() => {
+  const [t, n] = L(null), [r, o] = L(null);
+  return se(() => {
     Promise.all([
       Promise.resolve().then(() => hs).then((i) => i.default),
       import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
@@ -2272,7 +2272,7 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
       readOnly: !0
     }
   ) });
-}, ve = 350, Xe = 70, qe = 60, Je = {
+}, Ce = 350, et = 70, tt = 60, nt = {
   startNode: 40,
   endNode: 40,
   addTriggerNode: 56,
@@ -2285,11 +2285,11 @@ const is = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o,
 }, as = {
   plusEdge: Zn,
   labelPlusEdge: Jn,
-  plainEdge: qn,
-  edgeWithPlusLabel: Xn,
+  plainEdge: Xn,
+  edgeWithPlusLabel: qn,
   gatewayBranchEdge: Vn
 };
-function Yt() {
+function Vt() {
   return [
     { id: "start", kind: "start", reactFlowType: "startNode" },
     { id: "addTrigger", kind: "addTrigger", reactFlowType: "addTriggerNode" },
@@ -2297,61 +2297,74 @@ function Yt() {
   ];
 }
 function ds(e, t, n, r = "TB") {
-  const o = new Dt.graphlib.Graph();
+  const o = new Yt.graphlib.Graph();
   return o.setGraph({ rankdir: r, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
-    const s = n[i.id] ?? { width: ve, height: Je[i.type ?? ""] ?? 80 };
+    const s = n[i.id] ?? { width: Ce, height: nt[i.type ?? ""] ?? 80 };
     o.setNode(i.id, { width: s.width, height: s.height });
-  }), t.forEach((i) => o.setEdge(i.source, i.target)), Dt.layout(o), e.map((i) => {
+  }), t.forEach((i) => o.setEdge(i.source, i.target)), Yt.layout(o), e.map((i) => {
     var a, c;
-    const s = o.node(i.id), l = ((a = n[i.id]) == null ? void 0 : a.width) ?? ve, d = ((c = n[i.id]) == null ? void 0 : c.height) ?? Je[i.type ?? ""] ?? 80;
+    const s = o.node(i.id), l = ((a = n[i.id]) == null ? void 0 : a.width) ?? Ce, d = ((c = n[i.id]) == null ? void 0 : c.height) ?? nt[i.type ?? ""] ?? 80;
     return { ...i, position: { x: s.x - l / 2, y: s.y - d / 2 } };
   });
 }
-const le = (e) => e === "filter" || e === "approval";
+const fe = (e) => e === "filter" || e === "approval";
 function cs(e, t, n, r) {
-  const s = Xe, l = 30, d = 30, a = {}, c = {}, f = /* @__PURE__ */ new Map();
-  for (const m of e) f.set(m.id, m);
-  for (const m of Object.values(t))
-    for (const x of Object.values(m))
-      for (const C of x) f.set(C.id, C);
-  const h = (m, x, C) => {
-    const M = r[m] ?? { width: ve, height: 80 };
-    return a[m] = { x: x - M.width / 2, y: C }, C + M.height;
-  }, g = (m, x, C) => {
-    let M = C;
-    for (const z of m)
-      M = h(z.id, x, M) + s, le(z.kind) && t[z.id] && (M = b(z.id, x, M));
-    return M;
-  }, b = (m, x, C) => {
-    const M = x + 180, z = t[m], L = Object.keys(z), $ = f.get(m), P = ($ == null ? void 0 : $.branchLabels) ?? { pass: "Pass", fail: "Fail" }, B = a[m], G = r[m] ?? { height: 80 }, Ee = B.y + G.height, xe = [];
-    let te = C;
-    return L.forEach((he, ke) => {
-      const ze = z[he], Le = te;
-      xe.push({
-        y: Le - Ee,
-        label: P[he] ?? he,
-        isPass: ke === 0
-      }), te = g(ze, M, te + d), ke < L.length - 1 && (te += l);
-    }), c[m] = {
-      branches: xe,
-      height: te - Ee,
+  const s = et, l = 30, d = 30, a = {}, c = {}, f = /* @__PURE__ */ new Map();
+  for (const p of e) f.set(p.id, p);
+  for (const p of Object.values(t))
+    for (const k of Object.values(p))
+      for (const x of k) f.set(x.id, x);
+  const h = (p, k, x) => {
+    const O = r[p] ?? { width: Ce, height: 80 };
+    return a[p] = { x: k - O.width / 2, y: x }, x + O.height;
+  }, g = (p, k, x) => {
+    let O = x;
+    for (const z of p)
+      O = h(z.id, k, O) + s, fe(z.kind) && t[z.id] && (O = E(z.id, k, O));
+    return O;
+  }, E = (p, k, x) => {
+    const O = k + 180, z = t[p], W = Object.keys(z), $ = f.get(p), P = ($ == null ? void 0 : $.branchLabels) ?? { pass: "Pass", fail: "Fail" }, M = a[p], V = r[p] ?? { height: 80 }, oe = M.y + V.height;
+    if (($ == null ? void 0 : $.branchStyle) === "inline-gate") {
+      const ie = [];
+      let ee = M.y + V.height / 2;
+      W.slice(1).forEach((ge) => {
+        var Ie, we;
+        ie.push({ y: ee - oe, label: P[ge] ?? ge, isPass: !1 });
+        const Be = ee - (((we = r[(Ie = z[ge][0]) == null ? void 0 : Ie.id]) == null ? void 0 : we.height) ?? 50) / 2;
+        ee = g(z[ge], O, Be) + l;
+      });
+      const he = g(z[W[0]], k, x);
+      return c[p] = { branches: ie, height: Math.max(ee, he) - oe, indent: 180 }, Math.max(he, ee);
+    }
+    const le = [];
+    let A = x;
+    return W.forEach((ie, ve) => {
+      const ee = z[ie], he = A;
+      le.push({
+        y: he - oe,
+        label: P[ie] ?? ie,
+        isPass: ve === 0
+      }), A = g(ee, O, A + d), ve < W.length - 1 && (A += l);
+    }), c[p] = {
+      branches: le,
+      height: A - oe,
       indent: 180
-    }, te;
+    }, A;
   };
-  let E = qe;
-  for (const m of e)
-    E = h(m.id, 400, E) + s, le(m.kind) && t[m.id] && (E = b(m.id, 400, E));
+  let m = tt;
+  for (const p of e)
+    m = h(p.id, 400, m) + s, fe(p.kind) && t[p.id] && (m = E(p.id, 400, m));
   return {
-    nodes: n.map((m) => a[m.id] ? { ...m, position: a[m.id] } : m),
+    nodes: n.map((p) => a[p.id] ? { ...p, position: a[p.id] } : p),
     railSpecs: c
   };
 }
-function Kt(e) {
+function qt(e) {
   return {
     id: e.id,
     type: e.reactFlowType,
     position: { x: 0, y: 0 },
-    data: { ...e.nodeData, ...e.formData, descriptorType: e.descriptorType },
+    data: { ...e.nodeData, ...e.formData, descriptorType: e.descriptorType, branchStyle: e.branchStyle },
     draggable: !1,
     selectable: !1
   };
@@ -2371,78 +2384,92 @@ function fs(e, t, n, r, o) {
   };
 }
 function us(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
-  const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (b, E) => {
-    const m = t[b];
-    if (!m) return;
-    const C = E ?? { pass: "Pass", fail: "Fail" }, M = Object.keys(m), z = (L, $, P, B) => {
-      if (L.length !== 0) {
-        L.forEach((G) => d.push(Kt(G))), a.push({
-          id: `e-${b}-${$}-start`,
-          source: b,
-          target: L[0].id,
+  const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (m, p, k) => {
+    const x = t[m];
+    if (!x) return;
+    const z = p ?? { pass: "Pass", fail: "Fail" }, W = Object.keys(x), $ = k === "inline-gate", P = (M, V, oe, le) => {
+      if (M.length !== 0) {
+        M.forEach((A) => d.push(qt(A))), $ && le === 0 ? a.push({
+          id: `e-${m}-${V}-start`,
+          source: m,
+          sourceHandle: "pass",
+          target: M[0].id,
+          type: "plusEdge",
+          style: { stroke: l },
+          data: { onAddStepClick: n, referenceNodeType: "filterNode", filterId: m, branch: V }
+        }) : a.push({
+          id: `e-${m}-${V}-start`,
+          source: m,
+          // inline-gate Fail leaves the dedicated RIGHT handle so it routes out
+          // to the side instead of tangling with the Pass edge at the bottom.
+          ...$ ? { sourceHandle: "fail" } : {},
+          target: M[0].id,
           type: "gatewayBranchEdge",
           style: { stroke: l },
-          data: { branch: $, filterId: b, label: P, isFirst: B === 0, onAddStepClick: n, verticalRouting: s === "vertical" }
+          data: { branch: V, filterId: m, label: oe, isFirst: le === 0, onAddStepClick: n, verticalRouting: s === "vertical" && !$, sideRouting: $ }
         });
-        for (let G = 1; G < L.length; G++)
-          le(L[G - 1].kind) || a.push(fs(L[G - 1], L[G], l, n, { filterId: b, branch: $ }));
-        for (const G of L)
-          le(G.kind) && t[G.id] && c(G.id, G.branchLabels);
+        for (let A = 1; A < M.length; A++)
+          fe(M[A - 1].kind) || a.push(fs(M[A - 1], M[A], l, n, { filterId: m, branch: V }));
+        for (const A of M)
+          fe(A.kind) && t[A.id] && c(A.id, A.branchLabels, A.branchStyle);
       }
     };
-    M.forEach((L, $) => {
-      z(m[L], L, C[L] ?? L, $);
+    W.forEach((M, V) => {
+      P(x[M], M, z[M] ?? M, V);
     });
   };
-  for (let b = 0; b < e.length; b++) {
-    const E = e[b];
-    if (d.push(Kt(E)), b > 0) {
-      const m = e[b - 1], x = m.kind === "start" || m.kind === "addTrigger";
-      if (m.kind === "filter" || m.kind === "approval") continue;
+  for (let m = 0; m < e.length; m++) {
+    const p = e[m];
+    if (d.push(qt(p)), m > 0) {
+      const k = e[m - 1], x = k.kind === "start" || k.kind === "addTrigger";
+      if (k.kind === "filter" || k.kind === "approval") continue;
       a.push({
-        id: `e-${m.id}-${E.id}`,
-        source: m.id,
-        target: E.id,
+        id: `e-${k.id}-${p.id}`,
+        source: k.id,
+        target: p.id,
         type: x ? "plainEdge" : "plusEdge",
         style: { stroke: l },
         data: x ? {} : {
           onAddStepClick: n,
-          referenceNodeType: m.reactFlowType
+          referenceNodeType: k.reactFlowType
         }
       });
     }
-    (E.kind === "filter" || E.kind === "approval") && t[E.id] && c(E.id, E.branchLabels);
+    (p.kind === "filter" || p.kind === "approval") && t[p.id] && c(p.id, p.branchLabels, p.branchStyle);
   }
   const f = {};
-  if (d.forEach((b) => {
-    f[b.id] = {
-      width: ve,
-      height: r[b.id] ?? Je[b.type ?? ""] ?? 80
+  if (d.forEach((m) => {
+    f[m.id] = {
+      width: Ce,
+      height: r[m.id] ?? nt[m.type ?? ""] ?? 80
     };
   }), !(Object.keys(t).length > 0)) {
     if (i === "LR") {
-      let C = qe;
-      return { nodes: d.map((z) => {
-        const L = f[z.id].width, $ = f[z.id].height, P = { ...z, position: { x: C, y: 300 - $ / 2 } };
-        return C += L + Xe, P;
+      let O = tt;
+      return { nodes: d.map((W) => {
+        const $ = f[W.id].width, P = f[W.id].height, M = { ...W, position: { x: O, y: 300 - P / 2 } };
+        return O += $ + et, M;
       }), edges: a };
     }
-    const b = 400;
-    let E = qe;
+    const m = 400;
+    let p = tt;
     return { nodes: d.map((x) => {
-      const C = f[x.id].height, M = { ...x, position: { x: b - ve / 2, y: E } };
-      return E += C + Xe, M;
+      const O = f[x.id].height, z = { ...x, position: { x: m - Ce / 2, y: p } };
+      return p += O + et, z;
     }), edges: a };
   }
-  if (s === "vertical") {
-    const { nodes: b, railSpecs: E } = cs(e, t, d, f);
-    return { nodes: b.map(
-      (x) => E[x.id] ? { ...x, data: { ...x.data, _branchRail: E[x.id] } } : x
+  const g = e.some((m) => m.branchStyle === "inline-gate") || Object.values(t).some(
+    (m) => Object.values(m).flat().some((p) => p.branchStyle === "inline-gate")
+  );
+  if (s === "vertical" || g) {
+    const { nodes: m, railSpecs: p } = cs(e, t, d, f);
+    return { nodes: m.map(
+      (x) => p[x.id] ? { ...x, data: { ...x.data, _branchRail: p[x.id] } } : x
     ), edges: a };
   }
   return { nodes: ds(d, a, f, i), edges: a };
 }
-const Ht = ({
+const Xt = ({
   nodeRegistry: e,
   templateRegistry: t,
   initialValue: n,
@@ -2457,108 +2484,108 @@ const Ht = ({
   loadTriggerSources: f,
   renderNodePicker: h,
   renderNodeConfig: g,
-  onNodeClick: b,
-  maxNodes: E,
-  layoutDirection: m = "TB",
-  executionRecord: x,
-  onFetchWorkflow: C,
-  hideHeader: M = !1,
+  onNodeClick: E,
+  maxNodes: m,
+  layoutDirection: p = "TB",
+  executionRecord: k,
+  onFetchWorkflow: x,
+  hideHeader: O = !1,
   workflowName: z,
-  onWorkflowNameChange: L,
+  onWorkflowNameChange: W,
   onCancel: $,
   workflowStatus: P,
-  workflowStatusColor: B,
-  saveLabel: G,
-  optionsResolvers: Ee
+  workflowStatusColor: M,
+  saveLabel: V,
+  optionsResolvers: oe
 }) => {
   const {
-    fitView: xe = !0,
-    fitViewPadding: te = 0.3,
-    showControls: he = !0,
-    showMiniMap: ke = !1,
-    panOnScroll: ze = !0,
-    zoomOnScroll: Le = !1,
-    minZoom: Cn = 0.25,
-    maxZoom: Tn = 2,
-    snapToGrid: In = !1,
-    snapGrid: On = [15, 15],
-    branchLayout: ot = "horizontal",
-    nodeBody: it = "full"
-  } = a, ge = U(() => _r(d), [d]), [F, oe] = j(() => (n == null ? void 0 : n.slots) ?? Yt()), [Y, Z] = j(() => (n == null ? void 0 : n.branches) ?? {}), [de, X] = j(null), [Pe, st] = j(null), [q, _e] = j(null), [ie, lt] = j(null), [Se, at] = j(null), [O, dt] = j(() => {
-    const y = n == null ? void 0 : n.slots.find((_) => _.kind === "triggerFixed"), v = y != null && y.id.startsWith("trigger-") ? y.id.slice(8) : void 0;
+    fitView: le = !0,
+    fitViewPadding: A = 0.3,
+    showControls: ie = !0,
+    showMiniMap: ve = !1,
+    panOnScroll: ee = !0,
+    zoomOnScroll: he = !1,
+    minZoom: ge = 0.25,
+    maxZoom: Be = 2,
+    snapToGrid: dt = !1,
+    snapGrid: Ie = [15, 15],
+    branchLayout: we = "horizontal",
+    nodeBody: ct = "full"
+  } = a, Ee = U(() => _r(d), [d]), [R, ae] = L(() => (n == null ? void 0 : n.slots) ?? Vt()), [Y, te] = L(() => (n == null ? void 0 : n.branches) ?? {}), [pe, X] = L(null), [De, ft] = L(null), [J, Oe] = L(null), [de, ut] = L(null), [Me, ht] = L(null), [j, gt] = L(() => {
+    const y = n == null ? void 0 : n.slots.find((S) => S.kind === "triggerFixed"), v = y != null && y.id.startsWith("trigger-") ? y.id.slice(8) : void 0;
     return v ? t.lookup(v) ?? null : null;
-  }), [ct, Mn] = j({}), jn = H((y) => {
+  }), [pt, Mn] = L({}), jn = H((y) => {
     Mn(y);
   }, []), zn = U(() => ({ ...Un, ...r }), [r]), Ln = U(() => ({ ...as, ...o }), [o]), Pn = U(() => {
-    const y = F.filter((_) => _.kind === "userTask").length, v = Object.values(Y).flatMap((_) => Object.values(_).flat()).filter((_) => _.kind === "userTask").length;
+    const y = R.filter((S) => S.kind === "userTask").length, v = Object.values(Y).flatMap((S) => Object.values(S).flat()).filter((S) => S.kind === "userTask").length;
     return y + v;
-  }, [F, Y]), ft = E ?? (O == null ? void 0 : O.maxTasks), ut = ft !== void 0 && Pn >= ft, se = H((y) => {
-    const v = F.find((_) => _.id === y);
+  }, [R, Y]), yt = m ?? (j == null ? void 0 : j.maxTasks), bt = yt !== void 0 && Pn >= yt, ce = H((y) => {
+    const v = R.find((S) => S.id === y);
     if (v) return v;
-    for (const _ of Object.values(Y)) {
-      const N = Object.values(_).flat().find((T) => T.id === y);
-      if (N) return N;
+    for (const S of Object.values(Y)) {
+      const C = Object.values(S).flat().find((T) => T.id === y);
+      if (C) return C;
     }
     return null;
-  }, [F, Y]), Fe = H((y) => {
-    s || (st(y), X("nodeConfig"));
-  }, [s]), ht = H((y) => {
+  }, [R, Y]), We = H((y) => {
+    s || (ft(y), X("nodeConfig"));
+  }, [s]), mt = H((y) => {
     if (!s) {
-      if (F.some((v) => v.id === y)) {
-        const v = F.find((_) => _.id === y);
+      if (R.some((v) => v.id === y)) {
+        const v = R.find((S) => S.id === y);
         if ((v == null ? void 0 : v.kind) === "triggerFixed") {
-          oe(Yt()), Z({}), dt(null);
+          ae(Vt()), te({}), gt(null);
           return;
         }
-        oe((_) => {
-          const N = _.filter((T) => T.id !== y);
-          return le((v == null ? void 0 : v.kind) ?? "") && !N.some((T) => T.kind === "end") ? [...N, { id: "end", kind: "end", reactFlowType: "endNode" }] : N;
-        }), Z((_) => {
-          const N = { ..._ }, T = (p) => {
-            N[p] && (Object.values(N[p]).flat().filter((k) => le(k.kind)).forEach((k) => T(k.id)), delete N[p]);
+        ae((S) => {
+          const C = S.filter((T) => T.id !== y);
+          return fe((v == null ? void 0 : v.kind) ?? "") && !C.some((T) => T.kind === "end") ? [...C, { id: "end", kind: "end", reactFlowType: "endNode" }] : C;
+        }), te((S) => {
+          const C = { ...S }, T = (b) => {
+            C[b] && (Object.values(C[b]).flat().filter((N) => fe(N.kind)).forEach((N) => T(N.id)), delete C[b]);
           };
-          return T(y), N;
+          return T(y), C;
         });
         return;
       }
-      Z((v) => {
-        const _ = (T, p) => {
-          const k = [];
-          for (const S of T)
-            le(S.kind) && p[S.id] && (k.push(S.id), Object.values(p[S.id]).forEach((I) => k.push(..._(I, p))));
-          return k;
-        }, N = { ...v };
-        for (const T of Object.keys(N))
-          for (const p of Object.keys(N[T])) {
-            const k = N[T][p], S = k.findIndex((R) => R.id === y);
-            if (S === -1 || k[S].kind === "end") continue;
-            const I = k[S];
-            let A = k.filter((R) => R.id !== y);
-            return I.kind === "filter" && ((I.id in N ? _([I], N) : []).forEach((W) => delete N[W]), delete N[I.id], A.some((W) => W.kind === "end") || (A = [...A, { id: `end-${T}-${p}`, kind: "end", reactFlowType: "endNode" }])), N[T] = { ...N[T], [p]: A }, N;
+      te((v) => {
+        const S = (T, b) => {
+          const N = [];
+          for (const _ of T)
+            fe(_.kind) && b[_.id] && (N.push(_.id), Object.values(b[_.id]).forEach((I) => N.push(...S(I, b))));
+          return N;
+        }, C = { ...v };
+        for (const T of Object.keys(C))
+          for (const b of Object.keys(C[T])) {
+            const N = C[T][b], _ = N.findIndex((F) => F.id === y);
+            if (_ === -1 || N[_].kind === "end") continue;
+            const I = N[_];
+            let B = N.filter((F) => F.id !== y);
+            return I.kind === "filter" && ((I.id in C ? S([I], C) : []).forEach((D) => delete C[D]), delete C[I.id], B.some((D) => D.kind === "end") || (B = [...B, { id: `end-${T}-${b}`, kind: "end", reactFlowType: "endNode" }])), C[T] = { ...C[T], [b]: B }, C;
           }
-        return N;
+        return C;
       });
     }
-  }, [s, F]), Re = H(() => {
+  }, [s, R]), $e = H(() => {
     s || X("triggerSelect");
-  }, [s]), gt = H((y, v) => {
-    s || ut || (_e(y), lt(v.filterId && v.branch ? { filterId: v.filterId, branch: v.branch } : null), X("nodePicker"));
-  }, [s, ut]), pt = H((y, v) => {
-    if (dt(y), X(null), y.skeletonState) {
-      const N = Array.isArray(v) && v.length > 0, T = (y.skeletonState.slots ?? []).map((p) => p.kind !== "triggerFixed" ? p : {
-        ...p,
+  }, [s]), vt = H((y, v) => {
+    s || bt || (Oe(y), ut(v.filterId && v.branch ? { filterId: v.filterId, branch: v.branch } : null), X("nodePicker"));
+  }, [s, bt]), wt = H((y, v) => {
+    if (gt(y), X(null), y.skeletonState) {
+      const C = Array.isArray(v) && v.length > 0, T = (y.skeletonState.slots ?? []).map((b) => b.kind !== "triggerFixed" ? b : {
+        ...b,
         nodeData: {
           label: y.label,
-          ...p.nodeData ?? {},
-          ...N && { sources: v }
+          ...b.nodeData ?? {},
+          ...C && { sources: v }
         }
       });
-      Z(y.skeletonState.branches ?? {}), oe(T);
+      te(y.skeletonState.branches ?? {}), ae(T);
       return;
     }
-    Z({});
-    const _ = Array.isArray(v) && v.length > 0;
-    oe([
+    te({});
+    const S = Array.isArray(v) && v.length > 0;
+    ae([
       { id: "start", kind: "start", reactFlowType: "startNode" },
       {
         id: `trigger-${y.triggerKey}`,
@@ -2569,156 +2596,162 @@ const Ht = ({
           source: y.source,
           eventType: y.triggerKey,
           type: y.triggerCategory === "scheduler" ? "scheduler" : "event",
-          ..._ && { sources: v }
+          ...S && { sources: v }
         },
         deletable: !1
       },
       { id: "end", kind: "end", reactFlowType: "endNode" }
     ]);
-  }, []), yt = H(() => {
-    var _;
+  }, []), Et = H(() => {
+    var S;
     const y = {
       insertAfterSlot: null,
       upstreamSlots: [],
       downstreamSlots: [],
-      branch: ie,
-      template: O
+      branch: de,
+      template: j
     };
-    if (!q) return y;
-    if (ie) {
-      const { filterId: N, branch: T } = ie, p = F.findIndex((R) => R.id === N), k = p >= 0 ? F.slice(0, p + 1) : [], S = ((_ = Y[N]) == null ? void 0 : _[T]) ?? [], I = S.findIndex((R) => R.id === q), A = I >= 0 ? S.slice(0, I + 1) : [];
-      return y.upstreamSlots = [...k, ...A], y.downstreamSlots = I >= 0 ? S.slice(I + 1) : S, y.insertAfterSlot = A[A.length - 1] ?? null, y;
+    if (!J) return y;
+    if (de) {
+      const { filterId: C, branch: T } = de, b = R.findIndex((F) => F.id === C), N = b >= 0 ? R.slice(0, b + 1) : [], _ = ((S = Y[C]) == null ? void 0 : S[T]) ?? [], I = _.findIndex((F) => F.id === J), B = I >= 0 ? _.slice(0, I + 1) : [];
+      return y.upstreamSlots = [...N, ...B], y.downstreamSlots = I >= 0 ? _.slice(I + 1) : _, y.insertAfterSlot = B[B.length - 1] ?? null, y;
     }
-    const v = F.findIndex((N) => N.id === q);
-    return y.upstreamSlots = v >= 0 ? F.slice(0, v + 1) : [], y.downstreamSlots = v >= 0 ? F.slice(v + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
-  }, [F, Y, q, ie, O]), Ae = (y, v) => y.descriptorType === v || y.id === v || y.kind === v, bt = H(() => {
-    const y = e.list(), v = O != null && O.availableTasks ? y.filter((p) => O.availableTasks.includes(p.type)) : y, _ = yt(), N = [
-      ...F,
-      ...Object.values(Y).flatMap((p) => Object.values(p).flat())
-    ], T = (p) => N.some((k) => p.some((S) => Ae(k, S)));
-    return v.filter((p) => p.maxPerWorkflow !== void 0 && F.filter((S) => S.descriptorType === p.type).length + Object.values(Y).flatMap((S) => Object.values(S).flat()).filter((S) => S.descriptorType === p.type).length >= p.maxPerWorkflow ? !1 : p.canInsert ? p.canInsert(_) : !(p.insertAfter && p.insertAfter.length > 0 && T(p.insertAfter) && !_.upstreamSlots.some(
-      (S) => p.insertAfter.some((I) => Ae(S, I))
-    ) || p.insertBefore && p.insertBefore.length > 0 && T(p.insertBefore) && !_.downstreamSlots.some(
-      (S) => p.insertBefore.some((I) => Ae(S, I))
+    const v = R.findIndex((C) => C.id === J);
+    return y.upstreamSlots = v >= 0 ? R.slice(0, v + 1) : [], y.downstreamSlots = v >= 0 ? R.slice(v + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
+  }, [R, Y, J, de, j]), Ge = (y, v) => y.descriptorType === v || y.id === v || y.kind === v, xt = H(() => {
+    const y = e.list(), v = j != null && j.availableTasks ? y.filter((b) => j.availableTasks.includes(b.type)) : y, S = Et(), C = [
+      ...R,
+      ...Object.values(Y).flatMap((b) => Object.values(b).flat())
+    ], T = (b) => C.some((N) => b.some((_) => Ge(N, _)));
+    return v.filter((b) => b.maxPerWorkflow !== void 0 && R.filter((_) => _.descriptorType === b.type).length + Object.values(Y).flatMap((_) => Object.values(_).flat()).filter((_) => _.descriptorType === b.type).length >= b.maxPerWorkflow ? !1 : b.canInsert ? b.canInsert(S) : !(b.insertAfter && b.insertAfter.length > 0 && T(b.insertAfter) && !S.upstreamSlots.some(
+      (_) => b.insertAfter.some((I) => Ge(_, I))
+    ) || b.insertBefore && b.insertBefore.length > 0 && T(b.insertBefore) && !S.downstreamSlots.some(
+      (_) => b.insertBefore.some((I) => Ge(_, I))
     )));
-  }, [e, O, F, Y, yt]), mt = H((y) => {
-    if (!q) return;
-    const v = `${y.type}-${Date.now()}`, _ = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", N = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, T = {
+  }, [e, j, R, Y, Et]), kt = H((y) => {
+    if (!J) return;
+    const v = `${y.type}-${Date.now()}`, S = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", C = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, T = {
       id: v,
-      kind: _ ? y.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
+      kind: S ? y.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
       reactFlowType: y.reactFlowType,
       descriptorType: y.type,
       formData: {},
       nodeData: { title: y.label },
       deletable: !0,
-      branchLabels: N
+      branchLabels: C,
+      ...y.branchStyle ? { branchStyle: y.branchStyle } : {}
     };
-    if (ie) {
-      const { filterId: p, branch: k } = ie;
-      Z((S) => {
-        const I = [...S[p][k]];
-        if (_) {
-          const ne = I.filter((ce) => ce.kind !== "end"), kt = ne.findIndex((ce) => ce.id === q), Dn = kt === -1 ? ne.length : kt + 1;
-          return ne.splice(Dn, 0, T), {
-            ...S,
-            [p]: { ...S[p], [k]: ne },
+    if (de) {
+      const { filterId: b, branch: N } = de;
+      te((_) => {
+        const I = [..._[b][N]];
+        if (S) {
+          const Z = I.filter((ye) => ye.kind !== "end"), xe = Z.findIndex((ye) => ye.id === J), Dn = xe === -1 ? Z.length : xe + 1;
+          return Z.splice(Dn, 0, T), {
+            ..._,
+            [b]: { ..._[b], [N]: Z },
             [v]: Object.fromEntries(
-              Object.keys(N).map((ce) => [ce, [{ id: `end-${v}-${ce}`, kind: "end", reactFlowType: "endNode" }]])
+              Object.keys(C).map((ye) => [ye, [{ id: `end-${v}-${ye}`, kind: "end", reactFlowType: "endNode" }]])
             )
           };
         }
-        const A = I.findIndex((ne) => ne.id === q), R = I.findIndex((ne) => ne.kind === "end"), W = A === -1 ? R === -1 ? I.length : R : A + 1;
-        return I.splice(W, 0, T), { ...S, [p]: { ...S[p], [k]: I } };
+        const B = I.findIndex((Z) => Z.id === J), F = I.findIndex((Z) => Z.kind === "end"), D = B === -1 ? F === -1 ? I.length : F : B + 1;
+        return I.splice(D, 0, T), { ..._, [b]: { ..._[b], [N]: I } };
       });
-    } else
-      _ ? (oe((p) => {
-        const k = p.findIndex((I) => I.id === q);
-        return [...p.filter((I) => I.kind !== "end").slice(0, k + 1), T];
-      }), Z((p) => ({
-        ...p,
+    } else if (S) {
+      const b = y.branchStyle === "inline-gate", N = R.filter((F) => F.kind !== "end"), _ = N.findIndex((F) => F.id === J), I = _ >= 0 ? N.slice(_ + 1) : [];
+      ae(() => [...N.slice(0, _ + 1), T]);
+      const B = Object.keys(C);
+      te((F) => ({
+        ...F,
         [v]: Object.fromEntries(
-          Object.keys(N).map((k) => [k, [{ id: `end-${v}-${k}`, kind: "end", reactFlowType: "endNode" }]])
+          B.map((D, Z) => {
+            const xe = { id: `end-${v}-${D}`, kind: "end", reactFlowType: "endNode" };
+            return b && Z === 0 && I.length > 0 ? [D, [...I, xe]] : [D, [xe]];
+          })
         )
-      }))) : oe((p) => {
-        const k = p.findIndex((S) => S.id === q);
-        return k === -1 ? p : [...p.slice(0, k + 1), T, ...p.slice(k + 1)];
+      }));
+    } else
+      ae((b) => {
+        const N = b.findIndex((_) => _.id === J);
+        return N === -1 ? b : [...b.slice(0, N + 1), T, ...b.slice(N + 1)];
       });
-    _e(null), lt(null), st(v), X("nodeConfig");
-  }, [q, ie]), vt = H((y, v) => {
-    const _ = (p) => {
-      const k = p.label || p.key;
-      switch (p.kind) {
+    Oe(null), ut(null), ft(v), X("nodeConfig");
+  }, [J, de]), _t = H((y, v) => {
+    const S = (b) => {
+      const N = b.label || b.key;
+      switch (b.kind) {
         case "if":
-          return `IF · ${k}`;
+          return `IF · ${N}`;
         case "elseif":
-          return `ELSE IF · ${k}`;
+          return `ELSE IF · ${N}`;
         case "else":
-          return k.toUpperCase() === "ELSE" ? k : `ELSE · ${k}`;
+          return N.toUpperCase() === "ELSE" ? N : `ELSE · ${N}`;
         default:
-          return k;
+          return N;
       }
-    }, N = (p) => {
-      const k = se(y);
-      if ((k == null ? void 0 : k.descriptorType) !== "conditionBranch") return p;
-      const I = (v.branchConfigs ?? []).map((W) => W.key).filter(Boolean);
-      if (I.length === 0) return p;
-      const A = p[y] ?? {}, R = {};
-      return I.forEach((W) => {
-        R[W] = A[W] ?? [{ id: `end-${y}-${W}`, kind: "end", reactFlowType: "endNode" }];
-      }), { ...p, [y]: R };
-    }, T = (p, k) => {
-      if (p.descriptorType !== "conditionBranch") return { ...p, formData: k };
-      const S = k.branchConfigs ?? [], I = {};
-      return S.forEach((A) => {
-        A.key && (I[A.key] = _(A));
-      }), { ...p, formData: k, branchLabels: I };
+    }, C = (b) => {
+      const N = ce(y);
+      if ((N == null ? void 0 : N.descriptorType) !== "conditionBranch") return b;
+      const I = (v.branchConfigs ?? []).map((D) => D.key).filter(Boolean);
+      if (I.length === 0) return b;
+      const B = b[y] ?? {}, F = {};
+      return I.forEach((D) => {
+        F[D] = B[D] ?? [{ id: `end-${y}-${D}`, kind: "end", reactFlowType: "endNode" }];
+      }), { ...b, [y]: F };
+    }, T = (b, N) => {
+      if (b.descriptorType !== "conditionBranch") return { ...b, formData: N };
+      const _ = N.branchConfigs ?? [], I = {};
+      return _.forEach((B) => {
+        B.key && (I[B.key] = S(B));
+      }), { ...b, formData: N, branchLabels: I };
     };
-    if (F.some((p) => p.id === y)) {
-      Z((p) => {
-        const k = N(p);
-        return oe(
-          (S) => S.map(
+    if (R.some((b) => b.id === y)) {
+      te((b) => {
+        const N = C(b);
+        return ae(
+          (_) => _.map(
             (I) => I.id === y ? T(I, v) : I
           )
-        ), k;
+        ), N;
       });
       return;
     }
-    Z((p) => {
-      const S = { ...N(p) };
-      for (const I of Object.keys(S)) {
-        const A = (R) => R.map((W) => W.id === y ? T(W, v) : W);
-        for (const R of Object.keys(S[I]))
-          if (S[I][R].some((W) => W.id === y))
-            return S[I] = { ...S[I], [R]: A(S[I][R]) }, S;
+    te((b) => {
+      const _ = { ...C(b) };
+      for (const I of Object.keys(_)) {
+        const B = (F) => F.map((D) => D.id === y ? T(D, v) : D);
+        for (const F of Object.keys(_[I]))
+          if (_[I][F].some((D) => D.id === y))
+            return _[I] = { ..._[I], [F]: B(_[I][F]) }, _;
       }
-      return S;
+      return _;
     });
-  }, [F, Y, se]), K = U(() => se(Pe ?? ""), [se, Pe]), wt = U(() => {
+  }, [R, Y, ce]), K = U(() => ce(De ?? ""), [ce, De]), St = U(() => {
     if ((K == null ? void 0 : K.kind) === "triggerFixed") {
-      const y = (O == null ? void 0 : O.triggerCategory) === "scheduler", v = (O == null ? void 0 : O.triggerConfigTitle) ?? (y ? "Scheduler" : O == null ? void 0 : O.label) ?? "Trigger", _ = O == null ? void 0 : O.triggerCustomPanel;
-      if (_)
+      const y = (j == null ? void 0 : j.triggerCategory) === "scheduler", v = (j == null ? void 0 : j.triggerConfigTitle) ?? (y ? "Scheduler" : j == null ? void 0 : j.label) ?? "Trigger", S = j == null ? void 0 : j.triggerCustomPanel;
+      if (S)
         return {
           type: K.id,
           label: v,
-          icon: O == null ? void 0 : O.icon,
+          icon: j == null ? void 0 : j.icon,
           reactFlowType: "triggerNode",
           formSchema: [],
-          customPanel: ({ nodeId: T, data: p, onSave: k, onClose: S }) => _({ data: p, onSave: k, onClose: S }),
+          customPanel: ({ nodeId: T, data: b, onSave: N, onClose: _ }) => S({ data: b, onSave: N, onClose: _ }),
           matches: () => !1,
           bpmnEntry: (T) => T,
           bpmnExit: (T) => T,
           emitBpmnElements: () => []
         };
-      const N = O == null ? void 0 : O.triggerConfigSchema;
-      return Array.isArray(N) && N.length > 0 ? {
+      const C = j == null ? void 0 : j.triggerConfigSchema;
+      return Array.isArray(C) && C.length > 0 ? {
         type: K.id,
         // Title the config by what it IS (a scheduler), not the workflow name
         // (which would read as "Identify Dormant Account").
         label: v,
-        icon: O == null ? void 0 : O.icon,
+        icon: j == null ? void 0 : j.icon,
         reactFlowType: "triggerNode",
-        formSchema: N,
+        formSchema: C,
         matches: () => !1,
         bpmnEntry: (T) => T,
         bpmnExit: (T) => T,
@@ -2726,27 +2759,27 @@ const Ht = ({
       } : null;
     }
     return K != null && K.descriptorType ? e.forType(K.descriptorType) ?? null : null;
-  }, [K, e, O]), { nodes: Et, edges: Fn } = U(
-    () => us(F, Y, s ? null : gt, ct, l, m, ot),
-    [F, Y, s, gt, ct, l, m, ot]
-  ), xt = U(() => {
-    const y = x ? new Map(x.steps.map((v) => [v.nodeId, v])) : null;
-    return Et.map((v) => {
-      let _ = {};
+  }, [K, e, j]), { nodes: Nt, edges: Fn } = U(
+    () => us(R, Y, s ? null : vt, pt, l, p, we),
+    [R, Y, s, vt, pt, l, p, we]
+  ), Ct = U(() => {
+    const y = k ? new Map(k.steps.map((v) => [v.nodeId, v])) : null;
+    return Nt.map((v) => {
+      let S = {};
       if (y) {
-        const N = y.get(v.id);
-        N && (_ = { _executionStatus: N.status, _executionError: N.error });
+        const C = y.get(v.id);
+        C && (S = { _executionStatus: C.status, _executionError: C.error });
       }
-      return v.type === "subWorkflowNode" && C && (_.onPreview = (N) => {
-        var p;
-        const T = se(v.id);
-        at({ workflowId: N, workflowLabel: ((p = T == null ? void 0 : T.formData) == null ? void 0 : p.workflowLabel) ?? void 0 });
-      }), Object.keys(_).length > 0 ? { ...v, data: { ...v.data, ..._ } } : v;
+      return v.type === "subWorkflowNode" && x && (S.onPreview = (C) => {
+        var b;
+        const T = ce(v.id);
+        ht({ workflowId: C, workflowLabel: ((b = T == null ? void 0 : T.formData) == null ? void 0 : b.workflowLabel) ?? void 0 });
+      }), Object.keys(S).length > 0 ? { ...v, data: { ...v.data, ...S } } : v;
     });
-  }, [Et, x, C, se]), Rn = U(() => ({ onEditNode: Fe, onDeleteNode: ht, onAddStep: () => {
-  }, onClickAddTrigger: Re, messages: ge, nodeRegistry: e, nodeBody: it, activeTemplate: O }), [Fe, ht, Re, ge, e, it, O]), An = H(async () => {
-    i && await i({ slots: F, branches: Y });
-  }, [i, F, Y]), Bn = U(() => Sr({
+  }, [Nt, k, x, ce]), Rn = U(() => ({ onEditNode: We, onDeleteNode: mt, onAddStep: () => {
+  }, onClickAddTrigger: $e, messages: Ee, nodeRegistry: e, nodeBody: ct, activeTemplate: j }), [We, mt, $e, Ee, e, ct, j]), An = H(async () => {
+    i && await i({ slots: R, branches: Y });
+  }, [i, R, Y]), Bn = U(() => Sr({
     palette: {
       primary: { main: l.primaryColor ?? "#1976d2" },
       secondary: { main: l.secondaryColor ?? "#9c27b0" },
@@ -2758,7 +2791,7 @@ const Ht = ({
     shape: { borderRadius: l.borderRadius ?? 6 },
     typography: l.fontFamily ? { fontFamily: l.fontFamily } : {}
   }), [l]);
-  return /* @__PURE__ */ u(Nr, { theme: Bn, children: /* @__PURE__ */ u(kr, { resolvers: Ee, children: /* @__PURE__ */ u(Qn.Provider, { value: Rn, children: /* @__PURE__ */ w(
+  return /* @__PURE__ */ u(Nr, { theme: Bn, children: /* @__PURE__ */ u(kr, { resolvers: oe, children: /* @__PURE__ */ u(Qn.Provider, { value: Rn, children: /* @__PURE__ */ w(
     "div",
     {
       className: "flowforge-canvas",
@@ -2780,40 +2813,40 @@ const Ht = ({
         "--ff-font-family": l.fontFamily
       },
       children: [
-        !M && (i || $ || z) && /* @__PURE__ */ u(
+        !O && (i || $ || z) && /* @__PURE__ */ u(
           ns,
           {
             workflowName: z,
-            onWorkflowNameChange: L,
+            onWorkflowNameChange: W,
             status: P,
-            statusColor: B,
+            statusColor: M,
             onSave: i ? An : void 0,
             onCancel: $,
-            saveLabel: G
+            saveLabel: V
           }
         ),
         /* @__PURE__ */ w("div", { style: { flex: 1, minHeight: 0, position: "relative" }, children: [
           /* @__PURE__ */ w(
             Wn,
             {
-              nodes: xt,
+              nodes: Ct,
               edges: Fn,
               nodeTypes: zn,
               edgeTypes: Ln,
-              fitView: xe,
-              fitViewOptions: { padding: te },
+              fitView: le,
+              fitViewOptions: { padding: A },
               nodesDraggable: !1,
               nodesConnectable: !1,
-              panOnScroll: ze,
-              zoomOnScroll: Le,
-              minZoom: Cn,
-              maxZoom: Tn,
-              snapToGrid: In,
-              snapGrid: On,
+              panOnScroll: ee,
+              zoomOnScroll: he,
+              minZoom: ge,
+              maxZoom: Be,
+              snapToGrid: dt,
+              snapGrid: Ie,
               proOptions: { hideAttribution: !0 },
               onNodeClick: (y, v) => {
-                const _ = se(v.id);
-                _ && (b != null && b(_) || (_.kind === "addTrigger" || _.kind === "triggerFixed" ? Re() : (_.kind === "userTask" || _.kind === "filter" || _.kind === "approval") && Fe(v.id)));
+                const S = ce(v.id);
+                S && (E != null && E(S) || (S.kind === "addTrigger" || S.kind === "triggerFixed" ? $e() : (S.kind === "userTask" || S.kind === "filter" || S.kind === "approval") && We(v.id)));
               },
               children: [
                 l.background !== "none" && /* @__PURE__ */ u(
@@ -2824,27 +2857,27 @@ const Ht = ({
                     gap: 20
                   }
                 ),
-                he && /* @__PURE__ */ u(Kn, { showInteractive: !1 }),
-                ke && /* @__PURE__ */ u(Hn, { zoomable: !0, pannable: !0 }),
-                /* @__PURE__ */ u(es, { onHeightsReady: jn, nodeCount: xt.length })
+                ie && /* @__PURE__ */ u(Kn, { showInteractive: !1 }),
+                ve && /* @__PURE__ */ u(Hn, { zoomable: !0, pannable: !0 }),
+                /* @__PURE__ */ u(es, { onHeightsReady: jn, nodeCount: Ct.length })
               ]
             }
           ),
-          c ? de === "triggerSelect" && c(t.list(), pt, () => X(null)) : /* @__PURE__ */ u(rs, { open: de === "triggerSelect", templates: t.list(), messages: ge, onSelect: pt, onClose: () => X(null), loadTriggerSources: f }),
-          h ? de === "nodePicker" && h(bt(), mt, () => {
-            X(null), _e(null);
-          }) : /* @__PURE__ */ u(os, { open: de === "nodePicker", availableDescriptors: bt(), messages: ge, onSelect: mt, onClose: () => {
-            X(null), _e(null);
+          c ? pe === "triggerSelect" && c(t.list(), wt, () => X(null)) : /* @__PURE__ */ u(rs, { open: pe === "triggerSelect", templates: t.list(), messages: Ee, onSelect: wt, onClose: () => X(null), loadTriggerSources: f }),
+          h ? pe === "nodePicker" && h(xt(), kt, () => {
+            X(null), Oe(null);
+          }) : /* @__PURE__ */ u(os, { open: pe === "nodePicker", availableDescriptors: xt(), messages: Ee, onSelect: kt, onClose: () => {
+            X(null), Oe(null);
           } }),
-          g ? de === "nodeConfig" && g(wt ?? void 0, K, vt, () => X(null)) : /* @__PURE__ */ u(is, { open: de === "nodeConfig", nodeId: Pe, descriptor: wt, initialValues: K == null ? void 0 : K.formData, messages: ge, onSave: vt, onClose: () => X(null) }),
-          C && Se && /* @__PURE__ */ u(
+          g ? pe === "nodeConfig" && g(St ?? void 0, K, _t, () => X(null)) : /* @__PURE__ */ u(is, { open: pe === "nodeConfig", nodeId: De, descriptor: St, initialValues: K == null ? void 0 : K.formData, messages: Ee, onSave: _t, onClose: () => X(null) }),
+          x && Me && /* @__PURE__ */ u(
             ss,
             {
-              isOpen: !!Se,
-              onClose: () => at(null),
-              workflowId: Se.workflowId,
-              workflowLabel: Se.workflowLabel,
-              onFetchWorkflow: C
+              isOpen: !!Me,
+              onClose: () => ht(null),
+              workflowId: Me.workflowId,
+              workflowLabel: Me.workflowLabel,
+              onFetchWorkflow: x
             }
           )
         ] })
@@ -2853,9 +2886,9 @@ const Ht = ({
   ) }) }) });
 }, hs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  WorkflowCanvas: Ht,
-  default: Ht
-}, Symbol.toStringTag, { value: "Module" })), Ue = "All";
+  WorkflowCanvas: Xt,
+  default: Xt
+}, Symbol.toStringTag, { value: "Module" })), Ze = "All";
 function gs({ template: e, onSelect: t }) {
   var o, i;
   const n = e.triggerCategory ? Cr[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
@@ -2916,19 +2949,19 @@ const js = ({
   onSelectTemplate: t,
   onStartFromScratch: n
 }) => {
-  const [r, o] = j(""), [i, s] = j(Ue), l = U(() => {
+  const [r, o] = L(""), [i, s] = L(Ze), l = U(() => {
     const a = /* @__PURE__ */ new Set();
     return e.forEach((c) => {
       c.category && a.add(c.category);
-    }), [Ue, ...Array.from(a)];
+    }), [Ze, ...Array.from(a)];
   }, [e]), d = U(() => {
     let a = e;
-    if (i !== Ue && (a = a.filter((c) => c.category === i)), r.trim()) {
+    if (i !== Ze && (a = a.filter((c) => c.category === i)), r.trim()) {
       const c = r.toLowerCase();
       a = a.filter(
         (f) => {
           var h, g;
-          return f.label.toLowerCase().includes(c) || ((h = f.description) == null ? void 0 : h.toLowerCase().includes(c)) || ((g = f.tags) == null ? void 0 : g.some((b) => b.toLowerCase().includes(c)));
+          return f.label.toLowerCase().includes(c) || ((h = f.description) == null ? void 0 : h.toLowerCase().includes(c)) || ((g = f.tags) == null ? void 0 : g.some((E) => E.toLowerCase().includes(c)));
         }
       );
     }
@@ -2990,26 +3023,26 @@ const js = ({
       /* @__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: d.map((a) => /* @__PURE__ */ u(gs, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
   ] });
-}, Ne = {
-  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 }) }
+}, je = {
+  running: { label: "Running", color: re.running, icon: G.createElement(nn, { size: 14 }) },
+  success: { label: "Success", color: re.success, icon: G.createElement(tn, { size: 14 }) },
+  failed: { label: "Failed", color: re.failed, icon: G.createElement(en, { size: 14 }) },
+  cancelled: { label: "Cancelled", color: re.cancelled, icon: G.createElement(Qt, { size: 14 }) }
 }, ps = {
-  pending: { color: ee.pending, icon: D.createElement(gr, { 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 }) }
+  pending: { color: re.pending, icon: G.createElement(gr, { size: 14 }) },
+  running: { color: re.running, icon: G.createElement(nn, { size: 14 }) },
+  success: { color: re.success, icon: G.createElement(tn, { size: 14 }) },
+  failed: { color: re.failed, icon: G.createElement(en, { size: 14 }) },
+  skipped: { color: re.skipped, icon: G.createElement(Qt, { size: 14 }) }
 };
-function Ze(e) {
+function rt(e) {
   try {
     return new Date(e).toLocaleString();
   } catch {
     return e;
   }
 }
-function Nn(e, t) {
+function On(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`;
@@ -3018,7 +3051,7 @@ function Nn(e, t) {
   }
 }
 function ys({ step: e }) {
-  const [t, n] = j(!1), r = ps[e.status], o = !!(e.inputs || e.outputs || e.error);
+  const [t, n] = L(!1), r = ps[e.status], o = !!(e.inputs || e.outputs || e.error);
   return /* @__PURE__ */ w("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
     /* @__PURE__ */ w(
       "div",
@@ -3033,11 +3066,11 @@ function ys({ step: e }) {
           o && (i.key === "Enter" || i.key === " ") && n((s) => !s);
         },
         children: [
-          /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: D.cloneElement(r.icon, { color: r.color }) }),
+          /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: G.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 ? Nn(e.startedAt, e.completedAt) : "—" }),
-          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? D.createElement(yr, { size: 16 }) : D.createElement(br, { size: 16 }) })
+          /* @__PURE__ */ u("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 }, children: e.startedAt ? On(e.startedAt, e.completedAt) : "—" }),
+          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? G.createElement(yr, { size: 16 }) : G.createElement(br, { size: 16 }) })
         ]
       }
     ),
@@ -3055,7 +3088,7 @@ function ys({ step: e }) {
   ] });
 }
 function bs({ record: e, selected: t, onSelect: n }) {
-  const r = Ne[e.status];
+  const r = je[e.status];
   return /* @__PURE__ */ w(
     "div",
     {
@@ -3076,9 +3109,9 @@ function bs({ record: e, selected: t, onSelect: n }) {
         outline: "none"
       },
       children: [
-        /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: D.cloneElement(r.icon, { color: r.color, size: 16 }) }),
+        /* @__PURE__ */ u("span", { style: { color: r.color, flexShrink: 0 }, children: G.cloneElement(r.icon, { color: r.color, size: 16 }) }),
         /* @__PURE__ */ w("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: Ze(e.triggeredAt) }),
+          /* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" }, children: rt(e.triggeredAt) }),
           /* @__PURE__ */ w("div", { style: { fontSize: 11, color: "#9e9e9e" }, children: [
             e.triggeredBy ? `by ${e.triggeredBy}` : "System",
             " · ",
@@ -3088,16 +3121,16 @@ function bs({ record: e, selected: t, onSelect: n }) {
           ] })
         ] }),
         /* @__PURE__ */ u("span", { style: { fontSize: 11, fontWeight: 600, color: r.color, flexShrink: 0 }, children: r.label }),
-        /* @__PURE__ */ u(Vt, { size: 14, color: "#bdbdbd" })
+        /* @__PURE__ */ u(Zt, { size: 14, color: "#bdbdbd" })
       ]
     }
   );
 }
 const zs = ({ records: e, onViewOnCanvas: t }) => {
   var s;
-  const [n, r] = j(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === n) ?? null, i = [...e].sort((l, d) => new Date(d.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
+  const [n, r] = L(((s = e[0]) == null ? void 0 : s.id) ?? null), o = e.find((l) => l.id === n) ?? null, i = [...e].sort((l, d) => new Date(d.triggeredAt).getTime() - new Date(l.triggeredAt).getTime());
   return e.length === 0 ? /* @__PURE__ */ w("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
-    /* @__PURE__ */ u(Nt, { size: 36 }),
+    /* @__PURE__ */ u(Ot, { size: 36 }),
     /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: "No executions yet" }),
     /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 12 }, children: "Run history will appear here" })
   ] }) : /* @__PURE__ */ w("div", { style: { display: "flex", height: "100%", fontFamily: "inherit", border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" }, children: [
@@ -3113,15 +3146,15 @@ const zs = ({ records: e, onViewOnCanvas: t }) => {
       /* @__PURE__ */ w("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
         /* @__PURE__ */ w("div", { children: [
           /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 }, children: [
-            D.cloneElement(Ne[o.status].icon, { color: Ne[o.status].color, size: 18 }),
-            /* @__PURE__ */ u("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: Ne[o.status].label })
+            G.cloneElement(je[o.status].icon, { color: je[o.status].color, size: 18 }),
+            /* @__PURE__ */ u("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" }, children: je[o.status].label })
           ] }),
           /* @__PURE__ */ w("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 }, children: [
             /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
-              /* @__PURE__ */ u(Nt, { size: 13 }),
+              /* @__PURE__ */ u(Ot, { size: 13 }),
               " ",
-              Ze(o.triggeredAt),
-              o.completedAt && ` → ${Ze(o.completedAt)} (${Nn(o.triggeredAt, o.completedAt)})`
+              rt(o.triggeredAt),
+              o.completedAt && ` → ${rt(o.completedAt)} (${On(o.triggeredAt, o.completedAt)})`
             ] }),
             o.triggeredBy && /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
               /* @__PURE__ */ u(pr, { size: 13 }),
@@ -3156,10 +3189,10 @@ const zs = ({ records: e, onViewOnCanvas: t }) => {
   ] });
 };
 export {
-  Ht as F,
+  Xt as F,
   ss as S,
   zs as W,
   ns as a,
   js as b
 };
-//# sourceMappingURL=WorkflowExecutionHistory-DYp-l7mk.js.map
+//# sourceMappingURL=WorkflowExecutionHistory-BBeVPYVc.js.map