@notmrabhi/flowforge 0.1.0

package/dist/templateSkeletons-D60ixh5T.js

@@ -0,0 +1,2617 @@
+import c, { useRef as ht, useEffect as re, useState as M, useMemo as P, useCallback as G } from "react";
+import kn, { useStore as xn, useReactFlow as _n, Background as Tn, Controls as Nn, MiniMap as Cn } from "reactflow";
+import "reactflow/dist/style.css";
+import { e as Sn, G as In, E as On, P as Mn, L as jn, d as Fn, f as zn } from "./GatewayBranchEdge-gncIBR-0.js";
+import { Dialog as Rn, Box as Q, Drawer as Dn, Typography as Ln, IconButton as gt, Button as pt } from "@mui/material";
+import { MdClose as An, MdCalendarToday as Pn, MdBolt as Bn, MdAddCircleOutline as Wn, MdApps as Gn, MdArrowBack as $n, MdChevronRight as Rt, MdAccountTree as Yn, MdErrorOutline as Kn, MdAdd as Un, MdSearch as Vn, MdCategory as Hn, MdCancel as Dt, MdError as Lt, MdCheckCircle as At, MdPlayArrow as Pt, MdHourglassEmpty as qn, MdSchedule as mt, MdPerson as Xn, MdExpandLess as Jn, MdExpandMore as Zn } from "react-icons/md";
+import { GrTrigger as Qn } from "react-icons/gr";
+import { BiCollapse as er, BiExpand as tr } from "react-icons/bi";
+import { a as nr } from "./index-CIbEqy9U.js";
+import { m as rr } from "./messages-CO299wPN.js";
+import { T as or, E as V } from "./canvasTokens-CAD6G24b.js";
+var Bt = Object.defineProperty, ir = (e, t, n) => t in e ? Bt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, ar = (e, t) => {
+  for (var n in t) Bt(e, n, { get: t[n], enumerable: !0 });
+}, lr = (e, t, n) => ir(e, t + "", n), Wt = {};
+ar(Wt, { Graph: () => B, alg: () => Ke, json: () => $t, version: () => cr });
+var sr = Object.defineProperty, Gt = (e, t) => {
+  for (var n in t) sr(e, n, { get: t[n], enumerable: !0 });
+}, B = 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 = () => {
+    }, e && (this._isDirected = "directed" in e ? e.directed : !0, this._isMultigraph = "multigraph" in e ? e.multigraph : !1, this._isCompound = "compound" in e ? e.compound : !1), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
+  }
+  isDirected() {
+    return this._isDirected;
+  }
+  isMultigraph() {
+    return this._isMultigraph;
+  }
+  isCompound() {
+    return this._isCompound;
+  }
+  setGraph(e) {
+    return this._label = e, this;
+  }
+  graph() {
+    return this._label;
+  }
+  setDefaultNodeLabel(e) {
+    return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this;
+  }
+  nodeCount() {
+    return this._nodeCount;
+  }
+  nodes() {
+    return Object.keys(this._nodes);
+  }
+  sources() {
+    return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0);
+  }
+  sinks() {
+    return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0);
+  }
+  setNodes(e, t) {
+    return e.forEach((n) => {
+      t !== void 0 ? this.setNode(n, t) : this.setNode(n);
+    }), this;
+  }
+  setNode(e, t) {
+    return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  }
+  node(e) {
+    return this._nodes[e];
+  }
+  hasNode(e) {
+    return e in this._nodes;
+  }
+  removeNode(e) {
+    if (e in this._nodes) {
+      let t = (n) => this.removeEdge(this._edgeObjs[n]);
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((n) => {
+        this.setParent(n);
+      }), delete this._children[e]), Object.keys(this._in[e]).forEach(t), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+    }
+    return this;
+  }
+  setParent(e, t) {
+    if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
+    if (t === void 0) t = "\0";
+    else {
+      t += "";
+      for (let n = t; n !== void 0; n = this.parent(n)) if (n === e) throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
+      this.setNode(t);
+    }
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+  }
+  parent(e) {
+    if (this._isCompound) {
+      let t = this._parent[e];
+      if (t !== "\0") return t;
+    }
+  }
+  children(e = "\0") {
+    if (this._isCompound) {
+      let t = this._children[e];
+      if (t) return Object.keys(t);
+    } else {
+      if (e === "\0") return this.nodes();
+      if (this.hasNode(e)) return [];
+    }
+    return [];
+  }
+  predecessors(e) {
+    let t = this._preds[e];
+    if (t) return Object.keys(t);
+  }
+  successors(e) {
+    let t = this._sucs[e];
+    if (t) return Object.keys(t);
+  }
+  neighbors(e) {
+    let t = this.predecessors(e);
+    if (t) {
+      let n = new Set(t);
+      for (let r of this.successors(e)) n.add(r);
+      return Array.from(n.values());
+    }
+  }
+  isLeaf(e) {
+    let t;
+    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
+  }
+  filterNodes(e) {
+    let t = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound });
+    t.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => {
+      e(o) && t.setNode(o, i);
+    }), Object.values(this._edgeObjs).forEach((o) => {
+      t.hasNode(o.v) && t.hasNode(o.w) && t.setEdge(o, this.edge(o));
+    });
+    let n = {}, r = (o) => {
+      let i = this.parent(o);
+      return !i || t.hasNode(i) ? (n[o] = i ?? void 0, i ?? void 0) : i in n ? n[i] : r(i);
+    };
+    return this._isCompound && t.nodes().forEach((o) => t.setParent(o, r(o))), t;
+  }
+  setDefaultEdgeLabel(e) {
+    return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this;
+  }
+  edgeCount() {
+    return this._edgeCount;
+  }
+  edges() {
+    return Object.values(this._edgeObjs);
+  }
+  setPath(e, t) {
+    return e.reduce((n, r) => (t !== void 0 ? this.setEdge(n, r, t) : this.setEdge(n, r), r)), this;
+  }
+  setEdge(e, t, n, r) {
+    let o, i, a, l, d = !1;
+    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, a = e.name, arguments.length === 2 && (l = t, d = !0)) : (o = e, i = t, a = r, arguments.length > 2 && (l = n, d = !0)), o = "" + o, i = "" + i, a !== void 0 && (a = "" + a);
+    let s = fe(this._isDirected, o, i, a);
+    if (s in this._edgeLabels) return d && (this._edgeLabels[s] = l), this;
+    if (a !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(o), this.setNode(i), this._edgeLabels[s] = d ? l : this._defaultEdgeLabelFn(o, i, a);
+    let u = dr(this._isDirected, o, i, a);
+    return o = u.v, i = u.w, Object.freeze(u), this._edgeObjs[s] = u, bt(this._preds[i], o), bt(this._sucs[o], i), this._in[i][s] = u, this._out[o][s] = u, this._edgeCount++, this;
+  }
+  edge(e, t, n) {
+    let r = arguments.length === 1 ? Me(this._isDirected, e) : fe(this._isDirected, e, t, n);
+    return this._edgeLabels[r];
+  }
+  edgeAsObj(e, t, n) {
+    let r = arguments.length === 1 ? this.edge(e) : this.edge(e, t, n);
+    return typeof r != "object" ? { label: r } : r;
+  }
+  hasEdge(e, t, n) {
+    return (arguments.length === 1 ? Me(this._isDirected, e) : fe(this._isDirected, e, t, n)) in this._edgeLabels;
+  }
+  removeEdge(e, t, n) {
+    let r = arguments.length === 1 ? Me(this._isDirected, e) : fe(this._isDirected, e, t, n), o = this._edgeObjs[r];
+    if (o) {
+      let i = o.v, a = o.w;
+      delete this._edgeLabels[r], delete this._edgeObjs[r], yt(this._preds[a], i), yt(this._sucs[i], a), delete this._in[a][r], delete this._out[i][r], this._edgeCount--;
+    }
+    return this;
+  }
+  inEdges(e, t) {
+    return this.isDirected() ? this.filterEdges(this._in[e], e, t) : this.nodeEdges(e, t);
+  }
+  outEdges(e, t) {
+    return this.isDirected() ? this.filterEdges(this._out[e], e, t) : this.nodeEdges(e, t);
+  }
+  nodeEdges(e, t) {
+    if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, t);
+  }
+  _removeFromParentsChildList(e) {
+    delete this._children[this._parent[e]][e];
+  }
+  filterEdges(e, t, n) {
+    if (!e) return;
+    let r = Object.values(e);
+    return n ? r.filter((o) => o.v === t && o.w === n || o.v === n && o.w === t) : r;
+  }
+};
+function bt(e, t) {
+  e[t] ? e[t]++ : e[t] = 1;
+}
+function yt(e, t) {
+  e[t] !== void 0 && !--e[t] && delete e[t];
+}
+function fe(e, t, n, r) {
+  let o = "" + t, i = "" + n;
+  if (!e && o > i) {
+    let a = o;
+    o = i, i = a;
+  }
+  return o + "
" + i + "
" + (r === void 0 ? "\0" : r);
+}
+function dr(e, t, n, r) {
+  let o = "" + t, i = "" + n;
+  if (!e && o > i) {
+    let l = o;
+    o = i, i = l;
+  }
+  let a = { v: o, w: i };
+  return r && (a.name = r), a;
+}
+function Me(e, t) {
+  return fe(e, t.v, t.w, t.name);
+}
+var cr = "4.0.1", $t = {};
+Gt($t, { read: () => gr, write: () => ur });
+function ur(e) {
+  let t = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: fr(e), edges: hr(e) }, n = e.graph();
+  return n !== void 0 && (t.value = structuredClone(n)), t;
+}
+function fr(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 hr(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 gr(e) {
+  let t = new B(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 Ke = {};
+Gt(Ke, { CycleException: () => ke, bellmanFord: () => Yt, components: () => br, dijkstra: () => ve, dijkstraAll: () => wr, findCycles: () => vr, floydWarshall: () => xr, isAcyclic: () => Tr, postorder: () => Cr, preorder: () => Sr, prim: () => Ir, shortestPaths: () => Or, tarjan: () => Ut, topsort: () => Vt });
+var pr = () => 1;
+function Yt(e, t, n, r) {
+  return mr(e, String(t), n || pr, r || function(o) {
+    return e.outEdges(o);
+  });
+}
+function mr(e, t, n, r) {
+  let o = {}, i, a = 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);
+  }, s = function() {
+    l.forEach(function(f) {
+      r(f).forEach(function(h) {
+        let g = h.v === f ? h.v : h.w, m = g === h.v ? h.w : h.v;
+        d({ v: g, w: m });
+      });
+    });
+  };
+  l.forEach(function(f) {
+    let h = f === t ? 0 : Number.POSITIVE_INFINITY;
+    o[f] = { distance: h, predecessor: "" };
+  });
+  let u = l.length;
+  for (let f = 1; f < u && (i = !1, a++, s(), !!i); f++) ;
+  if (a === u - 1 && (i = !1, s(), i)) throw new Error("The graph contains a negative weight cycle");
+  return o;
+}
+function br(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));
+  }
+  return e.nodes().forEach(function(i) {
+    r = [], o(i), r.length && n.push(r);
+  }), n;
+}
+var Kt = class {
+  constructor() {
+    this._arr = [], this._keyIndices = {};
+  }
+  size() {
+    return this._arr.length;
+  }
+  keys() {
+    return this._arr.map((e) => e.key);
+  }
+  has(e) {
+    return e in this._keyIndices;
+  }
+  priority(e) {
+    let t = this._keyIndices[e];
+    if (t !== void 0) return this._arr[t].priority;
+  }
+  min() {
+    if (this.size() === 0) throw new Error("Queue underflow");
+    return this._arr[0].key;
+  }
+  add(e, t) {
+    let n = this._keyIndices, r = String(e);
+    if (!(r in n)) {
+      let o = this._arr, i = o.length;
+      return n[r] = i, o.push({ key: r, priority: t }), this._decrease(i), !0;
+    }
+    return !1;
+  }
+  removeMin() {
+    this._swap(0, this._arr.length - 1);
+    let e = this._arr.pop();
+    return delete this._keyIndices[e.key], this._heapify(0), e.key;
+  }
+  decrease(e, t) {
+    let n = this._keyIndices[e];
+    if (n === void 0) throw new Error(`Key not found: ${e}`);
+    let r = this._arr[n].priority;
+    if (t > r) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${r} New: ${t}`);
+    this._arr[n].priority = t, this._decrease(n);
+  }
+  _heapify(e) {
+    let t = this._arr, n = 2 * e, r = n + 1, o = e;
+    n < t.length && (o = t[n].priority < t[o].priority ? n : o, r < t.length && (o = t[r].priority < t[o].priority ? r : o), o !== e && (this._swap(e, o), this._heapify(o)));
+  }
+  _decrease(e) {
+    let t = this._arr, n = t[e].priority, r;
+    for (; e !== 0 && (r = e >> 1, !(t[r].priority < n)); ) this._swap(e, r), e = r;
+  }
+  _swap(e, t) {
+    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;
+  }
+}, yr = () => 1;
+function ve(e, t, n, r) {
+  let o = function(i) {
+    return e.outEdges(i);
+  };
+  return Er(e, String(t), n || yr, r || o);
+}
+function Er(e, t, n, r) {
+  let o = {}, i = new Kt(), a, l, d = function(s) {
+    let u = s.v !== a ? s.v : s.w, f = o[u], h = n(s), g = l.distance + h;
+    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + s + " Weight: " + h);
+    g < f.distance && (f.distance = g, f.predecessor = a, i.decrease(u, g));
+  };
+  for (e.nodes().forEach(function(s) {
+    let u = s === t ? 0 : Number.POSITIVE_INFINITY;
+    o[s] = { distance: u, predecessor: "" }, i.add(s, u);
+  }); i.size() > 0 && (a = i.removeMin(), l = o[a], l.distance !== Number.POSITIVE_INFINITY); ) r(a).forEach(d);
+  return o;
+}
+function wr(e, t, n) {
+  return e.nodes().reduce(function(r, o) {
+    return r[o] = ve(e, o, t, n), r;
+  }, {});
+}
+function Ut(e) {
+  let t = 0, n = [], r = {}, o = [];
+  function i(a) {
+    let l = r[a] = { onStack: !0, lowlink: t, index: t++ };
+    if (n.push(a), e.successors(a).forEach(function(d) {
+      d in r ? r[d].onStack && (l.lowlink = Math.min(l.lowlink, r[d].index)) : (i(d), l.lowlink = Math.min(l.lowlink, r[d].lowlink));
+    }), l.lowlink === l.index) {
+      let d = [], s;
+      do
+        s = n.pop(), r[s].onStack = !1, d.push(s);
+      while (a !== s);
+      o.push(d);
+    }
+  }
+  return e.nodes().forEach(function(a) {
+    a in r || i(a);
+  }), o;
+}
+function vr(e) {
+  return Ut(e).filter(function(t) {
+    return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
+  });
+}
+var kr = () => 1;
+function xr(e, t, n) {
+  return _r(e, t || kr, n || function(r) {
+    return e.outEdges(r);
+  });
+}
+function _r(e, t, n) {
+  let r = {}, o = e.nodes();
+  return o.forEach(function(i) {
+    r[i] = {}, r[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(a) {
+      i !== a && (r[i][a] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
+    }), n(i).forEach(function(a) {
+      let l = a.v === i ? a.w : a.v, d = t(a);
+      r[i][l] = { distance: d, predecessor: i };
+    });
+  }), o.forEach(function(i) {
+    let a = r[i];
+    o.forEach(function(l) {
+      let d = r[l];
+      o.forEach(function(s) {
+        let u = d[i], f = a[s], h = d[s], g = u.distance + f.distance;
+        g < h.distance && (h.distance = g, h.predecessor = f.predecessor);
+      });
+    });
+  }), r;
+}
+var ke = class extends Error {
+  constructor(...e) {
+    super(...e);
+  }
+};
+function Vt(e) {
+  let t = {}, n = {}, r = [];
+  function o(i) {
+    if (i in n) throw new ke();
+    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 ke();
+  return r;
+}
+function Tr(e) {
+  try {
+    Vt(e);
+  } catch (t) {
+    if (t instanceof ke) return !1;
+    throw t;
+  }
+  return !0;
+}
+function Nr(e, t, n, r, o) {
+  Array.isArray(t) || (t = [t]);
+  let i = (l) => {
+    var d;
+    return (d = e.isDirected() ? e.successors(l) : e.neighbors(l)) != null ? d : [];
+  }, a = {};
+  return t.forEach(function(l) {
+    if (!e.hasNode(l)) throw new Error("Graph does not have node: " + l);
+    o = Ht(e, l, n === "post", a, i, r, o);
+  }), o;
+}
+function Ht(e, t, n, r, o, i, a) {
+  return t in r || (r[t] = !0, n || (a = i(a, t)), o(t).forEach(function(l) {
+    a = Ht(e, l, n, r, o, i, a);
+  }), n && (a = i(a, t))), a;
+}
+function qt(e, t, n) {
+  return Nr(e, t, n, function(r, o) {
+    return r.push(o), r;
+  }, []);
+}
+function Cr(e, t) {
+  return qt(e, t, "post");
+}
+function Sr(e, t) {
+  return qt(e, t, "pre");
+}
+function Ir(e, t) {
+  let n = new B(), r = {}, o = new Kt(), i;
+  function a(d) {
+    let s = d.v === i ? d.w : d.v, u = o.priority(s);
+    if (u !== void 0) {
+      let f = t(d);
+      f < u && (r[s] = i, o.decrease(s, f));
+    }
+  }
+  if (e.nodeCount() === 0) return n;
+  e.nodes().forEach(function(d) {
+    o.add(d, Number.POSITIVE_INFINITY), n.setNode(d);
+  }), o.decrease(e.nodes()[0], 0);
+  let l = !1;
+  for (; o.size() > 0; ) {
+    if (i = o.removeMin(), i in r) n.setEdge(i, r[i]);
+    else {
+      if (l) throw new Error("Input graph is not connected: " + e);
+      l = !0;
+    }
+    e.nodeEdges(i).forEach(a);
+  }
+  return n;
+}
+function Or(e, t, n, r) {
+  return Mr(e, t, n, r ?? ((o) => {
+    let i = e.outEdges(o);
+    return i ?? [];
+  }));
+}
+function Mr(e, t, n, r) {
+  if (n === void 0) return ve(e, t, n, r);
+  let o = !1, i = e.nodes();
+  for (let a = 0; a < i.length; a++) {
+    let l = r(i[a]);
+    for (let d = 0; d < l.length; d++) {
+      let s = l[d], u = s.v === i[a] ? s.v : s.w, f = u === s.v ? s.w : s.v;
+      n({ v: u, w: f }) < 0 && (o = !0);
+    }
+    if (o) return Yt(e, t, n, r);
+  }
+  return ve(e, t, n, r);
+}
+function ce(e, t, n, r) {
+  let o = r;
+  for (; e.hasNode(o); ) o = Ue(r);
+  return n.dummy = t, e.setNode(o, n), o;
+}
+function jr(e) {
+  let t = new B().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 Xt(e) {
+  let t = new B({ 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 Et(e, t) {
+  let n = e.x, r = e.y, o = t.x - n, i = t.y - r, a = e.width / 2, l = e.height / 2;
+  if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
+  let d, s;
+  return Math.abs(i) * a > Math.abs(o) * l ? (i < 0 && (l = -l), d = l * o / i, s = l) : (o < 0 && (a = -a), d = a, s = a * i / o), { x: n + d, y: r + s };
+}
+function pe(e) {
+  let t = he(Zt(e) + 1).map(() => []);
+  return e.nodes().forEach((n) => {
+    let r = e.node(n), o = r.rank;
+    o !== void 0 && (t[o] || (t[o] = []), t[o][r.order] = n);
+  }), t;
+}
+function Fr(e) {
+  let t = e.nodes().map((r) => {
+    let o = e.node(r).rank;
+    return o === void 0 ? Number.MAX_VALUE : o;
+  }), n = $(Math.min, t);
+  e.nodes().forEach((r) => {
+    let o = e.node(r);
+    Object.hasOwn(o, "rank") && (o.rank -= n);
+  });
+}
+function zr(e) {
+  let t = e.nodes().map((a) => e.node(a).rank).filter((a) => a !== void 0), n = $(Math.min, t), r = [];
+  e.nodes().forEach((a) => {
+    let l = e.node(a).rank - n;
+    r[l] || (r[l] = []), r[l].push(a);
+  });
+  let o = 0, i = e.graph().nodeRankFactor;
+  Array.from(r).forEach((a, l) => {
+    a === void 0 && l % i !== 0 ? --o : a !== void 0 && o && a.forEach((d) => e.node(d).rank += o);
+  });
+}
+function wt(e, t, n, r) {
+  let o = { width: 0, height: 0 };
+  return arguments.length >= 4 && (o.rank = n, o.order = r), ce(e, "border", o, t);
+}
+function Rr(e, t = Jt) {
+  let n = [];
+  for (let r = 0; r < e.length; r += t) {
+    let o = e.slice(r, r + t);
+    n.push(o);
+  }
+  return n;
+}
+var Jt = 65535;
+function $(e, t) {
+  if (t.length > Jt) {
+    let n = Rr(t);
+    return e(...n.map((r) => e(...r)));
+  } else return e(...t);
+}
+function Zt(e) {
+  let t = e.nodes().map((n) => {
+    let r = e.node(n).rank;
+    return r === void 0 ? Number.MIN_VALUE : r;
+  });
+  return $(Math.max, t);
+}
+function Dr(e, t) {
+  let n = { lhs: [], rhs: [] };
+  return e.forEach((r) => {
+    t(r) ? n.lhs.push(r) : n.rhs.push(r);
+  }), n;
+}
+function Qt(e, t) {
+  let n = Date.now();
+  try {
+    return t();
+  } finally {
+    console.log(e + " time: " + (Date.now() - n) + "ms");
+  }
+}
+function en(e, t) {
+  return t();
+}
+var Lr = 0;
+function Ue(e) {
+  let t = ++Lr;
+  return e + ("" + t);
+}
+function he(e, t, n = 1) {
+  t == null && (t = e, e = 0);
+  let r = (i) => i < t;
+  n < 0 && (r = (i) => t < i);
+  let o = [];
+  for (let i = e; r(i); i += n) o.push(i);
+  return o;
+}
+function xe(e, t) {
+  let n = {};
+  for (let r of t) e[r] !== void 0 && (n[r] = e[r]);
+  return n;
+}
+function _e(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 Ar(e, t) {
+  return e.reduce((n, r, o) => (n[r] = t[o], n), {});
+}
+var Te = "\0", Pr = "3.0.0", Br = class {
+  constructor() {
+    lr(this, "_sentinel");
+    let e = {};
+    e._next = e._prev = e, this._sentinel = e;
+  }
+  dequeue() {
+    let e = this._sentinel, t = e._prev;
+    if (t !== e) return vt(t), t;
+  }
+  enqueue(e) {
+    let t = this._sentinel;
+    e._prev && e._next && vt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+  }
+  toString() {
+    let e = [], t = this._sentinel, n = t._prev;
+    for (; n !== t; ) e.push(JSON.stringify(n, Wr)), n = n._prev;
+    return "[" + e.join(", ") + "]";
+  }
+};
+function vt(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function Wr(e, t) {
+  if (e !== "_next" && e !== "_prev") return t;
+}
+var Gr = Br, $r = () => 1;
+function Yr(e, t) {
+  if (e.nodeCount() <= 1) return [];
+  let n = Ur(e, t || $r);
+  return Kr(n.graph, n.buckets, n.zeroIdx).flatMap((r) => e.outEdges(r.v, r.w) || []);
+}
+function Kr(e, t, n) {
+  var r;
+  let o = [], i = t[t.length - 1], a = t[0], l;
+  for (; e.nodeCount(); ) {
+    for (; l = a.dequeue(); ) je(e, t, n, l);
+    for (; l = i.dequeue(); ) je(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(je(e, t, n, l, !0) || []);
+        break;
+      }
+    }
+  }
+  return o;
+}
+function je(e, t, n, r, o) {
+  let i = [], a = o ? i : void 0;
+  return (e.inEdges(r.v) || []).forEach((l) => {
+    let d = e.edge(l), s = e.node(l.v);
+    o && i.push({ v: l.v, w: l.w }), s.out -= d, Be(t, n, s);
+  }), (e.outEdges(r.v) || []).forEach((l) => {
+    let d = e.edge(l), s = l.w, u = e.node(s);
+    u.in -= d, Be(t, n, u);
+  }), e.removeNode(r.v), a;
+}
+function Ur(e, t) {
+  let n = new B(), r = 0, o = 0;
+  e.nodes().forEach((l) => {
+    n.setNode(l, { v: l, in: 0, out: 0 });
+  }), e.edges().forEach((l) => {
+    let d = n.edge(l.v, l.w) || 0, s = t(l), u = d + s;
+    n.setEdge(l.v, l.w, u);
+    let f = n.node(l.v), h = n.node(l.w);
+    o = Math.max(o, f.out += s), r = Math.max(r, h.in += s);
+  });
+  let i = Vr(o + r + 3).map(() => new Gr()), a = r + 1;
+  return n.nodes().forEach((l) => {
+    Be(i, a, n.node(l));
+  }), { graph: n, buckets: i, zeroIdx: a };
+}
+function Be(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 Vr(e) {
+  let t = [];
+  for (let n = 0; n < e; n++) t.push(n);
+  return t;
+}
+function Hr(e) {
+  (e.graph().acyclicer === "greedy" ? Yr(e, t(e)) : qr(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, Ue("rev"));
+  });
+  function t(n) {
+    return (r) => n.edge(r).weight;
+  }
+}
+function qr(e) {
+  let t = [], n = {}, r = {};
+  function o(i) {
+    Object.hasOwn(r, i) || (r[i] = !0, n[i] = !0, e.outEdges(i).forEach((a) => {
+      Object.hasOwn(n, a.w) ? t.push(a) : o(a.w);
+    }), delete n[i]);
+  }
+  return e.nodes().forEach(o), t;
+}
+function Xr(e) {
+  e.edges().forEach((t) => {
+    let n = e.edge(t);
+    if (n.reversed) {
+      e.removeEdge(t);
+      let r = n.forwardName;
+      delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
+    }
+  });
+}
+function Jr(e) {
+  e.graph().dummyChains = [], e.edges().forEach((t) => Zr(e, t));
+}
+function Zr(e, t) {
+  let n = t.v, r = e.node(n).rank, o = t.w, i = e.node(o).rank, a = t.name, l = e.edge(t), d = l.labelRank;
+  if (i === r + 1) return;
+  e.removeEdge(t);
+  let s, u, f;
+  for (f = 0, ++r; r < i; ++f, ++r) l.points = [], u = { width: 0, height: 0, edgeLabel: l, edgeObj: t, rank: r }, s = ce(e, "edge", u, "_d"), r === d && (u.width = l.width, u.height = l.height, u.dummy = "edge-label", u.labelpos = l.labelpos), e.setEdge(n, s, { weight: l.weight }, a), f === 0 && e.graph().dummyChains.push(s), n = s;
+  e.setEdge(n, o, { weight: l.weight }, a);
+}
+function Qr(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);
+  });
+}
+function Ve(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), a = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : n(d.w) - e.edge(d).minlen) : [], l = $(Math.min, a);
+    return l === Number.POSITIVE_INFINITY && (l = 0), o.rank = l;
+  }
+  e.sources().forEach(n);
+}
+function de(e, t) {
+  return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+}
+var tn = eo;
+function eo(e) {
+  let t = new B({ 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, a;
+  for (; to(t, e) < o && (i = no(t, e), !!i); ) a = t.hasNode(i.v) ? de(e, i) : -de(e, i), ro(t, e, a);
+  return t;
+}
+function to(e, t) {
+  function n(r) {
+    let o = t.nodeEdges(r);
+    o && o.forEach((i) => {
+      let a = i.v, l = r === a ? i.w : a;
+      !e.hasNode(l) && !de(t, i) && (e.setNode(l, {}), e.setEdge(r, l, {}), n(l));
+    });
+  }
+  return e.nodes().forEach(n), e.nodeCount();
+}
+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 = de(t, r)), o < n[0] ? [o, r] : n;
+  }, [Number.POSITIVE_INFINITY, null])[1];
+}
+function ro(e, t, n) {
+  e.nodes().forEach((r) => t.node(r).rank += n);
+}
+var { preorder: oo, postorder: io } = Ke, ao = oe;
+oe.initLowLimValues = qe;
+oe.initCutValues = He;
+oe.calcCutValue = nn;
+oe.leaveEdge = on;
+oe.enterEdge = an;
+oe.exchangeEdges = ln;
+function oe(e) {
+  e = jr(e), Ve(e);
+  let t = tn(e);
+  qe(t), He(t, e);
+  let n, r;
+  for (; n = on(t); ) r = an(t, e, n), ln(t, e, n, r);
+}
+function He(e, t) {
+  let n = io(e, e.nodes());
+  n = n.slice(0, n.length - 1), n.forEach((r) => lo(e, t, r));
+}
+function lo(e, t, n) {
+  let r = e.node(n).parent, o = e.edge(n, r);
+  o.cutvalue = nn(e, t, n);
+}
+function nn(e, t, n) {
+  let r = e.node(n).parent, o = !0, i = t.edge(n, r), a = 0;
+  i || (o = !1, i = t.edge(r, n)), a = i.weight;
+  let l = t.nodeEdges(n);
+  return l && l.forEach((d) => {
+    let s = d.v === n, u = s ? d.w : d.v;
+    if (u !== r) {
+      let f = s === o, h = t.edge(d).weight;
+      if (a += f ? h : -h, co(e, n, u)) {
+        let g = e.edge(n, u).cutvalue;
+        a += f ? -g : g;
+      }
+    }
+  }), a;
+}
+function qe(e, t) {
+  arguments.length < 2 && (t = e.nodes()[0]), rn(e, {}, 1, t);
+}
+function rn(e, t, n, r, o) {
+  let i = n, a = e.node(r);
+  t[r] = !0;
+  let l = e.neighbors(r);
+  return l && l.forEach((d) => {
+    Object.hasOwn(t, d) || (n = rn(e, t, n, d, r));
+  }), a.low = i, a.lim = n++, o ? a.parent = o : delete a.parent, n;
+}
+function on(e) {
+  return e.edges().find((t) => e.edge(t).cutvalue < 0);
+}
+function an(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), a = e.node(o), l = i, d = !1;
+  return i.lim > a.lim && (l = a, d = !0), t.edges().filter((s) => d === kt(e, e.node(s.v), l) && d !== kt(e, e.node(s.w), l)).reduce((s, u) => de(t, u) < de(t, s) ? u : s);
+}
+function ln(e, t, n, r) {
+  let o = n.v, i = n.w;
+  e.removeEdge(o, i), e.setEdge(r.v, r.w, {}), qe(e), He(e, t), so(e, t);
+}
+function so(e, t) {
+  let n = e.nodes().find((o) => !e.node(o).parent);
+  if (!n) return;
+  let r = oo(e, [n]);
+  r = r.slice(1), r.forEach((o) => {
+    let i = e.node(o).parent, a = t.edge(o, i), l = !1;
+    a || (a = t.edge(i, o), l = !0), t.node(o).rank = t.node(i).rank + (l ? a.minlen : -a.minlen);
+  });
+}
+function co(e, t, n) {
+  return e.hasEdge(t, n);
+}
+function kt(e, t, n) {
+  return n.low <= t.lim && t.lim <= n.lim;
+}
+var uo = fo;
+function fo(e) {
+  let t = e.graph().ranker;
+  if (typeof t == "function") return t(e);
+  switch (t) {
+    case "network-simplex":
+      xt(e);
+      break;
+    case "tight-tree":
+      go(e);
+      break;
+    case "longest-path":
+      ho(e);
+      break;
+    case "none":
+      break;
+    default:
+      xt(e);
+  }
+}
+var ho = Ve;
+function go(e) {
+  Ve(e), tn(e);
+}
+function xt(e) {
+  ao(e);
+}
+var po = mo;
+function mo(e) {
+  let t = yo(e);
+  e.graph().dummyChains.forEach((n) => {
+    let r = e.node(n), o = r.edgeObj, i = bo(e, t, o.v, o.w), a = i.path, l = i.lca, d = 0, s = a[d], u = !0;
+    for (; n !== o.w; ) {
+      if (r = e.node(n), u) {
+        for (; (s = a[d]) !== l && e.node(s).maxRank < r.rank; ) d++;
+        s === l && (u = !1);
+      }
+      if (!u) {
+        for (; d < a.length - 1 && e.node(a[d + 1]).minRank <= r.rank; ) d++;
+        s = a[d];
+      }
+      s !== void 0 && e.setParent(n, s), n = e.successors(n)[0];
+    }
+  });
+}
+function bo(e, t, n, r) {
+  let o = [], i = [], a = Math.min(t[n].low, t[r].low), l = Math.max(t[n].lim, t[r].lim), d;
+  d = n;
+  do
+    d = e.parent(d), o.push(d);
+  while (d && (t[d].low > a || l > t[d].lim));
+  let s = d, u = r;
+  for (; (u = e.parent(u)) !== s; ) i.push(u);
+  return { path: o.concat(i.reverse()), lca: s };
+}
+function yo(e) {
+  let t = {}, n = 0;
+  function r(o) {
+    let i = n;
+    e.children(o).forEach(r), t[o] = { low: i, lim: n++ };
+  }
+  return e.children(Te).forEach(r), t;
+}
+function Eo(e) {
+  let t = ce(e, "root", {}, "_root"), n = wo(e), r = Object.values(n), o = $(Math.max, r) - 1, i = 2 * o + 1;
+  e.graph().nestingRoot = t, e.edges().forEach((l) => e.edge(l).minlen *= i);
+  let a = vo(e) + 1;
+  e.children(Te).forEach((l) => sn(e, t, i, a, o, n, l)), e.graph().nodeRankFactor = i;
+}
+function sn(e, t, n, r, o, i, a) {
+  var l;
+  let d = e.children(a);
+  if (!d.length) {
+    a !== t && e.setEdge(t, a, { weight: 0, minlen: n });
+    return;
+  }
+  let s = wt(e, "_bt"), u = wt(e, "_bb"), f = e.node(a);
+  e.setParent(s, a), f.borderTop = s, e.setParent(u, a), f.borderBottom = u, d.forEach((h) => {
+    var g;
+    sn(e, t, n, r, o, i, h);
+    let m = e.node(h), b = m.borderTop ? m.borderTop : h, p = m.borderBottom ? m.borderBottom : h, E = m.borderTop ? r : 2 * r, T = b !== p ? 1 : o - ((g = i[a]) != null ? g : 0) + 1;
+    e.setEdge(s, b, { weight: E, minlen: T, nestingEdge: !0 }), e.setEdge(p, u, { weight: E, minlen: T, nestingEdge: !0 });
+  }), e.parent(a) || e.setEdge(t, s, { weight: 0, minlen: o + ((l = i[a]) != null ? l : 0) });
+}
+function wo(e) {
+  let t = {};
+  function n(r, o) {
+    let i = e.children(r);
+    i && i.length && i.forEach((a) => n(a, o + 1)), t[r] = o;
+  }
+  return e.children(Te).forEach((r) => n(r, 1)), t;
+}
+function vo(e) {
+  return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
+}
+function ko(e) {
+  let t = e.graph();
+  e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((n) => {
+    e.edge(n).nestingEdge && e.removeEdge(n);
+  });
+}
+var xo = _o;
+function _o(e) {
+  function t(n) {
+    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, a = o.maxRank + 1; i < a; ++i) _t(e, "borderLeft", "_bl", n, o, i), _t(e, "borderRight", "_br", n, o, i);
+    }
+  }
+  e.children(Te).forEach(t);
+}
+function _t(e, t, n, r, o, i) {
+  let a = { width: 0, height: 0, rank: i, borderType: t }, l = o[t][i - 1], d = ce(e, "border", a, n);
+  o[t][i] = d, e.setParent(d, r), l && e.setEdge(l, d, { weight: 1 });
+}
+function To(e) {
+  var t;
+  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
+  (n === "lr" || n === "rl") && dn(e);
+}
+function No(e) {
+  var t;
+  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
+  (n === "bt" || n === "rl") && Co(e), (n === "lr" || n === "rl") && (So(e), dn(e));
+}
+function dn(e) {
+  e.nodes().forEach((t) => Tt(e.node(t))), e.edges().forEach((t) => Tt(e.edge(t)));
+}
+function Tt(e) {
+  let t = e.width;
+  e.width = e.height, e.height = t;
+}
+function Co(e) {
+  e.nodes().forEach((t) => Fe(e.node(t))), e.edges().forEach((t) => {
+    var n;
+    let r = e.edge(t);
+    (n = r.points) == null || n.forEach(Fe), Object.hasOwn(r, "y") && Fe(r);
+  });
+}
+function Fe(e) {
+  e.y = -e.y;
+}
+function So(e) {
+  e.nodes().forEach((t) => ze(e.node(t))), e.edges().forEach((t) => {
+    var n;
+    let r = e.edge(t);
+    (n = r.points) == null || n.forEach(ze), Object.hasOwn(r, "x") && ze(r);
+  });
+}
+function ze(e) {
+  let t = e.x;
+  e.x = e.y, e.y = t;
+}
+function Io(e) {
+  let t = {}, n = e.nodes().filter((l) => !e.children(l).length), r = n.map((l) => e.node(l).rank), o = $(Math.max, r), i = he(o + 1).map(() => []);
+  function a(l) {
+    if (t[l]) return;
+    t[l] = !0;
+    let d = e.node(l);
+    i[d.rank].push(l);
+    let s = e.successors(l);
+    s && s.forEach(a);
+  }
+  return n.sort((l, d) => e.node(l).rank - e.node(d).rank).forEach(a), i;
+}
+function Oo(e, t) {
+  let n = 0;
+  for (let r = 1; r < t.length; ++r) n += Mo(e, t[r - 1], t[r]);
+  return n;
+}
+function Mo(e, t, n) {
+  let r = Ar(n, n.map((s, u) => u)), o = t.flatMap((s) => {
+    let u = e.outEdges(s);
+    return u ? u.map((f) => ({ pos: r[f.w], weight: e.edge(f).weight })).sort((f, h) => f.pos - h.pos) : [];
+  }), i = 1;
+  for (; i < n.length; ) i <<= 1;
+  let a = 2 * i - 1;
+  i -= 1;
+  let l = new Array(a).fill(0), d = 0;
+  return o.forEach((s) => {
+    let u = s.pos + i;
+    l[u] += s.weight;
+    let f = 0;
+    for (; u > 0; ) u % 2 && (f += l[u + 1]), u = u - 1 >> 1, l[u] += s.weight;
+    d += s.weight * f;
+  }), d;
+}
+function jo(e, t = []) {
+  return t.map((n) => {
+    let r = e.inEdges(n);
+    if (!r || !r.length) return { v: n };
+    {
+      let o = r.reduce((i, a) => {
+        let l = e.edge(a), d = e.node(a.v);
+        return { sum: i.sum + l.weight * d.order, weight: i.weight + l.weight };
+      }, { sum: 0, weight: 0 });
+      return { v: n, barycenter: o.sum / o.weight, weight: o.weight };
+    }
+  });
+}
+function Fo(e, t) {
+  let n = {};
+  e.forEach((o, i) => {
+    let a = { indegree: 0, in: [], out: [], vs: [o.v], i };
+    o.barycenter !== void 0 && (a.barycenter = o.barycenter, a.weight = o.weight), n[o.v] = a;
+  }), t.edges().forEach((o) => {
+    let i = n[o.v], a = n[o.w];
+    i !== void 0 && a !== void 0 && (a.indegree++, i.out.push(a));
+  });
+  let r = Object.values(n).filter((o) => !o.indegree);
+  return zo(r);
+}
+function zo(e) {
+  let t = [];
+  function n(o) {
+    return (i) => {
+      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Ro(o, i);
+    };
+  }
+  function r(o) {
+    return (i) => {
+      i.in.push(o), --i.indegree === 0 && e.push(i);
+    };
+  }
+  for (; e.length; ) {
+    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) => xe(o, ["vs", "i", "barycenter", "weight"]));
+}
+function Ro(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 Do(e, t) {
+  let n = Dr(e, (u) => Object.hasOwn(u, "barycenter")), r = n.lhs, o = n.rhs.sort((u, f) => f.i - u.i), i = [], a = 0, l = 0, d = 0;
+  r.sort(Lo(!!t)), d = Nt(i, o, d), r.forEach((u) => {
+    d += u.vs.length, i.push(u.vs), a += u.barycenter * u.weight, l += u.weight, d = Nt(i, o, d);
+  });
+  let s = { vs: i.flat(1) };
+  return l && (s.barycenter = a / l, s.weight = l), s;
+}
+function Nt(e, t, n) {
+  let r;
+  for (; t.length && (r = t[t.length - 1]).i <= n; ) t.pop(), e.push(r.vs), n++;
+  return n;
+}
+function Lo(e) {
+  return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
+}
+function cn(e, t, n, r) {
+  let o = e.children(t), i = e.node(t), a = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, d = {};
+  a && (o = o.filter((h) => h !== a && h !== l));
+  let s = jo(e, o);
+  s.forEach((h) => {
+    if (e.children(h.v).length) {
+      let g = cn(e, h.v, n, r);
+      d[h.v] = g, Object.hasOwn(g, "barycenter") && Po(h, g);
+    }
+  });
+  let u = Fo(s, n);
+  Ao(u, d);
+  let f = Do(u, r);
+  if (a && l) {
+    f.vs = [a, f.vs, l].flat(1);
+    let h = e.predecessors(a);
+    if (h && h.length) {
+      let g = e.node(h[0]), m = e.predecessors(l), b = e.node(m[0]);
+      Object.hasOwn(f, "barycenter") || (f.barycenter = 0, f.weight = 0), f.barycenter = (f.barycenter * f.weight + g.order + b.order) / (f.weight + 2), f.weight += 2;
+    }
+  }
+  return f;
+}
+function Ao(e, t) {
+  e.forEach((n) => {
+    n.vs = n.vs.flatMap((r) => t[r] ? t[r].vs : r);
+  });
+}
+function Po(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 Bo(e, t, n, r) {
+  r || (r = e.nodes());
+  let o = Wo(e), i = new B({ compound: !0 }).setGraph({ root: o }).setDefaultNodeLabel((a) => e.node(a));
+  return r.forEach((a) => {
+    let l = e.node(a), d = e.parent(a);
+    if (l.rank === t || l.minRank <= t && t <= l.maxRank) {
+      i.setNode(a), i.setParent(a, d || o);
+      let s = e[n](a);
+      s && s.forEach((u) => {
+        let f = u.v === a ? u.w : u.v, h = i.edge(f, a), g = h !== void 0 ? h.weight : 0;
+        i.setEdge(f, a, { weight: e.edge(u).weight + g });
+      }), Object.hasOwn(l, "minRank") && i.setNode(a, { borderLeft: l.borderLeft[t], borderRight: l.borderRight[t] });
+    }
+  }), i;
+}
+function Wo(e) {
+  let t;
+  for (; e.hasNode(t = Ue("_root")); ) ;
+  return t;
+}
+function Go(e, t, n) {
+  let r = {}, o;
+  n.forEach((i) => {
+    let a = e.parent(i), l, d;
+    for (; a; ) {
+      if (l = e.parent(a), l ? (d = r[l], r[l] = a) : (d = o, o = a), d && d !== a) {
+        t.setEdge(d, a);
+        return;
+      }
+      a = l;
+    }
+  });
+}
+function un(e, t = {}) {
+  if (typeof t.customOrder == "function") {
+    t.customOrder(e, un);
+    return;
+  }
+  let n = Zt(e), r = Ct(e, he(1, n + 1), "inEdges"), o = Ct(e, he(n - 1, -1, -1), "outEdges"), i = Io(e);
+  if (St(e, i), t.disableOptimalOrderHeuristic) return;
+  let a = Number.POSITIVE_INFINITY, l, d = t.constraints || [];
+  for (let s = 0, u = 0; u < 4; ++s, ++u) {
+    $o(s % 2 ? r : o, s % 4 >= 2, d), i = pe(e);
+    let f = Oo(e, i);
+    f < a ? (u = 0, l = Object.assign({}, i), a = f) : f === a && (l = structuredClone(i));
+  }
+  St(e, l);
+}
+function Ct(e, t, n) {
+  let r = /* @__PURE__ */ new Map(), o = (i, a) => {
+    r.has(i) || r.set(i, []), r.get(i).push(a);
+  };
+  for (let i of e.nodes()) {
+    let a = e.node(i);
+    if (typeof a.rank == "number" && o(a.rank, i), typeof a.minRank == "number" && typeof a.maxRank == "number") for (let l = a.minRank; l <= a.maxRank; l++) l !== a.rank && o(l, i);
+  }
+  return t.map(function(i) {
+    return Bo(e, i, n, r.get(i) || []);
+  });
+}
+function $o(e, t, n) {
+  let r = new B();
+  e.forEach(function(o) {
+    n.forEach((l) => r.setEdge(l.left, l.right));
+    let i = o.graph().root, a = cn(o, i, r, t);
+    a.vs.forEach((l, d) => o.node(l).order = d), Go(o, r, a.vs);
+  });
+}
+function St(e, t) {
+  Object.values(t).forEach((n) => n.forEach((r, o) => e.node(r).order = o));
+}
+function Yo(e, t) {
+  let n = {};
+  function r(o, i) {
+    let a = 0, l = 0, d = o.length, s = i[i.length - 1];
+    return i.forEach((u, f) => {
+      let h = Uo(e, u), g = h ? e.node(h).order : d;
+      (h || u === s) && (i.slice(l, f + 1).forEach((m) => {
+        let b = e.predecessors(m);
+        b && b.forEach((p) => {
+          let E = e.node(p), T = E.order;
+          (T < a || g < T) && !(E.dummy && e.node(m).dummy) && fn(n, p, m);
+        });
+      }), l = f + 1, a = g);
+    }), i;
+  }
+  return t.length && t.reduce(r), n;
+}
+function Ko(e, t) {
+  let n = {};
+  function r(i, a, l, d, s) {
+    he(a, l).forEach((u) => {
+      let f = i[u];
+      if (f !== void 0 && e.node(f).dummy) {
+        let h = e.predecessors(f);
+        h && h.forEach((g) => {
+          if (g === void 0) return;
+          let m = e.node(g);
+          m.dummy && (m.order < d || m.order > s) && fn(n, g, f);
+        });
+      }
+    });
+  }
+  function o(i, a) {
+    let l = -1, d = -1, s = 0;
+    return a.forEach((u, f) => {
+      if (e.node(u).dummy === "border") {
+        let h = e.predecessors(u);
+        if (h && h.length) {
+          let g = h[0];
+          if (g === void 0) return;
+          d = e.node(g).order, r(a, s, f, l, d), s = f, l = d;
+        }
+      }
+      r(a, s, a.length, d, i.length);
+    }), a;
+  }
+  return t.length && t.reduce(o), n;
+}
+function Uo(e, t) {
+  if (e.node(t).dummy) {
+    let n = e.predecessors(t);
+    if (n) return n.find((r) => e.node(r).dummy);
+  }
+}
+function fn(e, t, n) {
+  if (t > n) {
+    let o = t;
+    t = n, n = o;
+  }
+  let r = e[t];
+  r || (e[t] = r = {}), r[n] = !0;
+}
+function Vo(e, t, n) {
+  if (t > n) {
+    let o = t;
+    t = n, n = o;
+  }
+  let r = e[t];
+  return r !== void 0 && Object.hasOwn(r, n);
+}
+function Ho(e, t, n, r) {
+  let o = {}, i = {}, a = {};
+  return t.forEach((l) => {
+    l.forEach((d, s) => {
+      o[d] = d, i[d] = d, a[d] = s;
+    });
+  }), t.forEach((l) => {
+    let d = -1;
+    l.forEach((s) => {
+      let u = r(s);
+      if (u && u.length) {
+        let f = u.sort((g, m) => {
+          let b = a[g], p = a[m];
+          return (b !== void 0 ? b : 0) - (p !== void 0 ? p : 0);
+        }), h = (f.length - 1) / 2;
+        for (let g = Math.floor(h), m = Math.ceil(h); g <= m; ++g) {
+          let b = f[g];
+          if (b === void 0) continue;
+          let p = a[b];
+          if (p !== void 0 && i[s] === s && d < p && !Vo(n, s, b)) {
+            let E = o[b];
+            E !== void 0 && (i[b] = s, i[s] = o[s] = E, d = p);
+          }
+        }
+      }
+    });
+  }), { root: o, align: i };
+}
+function qo(e, t, n, r, o = !1) {
+  let i = {}, a = Xo(e, t, n, o), l = o ? "borderLeft" : "borderRight";
+  function d(g, m) {
+    let b = a.nodes().slice(), p = {}, E = b.pop();
+    for (; E; ) {
+      if (p[E]) g(E);
+      else {
+        p[E] = !0, b.push(E);
+        for (let T of m(E)) b.push(T);
+      }
+      E = b.pop();
+    }
+  }
+  function s(g) {
+    let m = a.inEdges(g);
+    m ? i[g] = m.reduce((b, p) => {
+      var E;
+      let T = (E = i[p.v]) != null ? E : 0, I = a.edge(p);
+      return Math.max(b, T + (I !== void 0 ? I : 0));
+    }, 0) : i[g] = 0;
+  }
+  function u(g) {
+    let m = a.outEdges(g), b = Number.POSITIVE_INFINITY;
+    m && (b = m.reduce((E, T) => {
+      let I = i[T.w], O = a.edge(T);
+      return Math.min(E, (I !== void 0 ? I : 0) - (O !== void 0 ? O : 0));
+    }, Number.POSITIVE_INFINITY));
+    let p = e.node(g);
+    b !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[g] = Math.max(i[g] !== void 0 ? i[g] : 0, b));
+  }
+  function f(g) {
+    return a.predecessors(g) || [];
+  }
+  function h(g) {
+    return a.successors(g) || [];
+  }
+  return d(s, f), d(u, h), Object.keys(r).forEach((g) => {
+    var m;
+    let b = n[g];
+    b !== void 0 && (i[g] = (m = i[b]) != null ? m : 0);
+  }), i;
+}
+function Xo(e, t, n, r) {
+  let o = new B(), i = e.graph(), a = ti(i.nodesep, i.edgesep, r);
+  return t.forEach((l) => {
+    let d;
+    l.forEach((s) => {
+      let u = n[s];
+      if (u !== void 0) {
+        if (o.setNode(u), d !== void 0) {
+          let f = n[d];
+          if (f !== void 0) {
+            let h = o.edge(f, u);
+            o.setEdge(f, u, Math.max(a(e, s, d), h || 0));
+          }
+        }
+        d = s;
+      }
+    });
+  }), o;
+}
+function Jo(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 s = ni(e, l) / 2;
+      o = Math.max(d + s, o), i = Math.min(d - s, i);
+    });
+    let a = o - i;
+    return a < n[0] && (n = [a, r]), n;
+  }, [Number.POSITIVE_INFINITY, null])[1];
+}
+function Zo(e, t) {
+  let n = Object.values(t), r = $(Math.min, n), o = $(Math.max, n);
+  ["u", "d"].forEach((i) => {
+    ["l", "r"].forEach((a) => {
+      let l = i + a, d = e[l];
+      if (!d || d === t) return;
+      let s = Object.values(d), u = r - $(Math.min, s);
+      a !== "l" && (u = o - $(Math.max, s)), u && (e[l] = _e(d, (f) => f + u));
+    });
+  });
+}
+function Qo(e, t = void 0) {
+  let n = e.ul;
+  return n ? _e(n, (r, o) => {
+    var i, a;
+    if (t) {
+      let d = t.toLowerCase(), s = e[d];
+      if (s && s[o] !== void 0) return s[o];
+    }
+    let l = Object.values(e).map((d) => {
+      let s = d[o];
+      return s !== void 0 ? s : 0;
+    }).sort((d, s) => d - s);
+    return (((i = l[1]) != null ? i : 0) + ((a = l[2]) != null ? a : 0)) / 2;
+  }) : {};
+}
+function ei(e) {
+  let t = pe(e), n = Object.assign(Yo(e, t), Ko(e, t)), r = {}, o;
+  ["u", "d"].forEach((a) => {
+    o = a === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
+      l === "r" && (o = o.map((u) => Object.values(u).reverse()));
+      let d = Ho(e, o, n, (u) => (a === "u" ? e.predecessors(u) : e.successors(u)) || []), s = qo(e, o, d.root, d.align, l === "r");
+      l === "r" && (s = _e(s, (u) => -u)), r[a + l] = s;
+    });
+  });
+  let i = Jo(e, r);
+  return Zo(r, i), Qo(r, e.graph().align);
+}
+function ti(e, t, n) {
+  return (r, o, i) => {
+    let a = r.node(o), l = r.node(i), d = 0, s;
+    if (d += a.width / 2, Object.hasOwn(a, "labelpos")) switch (a.labelpos.toLowerCase()) {
+      case "l":
+        s = -a.width / 2;
+        break;
+      case "r":
+        s = a.width / 2;
+        break;
+    }
+    if (s && (d += n ? s : -s), s = void 0, d += (a.dummy ? t : e) / 2, d += (l.dummy ? t : e) / 2, d += l.width / 2, Object.hasOwn(l, "labelpos")) switch (l.labelpos.toLowerCase()) {
+      case "l":
+        s = l.width / 2;
+        break;
+      case "r":
+        s = -l.width / 2;
+        break;
+    }
+    return s && (d += n ? s : -s), d;
+  };
+}
+function ni(e, t) {
+  return e.node(t).width;
+}
+function ri(e) {
+  e = Xt(e), oi(e), Object.entries(ei(e)).forEach(([t, n]) => e.node(t).x = n);
+}
+function oi(e) {
+  let t = pe(e), n = e.graph(), r = n.ranksep, o = n.rankalign, i = 0;
+  t.forEach((a) => {
+    let l = a.reduce((d, s) => {
+      var u;
+      let f = (u = e.node(s).height) != null ? u : 0;
+      return d > f ? d : f;
+    }, 0);
+    a.forEach((d) => {
+      let s = e.node(d);
+      o === "top" ? s.y = i + s.height / 2 : o === "bottom" ? s.y = i + l - s.height / 2 : s.y = i + l / 2;
+    }), i += l + r;
+  });
+}
+function ii(e, t = {}) {
+  let n = t.debugTiming ? Qt : en;
+  return n("layout", () => {
+    let r = n("  buildLayoutGraph", () => pi(e));
+    return n("  runLayout", () => ai(r, n, t)), n("  updateInputGraph", () => li(e, r)), r;
+  });
+}
+function ai(e, t, n) {
+  t("    makeSpaceForEdgeLabels", () => mi(e)), t("    removeSelfEdges", () => Ti(e)), t("    acyclic", () => Hr(e)), t("    nestingGraph.run", () => Eo(e)), t("    rank", () => uo(Xt(e))), t("    injectEdgeLabelProxies", () => bi(e)), t("    removeEmptyRanks", () => zr(e)), t("    nestingGraph.cleanup", () => ko(e)), t("    normalizeRanks", () => Fr(e)), t("    assignRankMinMax", () => yi(e)), t("    removeEdgeLabelProxies", () => Ei(e)), t("    normalize.run", () => Jr(e)), t("    parentDummyChains", () => po(e)), t("    addBorderSegments", () => xo(e)), t("    order", () => un(e, n)), t("    insertSelfEdges", () => Ni(e)), t("    adjustCoordinateSystem", () => To(e)), t("    position", () => ri(e)), t("    positionSelfEdges", () => Ci(e)), t("    removeBorderNodes", () => _i(e)), t("    normalize.undo", () => Qr(e)), t("    fixupEdgeLabelCoords", () => ki(e)), t("    undoCoordinateSystem", () => No(e)), t("    translateGraph", () => wi(e)), t("    assignNodeIntersects", () => vi(e)), t("    reversePoints", () => xi(e)), t("    acyclic.undo", () => Xr(e));
+}
+function li(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));
+  }), e.edges().forEach((n) => {
+    let r = e.edge(n), o = t.edge(n);
+    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 si = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], di = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" }, ci = ["acyclicer", "ranker", "rankdir", "align", "rankalign"], ui = ["width", "height", "rank"], It = { width: 0, height: 0 }, fi = ["minlen", "weight", "width", "height", "labeloffset"], hi = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" }, gi = ["labelpos"];
+function pi(e) {
+  let t = new B({ multigraph: !0, compound: !0 }), n = De(e.graph());
+  return t.setGraph(Object.assign({}, di, Re(n, si), xe(n, ci))), e.nodes().forEach((r) => {
+    let o = De(e.node(r)), i = Re(o, ui);
+    Object.keys(It).forEach((l) => {
+      i[l] === void 0 && (i[l] = It[l]);
+    }), t.setNode(r, i);
+    let a = e.parent(r);
+    a !== void 0 && t.setParent(r, a);
+  }), e.edges().forEach((r) => {
+    let o = De(e.edge(r));
+    t.setEdge(r, Object.assign({}, hi, Re(o, fi), xe(o, gi)));
+  }), t;
+}
+function mi(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 bi(e) {
+  e.edges().forEach((t) => {
+    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 };
+      ce(e, "edge-proxy", o, "_ep");
+    }
+  });
+}
+function yi(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 Ei(e) {
+  e.nodes().forEach((t) => {
+    let n = e.node(t);
+    if (n.dummy === "edge-proxy") {
+      let r = n;
+      e.edge(r.e).labelRank = n.rank, e.removeNode(t);
+    }
+  });
+}
+function wi(e) {
+  let t = Number.POSITIVE_INFINITY, n = 0, r = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), a = i.marginx || 0, l = i.marginy || 0;
+  function d(s) {
+    let u = s.x, f = s.y, h = s.width, g = s.height;
+    t = Math.min(t, u - h / 2), n = Math.max(n, u + h / 2), r = Math.min(r, f - g / 2), o = Math.max(o, f + g / 2);
+  }
+  e.nodes().forEach((s) => d(e.node(s))), e.edges().forEach((s) => {
+    let u = e.edge(s);
+    Object.hasOwn(u, "x") && d(u);
+  }), t -= a, r -= l, e.nodes().forEach((s) => {
+    let u = e.node(s);
+    u.x -= t, u.y -= r;
+  }), e.edges().forEach((s) => {
+    let u = e.edge(s);
+    u.points.forEach((f) => {
+      f.x -= t, f.y -= r;
+    }), Object.hasOwn(u, "x") && (u.x -= t), Object.hasOwn(u, "y") && (u.y -= r);
+  }), i.width = n - t + a, i.height = o - r + l;
+}
+function vi(e) {
+  e.edges().forEach((t) => {
+    let n = e.edge(t), r = e.node(t.v), o = e.node(t.w), i, a;
+    n.points ? (i = n.points[0], a = n.points[n.points.length - 1]) : (n.points = [], i = o, a = r), n.points.unshift(Et(r, i)), n.points.push(Et(o, a));
+  });
+}
+function ki(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) {
+      case "l":
+        n.x -= n.width / 2 + n.labeloffset;
+        break;
+      case "r":
+        n.x += n.width / 2 + n.labeloffset;
+        break;
+    }
+  });
+}
+function xi(e) {
+  e.edges().forEach((t) => {
+    let n = e.edge(t);
+    n.reversed && n.points.reverse();
+  });
+}
+function _i(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]), a = e.node(n.borderRight[n.borderRight.length - 1]);
+      n.width = Math.abs(a.x - i.x), n.height = Math.abs(o.y - r.y), n.x = i.x + n.width / 2, n.y = r.y + n.height / 2;
+    }
+  }), e.nodes().forEach((t) => {
+    e.node(t).dummy === "border" && e.removeNode(t);
+  });
+}
+function Ti(e) {
+  e.edges().forEach((t) => {
+    if (t.v === t.w) {
+      let n = e.node(t.v);
+      n.selfEdges || (n.selfEdges = []), n.selfEdges.push({ e: t, label: e.edge(t) }), e.removeEdge(t);
+    }
+  });
+}
+function Ni(e) {
+  pe(e).forEach((t) => {
+    let n = 0;
+    t.forEach((r, o) => {
+      let i = e.node(r);
+      i.order = o + n, (i.selfEdges || []).forEach((a) => {
+        ce(e, "selfedge", { width: a.label.width, height: a.label.height, rank: i.rank, order: o + ++n, e: a.e, label: a.label }, "_se");
+      }), delete i.selfEdges;
+    });
+  });
+}
+function Ci(e) {
+  e.nodes().forEach((t) => {
+    let n = e.node(t);
+    if (n.dummy === "selfedge") {
+      let r = n, o = e.node(r.e.v), i = o.x + o.width / 2, a = o.y, l = n.x - i, d = o.height / 2;
+      e.setEdge(r.e, r.label), e.removeNode(t), r.label.points = [{ x: i + 2 * l / 3, y: a - d }, { x: i + 5 * l / 6, y: a - d }, { x: i + l, y: a }, { x: i + 5 * l / 6, y: a + d }, { x: i + 2 * l / 3, y: a + d }], r.label.x = n.x, r.label.y = n.y;
+    }
+  });
+}
+function Re(e, t) {
+  return _e(xe(e, t), Number);
+}
+function De(e) {
+  let t = {};
+  return e && Object.entries(e).forEach(([n, r]) => {
+    typeof n == "string" && (n = n.toLowerCase()), t[n] = r;
+  }), t;
+}
+function Si(e) {
+  let t = pe(e), n = new B({ 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) => {
+    let i = "layer" + o;
+    n.setNode(i, { rank: "same" }), r.reduce((a, l) => (n.setEdge(a, l, { style: "invis" }), l));
+  }), n;
+}
+var Ii = { graphlib: Wt, version: Pr, layout: ii, debug: Si, util: { time: Qt, notime: en } }, Ot = Ii;
+/*! For license information please see dagre.esm.js.LEGAL.txt */
+const Oi = (e) => {
+  const t = [];
+  return e.nodeInternals.forEach((n, r) => t.push(`${r}:${n.height ?? 0}`)), t.join(",");
+}, Mi = ({ onHeightsReady: e, nodeCount: t }) => {
+  const n = xn(Oi), r = ht("");
+  ht(0);
+  const { fitView: o } = _n();
+  return re(() => {
+    if (!n || n === r.current) return;
+    const i = {};
+    for (const a of n.split(",")) {
+      const [l, d] = a.split(":"), s = Number(d);
+      l && s > 0 && (i[l] = s);
+    }
+    Object.keys(i).length !== 0 && (r.current = n, e(i));
+  }, [n]), null;
+}, Ne = ({ isOpen: e, onClose: t, title: n, icon: r, children: o, footer: i, width: a = 600 }) => {
+  const [l, d] = M(!1), s = () => d((h) => !h), u = () => /* @__PURE__ */ c.createElement(Q, { sx: { display: "flex", alignItems: "center", p: 2, pt: 3, borderBottom: "1px solid #e0e0e0", mb: 0, flexShrink: 0 } }, r && /* @__PURE__ */ c.createElement(Q, { sx: { mr: 1.5, display: "flex", alignItems: "center", fontSize: "1.25rem", color: "#1DBF60" } }, r), /* @__PURE__ */ c.createElement(Ln, { variant: "h6", component: "div", sx: { flexGrow: 1, fontSize: "0.875rem", fontWeight: 600 } }, n), /* @__PURE__ */ c.createElement(gt, { onClick: s, size: "small", sx: { mr: 1 }, title: l ? "Collapse" : "Expand", "data-testid": "expand-collapse-base-drawer-btn" }, l ? /* @__PURE__ */ c.createElement(er, null) : /* @__PURE__ */ c.createElement(tr, null)), /* @__PURE__ */ c.createElement(gt, { onClick: t, size: "small", "data-testid": "close-drawer-button" }, /* @__PURE__ */ c.createElement(An, null))), f = () => i ? /* @__PURE__ */ c.createElement(Q, { sx: { flexShrink: 0, p: 2, borderTop: "1px solid #e0e0e0", display: "flex", justifyContent: "flex-end", gap: 2 } }, i) : null;
+  return l ? /* @__PURE__ */ c.createElement(Rn, { open: e, onClose: t, maxWidth: !1, fullWidth: !0, PaperProps: { sx: { display: "flex", flexDirection: "column", height: "80vh", boxShadow: 24, width: "750px", maxWidth: "100%" } } }, /* @__PURE__ */ c.createElement(u, null), /* @__PURE__ */ c.createElement(Q, { sx: { flexGrow: 1, overflowY: "auto", p: 0 } }, o), /* @__PURE__ */ c.createElement(f, null)) : /* @__PURE__ */ c.createElement(
+    Dn,
+    {
+      anchor: "right",
+      open: e,
+      onClose: t,
+      variant: "persistent",
+      sx: { zIndex: 900 },
+      ModalProps: { keepMounted: !1 },
+      PaperProps: {
+        sx: {
+          width: a,
+          position: "fixed",
+          top: "64px",
+          height: "calc(100% - 74px)",
+          right: "10px",
+          borderRadius: "8px",
+          border: "1px solid #bdbdbd",
+          boxShadow: "none",
+          zIndex: 900,
+          display: "flex",
+          flexDirection: "column"
+        }
+      }
+    },
+    /* @__PURE__ */ c.createElement(u, null),
+    /* @__PURE__ */ c.createElement(Q, { sx: { flexGrow: 1, overflowY: "auto", p: 0 } }, o),
+    /* @__PURE__ */ c.createElement(f, null)
+  );
+}, ji = ({ open: e, templates: t, messages: n, onSelect: r, onClose: o }) => /* @__PURE__ */ c.createElement(Ne, { isOpen: e, onClose: o, title: n.addTriggerTitle, icon: /* @__PURE__ */ c.createElement(Qn, null), width: 500 }, /* @__PURE__ */ c.createElement(Q, { sx: { p: 2 } }, /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 } }, n.chooseTrigger), /* @__PURE__ */ c.createElement("div", { className: "ff-d-flex ff-flex-column ff-gap-2" }, t.map((i) => /* @__PURE__ */ c.createElement(
+  "div",
+  {
+    key: i.triggerKey,
+    className: "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-start ff-gap-3",
+    style: { cursor: "pointer", transition: "background 0.15s" },
+    onClick: () => r(i),
+    role: "button",
+    tabIndex: 0,
+    onKeyDown: (a) => {
+      a.key === "Enter" && r(i);
+    },
+    onMouseEnter: (a) => {
+      a.currentTarget.style.background = "#f5f5f5";
+    },
+    onMouseLeave: (a) => {
+      a.currentTarget.style.background = "";
+    }
+  },
+  /* @__PURE__ */ c.createElement("div", { style: { color: i.triggerCategory === "scheduler" ? "#1976d2" : "#f57c00", marginTop: 2, flexShrink: 0 } }, i.triggerCategory === "scheduler" ? /* @__PURE__ */ c.createElement(Pn, { size: 18 }) : /* @__PURE__ */ c.createElement(Bn, { size: 18 })),
+  /* @__PURE__ */ c.createElement("div", null, /* @__PURE__ */ c.createElement("div", { style: { fontSize: 14, fontWeight: 600, color: "#212121" } }, i.label), i.description && /* @__PURE__ */ c.createElement("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 } }, i.description))
+)), t.length === 0 && /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 } }, n.noTriggers)))), Le = {
+  cursor: "pointer",
+  transition: "background 0.15s"
+}, Ae = "ff-p-3 ff-rounded ff-border ff-d-flex ff-align-items-center ff-gap-3", Fi = ({ open: e, availableDescriptors: t, messages: n, onSelect: r, onClose: o }) => {
+  const { apps: i, ungrouped: a } = P(() => {
+    const f = /* @__PURE__ */ new Map(), h = [];
+    for (const g of t)
+      if (g.app) {
+        const m = f.get(g.app.key);
+        m ? m.descriptors.push(g) : f.set(g.app.key, {
+          key: g.app.key,
+          label: g.app.label,
+          icon: g.app.icon,
+          description: g.app.description,
+          descriptors: [g]
+        });
+      } else
+        h.push(g);
+    return { apps: [...f.values()], ungrouped: h };
+  }, [t]), [l, d] = M(null), s = l ? i.find((f) => f.key === l) ?? null : null;
+  re(() => {
+    e || d(null);
+  }, [e]), re(() => {
+    d(null);
+  }, [t]);
+  const u = !s;
+  return /* @__PURE__ */ c.createElement(
+    Ne,
+    {
+      isOpen: e,
+      onClose: o,
+      title: u ? n.addStepTitle : s.label,
+      icon: u ? /* @__PURE__ */ c.createElement(Wn, null) : s.icon ?? /* @__PURE__ */ c.createElement(Gn, null),
+      width: 500
+    },
+    /* @__PURE__ */ c.createElement(Q, { sx: { p: 2 } }, !u && /* @__PURE__ */ c.createElement(
+      "div",
+      {
+        role: "button",
+        tabIndex: 0,
+        onClick: () => d(null),
+        onKeyDown: (f) => {
+          f.key === "Enter" && d(null);
+        },
+        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" }
+      },
+      /* @__PURE__ */ c.createElement($n, { size: 16 }),
+      /* @__PURE__ */ c.createElement("span", null, n.addStepTitle)
+    ), /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted ff-mb-3", style: { fontSize: 13 } }, u ? n.chooseAction : `Pick an action from ${s.label}`), /* @__PURE__ */ c.createElement("div", { className: "ff-d-flex ff-flex-column ff-gap-2" }, u ? /* @__PURE__ */ c.createElement(c.Fragment, null, i.map((f) => /* @__PURE__ */ c.createElement(
+      "div",
+      {
+        key: `app-${f.key}`,
+        className: Ae,
+        style: Le,
+        onClick: () => d(f.key),
+        role: "button",
+        tabIndex: 0,
+        onKeyDown: (h) => {
+          h.key === "Enter" && d(f.key);
+        },
+        onMouseEnter: (h) => {
+          h.currentTarget.style.background = "#f5f5f5";
+        },
+        onMouseLeave: (h) => {
+          h.currentTarget.style.background = "";
+        }
+      },
+      f.icon && /* @__PURE__ */ c.createElement("div", { style: { flexShrink: 0 } }, f.icon),
+      /* @__PURE__ */ c.createElement("div", { style: { flex: 1, minWidth: 0 } }, /* @__PURE__ */ c.createElement("div", { style: { fontSize: 14, fontWeight: 600, color: "#212121" } }, f.label), /* @__PURE__ */ c.createElement("div", { style: { fontSize: 12, color: "#757575", marginTop: 2 } }, f.description ?? `${f.descriptors.length} action${f.descriptors.length === 1 ? "" : "s"}`)),
+      /* @__PURE__ */ c.createElement(Rt, { size: 18, color: "#9e9e9e" })
+    )), a.map((f) => /* @__PURE__ */ c.createElement(
+      "div",
+      {
+        key: f.type,
+        className: Ae,
+        style: Le,
+        onClick: () => r(f),
+        role: "button",
+        tabIndex: 0,
+        onKeyDown: (h) => {
+          h.key === "Enter" && r(f);
+        },
+        onMouseEnter: (h) => {
+          h.currentTarget.style.background = "#f5f5f5";
+        },
+        onMouseLeave: (h) => {
+          h.currentTarget.style.background = "";
+        }
+      },
+      f.icon && /* @__PURE__ */ c.createElement("div", { style: { flexShrink: 0 } }, f.icon),
+      /* @__PURE__ */ c.createElement("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" } }, f.label)
+    )), i.length === 0 && a.length === 0 && /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted ff-text-center", style: { fontSize: 13 } }, n.noActions)) : (
+      /* Stage 2 — actions for the selected app */
+      s.descriptors.map((f) => /* @__PURE__ */ c.createElement(
+        "div",
+        {
+          key: f.type,
+          className: Ae,
+          style: Le,
+          onClick: () => r(f),
+          role: "button",
+          tabIndex: 0,
+          onKeyDown: (h) => {
+            h.key === "Enter" && r(f);
+          },
+          onMouseEnter: (h) => {
+            h.currentTarget.style.background = "#f5f5f5";
+          },
+          onMouseLeave: (h) => {
+            h.currentTarget.style.background = "";
+          }
+        },
+        f.icon && /* @__PURE__ */ c.createElement("div", { style: { flexShrink: 0 } }, f.icon),
+        /* @__PURE__ */ c.createElement("span", { style: { fontSize: 14, fontWeight: 500, color: "#212121" } }, f.label)
+      ))
+    )))
+  );
+}, Mt = "_conditionConfig", zi = ({ open: e, nodeId: t, descriptor: n, initialValues: r, messages: o, onSave: i, onClose: a }) => {
+  const [l, d] = M([]), [s, u] = M(!1), [f, h] = M(null), [g, m] = M({});
+  re(() => {
+    m((r == null ? void 0 : r[Mt]) ?? {});
+  }, [r, t]), re(() => {
+    let T = !1;
+    if (h(null), !n || !t) {
+      d([]), u(!1);
+      return;
+    }
+    const I = n.formSchema;
+    return typeof I == "function" ? (u(!0), I(t).then((O) => {
+      T || (d(O), u(!1));
+    }).catch((O) => {
+      T || (d([]), h(O instanceof Error ? O.message : "Unable to load configuration."), u(!1));
+    })) : (d(I), u(!1)), () => {
+      T = !0;
+    };
+  }, [n, t]);
+  const b = t ? `node-config-form-${t}` : "node-config-form", p = !s && !f && l.length > 0, E = p ? /* @__PURE__ */ c.createElement(c.Fragment, null, /* @__PURE__ */ c.createElement(pt, { type: "button", variant: "outlined", size: "small", onClick: a }, o.cancel), /* @__PURE__ */ c.createElement(pt, { type: "submit", form: b, variant: "contained", size: "small" }, o.save)) : null;
+  return /* @__PURE__ */ c.createElement(
+    Ne,
+    {
+      isOpen: e,
+      onClose: a,
+      title: (n == null ? void 0 : n.label) ?? o.configureStep,
+      icon: n == null ? void 0 : n.icon,
+      width: 500,
+      footer: E
+    },
+    /* @__PURE__ */ c.createElement(Q, { sx: { p: 2 } }, s && /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted", style: { fontSize: 13 } }, o.loadingConfiguration), !s && f && /* @__PURE__ */ c.createElement("p", { style: { fontSize: 13, color: "#d32f2f" } }, f), !s && !f && l.length === 0 && /* @__PURE__ */ c.createElement("p", { className: "ff-text-muted", style: { fontSize: 13 } }, o.noConfigurationNeeded), p && /* @__PURE__ */ c.createElement(
+      nr,
+      {
+        schema: { layout: "flat", fields: l },
+        initialValues: r ?? {},
+        formId: b,
+        conditionConfig: g,
+        onConditionConfigChange: m,
+        onSubmit: (T) => {
+          if (!t) return;
+          const I = Object.keys(g).length > 0;
+          i(t, { ...T, [Mt]: I ? g : void 0 }), a();
+        }
+      }
+    ))
+  );
+}, Ri = ({
+  isOpen: e,
+  onClose: t,
+  workflowId: n,
+  workflowLabel: r,
+  onFetchWorkflow: o
+}) => {
+  const [i, a] = M({ status: "idle" });
+  return re(() => {
+    if (!e || !n) {
+      a({ status: "idle" });
+      return;
+    }
+    a({ status: "loading" }), o(n).then((l) => a({ status: "loaded", state: l })).catch((l) => a({ status: "error", message: (l == null ? void 0 : l.message) ?? "Failed to load workflow" }));
+  }, [e, n, o]), /* @__PURE__ */ c.createElement(
+    Ne,
+    {
+      isOpen: e,
+      onClose: t,
+      title: r ? `Preview: ${r}` : "Sub-Workflow Preview",
+      icon: /* @__PURE__ */ c.createElement(Yn, { size: 18, color: "#00695c" }),
+      width: 700
+    },
+    /* @__PURE__ */ c.createElement("div", { style: { height: "100%", display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", padding: 24 } }, i.status === "idle" && /* @__PURE__ */ c.createElement("span", { style: { color: "#9e9e9e", fontSize: 14 } }, "Select a workflow to preview"), i.status === "loading" && /* @__PURE__ */ c.createElement("div", { style: { textAlign: "center", color: "#9e9e9e" } }, /* @__PURE__ */ c.createElement("div", { style: { width: 32, height: 32, borderRadius: "50%", border: "3px solid #e0e0e0", borderTopColor: "#00897b", animation: "spin 0.8s linear infinite", margin: "0 auto 12px" } }), /* @__PURE__ */ c.createElement("span", { style: { fontSize: 14 } }, "Loading workflow…"), /* @__PURE__ */ c.createElement("style", null, "@keyframes spin { to { transform: rotate(360deg); } }")), i.status === "error" && /* @__PURE__ */ c.createElement("div", { style: { textAlign: "center", color: "#c62828" } }, /* @__PURE__ */ c.createElement(Kn, { size: 32, style: { marginBottom: 8 } }), /* @__PURE__ */ c.createElement("p", { style: { margin: 0, fontSize: 14 } }, i.message)), i.status === "loaded" && /* @__PURE__ */ c.createElement("div", { style: { width: "100%", flex: 1 } }, /* @__PURE__ */ c.createElement(Di, { state: i.state })))
+  );
+}, Di = ({ state: e }) => {
+  const [t, n] = M(null), [r, o] = M(null);
+  return re(() => {
+    Promise.all([
+      Promise.resolve().then(() => Gi).then((i) => i.default),
+      import("./nodeRegistry.js").then((i) => i.nodeTypeRegistry),
+      import("./templateRegistry.js").then((i) => i.templateRegistry)
+    ]).then(([i, a, l]) => {
+      n(() => i), o({ nodeTypeRegistry: a, templateRegistry: l });
+    });
+  }, []), !t || !r ? /* @__PURE__ */ c.createElement("div", { style: { color: "#9e9e9e", fontSize: 13, textAlign: "center" } }, "Loading canvas…") : /* @__PURE__ */ c.createElement("div", { style: { width: "100%", height: 480, border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" } }, /* @__PURE__ */ c.createElement(
+    t,
+    {
+      nodeRegistry: r.nodeTypeRegistry,
+      templateRegistry: r.templateRegistry,
+      initialValue: e,
+      readOnly: !0
+    }
+  ));
+}, ge = 350, We = 70, Ge = 60, $e = {
+  startNode: 40,
+  endNode: 40,
+  addTriggerNode: 56,
+  triggerNode: 110,
+  actionNode: 90,
+  filterNode: 90,
+  approvalNode: 90,
+  delayNode: 80,
+  notificationNode: 80
+}, Li = {
+  plusEdge: Fn,
+  labelPlusEdge: jn,
+  plainEdge: Mn,
+  edgeWithPlusLabel: On,
+  gatewayBranchEdge: In
+};
+function jt() {
+  return [
+    { id: "start", kind: "start", reactFlowType: "startNode" },
+    { id: "addTrigger", kind: "addTrigger", reactFlowType: "addTriggerNode" },
+    { id: "end", kind: "end", reactFlowType: "endNode" }
+  ];
+}
+function Ai(e, t, n, r = "TB") {
+  const o = new Ot.graphlib.Graph();
+  return o.setGraph({ rankdir: r, ranksep: 70, nodesep: 50 }), o.setDefaultEdgeLabel(() => ({})), e.forEach((i) => {
+    const a = n[i.id] ?? { width: ge, height: $e[i.type ?? ""] ?? 80 };
+    o.setNode(i.id, { width: a.width, height: a.height });
+  }), t.forEach((i) => o.setEdge(i.source, i.target)), Ot.layout(o), e.map((i) => {
+    var s, u;
+    const a = o.node(i.id), l = ((s = n[i.id]) == null ? void 0 : s.width) ?? ge, d = ((u = n[i.id]) == null ? void 0 : u.height) ?? $e[i.type ?? ""] ?? 80;
+    return { ...i, position: { x: a.x - l / 2, y: a.y - d / 2 } };
+  });
+}
+const ne = (e) => e === "filter" || e === "approval";
+function Pi(e, t, n, r) {
+  const a = We, l = 30, d = 30, s = {}, u = {}, f = /* @__PURE__ */ new Map();
+  for (const p of e) f.set(p.id, p);
+  for (const p of Object.values(t))
+    for (const E of Object.values(p))
+      for (const T of E) f.set(T.id, T);
+  const h = (p, E, T) => {
+    const I = r[p] ?? { width: ge, height: 80 };
+    return s[p] = { x: E - I.width / 2, y: T }, T + I.height;
+  }, g = (p, E, T) => {
+    let I = T;
+    for (const O of p)
+      I = h(O.id, E, I) + a, ne(O.kind) && t[O.id] && (I = m(O.id, E, I));
+    return I;
+  }, m = (p, E, T) => {
+    const I = E + 180, O = t[p], j = Object.keys(O), A = f.get(p), ee = (A == null ? void 0 : A.branchLabels) ?? { pass: "Pass", fail: "Fail" }, ue = s[p], F = r[p] ?? { height: 80 }, me = ue.y + F.height, be = [];
+    let Y = T;
+    return j.forEach((ie, H) => {
+      const z = O[ie], q = Y;
+      be.push({
+        y: q - me,
+        label: ee[ie] ?? ie,
+        isPass: H === 0
+      }), Y = g(z, I, Y + d), H < j.length - 1 && (Y += l);
+    }), u[p] = {
+      branches: be,
+      height: Y - me,
+      indent: 180
+    }, Y;
+  };
+  let b = Ge;
+  for (const p of e)
+    b = h(p.id, 400, b) + a, ne(p.kind) && t[p.id] && (b = m(p.id, 400, b));
+  return {
+    nodes: n.map((p) => s[p.id] ? { ...p, position: s[p.id] } : p),
+    railSpecs: u
+  };
+}
+function Ft(e) {
+  return {
+    id: e.id,
+    type: e.reactFlowType,
+    position: { x: 0, y: 0 },
+    data: { ...e.nodeData, ...e.formData, descriptorType: e.descriptorType },
+    draggable: !1,
+    selectable: !1
+  };
+}
+function Bi(e, t, n, r, o) {
+  return {
+    id: `e-${e.id}-${t.id}`,
+    source: e.id,
+    target: t.id,
+    type: "plusEdge",
+    style: { stroke: n },
+    data: {
+      onAddStepClick: r,
+      referenceNodeType: e.reactFlowType,
+      ...o ?? {}
+    }
+  };
+}
+function Wi(e, t, n, r, o = {}, i = "TB", a = "horizontal") {
+  const l = o.edgeColor ?? "#b0bec5", d = [], s = [], u = (m, b) => {
+    const p = t[m];
+    if (!p) return;
+    const T = b ?? { pass: "Pass", fail: "Fail" }, I = Object.keys(p), O = (j, A, ee, ue) => {
+      if (j.length !== 0) {
+        j.forEach((F) => d.push(Ft(F))), s.push({
+          id: `e-${m}-${A}-start`,
+          source: m,
+          target: j[0].id,
+          type: "gatewayBranchEdge",
+          style: { stroke: l },
+          data: { branch: A, filterId: m, label: ee, isFirst: ue === 0, onAddStepClick: n, verticalRouting: a === "vertical" }
+        });
+        for (let F = 1; F < j.length; F++)
+          ne(j[F - 1].kind) || s.push(Bi(j[F - 1], j[F], l, n, { filterId: m, branch: A }));
+        for (const F of j)
+          ne(F.kind) && t[F.id] && u(F.id, F.branchLabels);
+      }
+    };
+    I.forEach((j, A) => {
+      O(p[j], j, T[j] ?? j, A);
+    });
+  };
+  for (let m = 0; m < e.length; m++) {
+    const b = e[m];
+    if (d.push(Ft(b)), m > 0) {
+      const p = e[m - 1], E = p.kind === "start" || p.kind === "addTrigger";
+      if (p.kind === "filter" || p.kind === "approval") continue;
+      s.push({
+        id: `e-${p.id}-${b.id}`,
+        source: p.id,
+        target: b.id,
+        type: E ? "plainEdge" : "plusEdge",
+        style: { stroke: l },
+        data: E ? {} : {
+          onAddStepClick: n,
+          referenceNodeType: p.reactFlowType
+        }
+      });
+    }
+    (b.kind === "filter" || b.kind === "approval") && t[b.id] && u(b.id, b.branchLabels);
+  }
+  const f = {};
+  if (d.forEach((m) => {
+    f[m.id] = {
+      width: ge,
+      height: r[m.id] ?? $e[m.type ?? ""] ?? 80
+    };
+  }), !(Object.keys(t).length > 0)) {
+    if (i === "LR") {
+      let T = Ge;
+      return { nodes: d.map((O) => {
+        const j = f[O.id].width, A = f[O.id].height, ee = { ...O, position: { x: T, y: 300 - A / 2 } };
+        return T += j + We, ee;
+      }), edges: s };
+    }
+    const m = 400;
+    let b = Ge;
+    return { nodes: d.map((E) => {
+      const T = f[E.id].height, I = { ...E, position: { x: m - ge / 2, y: b } };
+      return b += T + We, I;
+    }), edges: s };
+  }
+  if (a === "vertical") {
+    const { nodes: m, railSpecs: b } = Pi(e, t, d, f);
+    return { nodes: m.map(
+      (E) => b[E.id] ? { ...E, data: { ...E.data, _branchRail: b[E.id] } } : E
+    ), edges: s };
+  }
+  return { nodes: Ai(d, s, f, i), edges: s };
+}
+const zt = ({
+  nodeRegistry: e,
+  templateRegistry: t,
+  initialValue: n,
+  nodeTypes: r,
+  edgeTypes: o,
+  onSave: i,
+  readOnly: a = !1,
+  theme: l = {},
+  messages: d,
+  canvasOptions: s = {},
+  renderTriggerSelector: u,
+  renderNodePicker: f,
+  renderNodeConfig: h,
+  onNodeClick: g,
+  maxNodes: m,
+  layoutDirection: b = "TB",
+  executionRecord: p,
+  onFetchWorkflow: E
+}) => {
+  const {
+    fitView: T = !0,
+    fitViewPadding: I = 0.3,
+    showControls: O = !0,
+    showMiniMap: j = !1,
+    panOnScroll: A = !0,
+    zoomOnScroll: ee = !1,
+    minZoom: ue = 0.25,
+    maxZoom: F = 2,
+    snapToGrid: me = !1,
+    snapGrid: be = [15, 15],
+    branchLayout: Y = "horizontal",
+    nodeBody: ie = "full"
+  } = s, H = P(() => rr(d), [d]), [z, q] = M(() => (n == null ? void 0 : n.slots) ?? jt()), [K, X] = M(() => (n == null ? void 0 : n.branches) ?? {}), [ae, W] = M(null), [Ce, Xe] = M(null), [le, ye] = M(null), [Se, Je] = M(null), [Ee, Ze] = M(null), [J, Qe] = M(() => {
+    const y = n == null ? void 0 : n.slots.find((v) => v.kind === "triggerFixed"), w = y != null && y.id.startsWith("trigger-") ? y.id.slice(8) : void 0;
+    return w ? t.lookup(w) ?? null : null;
+  }), [et, gn] = M({}), pn = G((y) => {
+    gn(y);
+  }, []), mn = P(() => ({ ...Sn, ...r }), [r]), bn = P(() => ({ ...Li, ...o }), [o]), yn = P(() => {
+    const y = z.filter((v) => v.kind === "userTask").length, w = Object.values(K).flatMap((v) => Object.values(v).flat()).filter((v) => v.kind === "userTask").length;
+    return y + w;
+  }, [z, K]), tt = m ?? (J == null ? void 0 : J.maxTasks), nt = tt !== void 0 && yn >= tt, te = G((y) => {
+    const w = z.find((v) => v.id === y);
+    if (w) return w;
+    for (const v of Object.values(K)) {
+      const N = Object.values(v).flat().find((k) => k.id === y);
+      if (N) return N;
+    }
+    return null;
+  }, [z, K]), Ie = G((y) => {
+    a || (Xe(y), W("nodeConfig"));
+  }, [a]), rt = G((y) => {
+    if (!a) {
+      if (z.some((w) => w.id === y)) {
+        const w = z.find((v) => v.id === y);
+        if ((w == null ? void 0 : w.kind) === "triggerFixed") {
+          q(jt()), X({}), Qe(null);
+          return;
+        }
+        q((v) => {
+          const N = v.filter((k) => k.id !== y);
+          return ne((w == null ? void 0 : w.kind) ?? "") && !N.some((k) => k.kind === "end") ? [...N, { id: "end", kind: "end", reactFlowType: "endNode" }] : N;
+        }), X((v) => {
+          const N = { ...v }, k = (x) => {
+            N[x] && (Object.values(N[x]).flat().filter((_) => ne(_.kind)).forEach((_) => k(_.id)), delete N[x]);
+          };
+          return k(y), N;
+        });
+        return;
+      }
+      X((w) => {
+        const v = (k, x) => {
+          const _ = [];
+          for (const C of k)
+            ne(C.kind) && x[C.id] && (_.push(C.id), Object.values(x[C.id]).forEach((S) => _.push(...v(S, x))));
+          return _;
+        }, N = { ...w };
+        for (const k of Object.keys(N))
+          for (const x of Object.keys(N[k])) {
+            const _ = N[k][x], C = _.findIndex((L) => L.id === y);
+            if (C === -1 || _[C].kind === "end") continue;
+            const S = _[C];
+            let R = _.filter((L) => L.id !== y);
+            return S.kind === "filter" && ((S.id in N ? v([S], N) : []).forEach((D) => delete N[D]), delete N[S.id], R.some((D) => D.kind === "end") || (R = [...R, { id: `end-${k}-${x}`, kind: "end", reactFlowType: "endNode" }])), N[k] = { ...N[k], [x]: R }, N;
+          }
+        return N;
+      });
+    }
+  }, [a, z]), Oe = G(() => {
+    a || W("triggerSelect");
+  }, [a]), ot = G((y, w) => {
+    a || nt || (ye(y), Je(w.filterId && w.branch ? { filterId: w.filterId, branch: w.branch } : null), W("nodePicker"));
+  }, [a, nt]), it = G((y) => {
+    Qe(y), W(null), X({}), q([
+      { id: "start", kind: "start", reactFlowType: "startNode" },
+      {
+        id: `trigger-${y.triggerKey}`,
+        kind: "triggerFixed",
+        reactFlowType: "triggerNode",
+        nodeData: { label: y.label, source: y.source },
+        deletable: !1
+      },
+      { id: "end", kind: "end", reactFlowType: "endNode" }
+    ]);
+  }, []), at = G(() => {
+    const y = e.list();
+    return (J != null && J.availableTasks ? y.filter((v) => J.availableTasks.includes(v.type)) : y).filter((v) => v.maxPerWorkflow === void 0 ? !0 : z.filter((k) => k.descriptorType === v.type).length + Object.values(K).flatMap((k) => Object.values(k).flat()).filter((k) => k.descriptorType === v.type).length < v.maxPerWorkflow);
+  }, [e, J, z, K]), lt = G((y) => {
+    if (!le) return;
+    const w = `${y.type}-${Date.now()}`, v = y.reactFlowType === "filterNode" || y.reactFlowType === "approvalNode" || y.reactFlowType === "conditionBranchNode", N = y.branchLabels ?? { pass: "Pass", fail: "Fail" }, k = {
+      id: w,
+      kind: v ? y.reactFlowType === "approvalNode" ? "approval" : "filter" : "userTask",
+      reactFlowType: y.reactFlowType,
+      descriptorType: y.type,
+      formData: {},
+      nodeData: { title: y.label },
+      deletable: !0,
+      branchLabels: N
+    };
+    if (Se) {
+      const { filterId: x, branch: _ } = Se;
+      X((C) => {
+        const S = [...C[x][_]];
+        if (v) {
+          const Z = S.filter((se) => se.kind !== "end"), ft = Z.findIndex((se) => se.id === le), vn = ft === -1 ? Z.length : ft + 1;
+          return Z.splice(vn, 0, k), {
+            ...C,
+            [x]: { ...C[x], [_]: Z },
+            [w]: Object.fromEntries(
+              Object.keys(N).map((se) => [se, [{ id: `end-${w}-${se}`, kind: "end", reactFlowType: "endNode" }]])
+            )
+          };
+        }
+        const R = S.findIndex((Z) => Z.id === le), L = S.findIndex((Z) => Z.kind === "end"), D = R === -1 ? L === -1 ? S.length : L : R + 1;
+        return S.splice(D, 0, k), { ...C, [x]: { ...C[x], [_]: S } };
+      });
+    } else
+      v ? (q((x) => {
+        const _ = x.findIndex((S) => S.id === le);
+        return [...x.filter((S) => S.kind !== "end").slice(0, _ + 1), k];
+      }), X((x) => ({
+        ...x,
+        [w]: Object.fromEntries(
+          Object.keys(N).map((_) => [_, [{ id: `end-${w}-${_}`, kind: "end", reactFlowType: "endNode" }]])
+        )
+      }))) : q((x) => {
+        const _ = x.findIndex((C) => C.id === le);
+        return _ === -1 ? x : [...x.slice(0, _ + 1), k, ...x.slice(_ + 1)];
+      });
+    ye(null), Je(null), Xe(w), W("nodeConfig");
+  }, [le, Se]), st = G((y, w) => {
+    const v = (k) => {
+      const x = te(y);
+      if ((x == null ? void 0 : x.descriptorType) !== "conditionBranch") return k;
+      const _ = w.branchConfigs ?? [], C = _.map((D) => D.key).filter(Boolean);
+      if (C.length === 0) return k;
+      const S = k[y] ?? {}, R = {};
+      C.forEach((D) => {
+        R[D] = S[D] ?? [{ id: `end-${y}-${D}`, kind: "end", reactFlowType: "endNode" }];
+      });
+      const L = {};
+      return _.forEach((D) => {
+        D.key && (L[D.key] = D.label || D.key);
+      }), { ...k, [y]: R };
+    }, N = (k, x) => {
+      if (k.descriptorType !== "conditionBranch") return { ...k, formData: x };
+      const _ = x.branchConfigs ?? [], C = {};
+      return _.forEach((S) => {
+        S.key && (C[S.key] = S.label || S.key);
+      }), { ...k, formData: x, branchLabels: C };
+    };
+    if (z.some((k) => k.id === y)) {
+      X((k) => {
+        const x = v(k);
+        return q((_) => {
+          const C = _.map((S) => S.id === y ? N(S, w) : S);
+          return i == null || i({ slots: C, branches: x }), C;
+        }), x;
+      });
+      return;
+    }
+    X((k) => {
+      const _ = { ...v(k) };
+      for (const C of Object.keys(_)) {
+        const S = (R) => R.map((L) => L.id === y ? N(L, w) : L);
+        for (const R of Object.keys(_[C]))
+          if (_[C][R].some((L) => L.id === y))
+            return _[C] = { ..._[C], [R]: S(_[C][R]) }, i == null || i({ slots: z, branches: _ }), _;
+      }
+      return _;
+    });
+  }, [z, K, te, i]), U = P(() => te(Ce ?? ""), [te, Ce]), dt = P(() => U != null && U.descriptorType ? e.forType(U.descriptorType) ?? null : null, [U, e]), { nodes: ct, edges: En } = P(
+    () => Wi(z, K, a ? null : ot, et, l, b, Y),
+    [z, K, a, ot, et, l, b, Y]
+  ), ut = P(() => {
+    const y = p ? new Map(p.steps.map((w) => [w.nodeId, w])) : null;
+    return ct.map((w) => {
+      let v = {};
+      if (y) {
+        const N = y.get(w.id);
+        N && (v = { _executionStatus: N.status, _executionError: N.error });
+      }
+      return w.type === "subWorkflowNode" && E && (v.onPreview = (N) => {
+        var x;
+        const k = te(w.id);
+        Ze({ workflowId: N, workflowLabel: ((x = k == null ? void 0 : k.formData) == null ? void 0 : x.workflowLabel) ?? void 0 });
+      }), Object.keys(v).length > 0 ? { ...w, data: { ...w.data, ...v } } : w;
+    });
+  }, [ct, p, E, te]), wn = P(() => ({ onEditNode: Ie, onDeleteNode: rt, onAddStep: () => {
+  }, onClickAddTrigger: Oe, messages: H, nodeRegistry: e, nodeBody: ie }), [Ie, rt, Oe, H, e, ie]);
+  return /* @__PURE__ */ c.createElement(zn.Provider, { value: wn }, /* @__PURE__ */ c.createElement(
+    "div",
+    {
+      style: {
+        width: "100%",
+        height: "100%",
+        position: "relative",
+        // CSS variable consumed by edge SCSS for primary/hover color
+        "--ff-primary": l.primaryColor ?? "#1dbf60",
+        "--ff-edge-color": l.edgeColor ?? "#b0bec5",
+        "--ff-text": l.textColor ?? "#212121",
+        "--ff-muted": l.mutedTextColor ?? "#9ca3af",
+        "--ff-surface": l.surfaceColor ?? "#fff",
+        "--ff-border": l.borderColor ?? "#dee2e6",
+        "--ff-danger": l.dangerColor ?? "#d32f2f",
+        "--ff-radius": `${l.borderRadius ?? 6}px`,
+        "--ff-font-family": l.fontFamily
+      }
+    },
+    /* @__PURE__ */ c.createElement(
+      kn,
+      {
+        nodes: ut,
+        edges: En,
+        nodeTypes: mn,
+        edgeTypes: bn,
+        fitView: T,
+        fitViewOptions: { padding: I },
+        nodesDraggable: !1,
+        nodesConnectable: !1,
+        panOnScroll: A,
+        zoomOnScroll: ee,
+        minZoom: ue,
+        maxZoom: F,
+        snapToGrid: me,
+        snapGrid: be,
+        proOptions: { hideAttribution: !0 },
+        onNodeClick: (y, w) => {
+          const v = te(w.id);
+          v && (g != null && g(v) || (v.kind === "addTrigger" || v.kind === "triggerFixed" ? Oe() : (v.kind === "userTask" || v.kind === "filter" || v.kind === "approval") && Ie(w.id)));
+        }
+      },
+      l.background !== "none" && /* @__PURE__ */ c.createElement(
+        Tn,
+        {
+          variant: l.background,
+          color: l.backgroundColor ?? "#e0e0e0",
+          gap: 20
+        }
+      ),
+      O && /* @__PURE__ */ c.createElement(Nn, { showInteractive: !1 }),
+      j && /* @__PURE__ */ c.createElement(Cn, { zoomable: !0, pannable: !0 }),
+      /* @__PURE__ */ c.createElement(Mi, { onHeightsReady: pn, nodeCount: ut.length })
+    ),
+    u ? ae === "triggerSelect" && u(t.list(), it, () => W(null)) : /* @__PURE__ */ c.createElement(ji, { open: ae === "triggerSelect", templates: t.list(), messages: H, onSelect: it, onClose: () => W(null) }),
+    f ? ae === "nodePicker" && f(at(), lt, () => {
+      W(null), ye(null);
+    }) : /* @__PURE__ */ c.createElement(Fi, { open: ae === "nodePicker", availableDescriptors: at(), messages: H, onSelect: lt, onClose: () => {
+      W(null), ye(null);
+    } }),
+    h ? ae === "nodeConfig" && h(dt ?? void 0, U, st, () => W(null)) : /* @__PURE__ */ c.createElement(zi, { open: ae === "nodeConfig", nodeId: Ce, descriptor: dt, initialValues: U == null ? void 0 : U.formData, messages: H, onSave: st, onClose: () => W(null) }),
+    E && Ee && /* @__PURE__ */ c.createElement(
+      Ri,
+      {
+        isOpen: !!Ee,
+        onClose: () => Ze(null),
+        workflowId: Ee.workflowId,
+        workflowLabel: Ee.workflowLabel,
+        onFetchWorkflow: E
+      }
+    )
+  ));
+}, Gi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  WorkflowCanvas: zt,
+  default: zt
+}, Symbol.toStringTag, { value: "Module" })), Pe = "All";
+function $i({ template: e, onSelect: t }) {
+  var o, i;
+  const n = e.triggerCategory ? or[e.triggerCategory] : null, r = ((o = e.skeletonState) == null ? void 0 : o.slots.filter((a) => a.kind === "userTask").length) ?? 0;
+  return /* @__PURE__ */ c.createElement(
+    "div",
+    {
+      role: "button",
+      tabIndex: 0,
+      onClick: t,
+      onKeyDown: (a) => {
+        (a.key === "Enter" || a.key === " ") && t();
+      },
+      style: {
+        border: "1.5px solid #e0e0e0",
+        borderRadius: 10,
+        padding: "16px",
+        background: "#fff",
+        cursor: "pointer",
+        transition: "border-color 0.15s, box-shadow 0.15s",
+        display: "flex",
+        flexDirection: "column",
+        gap: 8,
+        outline: "none"
+      },
+      onMouseEnter: (a) => {
+        a.currentTarget.style.borderColor = "#1976d2", a.currentTarget.style.boxShadow = "0 2px 8px rgba(25,118,210,0.12)";
+      },
+      onMouseLeave: (a) => {
+        a.currentTarget.style.borderColor = "#e0e0e0", a.currentTarget.style.boxShadow = "none";
+      }
+    },
+    /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "flex-start", gap: 10 } }, e.icon && /* @__PURE__ */ c.createElement("div", { style: { flexShrink: 0, width: 36, height: 36, borderRadius: 8, background: "#f5f5f5", display: "flex", alignItems: "center", justifyContent: "center" } }, e.icon), /* @__PURE__ */ c.createElement("div", { style: { flex: 1, minWidth: 0 } }, /* @__PURE__ */ c.createElement("div", { style: { fontWeight: 600, fontSize: 14, color: "#212121", marginBottom: 2 } }, e.label), e.description && /* @__PURE__ */ c.createElement("div", { style: { fontSize: 12, color: "#757575", lineHeight: 1.4, display: "-webkit-box", WebkitLineClamp: 2, WebkitBoxOrient: "vertical", overflow: "hidden" } }, e.description))),
+    /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "center", flexWrap: "wrap", gap: 4 } }, n && /* @__PURE__ */ c.createElement("span", { style: { fontSize: 10, fontWeight: 600, padding: "2px 7px", borderRadius: 10, background: n.bg, color: n.color } }, n.label), (i = e.tags) == null ? void 0 : i.map((a) => /* @__PURE__ */ c.createElement("span", { key: a, style: { fontSize: 10, padding: "2px 7px", borderRadius: 10, background: "#f5f5f5", color: "#616161" } }, a)), r > 0 && /* @__PURE__ */ c.createElement("span", { style: { fontSize: 10, color: "#9e9e9e", marginLeft: "auto" } }, r, " step", r !== 1 ? "s" : "")),
+    e.author && /* @__PURE__ */ c.createElement("div", { style: { fontSize: 11, color: "#bdbdbd" } }, "by ", e.author)
+  );
+}
+const oa = ({
+  templates: e,
+  onSelectTemplate: t,
+  onStartFromScratch: n
+}) => {
+  const [r, o] = M(""), [i, a] = M(Pe), l = P(() => {
+    const s = /* @__PURE__ */ new Set();
+    return e.forEach((u) => {
+      u.category && s.add(u.category);
+    }), [Pe, ...Array.from(s)];
+  }, [e]), d = P(() => {
+    let s = e;
+    if (i !== Pe && (s = s.filter((u) => u.category === i)), r.trim()) {
+      const u = r.toLowerCase();
+      s = s.filter(
+        (f) => {
+          var h, g;
+          return f.label.toLowerCase().includes(u) || ((h = f.description) == null ? void 0 : h.toLowerCase().includes(u)) || ((g = f.tags) == null ? void 0 : g.some((m) => m.toLowerCase().includes(u)));
+        }
+      );
+    }
+    return [...s].sort((u, f) => (f.popularity ?? 0) - (u.popularity ?? 0));
+  }, [e, i, r]);
+  return /* @__PURE__ */ c.createElement("div", { style: { display: "flex", flexDirection: "column", height: "100%", fontFamily: "inherit" } }, /* @__PURE__ */ c.createElement("div", { style: { padding: "24px 24px 0", borderBottom: "1px solid #f0f0f0", paddingBottom: 16 } }, /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "center", justifyContent: "space-between", marginBottom: 16 } }, /* @__PURE__ */ c.createElement("div", null, /* @__PURE__ */ c.createElement("h2", { style: { margin: 0, fontSize: 20, fontWeight: 700, color: "#212121" } }, "Workflow Templates"), /* @__PURE__ */ c.createElement("p", { style: { margin: "4px 0 0", fontSize: 13, color: "#757575" } }, "Choose a pre-built template or start from scratch")), n && /* @__PURE__ */ c.createElement(
+    "button",
+    {
+      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" }
+    },
+    /* @__PURE__ */ c.createElement(Un, { size: 16 }),
+    "Start from Scratch"
+  )), /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "center", gap: 8, background: "#f5f5f5", borderRadius: 8, padding: "8px 12px", marginBottom: 12 } }, /* @__PURE__ */ c.createElement(Vn, { size: 18, color: "#9e9e9e" }), /* @__PURE__ */ c.createElement(
+    "input",
+    {
+      value: r,
+      onChange: (s) => o(s.target.value),
+      placeholder: "Search templates...",
+      style: { border: "none", background: "transparent", outline: "none", fontSize: 14, color: "#212121", flex: 1 }
+    }
+  )), l.length > 1 && /* @__PURE__ */ c.createElement("div", { style: { display: "flex", gap: 4, flexWrap: "wrap" } }, l.map((s) => /* @__PURE__ */ c.createElement(
+    "button",
+    {
+      key: s,
+      onClick: () => a(s),
+      style: {
+        padding: "4px 12px",
+        borderRadius: 20,
+        border: "1.5px solid",
+        borderColor: i === s ? "#1976d2" : "#e0e0e0",
+        background: i === s ? "#e3f2fd" : "#fff",
+        color: i === s ? "#1565c0" : "#616161",
+        fontSize: 12,
+        fontWeight: i === s ? 600 : 400,
+        cursor: "pointer"
+      }
+    },
+    s
+  )))), /* @__PURE__ */ c.createElement("div", { style: { flex: 1, overflowY: "auto", padding: 24 } }, d.length === 0 ? /* @__PURE__ */ c.createElement("div", { style: { textAlign: "center", padding: "40px 0", color: "#9e9e9e" } }, /* @__PURE__ */ c.createElement(Hn, { size: 36, style: { marginBottom: 8 } }), /* @__PURE__ */ c.createElement("p", { style: { margin: 0, fontSize: 14 } }, "No templates found")) : /* @__PURE__ */ c.createElement("div", { style: { display: "grid", gridTemplateColumns: "repeat(auto-fill, minmax(280px, 1fr))", gap: 16 } }, d.map((s) => /* @__PURE__ */ c.createElement($i, { key: s.triggerKey, template: s, onSelect: () => t(s) })))));
+}, we = {
+  running: { label: "Running", color: V.running, icon: c.createElement(Pt, { size: 14 }) },
+  success: { label: "Success", color: V.success, icon: c.createElement(At, { size: 14 }) },
+  failed: { label: "Failed", color: V.failed, icon: c.createElement(Lt, { size: 14 }) },
+  cancelled: { label: "Cancelled", color: V.cancelled, icon: c.createElement(Dt, { size: 14 }) }
+}, Yi = {
+  pending: { color: V.pending, icon: c.createElement(qn, { size: 14 }) },
+  running: { color: V.running, icon: c.createElement(Pt, { size: 14 }) },
+  success: { color: V.success, icon: c.createElement(At, { size: 14 }) },
+  failed: { color: V.failed, icon: c.createElement(Lt, { size: 14 }) },
+  skipped: { color: V.skipped, icon: c.createElement(Dt, { size: 14 }) }
+};
+function Ye(e) {
+  try {
+    return new Date(e).toLocaleString();
+  } catch {
+    return e;
+  }
+}
+function hn(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`;
+  } catch {
+    return "—";
+  }
+}
+function Ki({ step: e }) {
+  const [t, n] = M(!1), r = Yi[e.status], o = !!(e.inputs || e.outputs || e.error);
+  return /* @__PURE__ */ c.createElement("div", { style: { borderBottom: "1px solid #f5f5f5" } }, /* @__PURE__ */ c.createElement(
+    "div",
+    {
+      style: { display: "flex", alignItems: "center", gap: 8, padding: "8px 12px", cursor: o ? "pointer" : "default" },
+      onClick: () => {
+        o && n((i) => !i);
+      },
+      role: o ? "button" : void 0,
+      tabIndex: o ? 0 : void 0,
+      onKeyDown: (i) => {
+        o && (i.key === "Enter" || i.key === " ") && n((a) => !a);
+      }
+    },
+    /* @__PURE__ */ c.createElement("span", { style: { color: r.color, flexShrink: 0 } }, c.cloneElement(r.icon, { color: r.color })),
+    /* @__PURE__ */ c.createElement("span", { style: { flex: 1, fontSize: 13, color: "#212121" } }, e.label || e.nodeId),
+    e.branchTaken && /* @__PURE__ */ c.createElement("span", { style: { fontSize: 10, padding: "1px 6px", borderRadius: 10, background: "#e3f2fd", color: "#1565c0", fontWeight: 600 } }, e.branchTaken),
+    /* @__PURE__ */ c.createElement("span", { style: { fontSize: 11, color: "#9e9e9e", flexShrink: 0 } }, e.startedAt ? hn(e.startedAt, e.completedAt) : "—"),
+    o && /* @__PURE__ */ c.createElement("span", { style: { color: "#9e9e9e", flexShrink: 0 } }, t ? c.createElement(Jn, { size: 16 }) : c.createElement(Zn, { size: 16 }))
+  ), t && o && /* @__PURE__ */ c.createElement("div", { style: { padding: "0 12px 10px 32px", fontSize: 12 } }, e.error && /* @__PURE__ */ c.createElement("div", { style: { padding: "6px 10px", borderRadius: 6, background: "#ffebee", color: "#c62828", marginBottom: 6 } }, e.error), e.inputs && Object.keys(e.inputs).length > 0 && /* @__PURE__ */ c.createElement("details", { style: { marginBottom: 4 } }, /* @__PURE__ */ c.createElement("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 } }, "Inputs"), /* @__PURE__ */ c.createElement("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" } }, JSON.stringify(e.inputs, null, 2))), e.outputs && Object.keys(e.outputs).length > 0 && /* @__PURE__ */ c.createElement("details", null, /* @__PURE__ */ c.createElement("summary", { style: { cursor: "pointer", color: "#616161", marginBottom: 4 } }, "Outputs"), /* @__PURE__ */ c.createElement("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 8, borderRadius: 4, overflowX: "auto" } }, JSON.stringify(e.outputs, null, 2)))));
+}
+function Ui({ record: e, selected: t, onSelect: n }) {
+  const r = we[e.status];
+  return /* @__PURE__ */ c.createElement(
+    "div",
+    {
+      role: "button",
+      tabIndex: 0,
+      onClick: n,
+      onKeyDown: (o) => {
+        (o.key === "Enter" || o.key === " ") && n();
+      },
+      style: {
+        padding: "10px 14px",
+        borderBottom: "1px solid #f0f0f0",
+        cursor: "pointer",
+        background: t ? "#e3f2fd" : "#fff",
+        display: "flex",
+        alignItems: "center",
+        gap: 10,
+        outline: "none"
+      }
+    },
+    /* @__PURE__ */ c.createElement("span", { style: { color: r.color, flexShrink: 0 } }, c.cloneElement(r.icon, { color: r.color, size: 16 })),
+    /* @__PURE__ */ c.createElement("div", { style: { flex: 1, minWidth: 0 } }, /* @__PURE__ */ c.createElement("div", { style: { fontSize: 12, color: "#212121", fontWeight: t ? 600 : 400, whiteSpace: "nowrap", overflow: "hidden", textOverflow: "ellipsis" } }, Ye(e.triggeredAt)), /* @__PURE__ */ c.createElement("div", { style: { fontSize: 11, color: "#9e9e9e" } }, e.triggeredBy ? `by ${e.triggeredBy}` : "System", " · ", e.steps.length, " step", e.steps.length !== 1 ? "s" : "")),
+    /* @__PURE__ */ c.createElement("span", { style: { fontSize: 11, fontWeight: 600, color: r.color, flexShrink: 0 } }, r.label),
+    /* @__PURE__ */ c.createElement(Rt, { size: 14, color: "#bdbdbd" })
+  );
+}
+const ia = ({ records: e, onViewOnCanvas: t }) => {
+  var a;
+  const [n, r] = M(((a = e[0]) == null ? void 0 : a.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__ */ c.createElement("div", { style: { display: "flex", flexDirection: "column", alignItems: "center", justifyContent: "center", height: 300, color: "#9e9e9e", gap: 8 } }, /* @__PURE__ */ c.createElement(mt, { size: 36 }), /* @__PURE__ */ c.createElement("p", { style: { margin: 0, fontSize: 14 } }, "No executions yet"), /* @__PURE__ */ c.createElement("p", { style: { margin: 0, fontSize: 12 } }, "Run history will appear here")) : /* @__PURE__ */ c.createElement("div", { style: { display: "flex", height: "100%", fontFamily: "inherit", border: "1px solid #e0e0e0", borderRadius: 8, overflow: "hidden" } }, /* @__PURE__ */ c.createElement("div", { style: { width: 260, flexShrink: 0, borderRight: "1px solid #e0e0e0", overflowY: "auto", background: "#fafafa" } }, /* @__PURE__ */ c.createElement("div", { style: { padding: "12px 14px", borderBottom: "1px solid #e0e0e0", fontWeight: 600, fontSize: 13, color: "#212121" } }, "Run History (", e.length, ")"), i.map((l) => /* @__PURE__ */ c.createElement(Ui, { key: l.id, record: l, selected: l.id === n, onSelect: () => r(l.id) }))), /* @__PURE__ */ c.createElement("div", { style: { flex: 1, overflowY: "auto" } }, o ? /* @__PURE__ */ c.createElement("div", null, /* @__PURE__ */ c.createElement("div", { style: { padding: "16px 20px", borderBottom: "1px solid #f0f0f0", display: "flex", alignItems: "flex-start", justifyContent: "space-between", gap: 12 } }, /* @__PURE__ */ c.createElement("div", null, /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "center", gap: 8, marginBottom: 4 } }, c.cloneElement(we[o.status].icon, { color: we[o.status].color, size: 18 }), /* @__PURE__ */ c.createElement("span", { style: { fontWeight: 700, fontSize: 15, color: "#212121" } }, we[o.status].label)), /* @__PURE__ */ c.createElement("div", { style: { fontSize: 12, color: "#757575", display: "flex", flexDirection: "column", gap: 2 } }, /* @__PURE__ */ c.createElement("span", { style: { display: "flex", alignItems: "center", gap: 4 } }, /* @__PURE__ */ c.createElement(mt, { size: 13 }), " ", Ye(o.triggeredAt), o.completedAt && ` → ${Ye(o.completedAt)} (${hn(o.triggeredAt, o.completedAt)})`), o.triggeredBy && /* @__PURE__ */ c.createElement("span", { style: { display: "flex", alignItems: "center", gap: 4 } }, /* @__PURE__ */ c.createElement(Xn, { size: 13 }), " ", o.triggeredBy))), t && /* @__PURE__ */ c.createElement(
+    "button",
+    {
+      onClick: () => t(o),
+      style: { padding: "6px 12px", border: "1.5px solid #1976d2", borderRadius: 6, background: "#fff", color: "#1976d2", fontSize: 12, fontWeight: 600, cursor: "pointer", flexShrink: 0 }
+    },
+    "View on Canvas"
+  )), o.error && /* @__PURE__ */ c.createElement("div", { style: { margin: "12px 16px", padding: "10px 14px", borderRadius: 6, background: "#ffebee", color: "#c62828", fontSize: 13 } }, o.error), /* @__PURE__ */ c.createElement("div", null, /* @__PURE__ */ c.createElement("div", { style: { padding: "10px 12px", fontSize: 12, fontWeight: 600, color: "#757575", borderBottom: "1px solid #f0f0f0" } }, "STEPS (", o.steps.length, ")"), o.steps.map((l, d) => /* @__PURE__ */ c.createElement(Ki, { key: `${l.nodeId}-${d}`, step: l }))), o.inputs && Object.keys(o.inputs).length > 0 && /* @__PURE__ */ c.createElement("div", { style: { padding: "10px 16px" } }, /* @__PURE__ */ c.createElement("details", null, /* @__PURE__ */ c.createElement("summary", { style: { cursor: "pointer", fontSize: 12, fontWeight: 600, color: "#757575", marginBottom: 6 } }, "TRIGGER INPUTS"), /* @__PURE__ */ c.createElement("pre", { style: { margin: 0, fontSize: 11, background: "#f5f5f5", padding: 10, borderRadius: 4, overflowX: "auto" } }, JSON.stringify(o.inputs, null, 2))))) : /* @__PURE__ */ c.createElement("div", { style: { display: "flex", alignItems: "center", justifyContent: "center", height: "100%", color: "#9e9e9e", fontSize: 14 } }, "Select a run to see details")));
+}, aa = {
+  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" } },
+    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Welcome Email", nodeData: { title: "Welcome Email" } },
+    { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Manager Approval", branchLabels: { pass: "Approved", fail: "Rejected" } },
+    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
+  ],
+  branches: {
+    "approval-1": {
+      pass: [{ id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Approval Confirmed", nodeData: { title: "Approval Confirmed" } }],
+      fail: [{ id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Rejection Notice", nodeData: { title: "Rejection Notice" } }]
+    }
+  }
+}, la = {
+  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" } },
+    { id: "approval-1", kind: "approval", reactFlowType: "approvalNode", descriptorType: "approval", deletable: !0, label: "Access Approval", branchLabels: { pass: "Approved", fail: "Denied" } },
+    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
+  ],
+  branches: {
+    "approval-1": {
+      pass: [
+        { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Provision Access", nodeData: { title: "Provision Access" } },
+        { id: "notification-pass-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Granted Email", nodeData: { title: "Access Granted Email" } }
+      ],
+      fail: [
+        { id: "notification-fail-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Access Denied Email", nodeData: { title: "Access Denied Email" } }
+      ]
+    }
+  }
+}, sa = {
+  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" } },
+    { id: "delay-1", kind: "userTask", reactFlowType: "delayNode", descriptorType: "delay", deletable: !0, label: "Grace Period", nodeData: { title: "Grace Period", duration: 7, unit: "days" }, formData: { duration: 7, unit: "days" } },
+    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify IT Team", nodeData: { title: "Notify IT Team" } },
+    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
+  ],
+  branches: {}
+}, da = {
+  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" } },
+    { id: "restApi-1", kind: "userTask", reactFlowType: "restApiNode", descriptorType: "restApi", deletable: !0, label: "Call External API", nodeData: { title: "Call External API" } },
+    { id: "notification-1", kind: "userTask", reactFlowType: "notificationNode", descriptorType: "notification", deletable: !0, label: "Notify on Completion", nodeData: { title: "Notify on Completion" } },
+    { id: "end", kind: "end", reactFlowType: "endNode", deletable: !1 }
+  ],
+  branches: {}
+};
+export {
+  zt as F,
+  Ri as S,
+  ia as W,
+  oa as a,
+  la as b,
+  sa as o,
+  aa as u,
+  da as w
+};