@notmrabhi/flowforge 0.1.42 → 0.1.44

package/dist/{templateSkeletons-CFMb6KIK.js → templateSkeletons-CHrd4Z5h.js}

@@ -1,22 +1,22 @@
 import { jsxs as w, jsx as u, Fragment as be } from "react/jsx-runtime";
 import P, { useRef as Tt, useEffect as re, useState as j, useCallback as Y, useMemo as K } from "react";
-import Rn, { useStore as Dn, useReactFlow as Pn, Background as Bn, Controls as Wn, MiniMap as Gn } from "reactflow";
+import Dn, { useStore as Pn, useReactFlow as Bn, Background as Wn, Controls as Gn, MiniMap as $n } from "reactflow";
 import "reactflow/dist/style.css";
-import { e as $n, G as Yn, E as Kn, P as Un, L as Hn, d as Vn, f as qn } from "./GatewayBranchEdge-CrgczPYJ.js";
-import { Dialog as Xn, Box as Q, Drawer as Jn, IconButton as _t, Button as Ne, CircularProgress as Zn } from "@mui/material";
-import Qn from "react-select";
-import { MdClose as er, MdCalendarToday as tr, MdBolt as nr, MdArrowBack as Kt, MdChevronRight as Ut, MdAddCircleOutline as rr, MdApps as or, MdErrorOutline as ir, MdAccountTree as sr, MdAdd as lr, MdSearch as ar, MdCategory as dr, MdCancel as Ht, MdError as Vt, MdCheckCircle as qt, MdPlayArrow as Xt, MdHourglassEmpty as cr, MdSchedule as Nt, MdPerson as fr, MdExpandLess as ur, MdExpandMore as hr } from "react-icons/md";
-import { GrTrigger as gr } from "react-icons/gr";
-import { BiCollapse as pr, BiExpand as br } from "react-icons/bi";
-import { j as yr, b as mr } from "./index-B74jTc2b.js";
-import { m as wr } from "./messages-CO299wPN.js";
-import { T as vr, E as ee } from "./canvasTokens-CAD6G24b.js";
-var Jt = Object.defineProperty, Er = (e, t, n) => t in e ? Jt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, kr = (e, t) => {
+import { e as Yn, G as Kn, E as Un, P as Hn, L as Vn, d as qn, f as Xn } from "./GatewayBranchEdge-CrgczPYJ.js";
+import { Dialog as Jn, Box as Q, Drawer as Zn, IconButton as _t, Button as Ne, CircularProgress as Qn } from "@mui/material";
+import er from "react-select";
+import { MdClose as tr, MdCalendarToday as nr, MdBolt as rr, MdArrowBack as Kt, MdChevronRight as Ut, MdAddCircleOutline as or, MdApps as ir, MdErrorOutline as sr, MdAccountTree as lr, MdAdd as ar, MdSearch as dr, MdCategory as cr, MdCancel as Ht, MdError as Vt, MdCheckCircle as qt, MdPlayArrow as Xt, MdHourglassEmpty as fr, MdSchedule as Nt, MdPerson as ur, MdExpandLess as hr, MdExpandMore as gr } from "react-icons/md";
+import { GrTrigger as pr } from "react-icons/gr";
+import { BiCollapse as br, BiExpand as yr } from "react-icons/bi";
+import { j as mr, b as wr, O as vr } from "./index-y_v8Qog1.js";
+import { m as Er } from "./messages-CO299wPN.js";
+import { T as kr, E as ee } from "./canvasTokens-CAD6G24b.js";
+var Jt = Object.defineProperty, xr = (e, t, n) => t in e ? Jt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, Tr = (e, t) => {
   for (var n in t) Jt(e, n, { get: t[n], enumerable: !0 });
-}, xr = (e, t, n) => Er(e, t + "", n), Zt = {};
-kr(Zt, { Graph: () => U, alg: () => Ze, json: () => en, version: () => Nr });
-var Tr = Object.defineProperty, Qt = (e, t) => {
-  for (var n in t) Tr(e, n, { get: t[n], enumerable: !0 });
+}, _r = (e, t, n) => xr(e, t + "", n), Zt = {};
+Tr(Zt, { Graph: () => U, alg: () => Ze, json: () => en, version: () => Cr });
+var Nr = Object.defineProperty, Qt = (e, t) => {
+  for (var n in t) Nr(e, n, { get: t[n], enumerable: !0 });
 }, U = class {
   constructor(e) {
     this._isDirected = !0, this._isMultigraph = !1, this._isCompound = !1, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
@@ -154,7 +154,7 @@ var Tr = Object.defineProperty, Qt = (e, t) => {
     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 = _r(this._isDirected, o, i, s);
+    let c = Sr(this._isDirected, o, i, s);
     return o = c.v, i = c.w, Object.freeze(c), this._edgeObjs[a] = c, St(this._preds[i], o), St(this._sucs[o], i), this._in[i][a] = c, this._out[o][a] = c, this._edgeCount++, this;
   }
   edge(e, t, n) {
@@ -208,7 +208,7 @@ function pe(e, t, n, r) {
   }
   return o + "
" + i + "
" + (r === void 0 ? "\0" : r);
 }
-function _r(e, t, n, r) {
+function Sr(e, t, n, r) {
   let o = "" + t, i = "" + n;
   if (!e && o > i) {
     let l = o;
@@ -220,25 +220,25 @@ function _r(e, t, n, r) {
 function De(e, t) {
   return pe(e, t.v, t.w, t.name);
 }
-var Nr = "4.0.1", en = {};
-Qt(en, { read: () => Or, write: () => Sr });
-function Sr(e) {
-  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Cr(e), edges: Ir(e) }, n = e.graph();
+var Cr = "4.0.1", en = {};
+Qt(en, { read: () => Mr, write: () => Ir });
+function Ir(e) {
+  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: Or(e), edges: jr(e) }, n = e.graph();
   return n !== void 0 && (t.value = structuredClone(n)), t;
 }
-function Cr(e) {
+function Or(e) {
   return e.nodes().map((t) => {
     let n = e.node(t), r = e.parent(t), o = { v: t };
     return n !== void 0 && (o.value = n), r !== void 0 && (o.parent = r), o;
   });
 }
-function Ir(e) {
+function jr(e) {
   return e.edges().map((t) => {
     let n = e.edge(t), r = { v: t.v, w: t.w };
     return t.name !== void 0 && (r.name = t.name), n !== void 0 && (r.value = n), r;
   });
 }
-function Or(e) {
+function Mr(e) {
   let t = new U(e.options);
   return e.value !== void 0 && t.setGraph(e.value), e.nodes.forEach((n) => {
     t.setNode(n.v, n.value), n.parent && t.setParent(n.v, n.parent);
@@ -247,14 +247,14 @@ function Or(e) {
   }), t;
 }
 var Ze = {};
-Qt(Ze, { CycleException: () => Ce, bellmanFord: () => tn, components: () => zr, dijkstra: () => Se, dijkstraAll: () => Ar, findCycles: () => Rr, floydWarshall: () => Pr, isAcyclic: () => Wr, postorder: () => $r, preorder: () => Yr, prim: () => Kr, shortestPaths: () => Ur, tarjan: () => rn, topsort: () => on });
-var jr = () => 1;
+Qt(Ze, { CycleException: () => Ce, bellmanFord: () => tn, components: () => Lr, dijkstra: () => Se, dijkstraAll: () => Dr, findCycles: () => Pr, floydWarshall: () => Wr, isAcyclic: () => $r, postorder: () => Kr, preorder: () => Ur, prim: () => Hr, shortestPaths: () => Vr, tarjan: () => rn, topsort: () => on });
+var zr = () => 1;
 function tn(e, t, n, r) {
-  return Mr(e, String(t), n || jr, r || function(o) {
+  return Fr(e, String(t), n || zr, r || function(o) {
     return e.outEdges(o);
   });
 }
-function Mr(e, t, n, r) {
+function Fr(e, t, n, r) {
   let o = {}, i, s = 0, l = e.nodes(), d = function(f) {
     let h = n(f);
     o[f.v].distance + h < o[f.w].distance && (o[f.w] = { distance: o[f.v].distance + h, predecessor: f.v }, i = !0);
@@ -275,7 +275,7 @@ function Mr(e, t, n, r) {
   if (s === c - 1 && (i = !1, a(), i)) throw new Error("The graph contains a negative weight cycle");
   return o;
 }
-function zr(e) {
+function Lr(e) {
   let t = {}, n = [], r;
   function o(i) {
     i in t || (t[i] = !0, r.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
@@ -337,14 +337,14 @@ var nn = class {
     let n = this._arr, r = this._keyIndices, o = n[e], i = n[t];
     n[e] = i, n[t] = o, r[i.key] = e, r[o.key] = t;
   }
-}, Fr = () => 1;
+}, Ar = () => 1;
 function Se(e, t, n, r) {
   let o = function(i) {
     return e.outEdges(i);
   };
-  return Lr(e, String(t), n || Fr, r || o);
+  return Rr(e, String(t), n || Ar, r || o);
 }
-function Lr(e, t, n, r) {
+function Rr(e, t, n, r) {
   let o = {}, i = new nn(), 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);
@@ -356,7 +356,7 @@ function Lr(e, t, n, r) {
   }); i.size() > 0 && (s = i.removeMin(), l = o[s], l.distance !== Number.POSITIVE_INFINITY); ) r(s).forEach(d);
   return o;
 }
-function Ar(e, t, n) {
+function Dr(e, t, n) {
   return e.nodes().reduce(function(r, o) {
     return r[o] = Se(e, o, t, n), r;
   }, {});
@@ -379,18 +379,18 @@ function rn(e) {
     s in r || i(s);
   }), o;
 }
-function Rr(e) {
+function Pr(e) {
   return rn(e).filter(function(t) {
     return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
   });
 }
-var Dr = () => 1;
-function Pr(e, t, n) {
-  return Br(e, t || Dr, n || function(r) {
+var Br = () => 1;
+function Wr(e, t, n) {
+  return Gr(e, t || Br, n || function(r) {
     return e.outEdges(r);
   });
 }
-function Br(e, t, n) {
+function Gr(e, t, n) {
   let r = {}, o = e.nodes();
   return o.forEach(function(i) {
     r[i] = {}, r[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
@@ -424,7 +424,7 @@ function on(e) {
   if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount()) throw new Ce();
   return r;
 }
-function Wr(e) {
+function $r(e) {
   try {
     on(e);
   } catch (t) {
@@ -433,7 +433,7 @@ function Wr(e) {
   }
   return !0;
 }
-function Gr(e, t, n, r, o) {
+function Yr(e, t, n, r, o) {
   Array.isArray(t) || (t = [t]);
   let i = (l) => {
     var d;
@@ -450,17 +450,17 @@ function sn(e, t, n, r, o, i, s) {
   }), n && (s = i(s, t))), s;
 }
 function ln(e, t, n) {
-  return Gr(e, t, n, function(r, o) {
+  return Yr(e, t, n, function(r, o) {
     return r.push(o), r;
   }, []);
 }
-function $r(e, t) {
+function Kr(e, t) {
   return ln(e, t, "post");
 }
-function Yr(e, t) {
+function Ur(e, t) {
   return ln(e, t, "pre");
 }
-function Kr(e, t) {
+function Hr(e, t) {
   let n = new U(), r = {}, o = new nn(), i;
   function s(d) {
     let a = d.v === i ? d.w : d.v, c = o.priority(a);
@@ -484,13 +484,13 @@ function Kr(e, t) {
   }
   return n;
 }
-function Ur(e, t, n, r) {
-  return Hr(e, t, n, r ?? ((o) => {
+function Vr(e, t, n, r) {
+  return qr(e, t, n, r ?? ((o) => {
     let i = e.outEdges(o);
     return i ?? [];
   }));
 }
-function Hr(e, t, n, r) {
+function qr(e, t, n, r) {
   if (n === void 0) return Se(e, t, n, r);
   let o = !1, i = e.nodes();
   for (let s = 0; s < i.length; s++) {
@@ -508,7 +508,7 @@ function ue(e, t, n, r) {
   for (; e.hasNode(o); ) o = Qe(r);
   return n.dummy = t, e.setNode(o, n), o;
 }
-function Vr(e) {
+function Xr(e) {
   let t = new U().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);
@@ -536,7 +536,7 @@ function we(e) {
     o !== void 0 && (t[o] || (t[o] = []), t[o][r.order] = n);
   }), t;
 }
-function qr(e) {
+function Jr(e) {
   let t = e.nodes().map((r) => {
     let o = e.node(r).rank;
     return o === void 0 ? Number.MAX_VALUE : o;
@@ -546,7 +546,7 @@ function qr(e) {
     Object.hasOwn(o, "rank") && (o.rank -= n);
   });
 }
-function Xr(e) {
+function Zr(e) {
   let t = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), n = X(Math.min, t), r = [];
   e.nodes().forEach((s) => {
     let l = e.node(s).rank - n;
@@ -561,7 +561,7 @@ function Ot(e, t, n, r) {
   let o = { width: 0, height: 0 };
   return arguments.length >= 4 && (o.rank = n, o.order = r), ue(e, "border", o, t);
 }
-function Jr(e, t = dn) {
+function Qr(e, t = dn) {
   let n = [];
   for (let r = 0; r < e.length; r += t) {
     let o = e.slice(r, r + t);
@@ -572,7 +572,7 @@ function Jr(e, t = dn) {
 var dn = 65535;
 function X(e, t) {
   if (t.length > dn) {
-    let n = Jr(t);
+    let n = Qr(t);
     return e(...n.map((r) => e(...r)));
   } else return e(...t);
 }
@@ -583,7 +583,7 @@ function cn(e) {
   });
   return X(Math.max, t);
 }
-function Zr(e, t) {
+function eo(e, t) {
   let n = { lhs: [], rhs: [] };
   return e.forEach((r) => {
     t(r) ? n.lhs.push(r) : n.rhs.push(r);
@@ -600,9 +600,9 @@ function fn(e, t) {
 function un(e, t) {
   return t();
 }
-var Qr = 0;
+var to = 0;
 function Qe(e) {
-  let t = ++Qr;
+  let t = ++to;
   return e + ("" + t);
 }
 function ye(e, t, n = 1) {
@@ -622,12 +622,12 @@ function Oe(e, t) {
   let n;
   return typeof t == "string" ? n = (r) => r[t] : n = t, Object.entries(e).reduce((r, [o, i]) => (r[o] = n(i, o), r), {});
 }
-function eo(e, t) {
+function no(e, t) {
   return e.reduce((n, r, o) => (n[r] = t[o], n), {});
 }
-var je = "\0", to = "3.0.0", no = class {
+var je = "\0", ro = "3.0.0", oo = class {
   constructor() {
-    xr(this, "_sentinel");
+    _r(this, "_sentinel");
     let e = {};
     e._next = e._prev = e, this._sentinel = e;
   }
@@ -641,23 +641,23 @@ var je = "\0", to = "3.0.0", no = class {
   }
   toString() {
     let e = [], t = this._sentinel, n = t._prev;
-    for (; n !== t; ) e.push(JSON.stringify(n, ro)), n = n._prev;
+    for (; n !== t; ) e.push(JSON.stringify(n, io)), n = n._prev;
     return "[" + e.join(", ") + "]";
   }
 };
 function jt(e) {
   e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function ro(e, t) {
+function io(e, t) {
   if (e !== "_next" && e !== "_prev") return t;
 }
-var oo = no, io = () => 1;
-function so(e, t) {
+var so = oo, lo = () => 1;
+function ao(e, t) {
   if (e.nodeCount() <= 1) return [];
-  let n = ao(e, t || io);
-  return lo(n.graph, n.buckets, n.zeroIdx).flatMap((r) => e.outEdges(r.v, r.w) || []);
+  let n = fo(e, t || lo);
+  return co(n.graph, n.buckets, n.zeroIdx).flatMap((r) => e.outEdges(r.v, r.w) || []);
 }
-function lo(e, t, n) {
+function co(e, t, n) {
   var r;
   let o = [], i = t[t.length - 1], s = t[0], l;
   for (; e.nodeCount(); ) {
@@ -682,7 +682,7 @@ function Pe(e, t, n, r, o) {
     c.in -= d, He(t, n, c);
   }), e.removeNode(r.v), s;
 }
-function ao(e, t) {
+function fo(e, t) {
   let n = new U(), r = 0, o = 0;
   e.nodes().forEach((l) => {
     n.setNode(l, { v: l, in: 0, out: 0 });
@@ -692,7 +692,7 @@ function ao(e, t) {
     let f = n.node(l.v), h = n.node(l.w);
     o = Math.max(o, f.out += a), r = Math.max(r, h.in += a);
   });
-  let i = co(o + r + 3).map(() => new oo()), s = r + 1;
+  let i = uo(o + r + 3).map(() => new so()), s = r + 1;
   return n.nodes().forEach((l) => {
     He(i, s, n.node(l));
   }), { graph: n, buckets: i, zeroIdx: s };
@@ -701,13 +701,13 @@ function He(e, t, n) {
   var r, o, i;
   n.out ? n.in ? (i = e[n.out - n.in + t]) == null || i.enqueue(n) : (o = e[e.length - 1]) == null || o.enqueue(n) : (r = e[0]) == null || r.enqueue(n);
 }
-function co(e) {
+function uo(e) {
   let t = [];
   for (let n = 0; n < e; n++) t.push(n);
   return t;
 }
-function fo(e) {
-  (e.graph().acyclicer === "greedy" ? so(e, t(e)) : uo(e)).forEach((n) => {
+function ho(e) {
+  (e.graph().acyclicer === "greedy" ? ao(e, t(e)) : go(e)).forEach((n) => {
     let r = e.edge(n);
     e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r, Qe("rev"));
   });
@@ -715,7 +715,7 @@ function fo(e) {
     return (r) => n.edge(r).weight;
   }
 }
-function uo(e) {
+function go(e) {
   let t = [], n = {}, r = {};
   function o(i) {
     Object.hasOwn(r, i) || (r[i] = !0, n[i] = !0, e.outEdges(i).forEach((s) => {
@@ -724,7 +724,7 @@ function uo(e) {
   }
   return e.nodes().forEach(o), t;
 }
-function ho(e) {
+function po(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.reversed) {
@@ -734,10 +734,10 @@ function ho(e) {
     }
   });
 }
-function go(e) {
-  e.graph().dummyChains = [], e.edges().forEach((t) => po(e, t));
+function bo(e) {
+  e.graph().dummyChains = [], e.edges().forEach((t) => yo(e, t));
 }
-function po(e, t) {
+function yo(e, t) {
   let n = t.v, r = e.node(n).rank, o = t.w, i = e.node(o).rank, s = t.name, l = e.edge(t), d = l.labelRank;
   if (i === r + 1) return;
   e.removeEdge(t);
@@ -745,7 +745,7 @@ function po(e, t) {
   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;
   e.setEdge(n, o, { weight: l.weight }, s);
 }
-function bo(e) {
+function mo(e) {
   e.graph().dummyChains.forEach((t) => {
     let n = e.node(t), r = n.edgeLabel, o;
     for (e.setEdge(n.edgeObj, r); n.dummy; ) o = e.successors(t)[0], e.removeNode(t), r.points.push({ x: n.x, y: n.y }), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), t = o, n = e.node(t);
@@ -765,17 +765,17 @@ function et(e) {
 function fe(e, t) {
   return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var hn = yo;
-function yo(e) {
+var hn = wo;
+function wo(e) {
   let t = new U({ 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 (; mo(t, e) < o && (i = wo(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), vo(t, e, s);
+  for (; vo(t, e) < o && (i = Eo(t, e), !!i); ) s = t.hasNode(i.v) ? fe(e, i) : -fe(e, i), ko(t, e, s);
   return t;
 }
-function mo(e, t) {
+function vo(e, t) {
   function n(r) {
     let o = t.nodeEdges(r);
     o && o.forEach((i) => {
@@ -785,16 +785,16 @@ function mo(e, t) {
   }
   return e.nodes().forEach(n), e.nodeCount();
 }
-function wo(e, t) {
+function Eo(e, t) {
   return t.edges().reduce((n, r) => {
     let o = Number.POSITIVE_INFINITY;
     return e.hasNode(r.v) !== e.hasNode(r.w) && (o = fe(t, r)), o < n[0] ? [o, r] : n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function vo(e, t, n) {
+function ko(e, t, n) {
   e.nodes().forEach((r) => t.node(r).rank += n);
 }
-var { preorder: Eo, postorder: ko } = Ze, xo = ae;
+var { preorder: xo, postorder: To } = Ze, _o = ae;
 ae.initLowLimValues = nt;
 ae.initCutValues = tt;
 ae.calcCutValue = gn;
@@ -802,17 +802,17 @@ ae.leaveEdge = bn;
 ae.enterEdge = yn;
 ae.exchangeEdges = mn;
 function ae(e) {
-  e = Vr(e), et(e);
+  e = Xr(e), et(e);
   let t = hn(e);
   nt(t), tt(t, e);
   let n, r;
   for (; n = bn(t); ) r = yn(t, e, n), mn(t, e, n, r);
 }
 function tt(e, t) {
-  let n = ko(e, e.nodes());
-  n = n.slice(0, n.length - 1), n.forEach((r) => To(e, t, r));
+  let n = To(e, e.nodes());
+  n = n.slice(0, n.length - 1), n.forEach((r) => No(e, t, r));
 }
-function To(e, t, n) {
+function No(e, t, n) {
   let r = e.node(n).parent, o = e.edge(n, r);
   o.cutvalue = gn(e, t, n);
 }
@@ -824,7 +824,7 @@ function gn(e, t, n) {
     let a = d.v === n, c = a ? d.w : d.v;
     if (c !== r) {
       let f = a === o, h = t.edge(d).weight;
-      if (s += f ? h : -h, No(e, n, c)) {
+      if (s += f ? h : -h, Co(e, n, c)) {
         let g = e.edge(n, c).cutvalue;
         s += f ? -g : g;
       }
@@ -853,25 +853,25 @@ function yn(e, t, n) {
 }
 function mn(e, t, n, r) {
   let o = n.v, i = n.w;
-  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), nt(e), tt(e, t), _o(e, t);
+  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), nt(e), tt(e, t), So(e, t);
 }
-function _o(e, t) {
+function So(e, t) {
   let n = e.nodes().find((o) => !e.node(o).parent);
   if (!n) return;
-  let r = Eo(e, [n]);
+  let r = xo(e, [n]);
   r = r.slice(1), r.forEach((o) => {
     let i = e.node(o).parent, s = t.edge(o, i), l = !1;
     s || (s = t.edge(i, o), l = !0), t.node(o).rank = t.node(i).rank + (l ? s.minlen : -s.minlen);
   });
 }
-function No(e, t, n) {
+function Co(e, t, n) {
   return e.hasEdge(t, n);
 }
 function Mt(e, t, n) {
   return n.low <= t.lim && t.lim <= n.lim;
 }
-var So = Co;
-function Co(e) {
+var Io = Oo;
+function Oo(e) {
   let t = e.graph().ranker;
   if (typeof t == "function") return t(e);
   switch (t) {
@@ -879,10 +879,10 @@ function Co(e) {
       zt(e);
       break;
     case "tight-tree":
-      Oo(e);
+      Mo(e);
       break;
     case "longest-path":
-      Io(e);
+      jo(e);
       break;
     case "none":
       break;
@@ -890,18 +890,18 @@ function Co(e) {
       zt(e);
   }
 }
-var Io = et;
-function Oo(e) {
+var jo = et;
+function Mo(e) {
   et(e), hn(e);
 }
 function zt(e) {
-  xo(e);
+  _o(e);
 }
-var jo = Mo;
-function Mo(e) {
-  let t = Fo(e);
+var zo = Fo;
+function Fo(e) {
+  let t = Ao(e);
   e.graph().dummyChains.forEach((n) => {
-    let r = e.node(n), o = r.edgeObj, i = zo(e, t, o.v, o.w), s = i.path, l = i.lca, d = 0, a = s[d], c = !0;
+    let r = e.node(n), o = r.edgeObj, i = Lo(e, t, o.v, o.w), s = i.path, l = i.lca, d = 0, a = s[d], c = !0;
     for (; n !== o.w; ) {
       if (r = e.node(n), c) {
         for (; (a = s[d]) !== l && e.node(a).maxRank < r.rank; ) d++;
@@ -915,7 +915,7 @@ function Mo(e) {
     }
   });
 }
-function zo(e, t, n, r) {
+function Lo(e, t, n, r) {
   let o = [], i = [], s = Math.min(t[n].low, t[r].low), l = Math.max(t[n].lim, t[r].lim), d;
   d = n;
   do
@@ -925,7 +925,7 @@ function zo(e, t, n, r) {
   for (; (c = e.parent(c)) !== a; ) i.push(c);
   return { path: o.concat(i.reverse()), lca: a };
 }
-function Fo(e) {
+function Ao(e) {
   let t = {}, n = 0;
   function r(o) {
     let i = n;
@@ -933,10 +933,10 @@ function Fo(e) {
   }
   return e.children(je).forEach(r), t;
 }
-function Lo(e) {
-  let t = ue(e, "root", {}, "_root"), n = Ao(e), r = Object.values(n), o = X(Math.max, r) - 1, i = 2 * o + 1;
+function Ro(e) {
+  let t = ue(e, "root", {}, "_root"), n = Do(e), r = Object.values(n), o = X(Math.max, r) - 1, i = 2 * o + 1;
   e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
-  let s = Ro(e) + 1;
+  let s = Po(e) + 1;
   e.children(je).forEach((l) => wn(e, t, i, s, o, n, l)), e.graph().nodeRankFactor = i;
 }
 function wn(e, t, n, r, o, i, s) {
@@ -954,7 +954,7 @@ function wn(e, t, n, r, o, i, s) {
     e.setEdge(a, E, { weight: x, minlen: N, nestingEdge: !0 }), e.setEdge(b, c, { weight: x, minlen: N, nestingEdge: !0 });
   }), e.parent(s) || e.setEdge(t, a, { weight: 0, minlen: o + ((l = i[s]) != null ? l : 0) });
 }
-function Ao(e) {
+function Do(e) {
   let t = {};
   function n(r, o) {
     let i = e.children(r);
@@ -962,17 +962,17 @@ function Ao(e) {
   }
   return e.children(je).forEach((r) => n(r, 1)), t;
 }
-function Ro(e) {
+function Po(e) {
   return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
 }
-function Do(e) {
+function Bo(e) {
   let t = e.graph();
   e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((n) => {
     e.edge(n).nestingEdge && e.removeEdge(n);
   });
 }
-var Po = Bo;
-function Bo(e) {
+var Wo = Go;
+function Go(e) {
   function t(n) {
     let r = e.children(n), o = e.node(n);
     if (r.length && r.forEach(t), Object.hasOwn(o, "minRank")) {
@@ -986,15 +986,15 @@ function Ft(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);
   o[t][i] = d, e.setParent(d, r), l && e.setEdge(l, d, { weight: 1 });
 }
-function Wo(e) {
+function $o(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
   (n === "lr" || n === "rl") && vn(e);
 }
-function Go(e) {
+function Yo(e) {
   var t;
   let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "bt" || n === "rl") && $o(e), (n === "lr" || n === "rl") && (Yo(e), vn(e));
+  (n === "bt" || n === "rl") && Ko(e), (n === "lr" || n === "rl") && (Uo(e), vn(e));
 }
 function vn(e) {
   e.nodes().forEach((t) => Lt(e.node(t))), e.edges().forEach((t) => Lt(e.edge(t)));
@@ -1003,7 +1003,7 @@ function Lt(e) {
   let t = e.width;
   e.width = e.height, e.height = t;
 }
-function $o(e) {
+function Ko(e) {
   e.nodes().forEach((t) => Be(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
@@ -1013,7 +1013,7 @@ function $o(e) {
 function Be(e) {
   e.y = -e.y;
 }
-function Yo(e) {
+function Uo(e) {
   e.nodes().forEach((t) => We(e.node(t))), e.edges().forEach((t) => {
     var n;
     let r = e.edge(t);
@@ -1024,7 +1024,7 @@ function We(e) {
   let t = e.x;
   e.x = e.y, e.y = t;
 }
-function Ko(e) {
+function Ho(e) {
   let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = X(Math.max, r), i = ye(o + 1).map(() => []);
   function s(l) {
     if (t[l]) return;
@@ -1036,13 +1036,13 @@ function Ko(e) {
   }
   return n.sort((l, d) => e.node(l).rank - e.node(d).rank).forEach(s), i;
 }
-function Uo(e, t) {
+function Vo(e, t) {
   let n = 0;
-  for (let r = 1; r < t.length; ++r) n += Ho(e, t[r - 1], t[r]);
+  for (let r = 1; r < t.length; ++r) n += qo(e, t[r - 1], t[r]);
   return n;
 }
-function Ho(e, t, n) {
-  let r = eo(n, n.map((a, c) => c)), o = t.flatMap((a) => {
+function qo(e, t, n) {
+  let r = no(n, n.map((a, c) => c)), o = t.flatMap((a) => {
     let c = e.outEdges(a);
     return c ? c.map((f) => ({ pos: r[f.w], weight: e.edge(f).weight })).sort((f, h) => f.pos - h.pos) : [];
   }), i = 1;
@@ -1058,7 +1058,7 @@ function Ho(e, t, n) {
     d += a.weight * f;
   }), d;
 }
-function Vo(e, t = []) {
+function Xo(e, t = []) {
   return t.map((n) => {
     let r = e.inEdges(n);
     if (!r || !r.length) return { v: n };
@@ -1071,7 +1071,7 @@ function Vo(e, t = []) {
     }
   });
 }
-function qo(e, t) {
+function Jo(e, t) {
   let n = {};
   e.forEach((o, i) => {
     let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
@@ -1081,13 +1081,13 @@ function qo(e, t) {
     i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
   });
   let r = Object.values(n).filter((o) => !o.indegree);
-  return Xo(r);
+  return Zo(r);
 }
-function Xo(e) {
+function Zo(e) {
   let t = [];
   function n(o) {
     return (i) => {
-      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Jo(o, i);
+      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Qo(o, i);
     };
   }
   function r(o) {
@@ -1101,13 +1101,13 @@ function Xo(e) {
   }
   return t.filter((o) => !o.merged).map((o) => Ie(o, ["vs", "i", "barycenter", "weight"]));
 }
-function Jo(e, t) {
+function Qo(e, t) {
   let n = 0, r = 0;
   e.weight && (n += e.barycenter * e.weight, r += e.weight), t.weight && (n += t.barycenter * t.weight, r += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = n / r, e.weight = r, e.i = Math.min(t.i, e.i), t.merged = !0;
 }
-function Zo(e, t) {
-  let n = Zr(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(Qo(!!t)), d = At(i, o, d), r.forEach((c) => {
+function ei(e, t) {
+  let n = eo(e, (c) => Object.hasOwn(c, "barycenter")), r = n.lhs, o = n.rhs.sort((c, f) => f.i - c.i), i = [], s = 0, l = 0, d = 0;
+  r.sort(ti(!!t)), d = At(i, o, d), r.forEach((c) => {
     d += c.vs.length, i.push(c.vs), s += c.barycenter * c.weight, l += c.weight, d = At(i, o, d);
   });
   let a = { vs: i.flat(1) };
@@ -1118,22 +1118,22 @@ function At(e, t, n) {
   for (; t.length && (r = t[t.length - 1]).i <= n; ) t.pop(), e.push(r.vs), n++;
   return n;
 }
-function Qo(e) {
+function ti(e) {
   return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
 }
 function En(e, t, n, r) {
   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 = Vo(e, o);
+  let a = Xo(e, o);
   a.forEach((h) => {
     if (e.children(h.v).length) {
       let g = En(e, h.v, n, r);
-      d[h.v] = g, Object.hasOwn(g, "barycenter") && ti(h, g);
+      d[h.v] = g, Object.hasOwn(g, "barycenter") && ri(h, g);
     }
   });
-  let c = qo(a, n);
-  ei(c, d);
-  let f = Zo(c, r);
+  let c = Jo(a, n);
+  ni(c, d);
+  let f = ei(c, r);
   if (s && l) {
     f.vs = [s, f.vs, l].flat(1);
     let h = e.predecessors(s);
@@ -1144,17 +1144,17 @@ function En(e, t, n, r) {
   }
   return f;
 }
-function ei(e, t) {
+function ni(e, t) {
   e.forEach((n) => {
     n.vs = n.vs.flatMap((r) => t[r] ? t[r].vs : r);
   });
 }
-function ti(e, t) {
+function ri(e, t) {
   e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight) : (e.barycenter = t.barycenter, e.weight = t.weight);
 }
-function ni(e, t, n, r) {
+function oi(e, t, n, r) {
   r || (r = e.nodes());
-  let o = ri(e), i = new U({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
+  let o = ii(e), i = new U({ 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) {
@@ -1167,12 +1167,12 @@ function ni(e, t, n, r) {
     }
   }), i;
 }
-function ri(e) {
+function ii(e) {
   let t;
   for (; e.hasNode(t = Qe("_root")); ) ;
   return t;
 }
-function oi(e, t, n) {
+function si(e, t, n) {
   let r = {}, o;
   n.forEach((i) => {
     let s = e.parent(i), l, d;
@@ -1190,12 +1190,12 @@ function kn(e, t = {}) {
     t.customOrder(e, kn);
     return;
   }
-  let n = cn(e), r = Rt(e, ye(1, n + 1), "inEdges"), o = Rt(e, ye(n - 1, -1, -1), "outEdges"), i = Ko(e);
+  let n = cn(e), r = Rt(e, ye(1, n + 1), "inEdges"), o = Rt(e, ye(n - 1, -1, -1), "outEdges"), i = Ho(e);
   if (Dt(e, i), t.disableOptimalOrderHeuristic) return;
   let s = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
   for (let a = 0, c = 0; c < 4; ++a, ++c) {
-    ii(a % 2 ? r : o, a % 4 >= 2, d), i = we(e);
-    let f = Uo(e, i);
+    li(a % 2 ? r : o, a % 4 >= 2, d), i = we(e);
+    let f = Vo(e, i);
     f < s ? (c = 0, l = Object.assign({}, i), s = f) : f === s && (l = structuredClone(i));
   }
   Dt(e, l);
@@ -1209,26 +1209,26 @@ function Rt(e, t, n) {
     if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let l = s.minRank; l <= s.maxRank; l++) l !== s.rank && o(l, i);
   }
   return t.map(function(i) {
-    return ni(e, i, n, r.get(i) || []);
+    return oi(e, i, n, r.get(i) || []);
   });
 }
-function ii(e, t, n) {
+function li(e, t, n) {
   let r = new U();
   e.forEach(function(o) {
     n.forEach((l) => r.setEdge(l.left, l.right));
     let i = o.graph().root, s = En(o, i, r, t);
-    s.vs.forEach((l, d) => o.node(l).order = d), oi(o, r, s.vs);
+    s.vs.forEach((l, d) => o.node(l).order = d), si(o, r, s.vs);
   });
 }
 function Dt(e, t) {
   Object.values(t).forEach((n) => n.forEach((r, o) => e.node(r).order = o));
 }
-function si(e, t) {
+function ai(e, t) {
   let n = {};
   function r(o, i) {
     let s = 0, l = 0, d = o.length, a = i[i.length - 1];
     return i.forEach((c, f) => {
-      let h = ai(e, c), g = h ? e.node(h).order : d;
+      let h = ci(e, c), g = h ? e.node(h).order : d;
       (h || c === a) && (i.slice(l, f + 1).forEach((p) => {
         let E = e.predecessors(p);
         E && E.forEach((b) => {
@@ -1240,7 +1240,7 @@ function si(e, t) {
   }
   return t.length && t.reduce(r), n;
 }
-function li(e, t) {
+function di(e, t) {
   let n = {};
   function r(i, s, l, d, a) {
     ye(s, l).forEach((c) => {
@@ -1271,7 +1271,7 @@ function li(e, t) {
   }
   return t.length && t.reduce(o), n;
 }
-function ai(e, t) {
+function ci(e, t) {
   if (e.node(t).dummy) {
     let n = e.predecessors(t);
     if (n) return n.find((r) => e.node(r).dummy);
@@ -1285,7 +1285,7 @@ function xn(e, t, n) {
   let r = e[t];
   r || (e[t] = r = {}), r[n] = !0;
 }
-function di(e, t, n) {
+function fi(e, t, n) {
   if (t > n) {
     let o = t;
     t = n, n = o;
@@ -1293,7 +1293,7 @@ function di(e, t, n) {
   let r = e[t];
   return r !== void 0 && Object.hasOwn(r, n);
 }
-function ci(e, t, n, r) {
+function ui(e, t, n, r) {
   let o = {}, i = {}, s = {};
   return t.forEach((l) => {
     l.forEach((d, a) => {
@@ -1312,7 +1312,7 @@ function ci(e, t, n, r) {
           let E = f[g];
           if (E === void 0) continue;
           let b = s[E];
-          if (b !== void 0 && i[a] === a && d < b && !di(n, a, E)) {
+          if (b !== void 0 && i[a] === a && d < b && !fi(n, a, E)) {
             let x = o[E];
             x !== void 0 && (i[E] = a, i[a] = o[a] = x, d = b);
           }
@@ -1321,8 +1321,8 @@ function ci(e, t, n, r) {
     });
   }), { root: o, align: i };
 }
-function fi(e, t, n, r, o = !1) {
-  let i = {}, s = ui(e, t, n, o), l = o ? "borderLeft" : "borderRight";
+function hi(e, t, n, r, o = !1) {
+  let i = {}, s = gi(e, t, n, o), l = o ? "borderLeft" : "borderRight";
   function d(g, p) {
     let E = s.nodes().slice(), b = {}, x = E.pop();
     for (; x; ) {
@@ -1363,8 +1363,8 @@ function fi(e, t, n, r, o = !1) {
     E !== void 0 && (i[g] = (p = i[E]) != null ? p : 0);
   }), i;
 }
-function ui(e, t, n, r) {
-  let o = new U(), i = e.graph(), s = yi(i.nodesep, i.edgesep, r);
+function gi(e, t, n, r) {
+  let o = new U(), i = e.graph(), s = wi(i.nodesep, i.edgesep, r);
   return t.forEach((l) => {
     let d;
     l.forEach((a) => {
@@ -1382,18 +1382,18 @@ function ui(e, t, n, r) {
     });
   }), o;
 }
-function hi(e, t) {
+function pi(e, t) {
   return Object.values(t).reduce((n, r) => {
     let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
     Object.entries(r).forEach(([l, d]) => {
-      let a = mi(e, l) / 2;
+      let a = vi(e, l) / 2;
       o = Math.max(d + a, o), i = Math.min(d - a, i);
     });
     let s = o - i;
     return s < n[0] && (n = [s, r]), n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function gi(e, t) {
+function bi(e, t) {
   let n = Object.values(t), r = X(Math.min, n), o = X(Math.max, n);
   ["u", "d"].forEach((i) => {
     ["l", "r"].forEach((s) => {
@@ -1404,7 +1404,7 @@ function gi(e, t) {
     });
   });
 }
-function pi(e, t = void 0) {
+function yi(e, t = void 0) {
   let n = e.ul;
   return n ? Oe(n, (r, o) => {
     var i, s;
@@ -1419,19 +1419,19 @@ function pi(e, t = void 0) {
     return (((i = l[1]) != null ? i : 0) + ((s = l[2]) != null ? s : 0)) / 2;
   }) : {};
 }
-function bi(e) {
-  let t = we(e), n = Object.assign(si(e, t), li(e, t)), r = {}, o;
+function mi(e) {
+  let t = we(e), n = Object.assign(ai(e, t), di(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 = ci(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = fi(e, o, d.root, d.align, l === "r");
+      let d = ui(e, o, n, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), a = hi(e, o, d.root, d.align, l === "r");
       l === "r" && (a = Oe(a, (c) => -c)), r[s + l] = a;
     });
   });
-  let i = hi(e, r);
-  return gi(r, i), pi(r, e.graph().align);
+  let i = pi(e, r);
+  return bi(r, i), yi(r, e.graph().align);
 }
-function yi(e, t, n) {
+function wi(e, t, n) {
   return (r, o, i) => {
     let s = r.node(o), l = r.node(i), d = 0, a;
     if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
@@ -1453,13 +1453,13 @@ function yi(e, t, n) {
     return a && (d += n ? a : -a), d;
   };
 }
-function mi(e, t) {
+function vi(e, t) {
   return e.node(t).width;
 }
-function wi(e) {
-  e = an(e), vi(e), Object.entries(bi(e)).forEach(([t, n]) => e.node(t).x = n);
+function Ei(e) {
+  e = an(e), ki(e), Object.entries(mi(e)).forEach(([t, n]) => e.node(t).x = n);
 }
-function vi(e) {
+function ki(e) {
   let t = we(e), n = e.graph(), r = n.ranksep, o = n.rankalign, i = 0;
   t.forEach((s) => {
     let l = s.reduce((d, a) => {
@@ -1473,17 +1473,17 @@ function vi(e) {
     }), i += l + r;
   });
 }
-function Ei(e, t = {}) {
+function xi(e, t = {}) {
   let n = t.debugTiming ? fn : un;
   return n("layout", () => {
-    let r = n("  buildLayoutGraph", () => ji(e));
-    return n("  runLayout", () => ki(r, n, t)), n("  updateInputGraph", () => xi(e, r)), r;
+    let r = n("  buildLayoutGraph", () => zi(e));
+    return n("  runLayout", () => Ti(r, n, t)), n("  updateInputGraph", () => _i(e, r)), r;
   });
 }
-function ki(e, t, n) {
-  t("    makeSpaceForEdgeLabels", () => Mi(e)), t("    removeSelfEdges", () => Wi(e)), t("    acyclic", () => fo(e)), t("    nestingGraph.run", () => Lo(e)), t("    rank", () => So(an(e))), t("    injectEdgeLabelProxies", () => zi(e)), t("    removeEmptyRanks", () => Xr(e)), t("    nestingGraph.cleanup", () => Do(e)), t("    normalizeRanks", () => qr(e)), t("    assignRankMinMax", () => Fi(e)), t("    removeEdgeLabelProxies", () => Li(e)), t("    normalize.run", () => go(e)), t("    parentDummyChains", () => jo(e)), t("    addBorderSegments", () => Po(e)), t("    order", () => kn(e, n)), t("    insertSelfEdges", () => Gi(e)), t("    adjustCoordinateSystem", () => Wo(e)), t("    position", () => wi(e)), t("    positionSelfEdges", () => $i(e)), t("    removeBorderNodes", () => Bi(e)), t("    normalize.undo", () => bo(e)), t("    fixupEdgeLabelCoords", () => Di(e)), t("    undoCoordinateSystem", () => Go(e)), t("    translateGraph", () => Ai(e)), t("    assignNodeIntersects", () => Ri(e)), t("    reversePoints", () => Pi(e)), t("    acyclic.undo", () => ho(e));
+function Ti(e, t, n) {
+  t("    makeSpaceForEdgeLabels", () => Fi(e)), t("    removeSelfEdges", () => $i(e)), t("    acyclic", () => ho(e)), t("    nestingGraph.run", () => Ro(e)), t("    rank", () => Io(an(e))), t("    injectEdgeLabelProxies", () => Li(e)), t("    removeEmptyRanks", () => Zr(e)), t("    nestingGraph.cleanup", () => Bo(e)), t("    normalizeRanks", () => Jr(e)), t("    assignRankMinMax", () => Ai(e)), t("    removeEdgeLabelProxies", () => Ri(e)), t("    normalize.run", () => bo(e)), t("    parentDummyChains", () => zo(e)), t("    addBorderSegments", () => Wo(e)), t("    order", () => kn(e, n)), t("    insertSelfEdges", () => Yi(e)), t("    adjustCoordinateSystem", () => $o(e)), t("    position", () => Ei(e)), t("    positionSelfEdges", () => Ki(e)), t("    removeBorderNodes", () => Gi(e)), t("    normalize.undo", () => mo(e)), t("    fixupEdgeLabelCoords", () => Bi(e)), t("    undoCoordinateSystem", () => Yo(e)), t("    translateGraph", () => Di(e)), t("    assignNodeIntersects", () => Pi(e)), t("    reversePoints", () => Wi(e)), t("    acyclic.undo", () => po(e));
 }
-function xi(e, t) {
+function _i(e, t) {
   e.nodes().forEach((n) => {
     let r = e.node(n), o = t.node(n);
     r && (r.x = o.x, r.y = o.y, r.order = o.order, r.rank = o.rank, t.children(n).length && (r.width = o.width, r.height = o.height));
@@ -1492,11 +1492,11 @@ function xi(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 Ti = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], _i = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, Ni = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Si = ["width", "height", "rank"], Pt = { width: 0, height: 0 }, Ci = ["minlen", "weight", "width", "height", "labeloffset"], Ii = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Oi = ["labelpos"];
-function ji(e) {
+var Ni = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Si = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, Ci = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], Ii = ["width", "height", "rank"], Pt = { width: 0, height: 0 }, Oi = ["minlen", "weight", "width", "height", "labeloffset"], ji = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, Mi = ["labelpos"];
+function zi(e) {
   let t = new U({ multigraph: !0, compound: !0 }), n = $e(e.graph());
-  return t.setGraph(Object.assign({}, _i, Ge(n, Ti), Ie(n, Ni))), e.nodes().forEach((r) => {
-    let o = $e(e.node(r)), i = Ge(o, Si);
+  return t.setGraph(Object.assign({}, Si, Ge(n, Ni), Ie(n, Ci))), e.nodes().forEach((r) => {
+    let o = $e(e.node(r)), i = Ge(o, Ii);
     Object.keys(Pt).forEach((l) => {
       i[l] === void 0 && (i[l] = Pt[l]);
     }), t.setNode(r, i);
@@ -1504,17 +1504,17 @@ function ji(e) {
     s !== void 0 && t.setParent(r, s);
   }), e.edges().forEach((r) => {
     let o = $e(e.edge(r));
-    t.setEdge(r, Object.assign({}, Ii, Ge(o, Ci), Ie(o, Oi)));
+    t.setEdge(r, Object.assign({}, ji, Ge(o, Oi), Ie(o, Mi)));
   }), t;
 }
-function Mi(e) {
+function Fi(e) {
   let t = e.graph();
   t.ranksep /= 2, e.edges().forEach((n) => {
     let r = e.edge(n);
     r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
   });
 }
-function zi(e) {
+function Li(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.width && n.height) {
@@ -1523,14 +1523,14 @@ function zi(e) {
     }
   });
 }
-function Fi(e) {
+function Ai(e) {
   let t = 0;
   e.nodes().forEach((n) => {
     let r = e.node(n);
     r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = Math.max(t, r.maxRank));
   }), e.graph().maxRank = t;
 }
-function Li(e) {
+function Ri(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     if (n.dummy === "edge-proxy") {
@@ -1539,7 +1539,7 @@ function Li(e) {
     }
   });
 }
-function Ai(e) {
+function Di(e) {
   let t = Number.POSITIVE_INFINITY, n = 0, r = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, l = i.marginy || 0;
   function d(a) {
     let c = a.x, f = a.y, h = a.width, g = a.height;
@@ -1558,13 +1558,13 @@ function Ai(e) {
     }), Object.hasOwn(c, "x") && (c.x -= t), Object.hasOwn(c, "y") && (c.y -= r);
   }), i.width = n - t + s, i.height = o - r + l;
 }
-function Ri(e) {
+function Pi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t), r = e.node(t.v), o = e.node(t.w), i, s;
     n.points ? (i = n.points[0], s = n.points[n.points.length - 1]) : (n.points = [], i = o, s = r), n.points.unshift(It(r, i)), n.points.push(It(o, s));
   });
 }
-function Di(e) {
+function Bi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (Object.hasOwn(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
@@ -1577,13 +1577,13 @@ function Di(e) {
     }
   });
 }
-function Pi(e) {
+function Wi(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     n.reversed && n.points.reverse();
   });
 }
-function Bi(e) {
+function Gi(e) {
   e.nodes().forEach((t) => {
     if (e.children(t).length) {
       let n = e.node(t), r = e.node(n.borderTop), o = e.node(n.borderBottom), i = e.node(n.borderLeft[n.borderLeft.length - 1]), s = e.node(n.borderRight[n.borderRight.length - 1]);
@@ -1593,7 +1593,7 @@ function Bi(e) {
     e.node(t).dummy === "border" && e.removeNode(t);
   });
 }
-function Wi(e) {
+function $i(e) {
   e.edges().forEach((t) => {
     if (t.v === t.w) {
       let n = e.node(t.v);
@@ -1601,7 +1601,7 @@ function Wi(e) {
     }
   });
 }
-function Gi(e) {
+function Yi(e) {
   we(e).forEach((t) => {
     let n = 0;
     t.forEach((r, o) => {
@@ -1612,7 +1612,7 @@ function Gi(e) {
     });
   });
 }
-function $i(e) {
+function Ki(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     if (n.dummy === "selfedge") {
@@ -1630,7 +1630,7 @@ function $e(e) {
     typeof n == "string" && (n = n.toLowerCase()), t[n] = r;
   }), t;
 }
-function Yi(e) {
+function Ui(e) {
   let t = we(e), n = new U({ compound: !0, multigraph: !0 }).setGraph({});
   return e.nodes().forEach((r) => {
     n.setNode(r, { label: r }), n.setParent(r, "layer" + e.node(r).rank);
@@ -1639,15 +1639,15 @@ function Yi(e) {
     n.setNode(i, { rank: "same" }), r.reduce((s, l) => (n.setEdge(s, l, { style: "invis" }), l));
   }), n;
 }
-var Ki = { graphlib: Zt, version: to, layout: Ei, debug: Yi, util: { time: fn, notime: un } }, Bt = Ki;
+var Hi = { graphlib: Zt, version: ro, layout: xi, debug: Ui, util: { time: fn, notime: un } }, Bt = Hi;
 /*! For license information please see dagre.esm.js.LEGAL.txt */
-const Ui = (e) => {
+const Vi = (e) => {
   const t = [];
   return e.nodeInternals.forEach((n, r) => t.push(`${r}:${n.height ?? 0}`)), t.join(",");
-}, Hi = ({ onHeightsReady: e, nodeCount: t }) => {
-  const n = Dn(Ui), r = Tt("");
+}, qi = ({ onHeightsReady: e, nodeCount: t }) => {
+  const n = Pn(Vi), r = Tt("");
   Tt(0);
-  const { fitView: o } = Pn();
+  const { fitView: o } = Bn();
   return re(() => {
     if (!n || n === r.current) return;
     const i = {};
@@ -1657,13 +1657,13 @@ const Ui = (e) => {
     }
     Object.keys(i).length !== 0 && (r.current = n, e(i));
   }, [n]), null;
-}, Vi = {
+}, Xi = {
   gray: { bg: "#f1f5f9", fg: "#475569" },
   green: { bg: "#dcfce7", fg: "#166534" },
   amber: { bg: "#fef3c7", fg: "#92400e" },
   red: { bg: "#fee2e2", fg: "#991b1b" }
 };
-function qi({
+function Ji({
   workflowName: e,
   onWorkflowNameChange: t,
   status: n,
@@ -1686,7 +1686,7 @@ function qi({
         a(!1);
       }
     }
-  }, E = Vi[r] ?? {
+  }, E = Xi[r] ?? {
     bg: r,
     fg: "#fff"
   };
@@ -1816,15 +1816,15 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   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 }),
     /* @__PURE__ */ u("span", { style: { flexGrow: 1, fontSize: 14, fontWeight: 500, color: "#212121" }, children: n }),
-    /* @__PURE__ */ u(_t, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(pr, {}) : /* @__PURE__ */ u(br, {}) }),
-    /* @__PURE__ */ u(_t, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(er, {}) })
+    /* @__PURE__ */ u(_t, { onClick: a, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn", children: l ? /* @__PURE__ */ u(br, {}) : /* @__PURE__ */ u(yr, {}) }),
+    /* @__PURE__ */ u(_t, { onClick: t, size: "small", "data-testid": "close-drawer-button", children: /* @__PURE__ */ u(tr, {}) })
   ] }), f = () => i ? /* @__PURE__ */ u(Q, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 }, children: i }) : null;
-  return l ? /* @__PURE__ */ w(Xn, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
+  return l ? /* @__PURE__ */ w(Jn, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } }, children: [
     /* @__PURE__ */ u(c, {}),
     /* @__PURE__ */ u(Q, { sx: { flexGrow: 1, overflowY: "auto", p: 0 }, children: o }),
     /* @__PURE__ */ u(f, {})
   ] }) : /* @__PURE__ */ w(
-    Jn,
+    Zn,
     {
       anchor: "right",
       open: e,
@@ -1854,7 +1854,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ]
     }
   );
-}, Xi = ({
+}, Zi = ({
   open: e,
   templates: t,
   messages: n,
@@ -1908,7 +1908,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: o,
       title: z ? d.label : n.addTriggerTitle,
-      icon: /* @__PURE__ */ u(gr, {}),
+      icon: /* @__PURE__ */ u(pr, {}),
       width: 500,
       footer: W,
       children: /* @__PURE__ */ w(Q, { sx: { p: 2 }, children: [
@@ -1933,7 +1933,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
                   D.currentTarget.style.background = "";
                 },
                 children: [
-                  /* @__PURE__ */ u("div", { style: { color: F.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: F.triggerCategory === "scheduler" ? /* @__PURE__ */ u(tr, { size: 18 }) : /* @__PURE__ */ u(nr, { size: 18 }) }),
+                  /* @__PURE__ */ u("div", { style: { color: F.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 }, children: F.triggerCategory === "scheduler" ? /* @__PURE__ */ u(nr, { size: 18 }) : /* @__PURE__ */ u(rr, { size: 18 }) }),
                   /* @__PURE__ */ w("div", { children: [
                     /* @__PURE__ */ u("div", { style: { fontSize: 14, fontWeight: 500, color: "#212121" }, children: F.label }),
                     F.description && /* @__PURE__ */ u("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 }, children: F.description })
@@ -1945,7 +1945,7 @@ 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 })
           ] }),
           p && /* @__PURE__ */ w(Q, { sx: { display: "flex", alignItems: "center", gap: 1, mt: 2, fontSize: 12, color: "#64748b" }, children: [
-            /* @__PURE__ */ u(Zn, { size: 14 }),
+            /* @__PURE__ */ u(Qn, { size: 14 }),
             /* @__PURE__ */ u("span", { children: "Loading sources for the selected trigger…" })
           ] }),
           b && /* @__PURE__ */ u("p", { style: { fontSize: 12, color: "#d32f2f", marginTop: 12 }, children: b })
@@ -1974,7 +1974,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
             ":"
           ] }),
           /* @__PURE__ */ u(
-            Qn,
+            er,
             {
               isMulti: !0,
               options: c,
@@ -1983,7 +1983,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
               placeholder: "Select sources…",
               menuPosition: "fixed",
               menuPortalTarget: typeof document < "u" ? document.body : void 0,
-              styles: yr(!1, !0)
+              styles: mr(!1, !0)
             }
           )
         ] })
@@ -1993,7 +1993,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
 }, Ye = {
   cursor: "pointer",
   transition: "background 0.15s"
-}, Ke = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Ji = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
+}, Ke = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Qi = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
   const { apps: i, ungrouped: s } = K(() => {
     const f = /* @__PURE__ */ new Map(), h = [];
     for (const g of t)
@@ -2022,7 +2022,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: o,
       title: c ? n.addStepTitle : a.label,
-      icon: c ? /* @__PURE__ */ u(rr, {}) : a.icon ?? /* @__PURE__ */ u(or, {}),
+      icon: c ? /* @__PURE__ */ u(or, {}) : a.icon ?? /* @__PURE__ */ u(ir, {}),
       width: 500,
       children: /* @__PURE__ */ w(Q, { sx: { p: 2 }, children: [
         !c && /* @__PURE__ */ w(
@@ -2127,7 +2127,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, Wt = "_conditionConfig", Zi = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: s }) => {
+}, Wt = "_conditionConfig", es = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: s }) => {
   const [l, d] = j([]), [a, c] = j(!1), [f, h] = j(null), [g, p] = j({});
   re(() => {
     p((r == null ? void 0 : r[Wt]) ?? {});
@@ -2164,7 +2164,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
         !a && f && /* @__PURE__ */ u("p", { style: { fontSize: 13, color: "#d32f2f" }, children: f }),
         !a && !f && l.length === 0 && /* @__PURE__ */ u("p", { className: "ff-text-muted", style: { fontSize: 13 }, children: o.noConfigurationNeeded }),
         b && /* @__PURE__ */ u(
-          mr,
+          wr,
           {
             schema: { layout: "flat", fields: l },
             initialValues: r ?? {},
@@ -2181,7 +2181,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       ] })
     }
   );
-}, Qi = ({
+}, ts = ({
   isOpen: e,
   onClose: t,
   workflowId: n,
@@ -2201,7 +2201,7 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
       isOpen: e,
       onClose: t,
       title: r ? `Preview: ${r}` : "Sub-Workflow Preview",
-      icon: /* @__PURE__ */ u(sr, { size: 18, color: "#00695c" }),
+      icon: /* @__PURE__ */ u(lr, { size: 18, color: "#00695c" }),
       width: 700,
       children: /* @__PURE__ */ w("div", { style: { height: "100%", display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", padding: 24 }, children: [
         i.status === "idle" && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", fontSize: 14 }, children: "Select a workflow to preview" }),
@@ -2211,20 +2211,20 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
           /* @__PURE__ */ u("style", { children: "@keyframes spin { to { transform: rotate(360deg); } }" })
         ] }),
         i.status === "error" && /* @__PURE__ */ w("div", { style: { textAlign: "center", color: "#c62828" }, children: [
-          /* @__PURE__ */ u(ir, { size: 32, style: { marginBottom: 8 } }),
+          /* @__PURE__ */ u(sr, { size: 32, style: { marginBottom: 8 } }),
           /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: i.message })
         ] }),
-        i.status === "loaded" && /* @__PURE__ */ u("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ u(es, { state: i.state }) })
+        i.status === "loaded" && /* @__PURE__ */ u("div", { style: { width: "100%", flex: 1 }, children: /* @__PURE__ */ u(ns, { state: i.state }) })
       ] })
     }
   );
-}, es = ({ state: e }) => {
+}, ns = ({ state: e }) => {
   const [t, n] = j(null), [r, o] = j(null);
   return re(() => {
     Promise.all([
-      Promise.resolve().then(() => ss).then((i) => i.default),
-      import("./index-Dcur-XJ9.js").then((i) => i.nodeTypeRegistry),
-      import("./index-B6xrei80.js").then((i) => i.templateRegistry)
+      Promise.resolve().then(() => as).then((i) => i.default),
+      import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
+      import("./templateRegistry.js").then((i) => i.templateRegistry)
     ]).then(([i, s, l]) => {
       n(() => i), o({ nodeTypeRegistry: s, templateRegistry: l });
     });
@@ -2247,12 +2247,12 @@ const Me = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i,
   approvalNode: 90,
   delayNode: 80,
   notificationNode: 80
-}, ts = {
-  plusEdge: Vn,
-  labelPlusEdge: Hn,
-  plainEdge: Un,
-  edgeWithPlusLabel: Kn,
-  gatewayBranchEdge: Yn
+}, rs = {
+  plusEdge: qn,
+  labelPlusEdge: Vn,
+  plainEdge: Hn,
+  edgeWithPlusLabel: Un,
+  gatewayBranchEdge: Kn
 };
 function Gt() {
   return [
@@ -2261,7 +2261,7 @@ function Gt() {
     { id: "end", kind: "end", reactFlowType: "endNode" }
   ];
 }
-function ns(e, t, n, r = "TB") {
+function os(e, t, n, r = "TB") {
   const o = new Bt.graphlib.Graph();
   return o.setGraph({ rankdir: r, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
     const s = n[i.id] ?? { width: me, height: Xe[i.type ?? ""] ?? 80 };
@@ -2273,7 +2273,7 @@ function ns(e, t, n, r = "TB") {
   });
 }
 const le = (e) => e === "filter" || e === "approval";
-function rs(e, t, n, r) {
+function is(e, t, n, r) {
   const s = Ve, l = 30, d = 30, a = {}, c = {}, f = /* @__PURE__ */ new Map();
   for (const b of e) f.set(b.id, b);
   for (const b of Object.values(t))
@@ -2321,7 +2321,7 @@ function $t(e) {
     selectable: !1
   };
 }
-function os(e, t, n, r, o) {
+function ss(e, t, n, r, o) {
   return {
     id: `e-${e.id}-${t.id}`,
     source: e.id,
@@ -2335,7 +2335,7 @@ function os(e, t, n, r, o) {
     }
   };
 }
-function is(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
+function ls(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
   const l = o.edgeColor ?? "#b0bec5", d = [], a = [], c = (p, E) => {
     const b = t[p];
     if (!b) return;
@@ -2350,7 +2350,7 @@ function is(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
           data: { branch: W, filterId: p, label: F, isFirst: D === 0, onAddStepClick: n, verticalRouting: s === "vertical" }
         });
         for (let G = 1; G < z.length; G++)
-          le(z[G - 1].kind) || a.push(os(z[G - 1], z[G], l, n, { filterId: p, branch: W }));
+          le(z[G - 1].kind) || a.push(ss(z[G - 1], z[G], l, n, { filterId: p, branch: W }));
         for (const G of z)
           le(G.kind) && t[G.id] && c(G.id, G.branchLabels);
       }
@@ -2400,12 +2400,12 @@ function is(e, t, n, r, o = {}, i = "TB", s = "horizontal") {
     }), edges: a };
   }
   if (s === "vertical") {
-    const { nodes: p, railSpecs: E } = rs(e, t, d, f);
+    const { nodes: p, railSpecs: E } = is(e, t, d, f);
     return { nodes: p.map(
       (x) => E[x.id] ? { ...x, data: { ...x.data, _branchRail: E[x.id] } } : x
     ), edges: a };
   }
-  return { nodes: ns(d, a, f, i), edges: a };
+  return { nodes: os(d, a, f, i), edges: a };
 }
 const Yt = ({
   nodeRegistry: e,
@@ -2433,43 +2433,44 @@ const Yt = ({
   onCancel: W,
   workflowStatus: F,
   workflowStatusColor: D,
-  saveLabel: G
+  saveLabel: G,
+  optionsResolvers: ve
 }) => {
   const {
-    fitView: ve = !0,
-    fitViewPadding: Ee = 0.3,
-    showControls: te = !0,
-    showMiniMap: he = !1,
-    panOnScroll: ke = !0,
-    zoomOnScroll: ze = !1,
-    minZoom: Fe = 0.25,
-    maxZoom: _n = 2,
-    snapToGrid: Nn = !1,
-    snapGrid: Sn = [15, 15],
+    fitView: Ee = !0,
+    fitViewPadding: te = 0.3,
+    showControls: he = !0,
+    showMiniMap: ke = !1,
+    panOnScroll: ze = !0,
+    zoomOnScroll: Fe = !1,
+    minZoom: _n = 0.25,
+    maxZoom: Nn = 2,
+    snapToGrid: Sn = !1,
+    snapGrid: Cn = [15, 15],
     branchLayout: rt = "horizontal",
     nodeBody: ot = "full"
-  } = a, ge = K(() => wr(d), [d]), [A, oe] = j(() => (n == null ? void 0 : n.slots) ?? Gt()), [$, J] = j(() => (n == null ? void 0 : n.branches) ?? {}), [de, H] = j(null), [Le, it] = j(null), [V, xe] = j(null), [ie, st] = j(null), [Te, lt] = j(null), [q, at] = j(() => {
+  } = a, ge = K(() => Er(d), [d]), [L, oe] = j(() => (n == null ? void 0 : n.slots) ?? Gt()), [$, J] = j(() => (n == null ? void 0 : n.branches) ?? {}), [de, H] = j(null), [Le, it] = j(null), [V, xe] = j(null), [ie, st] = j(null), [Te, lt] = j(null), [q, at] = 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;
     return v ? t.lookup(v) ?? null : null;
-  }), [dt, Cn] = j({}), In = Y((y) => {
-    Cn(y);
-  }, []), On = K(() => ({ ...$n, ...r }), [r]), jn = K(() => ({ ...ts, ...o }), [o]), Mn = K(() => {
-    const y = A.filter((_) => _.kind === "userTask").length, v = Object.values($).flatMap((_) => Object.values(_).flat()).filter((_) => _.kind === "userTask").length;
+  }), [dt, In] = j({}), On = Y((y) => {
+    In(y);
+  }, []), jn = K(() => ({ ...Yn, ...r }), [r]), Mn = K(() => ({ ...rs, ...o }), [o]), zn = K(() => {
+    const y = L.filter((_) => _.kind === "userTask").length, v = Object.values($).flatMap((_) => Object.values(_).flat()).filter((_) => _.kind === "userTask").length;
     return y + v;
-  }, [A, $]), ct = E ?? (q == null ? void 0 : q.maxTasks), ft = ct !== void 0 && Mn >= ct, se = Y((y) => {
-    const v = A.find((_) => _.id === y);
+  }, [L, $]), ct = E ?? (q == null ? void 0 : q.maxTasks), ft = ct !== void 0 && zn >= ct, se = Y((y) => {
+    const v = L.find((_) => _.id === y);
     if (v) return v;
     for (const _ of Object.values($)) {
       const k = Object.values(_).flat().find((I) => I.id === y);
       if (k) return k;
     }
     return null;
-  }, [A, $]), Ae = Y((y) => {
+  }, [L, $]), Ae = Y((y) => {
     s || (it(y), H("nodeConfig"));
   }, [s]), ut = Y((y) => {
     if (!s) {
-      if (A.some((v) => v.id === y)) {
-        const v = A.find((_) => _.id === y);
+      if (L.some((v) => v.id === y)) {
+        const v = L.find((_) => _.id === y);
         if ((v == null ? void 0 : v.kind) === "triggerFixed") {
           oe(Gt()), J({}), at(null);
           return;
@@ -2488,22 +2489,22 @@ const Yt = ({
       J((v) => {
         const _ = (I, m) => {
           const T = [];
-          for (const S of I)
-            le(S.kind) && m[S.id] && (T.push(S.id), Object.values(m[S.id]).forEach((C) => T.push(..._(C, m))));
+          for (const C of I)
+            le(C.kind) && m[C.id] && (T.push(C.id), Object.values(m[C.id]).forEach((S) => T.push(..._(S, m))));
           return T;
         }, k = { ...v };
         for (const I of Object.keys(k))
           for (const m of Object.keys(k[I])) {
-            const T = k[I][m], S = T.findIndex((R) => R.id === y);
-            if (S === -1 || T[S].kind === "end") continue;
-            const C = T[S];
-            let L = T.filter((R) => R.id !== y);
-            return C.kind === "filter" && ((C.id in k ? _([C], k) : []).forEach((B) => delete k[B]), delete k[C.id], L.some((B) => B.kind === "end") || (L = [...L, { id: `end-${I}-${m}`, kind: "end", reactFlowType: "endNode" }])), k[I] = { ...k[I], [m]: L }, k;
+            const T = k[I][m], C = T.findIndex((A) => A.id === y);
+            if (C === -1 || T[C].kind === "end") continue;
+            const S = T[C];
+            let R = T.filter((A) => A.id !== y);
+            return S.kind === "filter" && ((S.id in k ? _([S], k) : []).forEach((B) => delete k[B]), delete k[S.id], R.some((B) => B.kind === "end") || (R = [...R, { id: `end-${I}-${m}`, kind: "end", reactFlowType: "endNode" }])), k[I] = { ...k[I], [m]: R }, k;
           }
         return k;
       });
     }
-  }, [s, A]), Re = Y(() => {
+  }, [s, L]), Re = Y(() => {
     s || H("triggerSelect");
   }, [s]), ht = Y((y, v) => {
     s || ft || (xe(y), st(v.filterId && v.branch ? { filterId: v.filterId, branch: v.branch } : null), H("nodePicker"));
@@ -2550,19 +2551,19 @@ const Yt = ({
     };
     if (!V) return y;
     if (ie) {
-      const { filterId: k, branch: I } = ie, m = A.findIndex((R) => R.id === k), T = m >= 0 ? A.slice(0, m + 1) : [], S = ((_ = $[k]) == null ? void 0 : _[I]) ?? [], C = S.findIndex((R) => R.id === V), L = C >= 0 ? S.slice(0, C + 1) : [];
-      return y.upstreamSlots = [...T, ...L], y.downstreamSlots = C >= 0 ? S.slice(C + 1) : S, y.insertAfterSlot = L[L.length - 1] ?? null, y;
+      const { filterId: k, branch: I } = ie, m = L.findIndex((A) => A.id === k), T = m >= 0 ? L.slice(0, m + 1) : [], C = ((_ = $[k]) == null ? void 0 : _[I]) ?? [], S = C.findIndex((A) => A.id === V), R = S >= 0 ? C.slice(0, S + 1) : [];
+      return y.upstreamSlots = [...T, ...R], y.downstreamSlots = S >= 0 ? C.slice(S + 1) : C, y.insertAfterSlot = R[R.length - 1] ?? null, y;
     }
-    const v = A.findIndex((k) => k.id === V);
-    return y.upstreamSlots = v >= 0 ? A.slice(0, v + 1) : [], y.downstreamSlots = v >= 0 ? A.slice(v + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
-  }, [A, $, V, ie, q]), bt = (y, v) => y.descriptorType === v || y.id === v || y.kind === v, yt = Y(() => {
+    const v = L.findIndex((k) => k.id === V);
+    return y.upstreamSlots = v >= 0 ? L.slice(0, v + 1) : [], y.downstreamSlots = v >= 0 ? L.slice(v + 1) : [], y.insertAfterSlot = y.upstreamSlots[y.upstreamSlots.length - 1] ?? null, y;
+  }, [L, $, V, ie, q]), bt = (y, v) => y.descriptorType === v || y.id === v || y.kind === v, yt = Y(() => {
     const y = e.list(), v = q != null && q.availableTasks ? y.filter((k) => q.availableTasks.includes(k.type)) : y, _ = pt();
-    return v.filter((k) => k.maxPerWorkflow !== void 0 && A.filter((m) => m.descriptorType === k.type).length + Object.values($).flatMap((m) => Object.values(m).flat()).filter((m) => m.descriptorType === k.type).length >= k.maxPerWorkflow ? !1 : k.canInsert ? k.canInsert(_) : !(k.insertAfter && k.insertAfter.length > 0 && !_.upstreamSlots.some(
+    return v.filter((k) => k.maxPerWorkflow !== void 0 && L.filter((m) => m.descriptorType === k.type).length + Object.values($).flatMap((m) => Object.values(m).flat()).filter((m) => m.descriptorType === k.type).length >= k.maxPerWorkflow ? !1 : k.canInsert ? k.canInsert(_) : !(k.insertAfter && k.insertAfter.length > 0 && !_.upstreamSlots.some(
       (m) => k.insertAfter.some((T) => bt(m, T))
     ) || k.insertBefore && k.insertBefore.length > 0 && !_.downstreamSlots.some(
       (m) => k.insertBefore.some((T) => bt(m, T))
     )));
-  }, [e, q, A, $, pt]), mt = Y((y) => {
+  }, [e, q, L, $, pt]), mt = Y((y) => {
     if (!V) return;
     const v = `${y.type}-${Date.now()}`, _ = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", k = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, I = {
       id: v,
@@ -2576,32 +2577,32 @@ const Yt = ({
     };
     if (ie) {
       const { filterId: m, branch: T } = ie;
-      J((S) => {
-        const C = [...S[m][T]];
+      J((C) => {
+        const S = [...C[m][T]];
         if (_) {
-          const ne = C.filter((ce) => ce.kind !== "end"), xt = ne.findIndex((ce) => ce.id === V), An = xt === -1 ? ne.length : xt + 1;
-          return ne.splice(An, 0, I), {
-            ...S,
-            [m]: { ...S[m], [T]: ne },
+          const ne = S.filter((ce) => ce.kind !== "end"), xt = ne.findIndex((ce) => ce.id === V), Rn = xt === -1 ? ne.length : xt + 1;
+          return ne.splice(Rn, 0, I), {
+            ...C,
+            [m]: { ...C[m], [T]: ne },
             [v]: Object.fromEntries(
               Object.keys(k).map((ce) => [ce, [{ id: `end-${v}-${ce}`, kind: "end", reactFlowType: "endNode" }]])
             )
           };
         }
-        const L = C.findIndex((ne) => ne.id === V), R = C.findIndex((ne) => ne.kind === "end"), B = L === -1 ? R === -1 ? C.length : R : L + 1;
-        return C.splice(B, 0, I), { ...S, [m]: { ...S[m], [T]: C } };
+        const R = S.findIndex((ne) => ne.id === V), A = S.findIndex((ne) => ne.kind === "end"), B = R === -1 ? A === -1 ? S.length : A : R + 1;
+        return S.splice(B, 0, I), { ...C, [m]: { ...C[m], [T]: S } };
       });
     } else
       _ ? (oe((m) => {
-        const T = m.findIndex((C) => C.id === V);
-        return [...m.filter((C) => C.kind !== "end").slice(0, T + 1), I];
+        const T = m.findIndex((S) => S.id === V);
+        return [...m.filter((S) => S.kind !== "end").slice(0, T + 1), I];
       }), J((m) => ({
         ...m,
         [v]: Object.fromEntries(
           Object.keys(k).map((T) => [T, [{ id: `end-${v}-${T}`, kind: "end", reactFlowType: "endNode" }]])
         )
       }))) : oe((m) => {
-        const T = m.findIndex((S) => S.id === V);
+        const T = m.findIndex((C) => C.id === V);
         return T === -1 ? m : [...m.slice(0, T + 1), I, ...m.slice(T + 1)];
       });
     xe(null), st(null), it(v), H("nodeConfig");
@@ -2621,42 +2622,43 @@ const Yt = ({
     }, k = (m) => {
       const T = se(y);
       if ((T == null ? void 0 : T.descriptorType) !== "conditionBranch") return m;
-      const C = (v.branchConfigs ?? []).map((B) => B.key).filter(Boolean);
-      if (C.length === 0) return m;
-      const L = m[y] ?? {}, R = {};
-      return C.forEach((B) => {
-        R[B] = L[B] ?? [{ id: `end-${y}-${B}`, kind: "end", reactFlowType: "endNode" }];
-      }), { ...m, [y]: R };
+      const S = (v.branchConfigs ?? []).map((B) => B.key).filter(Boolean);
+      if (S.length === 0) return m;
+      const R = m[y] ?? {}, A = {};
+      return S.forEach((B) => {
+        A[B] = R[B] ?? [{ id: `end-${y}-${B}`, kind: "end", reactFlowType: "endNode" }];
+      }), { ...m, [y]: A };
     }, I = (m, T) => {
       if (m.descriptorType !== "conditionBranch") return { ...m, formData: T };
-      const S = T.branchConfigs ?? [], C = {};
-      return S.forEach((L) => {
-        L.key && (C[L.key] = _(L));
-      }), { ...m, formData: T, branchLabels: C };
+      const C = T.branchConfigs ?? [], S = {};
+      return C.forEach((R) => {
+        R.key && (S[R.key] = _(R));
+      }), { ...m, formData: T, branchLabels: S };
     };
-    if (A.some((m) => m.id === y)) {
+    if (L.some((m) => m.id === y)) {
       J((m) => {
         const T = k(m);
-        return oe((S) => {
-          const C = S.map((L) => L.id === y ? I(L, v) : L);
-          return i == null || i({ slots: C, branches: T }), C;
-        }), T;
+        return oe(
+          (C) => C.map(
+            (S) => S.id === y ? I(S, v) : S
+          )
+        ), T;
       });
       return;
     }
     J((m) => {
-      const S = { ...k(m) };
-      for (const C of Object.keys(S)) {
-        const L = (R) => R.map((B) => B.id === y ? I(B, v) : B);
-        for (const R of Object.keys(S[C]))
-          if (S[C][R].some((B) => B.id === y))
-            return S[C] = { ...S[C], [R]: L(S[C][R]) }, i == null || i({ slots: A, branches: S }), S;
+      const C = { ...k(m) };
+      for (const S of Object.keys(C)) {
+        const R = (A) => A.map((B) => B.id === y ? I(B, v) : B);
+        for (const A of Object.keys(C[S]))
+          if (C[S][A].some((B) => B.id === y))
+            return C[S] = { ...C[S], [A]: R(C[S][A]) }, C;
       }
-      return S;
+      return C;
     });
-  }, [A, $, se, i]), Z = K(() => se(Le ?? ""), [se, Le]), vt = K(() => Z != null && Z.descriptorType ? e.forType(Z.descriptorType) ?? null : null, [Z, e]), { nodes: Et, edges: zn } = K(
-    () => is(A, $, s ? null : ht, dt, l, b, rt),
-    [A, $, s, ht, dt, l, b, rt]
+  }, [L, $, se]), Z = K(() => se(Le ?? ""), [se, Le]), vt = K(() => Z != null && Z.descriptorType ? e.forType(Z.descriptorType) ?? null : null, [Z, e]), { nodes: Et, edges: Fn } = K(
+    () => ls(L, $, s ? null : ht, dt, l, b, rt),
+    [L, $, s, ht, dt, l, b, rt]
   ), kt = K(() => {
     const y = x ? new Map(x.steps.map((v) => [v.nodeId, v])) : null;
     return Et.map((v) => {
@@ -2671,11 +2673,11 @@ const Yt = ({
         lt({ workflowId: k, workflowLabel: ((m = I == null ? void 0 : I.formData) == null ? void 0 : m.workflowLabel) ?? void 0 });
       }), Object.keys(_).length > 0 ? { ...v, data: { ...v.data, ..._ } } : v;
     });
-  }, [Et, x, N, se]), Fn = K(() => ({ onEditNode: Ae, onDeleteNode: ut, onAddStep: () => {
-  }, onClickAddTrigger: Re, messages: ge, nodeRegistry: e, nodeBody: ot }), [Ae, ut, Re, ge, e, ot]), Ln = Y(async () => {
-    i && await i({ slots: A, branches: $ });
-  }, [i, A, $]);
-  return /* @__PURE__ */ u(qn.Provider, { value: Fn, children: /* @__PURE__ */ w(
+  }, [Et, x, N, se]), Ln = K(() => ({ onEditNode: Ae, onDeleteNode: ut, onAddStep: () => {
+  }, onClickAddTrigger: Re, messages: ge, nodeRegistry: e, nodeBody: ot }), [Ae, ut, Re, ge, e, ot]), An = Y(async () => {
+    i && await i({ slots: L, branches: $ });
+  }, [i, L, $]);
+  return /* @__PURE__ */ u(vr, { resolvers: ve, children: /* @__PURE__ */ u(Xn.Provider, { value: Ln, children: /* @__PURE__ */ w(
     "div",
     {
       className: "flowforge-canvas",
@@ -2698,35 +2700,35 @@ const Yt = ({
       },
       children: [
         !O && (i || W || M) && /* @__PURE__ */ u(
-          qi,
+          Ji,
           {
             workflowName: M,
             onWorkflowNameChange: z,
             status: F,
             statusColor: D,
-            onSave: i ? Ln : void 0,
+            onSave: i ? An : void 0,
             onCancel: W,
             saveLabel: G
           }
         ),
         /* @__PURE__ */ w("div", { style: { flex: 1, minHeight: 0, position: "relative" }, children: [
           /* @__PURE__ */ w(
-            Rn,
+            Dn,
             {
               nodes: kt,
-              edges: zn,
-              nodeTypes: On,
-              edgeTypes: jn,
-              fitView: ve,
-              fitViewOptions: { padding: Ee },
+              edges: Fn,
+              nodeTypes: jn,
+              edgeTypes: Mn,
+              fitView: Ee,
+              fitViewOptions: { padding: te },
               nodesDraggable: !1,
               nodesConnectable: !1,
-              panOnScroll: ke,
-              zoomOnScroll: ze,
-              minZoom: Fe,
-              maxZoom: _n,
-              snapToGrid: Nn,
-              snapGrid: Sn,
+              panOnScroll: ze,
+              zoomOnScroll: Fe,
+              minZoom: _n,
+              maxZoom: Nn,
+              snapToGrid: Sn,
+              snapGrid: Cn,
               proOptions: { hideAttribution: !0 },
               onNodeClick: (y, v) => {
                 const _ = se(v.id);
@@ -2734,28 +2736,28 @@ const Yt = ({
               },
               children: [
                 l.background !== "none" && /* @__PURE__ */ u(
-                  Bn,
+                  Wn,
                   {
                     variant: l.background,
                     color: l.backgroundColor ?? "#e0e0e0",
                     gap: 20
                   }
                 ),
-                te && /* @__PURE__ */ u(Wn, { showInteractive: !1 }),
-                he && /* @__PURE__ */ u(Gn, { zoomable: !0, pannable: !0 }),
-                /* @__PURE__ */ u(Hi, { onHeightsReady: In, nodeCount: kt.length })
+                he && /* @__PURE__ */ u(Gn, { showInteractive: !1 }),
+                ke && /* @__PURE__ */ u($n, { zoomable: !0, pannable: !0 }),
+                /* @__PURE__ */ u(qi, { onHeightsReady: On, nodeCount: kt.length })
               ]
             }
           ),
-          c ? de === "triggerSelect" && c(t.list(), gt, () => H(null)) : /* @__PURE__ */ u(Xi, { open: de === "triggerSelect", templates: t.list(), messages: ge, onSelect: gt, onClose: () => H(null), loadTriggerSources: f }),
+          c ? de === "triggerSelect" && c(t.list(), gt, () => H(null)) : /* @__PURE__ */ u(Zi, { open: de === "triggerSelect", templates: t.list(), messages: ge, onSelect: gt, onClose: () => H(null), loadTriggerSources: f }),
           h ? de === "nodePicker" && h(yt(), mt, () => {
             H(null), xe(null);
-          }) : /* @__PURE__ */ u(Ji, { open: de === "nodePicker", availableDescriptors: yt(), messages: ge, onSelect: mt, onClose: () => {
+          }) : /* @__PURE__ */ u(Qi, { open: de === "nodePicker", availableDescriptors: yt(), messages: ge, onSelect: mt, onClose: () => {
             H(null), xe(null);
           } }),
-          g ? de === "nodeConfig" && g(vt ?? void 0, Z, wt, () => H(null)) : /* @__PURE__ */ u(Zi, { open: de === "nodeConfig", nodeId: Le, descriptor: vt, initialValues: Z == null ? void 0 : Z.formData, messages: ge, onSave: wt, onClose: () => H(null) }),
+          g ? de === "nodeConfig" && g(vt ?? void 0, Z, wt, () => H(null)) : /* @__PURE__ */ u(es, { open: de === "nodeConfig", nodeId: Le, descriptor: vt, initialValues: Z == null ? void 0 : Z.formData, messages: ge, onSave: wt, onClose: () => H(null) }),
           N && Te && /* @__PURE__ */ u(
-            Qi,
+            ts,
             {
               isOpen: !!Te,
               onClose: () => lt(null),
@@ -2767,15 +2769,15 @@ const Yt = ({
         ] })
       ]
     }
-  ) });
-}, ss = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  ) }) });
+}, as = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   WorkflowCanvas: Yt,
   default: Yt
 }, Symbol.toStringTag, { value: "Module" })), Ue = "All";
-function ls({ template: e, onSelect: t }) {
+function ds({ template: e, onSelect: t }) {
   var o, i;
-  const n = e.triggerCategory ? vr[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
+  const n = e.triggerCategory ? kr[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((s) => s.kind === "userTask").length) ?? 0;
   return /* @__PURE__ */ w(
     "div",
     {
@@ -2828,7 +2830,7 @@ function ls({ template: e, onSelect: t }) {
     }
   );
 }
-const Ts = ({
+const Ns = ({
   templates: e,
   onSelectTemplate: t,
   onStartFromScratch: n
@@ -2864,14 +2866,14 @@ const Ts = ({
             onClick: n,
             style: { display: "flex", alignItems: "center", gap: 6, padding: "8px 16px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 13, fontWeight: 600, cursor: "pointer" },
             children: [
-              /* @__PURE__ */ u(lr, { size: 16 }),
+              /* @__PURE__ */ u(ar, { size: 16 }),
               "Start from Scratch"
             ]
           }
         )
       ] }),
       /* @__PURE__ */ w("div", { style: { display: "flex", alignItems: "center", gap: 8, background: "#f5f5f5", borderRadius: 8, padding: "8px 12px", marginBottom: 12 }, children: [
-        /* @__PURE__ */ u(ar, { size: 18, color: "#9e9e9e" }),
+        /* @__PURE__ */ u(dr, { size: 18, color: "#9e9e9e" }),
         /* @__PURE__ */ u(
           "input",
           {
@@ -2903,17 +2905,17 @@ const Ts = ({
       )) })
     ] }),
     /* @__PURE__ */ u("div", { style: { flex: 1, overflowY: "auto", padding: 24 }, children: d.length === 0 ? /* @__PURE__ */ w("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" }, children: [
-      /* @__PURE__ */ u(dr, { size: 36, style: { marginBottom: 8 } }),
+      /* @__PURE__ */ u(cr, { size: 36, style: { marginBottom: 8 } }),
       /* @__PURE__ */ u("p", { style: { margin: 0, fontSize: 14 }, children: "No templates found" })
-    ] }) : /* @__PURE__ */ u("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ u(ls, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
+    ] }) : /* @__PURE__ */ u("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 }, children: d.map((a) => /* @__PURE__ */ u(ds, { template: a, onSelect: () => t(a) }, a.triggerKey)) }) })
   ] });
 }, _e = {
   running: { label: "Running", color: ee.running, icon: P.createElement(Xt, { size: 14 }) },
   success: { label: "Success", color: ee.success, icon: P.createElement(qt, { size: 14 }) },
   failed: { label: "Failed", color: ee.failed, icon: P.createElement(Vt, { size: 14 }) },
   cancelled: { label: "Cancelled", color: ee.cancelled, icon: P.createElement(Ht, { size: 14 }) }
-}, as = {
-  pending: { color: ee.pending, icon: P.createElement(cr, { size: 14 }) },
+}, cs = {
+  pending: { color: ee.pending, icon: P.createElement(fr, { size: 14 }) },
   running: { color: ee.running, icon: P.createElement(Xt, { size: 14 }) },
   success: { color: ee.success, icon: P.createElement(qt, { size: 14 }) },
   failed: { color: ee.failed, icon: P.createElement(Vt, { size: 14 }) },
@@ -2934,8 +2936,8 @@ function Tn(e, t) {
     return "—";
   }
 }
-function ds({ step: e }) {
-  const [t, n] = j(!1), r = as[e.status], o = !!(e.inputs || e.outputs || e.error);
+function fs({ step: e }) {
+  const [t, n] = j(!1), r = cs[e.status], o = !!(e.inputs || e.outputs || e.error);
   return /* @__PURE__ */ w("div", { style: { borderBottom: "1px solid #f5f5f5" }, children: [
     /* @__PURE__ */ w(
       "div",
@@ -2954,7 +2956,7 @@ function ds({ step: e }) {
           /* @__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 ? Tn(e.startedAt, e.completedAt) : "—" }),
-          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? P.createElement(ur, { size: 16 }) : P.createElement(hr, { size: 16 }) })
+          o && /* @__PURE__ */ u("span", { style: { color: "#9e9e9e", flexShrink: 0 }, children: t ? P.createElement(hr, { size: 16 }) : P.createElement(gr, { size: 16 }) })
         ]
       }
     ),
@@ -2971,7 +2973,7 @@ function ds({ step: e }) {
     ] })
   ] });
 }
-function cs({ record: e, selected: t, onSelect: n }) {
+function us({ record: e, selected: t, onSelect: n }) {
   const r = _e[e.status];
   return /* @__PURE__ */ w(
     "div",
@@ -3010,7 +3012,7 @@ function cs({ record: e, selected: t, onSelect: n }) {
     }
   );
 }
-const _s = ({ records: e, onViewOnCanvas: t }) => {
+const Ss = ({ 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());
   return e.length === 0 ? /* @__PURE__ */ w("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 }, children: [
@@ -3024,7 +3026,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
         e.length,
         ")"
       ] }),
-      i.map((l) => /* @__PURE__ */ u(cs, { record: l, selected: l.id === n, onSelect: () => r(l.id) }, l.id))
+      i.map((l) => /* @__PURE__ */ u(us, { record: l, selected: l.id === n, onSelect: () => r(l.id) }, l.id))
     ] }),
     /* @__PURE__ */ u("div", { style: { flex: 1, overflowY: "auto" }, children: o ? /* @__PURE__ */ w("div", { children: [
       /* @__PURE__ */ w("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 }, children: [
@@ -3041,7 +3043,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
               o.completedAt && ` → ${Je(o.completedAt)} (${Tn(o.triggeredAt, o.completedAt)})`
             ] }),
             o.triggeredBy && /* @__PURE__ */ w("span", { style: { display: "flex", alignItems: "center", gap: 4 }, children: [
-              /* @__PURE__ */ u(fr, { size: 13 }),
+              /* @__PURE__ */ u(ur, { size: 13 }),
               " ",
               o.triggeredBy
             ] })
@@ -3063,7 +3065,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
           o.steps.length,
           ")"
         ] }),
-        o.steps.map((l, d) => /* @__PURE__ */ u(ds, { step: l }, `${l.nodeId}-${d}`))
+        o.steps.map((l, d) => /* @__PURE__ */ u(fs, { step: l }, `${l.nodeId}-${d}`))
       ] }),
       o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ u("div", { style: { padding: "10px 16px" }, children: /* @__PURE__ */ w("details", { children: [
         /* @__PURE__ */ u("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 }, children: "TRIGGER INPUTS" }),
@@ -3071,7 +3073,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
       ] }) })
     ] }) : /* @__PURE__ */ u("div", { style: { display: "flex", alignItems: "center", justifyContent: "center", height: "100%", color: "#9e9e9e", fontSize: 14 }, children: "Select a run to see details" }) })
   ] });
-}, Ns = {
+}, Cs = {
   slots: [
     { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
     { id: "trigger-END_USER_CREATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "New User Registration", nodeData: { label: "New User Registration" } },
@@ -3085,7 +3087,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
       fail: [{ id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Rejection Notice", nodeData: { title: "Rejection Notice" } }]
     }
   }
-}, Ss = {
+}, Is = {
   slots: [
     { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
     { id: "trigger-ACCESS_REQUEST", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "Access Request Submitted", nodeData: { label: "Access Request Submitted" } },
@@ -3103,7 +3105,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
       ]
     }
   }
-}, Cs = {
+}, Os = {
   slots: [
     { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
     { id: "trigger-USER_DEACTIVATION", kind: "triggerFixed", reactFlowType: "triggerNode", deletable: !0, label: "User Deactivation", nodeData: { label: "User Deactivation" } },
@@ -3112,7 +3114,7 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
     { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
   ],
   branches: {}
-}, Is = {
+}, js = {
   slots: [
     { id: "start", kind: "start", reactFlowType: "startNode", deletable: !1 },
     { id: "trigger-WEBHOOK_TRIGGER", kind: "triggerFixed", reactFlowType: "webhookTriggerNode", deletable: !0, label: "Incoming Webhook", nodeData: { label: "Incoming Webhook" } },
@@ -3124,13 +3126,13 @@ const _s = ({ records: e, onViewOnCanvas: t }) => {
 };
 export {
   Yt as F,
-  Qi as S,
-  _s as W,
-  qi as a,
-  Ts as b,
-  Ss as c,
-  Cs as o,
-  Ns as u,
-  Is as w
+  ts as S,
+  Ss as W,
+  Ji as a,
+  Ns as b,
+  Is as c,
+  Os as o,
+  Cs as u,
+  js as w
 };
-//# sourceMappingURL=templateSkeletons-CFMb6KIK.js.map
+//# sourceMappingURL=templateSkeletons-CHrd4Z5h.js.map