@draftably/editor 0.0.0-stage → 0.1.0

package/dist/chunks/dagre-NK4GIZVX-Cz37yPrT.js

@@ -0,0 +1,2157 @@
+import { s as ce, a as Wn, c as qn, b as Hn, f as Te, e as T, i as zn } from "./chunk-ZCHMQSOR-BALpdc3g.js";
+import { _ as x, c as Jn, l as m, bB as Kn, bC as Zn, aD as Qn, aC as Se, an as Ce, al as er, az as nr, b8 as rr } from "./mermaid.core-DXv6D2Sm.js";
+import { i as U, a as O, d as Ie, e as H, b as z, c as tn, f as le, g as an, h as tr, j as on, s as ar, o as ir, k as or, l as he, m as sr, r as dr, U as Re, S as ke, n as pe, p as ge, q as V, t as sn, u as dn, v as ur, w as I, x as fr, y as cr, z as lr, A as _e, B as hr, C as un, D as _, E as pr, F as gr, H as vr, I as X, J as fn, K as cn, L as br, M as ve, N as ln, O as wr, P as hn, Q as mr, R as yr, G as N, T as l, V as xr, W as L, X as $, Y as R, Z as J } from "./graph-CKJmgLki.js";
+var Er = /\s/;
+function Lr(e) {
+  for (var n = e.length; n-- && Er.test(e.charAt(n)); )
+    ;
+  return n;
+}
+var Or = /^\s+/;
+function Nr(e) {
+  return e && e.slice(0, Lr(e) + 1).replace(Or, "");
+}
+var Me = NaN, Pr = /^[-+]0x[0-9a-f]+$/i, Tr = /^0b[01]+$/i, Sr = /^0o[0-7]+$/i, Cr = parseInt;
+function Ir(e) {
+  if (typeof e == "number")
+    return e;
+  if (U(e))
+    return Me;
+  if (O(e)) {
+    var n = typeof e.valueOf == "function" ? e.valueOf() : e;
+    e = O(n) ? n + "" : n;
+  }
+  if (typeof e != "string")
+    return e === 0 ? e : +e;
+  e = Nr(e);
+  var r = Tr.test(e);
+  return r || Sr.test(e) ? Cr(e.slice(2), r ? 2 : 8) : Pr.test(e) ? Me : +e;
+}
+var Ae = 1 / 0, Rr = 17976931348623157e292;
+function G(e) {
+  if (!e)
+    return e === 0 ? e : 0;
+  if (e = Ir(e), e === Ae || e === -Ae) {
+    var n = e < 0 ? -1 : 1;
+    return n * Rr;
+  }
+  return e === e ? e : 0;
+}
+function kr(e) {
+  var n = G(e), r = n % 1;
+  return n === n ? r ? n - r : n : 0;
+}
+var je = Object.create, _r = /* @__PURE__ */ (function() {
+  function e() {
+  }
+  return function(n) {
+    if (!O(n))
+      return {};
+    if (je)
+      return je(n);
+    e.prototype = n;
+    var r = new e();
+    return e.prototype = void 0, r;
+  };
+})();
+function Mr(e, n) {
+  var r = -1, t = e.length;
+  for (n || (n = Array(t)); ++r < t; )
+    n[r] = e[r];
+  return n;
+}
+function K(e, n, r) {
+  n == "__proto__" && Ie ? Ie(e, n, {
+    configurable: !0,
+    enumerable: !0,
+    value: r,
+    writable: !0
+  }) : e[n] = r;
+}
+var Ar = Object.prototype, jr = Ar.hasOwnProperty;
+function Z(e, n, r) {
+  var t = e[n];
+  (!(jr.call(e, n) && H(t, r)) || r === void 0 && !(n in e)) && K(e, n, r);
+}
+function Dr(e, n, r, t) {
+  var a = !r;
+  r || (r = {});
+  for (var o = -1, i = n.length; ++o < i; ) {
+    var s = n[o], d = void 0;
+    d === void 0 && (d = e[s]), a ? K(r, s, d) : Z(r, s, d);
+  }
+  return r;
+}
+function j(e, n, r) {
+  if (!O(r))
+    return !1;
+  var t = typeof n;
+  return (t == "number" ? z(r) && tn(n, r.length) : t == "string" && n in r) ? H(r[n], e) : !1;
+}
+function Br(e) {
+  return le(function(n, r) {
+    var t = -1, a = r.length, o = a > 1 ? r[a - 1] : void 0, i = a > 2 ? r[2] : void 0;
+    for (o = e.length > 3 && typeof o == "function" ? (a--, o) : void 0, i && j(r[0], r[1], i) && (o = a < 3 ? void 0 : o, a = 1), n = Object(n); ++t < a; ) {
+      var s = r[t];
+      s && e(n, s, t, o);
+    }
+    return n;
+  });
+}
+function $r(e) {
+  var n = [];
+  if (e != null)
+    for (var r in Object(e))
+      n.push(r);
+  return n;
+}
+var Fr = Object.prototype, Xr = Fr.hasOwnProperty;
+function Gr(e) {
+  if (!O(e))
+    return $r(e);
+  var n = an(e), r = [];
+  for (var t in e)
+    t == "constructor" && (n || !Xr.call(e, t)) || r.push(t);
+  return r;
+}
+function Q(e) {
+  return z(e) ? tr(e, !0) : Gr(e);
+}
+function M(e) {
+  var n = e == null ? 0 : e.length;
+  return n ? on(e) : [];
+}
+function Yr(e) {
+  return ar(ir(e, void 0, M), e + "");
+}
+var pn = or(Object.getPrototypeOf, Object), Ur = "[object Object]", Vr = Function.prototype, Wr = Object.prototype, gn = Vr.toString, qr = Wr.hasOwnProperty, Hr = gn.call(Object);
+function zr(e) {
+  if (!he(e) || sr(e) != Ur)
+    return !1;
+  var n = pn(e);
+  if (n === null)
+    return !0;
+  var r = qr.call(n, "constructor") && n.constructor;
+  return typeof r == "function" && r instanceof r && gn.call(r) == Hr;
+}
+var vn = typeof exports == "object" && exports && !exports.nodeType && exports, De = vn && typeof module == "object" && module && !module.nodeType && module, Jr = De && De.exports === vn, Be = Jr ? dr.Buffer : void 0, $e = Be ? Be.allocUnsafe : void 0;
+function bn(e, n) {
+  if (n)
+    return e.slice();
+  var r = e.length, t = $e ? $e(r) : new e.constructor(r);
+  return e.copy(t), t;
+}
+var Kr = Object.prototype, Zr = Kr.hasOwnProperty;
+function Qr(e) {
+  var n = e.length, r = new e.constructor(n);
+  return n && typeof e[0] == "string" && Zr.call(e, "index") && (r.index = e.index, r.input = e.input), r;
+}
+function be(e) {
+  var n = new e.constructor(e.byteLength);
+  return new Re(n).set(new Re(e)), n;
+}
+function et(e, n) {
+  var r = be(e.buffer);
+  return new e.constructor(r, e.byteOffset, e.byteLength);
+}
+var nt = /\w*$/;
+function rt(e) {
+  var n = new e.constructor(e.source, nt.exec(e));
+  return n.lastIndex = e.lastIndex, n;
+}
+var Fe = ke ? ke.prototype : void 0, Xe = Fe ? Fe.valueOf : void 0;
+function tt(e) {
+  return Xe ? Object(Xe.call(e)) : {};
+}
+function wn(e, n) {
+  var r = n ? be(e.buffer) : e.buffer;
+  return new e.constructor(r, e.byteOffset, e.length);
+}
+var at = "[object Boolean]", it = "[object Date]", ot = "[object Map]", st = "[object Number]", dt = "[object RegExp]", ut = "[object Set]", ft = "[object String]", ct = "[object Symbol]", lt = "[object ArrayBuffer]", ht = "[object DataView]", pt = "[object Float32Array]", gt = "[object Float64Array]", vt = "[object Int8Array]", bt = "[object Int16Array]", wt = "[object Int32Array]", mt = "[object Uint8Array]", yt = "[object Uint8ClampedArray]", xt = "[object Uint16Array]", Et = "[object Uint32Array]";
+function Lt(e, n, r) {
+  var t = e.constructor;
+  switch (n) {
+    case lt:
+      return be(e);
+    case at:
+    case it:
+      return new t(+e);
+    case ht:
+      return et(e);
+    case pt:
+    case gt:
+    case vt:
+    case bt:
+    case wt:
+    case mt:
+    case yt:
+    case xt:
+    case Et:
+      return wn(e, r);
+    case ot:
+      return new t();
+    case st:
+    case ft:
+      return new t(e);
+    case dt:
+      return rt(e);
+    case ut:
+      return new t();
+    case ct:
+      return tt(e);
+  }
+}
+function mn(e) {
+  return typeof e.constructor == "function" && !an(e) ? _r(pn(e)) : {};
+}
+var Ot = "[object Map]";
+function Nt(e) {
+  return he(e) && pe(e) == Ot;
+}
+var Ge = V && V.isMap, Pt = Ge ? ge(Ge) : Nt, Tt = "[object Set]";
+function St(e) {
+  return he(e) && pe(e) == Tt;
+}
+var Ye = V && V.isSet, Ct = Ye ? ge(Ye) : St, It = 1, yn = "[object Arguments]", Rt = "[object Array]", kt = "[object Boolean]", _t = "[object Date]", Mt = "[object Error]", xn = "[object Function]", At = "[object GeneratorFunction]", jt = "[object Map]", Dt = "[object Number]", En = "[object Object]", Bt = "[object RegExp]", $t = "[object Set]", Ft = "[object String]", Xt = "[object Symbol]", Gt = "[object WeakMap]", Yt = "[object ArrayBuffer]", Ut = "[object DataView]", Vt = "[object Float32Array]", Wt = "[object Float64Array]", qt = "[object Int8Array]", Ht = "[object Int16Array]", zt = "[object Int32Array]", Jt = "[object Uint8Array]", Kt = "[object Uint8ClampedArray]", Zt = "[object Uint16Array]", Qt = "[object Uint32Array]", y = {};
+y[yn] = y[Rt] = y[Yt] = y[Ut] = y[kt] = y[_t] = y[Vt] = y[Wt] = y[qt] = y[Ht] = y[zt] = y[jt] = y[Dt] = y[En] = y[Bt] = y[$t] = y[Ft] = y[Xt] = y[Jt] = y[Kt] = y[Zt] = y[Qt] = !0;
+y[Mt] = y[xn] = y[Gt] = !1;
+function Y(e, n, r, t, a, o) {
+  var i, s = n & It;
+  if (i !== void 0)
+    return i;
+  if (!O(e))
+    return e;
+  var d = I(e);
+  if (d)
+    i = Qr(e);
+  else {
+    var u = pe(e), f = u == xn || u == At;
+    if (sn(e))
+      return bn(e, s);
+    if (u == En || u == yn || f && !a)
+      i = f ? {} : mn(e);
+    else {
+      if (!y[u])
+        return a ? e : {};
+      i = Lt(e, u, s);
+    }
+  }
+  o || (o = new dn());
+  var c = o.get(e);
+  if (c)
+    return c;
+  o.set(e, i), Ct(e) ? e.forEach(function(p) {
+    i.add(Y(p, n, r, p, e, o));
+  }) : Pt(e) && e.forEach(function(p, g) {
+    i.set(g, Y(p, n, r, g, e, o));
+  });
+  var h = fr, v = d ? void 0 : h(e);
+  return ur(v || e, function(p, g) {
+    v && (g = p, p = e[g]), Z(i, g, Y(p, n, r, g, e, o));
+  }), i;
+}
+var ea = 1, na = 4;
+function ra(e) {
+  return Y(e, ea | na);
+}
+var Ln = Object.prototype, ta = Ln.hasOwnProperty, aa = le(function(e, n) {
+  e = Object(e);
+  var r = -1, t = n.length, a = t > 2 ? n[2] : void 0;
+  for (a && j(n[0], n[1], a) && (t = 1); ++r < t; )
+    for (var o = n[r], i = Q(o), s = -1, d = i.length; ++s < d; ) {
+      var u = i[s], f = e[u];
+      (f === void 0 || H(f, Ln[u]) && !ta.call(e, u)) && (e[u] = o[u]);
+    }
+  return e;
+});
+function se(e, n, r) {
+  (r !== void 0 && !H(e[n], r) || r === void 0 && !(n in e)) && K(e, n, r);
+}
+function de(e, n) {
+  if (!(n === "constructor" && typeof e[n] == "function") && n != "__proto__")
+    return e[n];
+}
+function ia(e) {
+  return Dr(e, Q(e));
+}
+function oa(e, n, r, t, a, o, i) {
+  var s = de(e, r), d = de(n, r), u = i.get(d);
+  if (u) {
+    se(e, r, u);
+    return;
+  }
+  var f = o ? o(s, d, r + "", e, n, i) : void 0, c = f === void 0;
+  if (c) {
+    var h = I(d), v = !h && sn(d), p = !h && !v && cr(d);
+    f = d, h || v || p ? I(s) ? f = s : lr(s) ? f = Mr(s) : v ? (c = !1, f = bn(d, !0)) : p ? (c = !1, f = wn(d, !0)) : f = [] : zr(d) || _e(d) ? (f = s, _e(s) ? f = ia(s) : (!O(s) || hr(s)) && (f = mn(d))) : c = !1;
+  }
+  c && (i.set(d, f), a(f, d, t, o, i), i.delete(d)), se(e, r, f);
+}
+function On(e, n, r, t, a) {
+  e !== n && un(n, function(o, i) {
+    if (a || (a = new dn()), O(o))
+      oa(e, n, i, r, On, t, a);
+    else {
+      var s = t ? t(de(e, i), o, i + "", e, n, a) : void 0;
+      s === void 0 && (s = o), se(e, i, s);
+    }
+  }, Q);
+}
+function W(e) {
+  var n = e == null ? 0 : e.length;
+  return n ? e[n - 1] : void 0;
+}
+function sa(e) {
+  return function(n, r, t) {
+    var a = Object(n);
+    if (!z(n)) {
+      var o = _(r);
+      n = pr(n), r = function(s) {
+        return o(a[s], s, a);
+      };
+    }
+    var i = e(n, r, t);
+    return i > -1 ? a[o ? n[i] : i] : void 0;
+  };
+}
+var da = Math.max;
+function ua(e, n, r) {
+  var t = e == null ? 0 : e.length;
+  if (!t)
+    return -1;
+  var a = r == null ? 0 : kr(r);
+  return a < 0 && (a = da(t + a, 0)), gr(e, _(n), a);
+}
+var we = sa(ua);
+function Nn(e, n) {
+  var r = -1, t = z(e) ? Array(e.length) : [];
+  return vr(e, function(a, o, i) {
+    t[++r] = n(a, o, i);
+  }), t;
+}
+function E(e, n) {
+  var r = I(e) ? X : Nn;
+  return r(e, _(n));
+}
+function fa(e, n) {
+  return e == null ? e : un(e, fn(n), Q);
+}
+function ca(e, n) {
+  return e && cn(e, fn(n));
+}
+function la(e, n) {
+  return e > n;
+}
+var ha = Object.prototype, pa = ha.hasOwnProperty;
+function ga(e, n) {
+  return e != null && pa.call(e, n);
+}
+function Pn(e, n) {
+  return e != null && br(e, n, ga);
+}
+function Tn(e, n) {
+  return e < n;
+}
+function ee(e, n) {
+  var r = {};
+  return n = _(n), cn(e, function(t, a, o) {
+    K(r, a, n(t, a, o));
+  }), r;
+}
+function me(e, n, r) {
+  for (var t = -1, a = e.length; ++t < a; ) {
+    var o = e[t], i = n(o);
+    if (i != null && (s === void 0 ? i === i && !U(i) : r(i, s)))
+      var s = i, d = o;
+  }
+  return d;
+}
+function S(e) {
+  return e && e.length ? me(e, ve, la) : void 0;
+}
+var ue = Br(function(e, n, r) {
+  On(e, n, r);
+});
+function D(e) {
+  return e && e.length ? me(e, ve, Tn) : void 0;
+}
+function ye(e, n) {
+  return e && e.length ? me(e, _(n), Tn) : void 0;
+}
+function va(e, n, r, t) {
+  if (!O(e))
+    return e;
+  n = ln(n, e);
+  for (var a = -1, o = n.length, i = o - 1, s = e; s != null && ++a < o; ) {
+    var d = wr(n[a]), u = r;
+    if (d === "__proto__" || d === "constructor" || d === "prototype")
+      return e;
+    if (a != i) {
+      var f = s[d];
+      u = void 0, u === void 0 && (u = O(f) ? f : tn(n[a + 1]) ? [] : {});
+    }
+    Z(s, d, u), s = s[d];
+  }
+  return e;
+}
+function ba(e, n, r) {
+  for (var t = -1, a = n.length, o = {}; ++t < a; ) {
+    var i = n[t], s = hn(e, i);
+    r(s, i) && va(o, ln(i, e), s);
+  }
+  return o;
+}
+function wa(e, n) {
+  var r = e.length;
+  for (e.sort(n); r--; )
+    e[r] = e[r].value;
+  return e;
+}
+function ma(e, n) {
+  if (e !== n) {
+    var r = e !== void 0, t = e === null, a = e === e, o = U(e), i = n !== void 0, s = n === null, d = n === n, u = U(n);
+    if (!s && !u && !o && e > n || o && i && d && !s && !u || t && i && d || !r && d || !a)
+      return 1;
+    if (!t && !o && !u && e < n || u && r && a && !t && !o || s && r && a || !i && a || !d)
+      return -1;
+  }
+  return 0;
+}
+function ya(e, n, r) {
+  for (var t = -1, a = e.criteria, o = n.criteria, i = a.length, s = r.length; ++t < i; ) {
+    var d = ma(a[t], o[t]);
+    if (d) {
+      if (t >= s)
+        return d;
+      var u = r[t];
+      return d * (u == "desc" ? -1 : 1);
+    }
+  }
+  return e.index - n.index;
+}
+function xa(e, n, r) {
+  n.length ? n = X(n, function(o) {
+    return I(o) ? function(i) {
+      return hn(i, o.length === 1 ? o[0] : o);
+    } : o;
+  }) : n = [ve];
+  var t = -1;
+  n = X(n, ge(_));
+  var a = Nn(e, function(o, i, s) {
+    var d = X(n, function(u) {
+      return u(o);
+    });
+    return { criteria: d, index: ++t, value: o };
+  });
+  return wa(a, function(o, i) {
+    return ya(o, i, r);
+  });
+}
+function Ea(e, n) {
+  return ba(e, n, function(r, t) {
+    return mr(e, t);
+  });
+}
+var q = Yr(function(e, n) {
+  return e == null ? {} : Ea(e, n);
+}), La = Math.ceil, Oa = Math.max;
+function Na(e, n, r, t) {
+  for (var a = -1, o = Oa(La((n - e) / (r || 1)), 0), i = Array(o); o--; )
+    i[++a] = e, e += r;
+  return i;
+}
+function Pa(e) {
+  return function(n, r, t) {
+    return t && typeof t != "number" && j(n, r, t) && (r = t = void 0), n = G(n), r === void 0 ? (r = n, n = 0) : r = G(r), t = t === void 0 ? n < r ? 1 : -1 : G(t), Na(n, r, t);
+  };
+}
+var k = Pa(), F = le(function(e, n) {
+  if (e == null)
+    return [];
+  var r = n.length;
+  return r > 1 && j(e, n[0], n[1]) ? n = [] : r > 2 && j(n[0], n[1], n[2]) && (n = [n[0]]), xa(e, on(n), []);
+}), Ta = 0;
+function xe(e) {
+  var n = ++Ta;
+  return yr(e) + n;
+}
+function Sa(e, n, r) {
+  for (var t = -1, a = e.length, o = n.length, i = {}; ++t < a; ) {
+    var s = t < o ? n[t] : void 0;
+    r(i, e[t], s);
+  }
+  return i;
+}
+function Ca(e, n) {
+  return Sa(e || [], n || [], Z);
+}
+class Ia {
+  constructor() {
+    var n = {};
+    n._next = n._prev = n, this._sentinel = n;
+  }
+  dequeue() {
+    var n = this._sentinel, r = n._prev;
+    if (r !== n)
+      return Ue(r), r;
+  }
+  enqueue(n) {
+    var r = this._sentinel;
+    n._prev && n._next && Ue(n), n._next = r._next, r._next._prev = n, r._next = n, n._prev = r;
+  }
+  toString() {
+    for (var n = [], r = this._sentinel, t = r._prev; t !== r; )
+      n.push(JSON.stringify(t, Ra)), t = t._prev;
+    return "[" + n.join(", ") + "]";
+  }
+}
+function Ue(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function Ra(e, n) {
+  if (e !== "_next" && e !== "_prev")
+    return n;
+}
+var ka = xr(1);
+function _a(e, n) {
+  if (e.nodeCount() <= 1)
+    return [];
+  var r = Aa(e, n || ka), t = Ma(r.graph, r.buckets, r.zeroIdx);
+  return M(
+    E(t, function(a) {
+      return e.outEdges(a.v, a.w);
+    })
+  );
+}
+function Ma(e, n, r) {
+  for (var t = [], a = n[n.length - 1], o = n[0], i; e.nodeCount(); ) {
+    for (; i = o.dequeue(); )
+      re(e, n, r, i);
+    for (; i = a.dequeue(); )
+      re(e, n, r, i);
+    if (e.nodeCount()) {
+      for (var s = n.length - 2; s > 0; --s)
+        if (i = n[s].dequeue(), i) {
+          t = t.concat(re(e, n, r, i, !0));
+          break;
+        }
+    }
+  }
+  return t;
+}
+function re(e, n, r, t, a) {
+  var o = a ? [] : void 0;
+  return l(e.inEdges(t.v), function(i) {
+    var s = e.edge(i), d = e.node(i.v);
+    a && o.push({ v: i.v, w: i.w }), d.out -= s, fe(n, r, d);
+  }), l(e.outEdges(t.v), function(i) {
+    var s = e.edge(i), d = i.w, u = e.node(d);
+    u.in -= s, fe(n, r, u);
+  }), e.removeNode(t.v), o;
+}
+function Aa(e, n) {
+  var r = new N(), t = 0, a = 0;
+  l(e.nodes(), function(s) {
+    r.setNode(s, { v: s, in: 0, out: 0 });
+  }), l(e.edges(), function(s) {
+    var d = r.edge(s.v, s.w) || 0, u = n(s), f = d + u;
+    r.setEdge(s.v, s.w, f), a = Math.max(a, r.node(s.v).out += u), t = Math.max(t, r.node(s.w).in += u);
+  });
+  var o = k(a + t + 3).map(function() {
+    return new Ia();
+  }), i = t + 1;
+  return l(r.nodes(), function(s) {
+    fe(o, i, r.node(s));
+  }), { graph: r, buckets: o, zeroIdx: i };
+}
+function fe(e, n, r) {
+  r.out ? r.in ? e[r.out - r.in + n].enqueue(r) : e[e.length - 1].enqueue(r) : e[0].enqueue(r);
+}
+function ja(e) {
+  var n = e.graph().acyclicer === "greedy" ? _a(e, r(e)) : Da(e);
+  l(n, function(t) {
+    var a = e.edge(t);
+    e.removeEdge(t), a.forwardName = t.name, a.reversed = !0, e.setEdge(t.w, t.v, a, xe("rev"));
+  });
+  function r(t) {
+    return function(a) {
+      return t.edge(a).weight;
+    };
+  }
+}
+function Da(e) {
+  var n = [], r = {}, t = {};
+  function a(o) {
+    Object.prototype.hasOwnProperty.call(t, o) || (t[o] = !0, r[o] = !0, l(e.outEdges(o), function(i) {
+      Object.prototype.hasOwnProperty.call(r, i.w) ? n.push(i) : a(i.w);
+    }), delete r[o]);
+  }
+  return l(e.nodes(), a), n;
+}
+function Ba(e) {
+  l(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.reversed) {
+      e.removeEdge(n);
+      var t = r.forwardName;
+      delete r.reversed, delete r.forwardName, e.setEdge(n.w, n.v, r, t);
+    }
+  });
+}
+function A(e, n, r, t) {
+  var a;
+  do
+    a = xe(t);
+  while (e.hasNode(a));
+  return r.dummy = n, e.setNode(a, r), a;
+}
+function $a(e) {
+  var n = new N().setGraph(e.graph());
+  return l(e.nodes(), function(r) {
+    n.setNode(r, e.node(r));
+  }), l(e.edges(), function(r) {
+    var t = n.edge(r.v, r.w) || { weight: 0, minlen: 1 }, a = e.edge(r);
+    n.setEdge(r.v, r.w, {
+      weight: t.weight + a.weight,
+      minlen: Math.max(t.minlen, a.minlen)
+    });
+  }), n;
+}
+function Sn(e) {
+  var n = new N({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+  return l(e.nodes(), function(r) {
+    e.children(r).length || n.setNode(r, e.node(r));
+  }), l(e.edges(), function(r) {
+    n.setEdge(r, e.edge(r));
+  }), n;
+}
+function Ve(e, n) {
+  var r = e.x, t = e.y, a = n.x - r, o = n.y - t, i = e.width / 2, s = e.height / 2;
+  if (!a && !o)
+    throw new Error("Not possible to find intersection inside of the rectangle");
+  var d, u;
+  return Math.abs(o) * i > Math.abs(a) * s ? (o < 0 && (s = -s), d = s * a / o, u = s) : (a < 0 && (i = -i), d = i, u = i * o / a), { x: r + d, y: t + u };
+}
+function ne(e) {
+  var n = E(k(Cn(e) + 1), function() {
+    return [];
+  });
+  return l(e.nodes(), function(r) {
+    var t = e.node(r), a = t.rank;
+    L(a) || (n[a][t.order] = r);
+  }), n;
+}
+function Fa(e) {
+  var n = D(
+    E(e.nodes(), function(r) {
+      return e.node(r).rank;
+    })
+  );
+  l(e.nodes(), function(r) {
+    var t = e.node(r);
+    Pn(t, "rank") && (t.rank -= n);
+  });
+}
+function Xa(e) {
+  var n = D(
+    E(e.nodes(), function(o) {
+      return e.node(o).rank;
+    })
+  ), r = [];
+  l(e.nodes(), function(o) {
+    var i = e.node(o).rank - n;
+    r[i] || (r[i] = []), r[i].push(o);
+  });
+  var t = 0, a = e.graph().nodeRankFactor;
+  l(r, function(o, i) {
+    L(o) && i % a !== 0 ? --t : t && l(o, function(s) {
+      e.node(s).rank += t;
+    });
+  });
+}
+function We(e, n, r, t) {
+  var a = {
+    width: 0,
+    height: 0
+  };
+  return arguments.length >= 4 && (a.rank = r, a.order = t), A(e, "border", a, n);
+}
+function Cn(e) {
+  return S(
+    E(e.nodes(), function(n) {
+      var r = e.node(n).rank;
+      if (!L(r))
+        return r;
+    })
+  );
+}
+function Ga(e, n) {
+  var r = { lhs: [], rhs: [] };
+  return l(e, function(t) {
+    n(t) ? r.lhs.push(t) : r.rhs.push(t);
+  }), r;
+}
+function Ya(e, n) {
+  return n();
+}
+function Ua(e) {
+  function n(r) {
+    var t = e.children(r), a = e.node(r);
+    if (t.length && l(t, n), Object.prototype.hasOwnProperty.call(a, "minRank")) {
+      a.borderLeft = [], a.borderRight = [];
+      for (var o = a.minRank, i = a.maxRank + 1; o < i; ++o)
+        qe(e, "borderLeft", "_bl", r, a, o), qe(e, "borderRight", "_br", r, a, o);
+    }
+  }
+  l(e.children(), n);
+}
+function qe(e, n, r, t, a, o) {
+  var i = { width: 0, height: 0, rank: o, borderType: n }, s = a[n][o - 1], d = A(e, "border", i, r);
+  a[n][o] = d, e.setParent(d, t), s && e.setEdge(s, d, { weight: 1 });
+}
+function Va(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "lr" || n === "rl") && In(e);
+}
+function Wa(e) {
+  var n = e.graph().rankdir.toLowerCase();
+  (n === "bt" || n === "rl") && qa(e), (n === "lr" || n === "rl") && (Ha(e), In(e));
+}
+function In(e) {
+  l(e.nodes(), function(n) {
+    He(e.node(n));
+  }), l(e.edges(), function(n) {
+    He(e.edge(n));
+  });
+}
+function He(e) {
+  var n = e.width;
+  e.width = e.height, e.height = n;
+}
+function qa(e) {
+  l(e.nodes(), function(n) {
+    te(e.node(n));
+  }), l(e.edges(), function(n) {
+    var r = e.edge(n);
+    l(r.points, te), Object.prototype.hasOwnProperty.call(r, "y") && te(r);
+  });
+}
+function te(e) {
+  e.y = -e.y;
+}
+function Ha(e) {
+  l(e.nodes(), function(n) {
+    ae(e.node(n));
+  }), l(e.edges(), function(n) {
+    var r = e.edge(n);
+    l(r.points, ae), Object.prototype.hasOwnProperty.call(r, "x") && ae(r);
+  });
+}
+function ae(e) {
+  var n = e.x;
+  e.x = e.y, e.y = n;
+}
+function za(e) {
+  e.graph().dummyChains = [], l(e.edges(), function(n) {
+    Ja(e, n);
+  });
+}
+function Ja(e, n) {
+  var r = n.v, t = e.node(r).rank, a = n.w, o = e.node(a).rank, i = n.name, s = e.edge(n), d = s.labelRank;
+  if (o !== t + 1) {
+    e.removeEdge(n);
+    var u = void 0, f, c;
+    for (c = 0, ++t; t < o; ++c, ++t)
+      s.points = [], u = {
+        width: 0,
+        height: 0,
+        edgeLabel: s,
+        edgeObj: n,
+        rank: t
+      }, f = A(e, "edge", u, "_d"), t === d && (u.width = s.width, u.height = s.height, u.dummy = "edge-label", u.labelpos = s.labelpos), e.setEdge(r, f, { weight: s.weight }, i), c === 0 && e.graph().dummyChains.push(f), r = f;
+    e.setEdge(r, a, { weight: s.weight }, i);
+  }
+}
+function Ka(e) {
+  l(e.graph().dummyChains, function(n) {
+    var r = e.node(n), t = r.edgeLabel, a;
+    for (e.setEdge(r.edgeObj, t); r.dummy; )
+      a = e.successors(n)[0], e.removeNode(n), t.points.push({ x: r.x, y: r.y }), r.dummy === "edge-label" && (t.x = r.x, t.y = r.y, t.width = r.width, t.height = r.height), n = a, r = e.node(n);
+  });
+}
+function Ee(e) {
+  var n = {};
+  function r(t) {
+    var a = e.node(t);
+    if (Object.prototype.hasOwnProperty.call(n, t))
+      return a.rank;
+    n[t] = !0;
+    var o = D(
+      E(e.outEdges(t), function(i) {
+        return r(i.w) - e.edge(i).minlen;
+      })
+    );
+    return (o === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+    o === void 0 || // return value of _.map([]) for Lodash 4
+    o === null) && (o = 0), a.rank = o;
+  }
+  l(e.sources(), r);
+}
+function B(e, n) {
+  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
+}
+function Rn(e) {
+  var n = new N({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
+  n.setNode(r, {});
+  for (var a, o; Za(n, e) < t; )
+    a = Qa(n, e), o = n.hasNode(a.v) ? B(e, a) : -B(e, a), ei(n, e, o);
+  return n;
+}
+function Za(e, n) {
+  function r(t) {
+    l(n.nodeEdges(t), function(a) {
+      var o = a.v, i = t === o ? a.w : o;
+      !e.hasNode(i) && !B(n, a) && (e.setNode(i, {}), e.setEdge(t, i, {}), r(i));
+    });
+  }
+  return l(e.nodes(), r), e.nodeCount();
+}
+function Qa(e, n) {
+  return ye(n.edges(), function(r) {
+    if (e.hasNode(r.v) !== e.hasNode(r.w))
+      return B(n, r);
+  });
+}
+function ei(e, n, r) {
+  l(e.nodes(), function(t) {
+    n.node(t).rank += r;
+  });
+}
+function ni() {
+}
+ni.prototype = new Error();
+function kn(e, n, r) {
+  I(n) || (n = [n]);
+  var t = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], o = {};
+  return l(n, function(i) {
+    if (!e.hasNode(i))
+      throw new Error("Graph does not have node: " + i);
+    _n(e, i, r === "post", o, t, a);
+  }), a;
+}
+function _n(e, n, r, t, a, o) {
+  Object.prototype.hasOwnProperty.call(t, n) || (t[n] = !0, r || o.push(n), l(a(n), function(i) {
+    _n(e, i, r, t, a, o);
+  }), r && o.push(n));
+}
+function ri(e, n) {
+  return kn(e, n, "post");
+}
+function ti(e, n) {
+  return kn(e, n, "pre");
+}
+C.initLowLimValues = Oe;
+C.initCutValues = Le;
+C.calcCutValue = Mn;
+C.leaveEdge = jn;
+C.enterEdge = Dn;
+C.exchangeEdges = Bn;
+function C(e) {
+  e = $a(e), Ee(e);
+  var n = Rn(e);
+  Oe(n), Le(n, e);
+  for (var r, t; r = jn(n); )
+    t = Dn(n, e, r), Bn(n, e, r, t);
+}
+function Le(e, n) {
+  var r = ri(e, e.nodes());
+  r = r.slice(0, r.length - 1), l(r, function(t) {
+    ai(e, n, t);
+  });
+}
+function ai(e, n, r) {
+  var t = e.node(r), a = t.parent;
+  e.edge(r, a).cutvalue = Mn(e, n, r);
+}
+function Mn(e, n, r) {
+  var t = e.node(r), a = t.parent, o = !0, i = n.edge(r, a), s = 0;
+  return i || (o = !1, i = n.edge(a, r)), s = i.weight, l(n.nodeEdges(r), function(d) {
+    var u = d.v === r, f = u ? d.w : d.v;
+    if (f !== a) {
+      var c = u === o, h = n.edge(d).weight;
+      if (s += c ? h : -h, oi(e, r, f)) {
+        var v = e.edge(r, f).cutvalue;
+        s += c ? -v : v;
+      }
+    }
+  }), s;
+}
+function Oe(e, n) {
+  arguments.length < 2 && (n = e.nodes()[0]), An(e, {}, 1, n);
+}
+function An(e, n, r, t, a) {
+  var o = r, i = e.node(t);
+  return n[t] = !0, l(e.neighbors(t), function(s) {
+    Object.prototype.hasOwnProperty.call(n, s) || (r = An(e, n, r, s, t));
+  }), i.low = o, i.lim = r++, a ? i.parent = a : delete i.parent, r;
+}
+function jn(e) {
+  return we(e.edges(), function(n) {
+    return e.edge(n).cutvalue < 0;
+  });
+}
+function Dn(e, n, r) {
+  var t = r.v, a = r.w;
+  n.hasEdge(t, a) || (t = r.w, a = r.v);
+  var o = e.node(t), i = e.node(a), s = o, d = !1;
+  o.lim > i.lim && (s = i, d = !0);
+  var u = $(n.edges(), function(f) {
+    return d === ze(e, e.node(f.v), s) && d !== ze(e, e.node(f.w), s);
+  });
+  return ye(u, function(f) {
+    return B(n, f);
+  });
+}
+function Bn(e, n, r, t) {
+  var a = r.v, o = r.w;
+  e.removeEdge(a, o), e.setEdge(t.v, t.w, {}), Oe(e), Le(e, n), ii(e, n);
+}
+function ii(e, n) {
+  var r = we(e.nodes(), function(a) {
+    return !n.node(a).parent;
+  }), t = ti(e, r);
+  t = t.slice(1), l(t, function(a) {
+    var o = e.node(a).parent, i = n.edge(a, o), s = !1;
+    i || (i = n.edge(o, a), s = !0), n.node(a).rank = n.node(o).rank + (s ? i.minlen : -i.minlen);
+  });
+}
+function oi(e, n, r) {
+  return e.hasEdge(n, r);
+}
+function ze(e, n, r) {
+  return r.low <= n.lim && n.lim <= r.lim;
+}
+function si(e) {
+  switch (e.graph().ranker) {
+    case "network-simplex":
+      Je(e);
+      break;
+    case "tight-tree":
+      ui(e);
+      break;
+    case "longest-path":
+      di(e);
+      break;
+    default:
+      Je(e);
+  }
+}
+var di = Ee;
+function ui(e) {
+  Ee(e), Rn(e);
+}
+function Je(e) {
+  C(e);
+}
+function fi(e) {
+  var n = A(e, "root", {}, "_root"), r = ci(e), t = S(R(r)) - 1, a = 2 * t + 1;
+  e.graph().nestingRoot = n, l(e.edges(), function(i) {
+    e.edge(i).minlen *= a;
+  });
+  var o = li(e) + 1;
+  l(e.children(), function(i) {
+    $n(e, n, a, o, t, r, i);
+  }), e.graph().nodeRankFactor = a;
+}
+function $n(e, n, r, t, a, o, i) {
+  var s = e.children(i);
+  if (!s.length) {
+    i !== n && e.setEdge(n, i, { weight: 0, minlen: r });
+    return;
+  }
+  var d = We(e, "_bt"), u = We(e, "_bb"), f = e.node(i);
+  e.setParent(d, i), f.borderTop = d, e.setParent(u, i), f.borderBottom = u, l(s, function(c) {
+    $n(e, n, r, t, a, o, c);
+    var h = e.node(c), v = h.borderTop ? h.borderTop : c, p = h.borderBottom ? h.borderBottom : c, g = h.borderTop ? t : 2 * t, b = v !== p ? 1 : a - o[i] + 1;
+    e.setEdge(d, v, {
+      weight: g,
+      minlen: b,
+      nestingEdge: !0
+    }), e.setEdge(p, u, {
+      weight: g,
+      minlen: b,
+      nestingEdge: !0
+    });
+  }), e.parent(i) || e.setEdge(n, d, { weight: 0, minlen: a + o[i] });
+}
+function ci(e) {
+  var n = {};
+  function r(t, a) {
+    var o = e.children(t);
+    o && o.length && l(o, function(i) {
+      r(i, a + 1);
+    }), n[t] = a;
+  }
+  return l(e.children(), function(t) {
+    r(t, 1);
+  }), n;
+}
+function li(e) {
+  return J(
+    e.edges(),
+    function(n, r) {
+      return n + e.edge(r).weight;
+    },
+    0
+  );
+}
+function hi(e) {
+  var n = e.graph();
+  e.removeNode(n.nestingRoot), delete n.nestingRoot, l(e.edges(), function(r) {
+    var t = e.edge(r);
+    t.nestingEdge && e.removeEdge(r);
+  });
+}
+function pi(e, n, r) {
+  var t = {}, a;
+  l(r, function(o) {
+    for (var i = e.parent(o), s, d; i; ) {
+      if (s = e.parent(i), s ? (d = t[s], t[s] = i) : (d = a, a = i), d && d !== i) {
+        n.setEdge(d, i);
+        return;
+      }
+      i = s;
+    }
+  });
+}
+function gi(e, n, r) {
+  var t = vi(e), a = new N({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(o) {
+    return e.node(o);
+  });
+  return l(e.nodes(), function(o) {
+    var i = e.node(o), s = e.parent(o);
+    (i.rank === n || i.minRank <= n && n <= i.maxRank) && (a.setNode(o), a.setParent(o, s || t), l(e[r](o), function(d) {
+      var u = d.v === o ? d.w : d.v, f = a.edge(u, o), c = L(f) ? 0 : f.weight;
+      a.setEdge(u, o, { weight: e.edge(d).weight + c });
+    }), Object.prototype.hasOwnProperty.call(i, "minRank") && a.setNode(o, {
+      borderLeft: i.borderLeft[n],
+      borderRight: i.borderRight[n]
+    }));
+  }), a;
+}
+function vi(e) {
+  for (var n; e.hasNode(n = xe("_root")); ) ;
+  return n;
+}
+function bi(e, n) {
+  for (var r = 0, t = 1; t < n.length; ++t)
+    r += wi(e, n[t - 1], n[t]);
+  return r;
+}
+function wi(e, n, r) {
+  for (var t = Ca(
+    r,
+    E(r, function(u, f) {
+      return f;
+    })
+  ), a = M(
+    E(n, function(u) {
+      return F(
+        E(e.outEdges(u), function(f) {
+          return { pos: t[f.w], weight: e.edge(f).weight };
+        }),
+        "pos"
+      );
+    })
+  ), o = 1; o < r.length; ) o <<= 1;
+  var i = 2 * o - 1;
+  o -= 1;
+  var s = E(new Array(i), function() {
+    return 0;
+  }), d = 0;
+  return l(
+    // @ts-expect-error
+    a.forEach(function(u) {
+      var f = u.pos + o;
+      s[f] += u.weight;
+      for (var c = 0; f > 0; )
+        f % 2 && (c += s[f + 1]), f = f - 1 >> 1, s[f] += u.weight;
+      d += u.weight * c;
+    })
+  ), d;
+}
+function mi(e) {
+  var n = {}, r = $(e.nodes(), function(s) {
+    return !e.children(s).length;
+  }), t = S(
+    E(r, function(s) {
+      return e.node(s).rank;
+    })
+  ), a = E(k(t + 1), function() {
+    return [];
+  });
+  function o(s) {
+    if (!Pn(n, s)) {
+      n[s] = !0;
+      var d = e.node(s);
+      a[d.rank].push(s), l(e.successors(s), o);
+    }
+  }
+  var i = F(r, function(s) {
+    return e.node(s).rank;
+  });
+  return l(i, o), a;
+}
+function yi(e, n) {
+  return E(n, function(r) {
+    var t = e.inEdges(r);
+    if (t.length) {
+      var a = J(
+        t,
+        function(o, i) {
+          var s = e.edge(i), d = e.node(i.v);
+          return {
+            sum: o.sum + s.weight * d.order,
+            weight: o.weight + s.weight
+          };
+        },
+        { sum: 0, weight: 0 }
+      );
+      return {
+        v: r,
+        barycenter: a.sum / a.weight,
+        weight: a.weight
+      };
+    } else
+      return { v: r };
+  });
+}
+function xi(e, n) {
+  var r = {};
+  l(e, function(a, o) {
+    var i = r[a.v] = {
+      indegree: 0,
+      in: [],
+      out: [],
+      vs: [a.v],
+      i: o
+    };
+    L(a.barycenter) || (i.barycenter = a.barycenter, i.weight = a.weight);
+  }), l(n.edges(), function(a) {
+    var o = r[a.v], i = r[a.w];
+    !L(o) && !L(i) && (i.indegree++, o.out.push(r[a.w]));
+  });
+  var t = $(r, function(a) {
+    return !a.indegree;
+  });
+  return Ei(t);
+}
+function Ei(e) {
+  var n = [];
+  function r(o) {
+    return function(i) {
+      i.merged || (L(i.barycenter) || L(o.barycenter) || i.barycenter >= o.barycenter) && Li(o, i);
+    };
+  }
+  function t(o) {
+    return function(i) {
+      i.in.push(o), --i.indegree === 0 && e.push(i);
+    };
+  }
+  for (; e.length; ) {
+    var a = e.pop();
+    n.push(a), l(a.in.reverse(), r(a)), l(a.out, t(a));
+  }
+  return E(
+    $(n, function(o) {
+      return !o.merged;
+    }),
+    function(o) {
+      return q(o, ["vs", "i", "barycenter", "weight"]);
+    }
+  );
+}
+function Li(e, n) {
+  var r = 0, t = 0;
+  e.weight && (r += e.barycenter * e.weight, t += e.weight), n.weight && (r += n.barycenter * n.weight, t += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / t, e.weight = t, e.i = Math.min(n.i, e.i), n.merged = !0;
+}
+function Oi(e, n) {
+  var r = Ga(e, function(f) {
+    return Object.prototype.hasOwnProperty.call(f, "barycenter");
+  }), t = r.lhs, a = F(r.rhs, function(f) {
+    return -f.i;
+  }), o = [], i = 0, s = 0, d = 0;
+  t.sort(Ni(!!n)), d = Ke(o, a, d), l(t, function(f) {
+    d += f.vs.length, o.push(f.vs), i += f.barycenter * f.weight, s += f.weight, d = Ke(o, a, d);
+  });
+  var u = { vs: M(o) };
+  return s && (u.barycenter = i / s, u.weight = s), u;
+}
+function Ke(e, n, r) {
+  for (var t; n.length && (t = W(n)).i <= r; )
+    n.pop(), e.push(t.vs), r++;
+  return r;
+}
+function Ni(e) {
+  return function(n, r) {
+    return n.barycenter < r.barycenter ? -1 : n.barycenter > r.barycenter ? 1 : e ? r.i - n.i : n.i - r.i;
+  };
+}
+function Fn(e, n, r, t) {
+  var a = e.children(n), o = e.node(n), i = o ? o.borderLeft : void 0, s = o ? o.borderRight : void 0, d = {};
+  i && (a = $(a, function(p) {
+    return p !== i && p !== s;
+  }));
+  var u = yi(e, a);
+  l(u, function(p) {
+    if (e.children(p.v).length) {
+      var g = Fn(e, p.v, r, t);
+      d[p.v] = g, Object.prototype.hasOwnProperty.call(g, "barycenter") && Ti(p, g);
+    }
+  });
+  var f = xi(u, r);
+  Pi(f, d);
+  var c = Oi(f, t);
+  if (i && (c.vs = M([i, c.vs, s]), e.predecessors(i).length)) {
+    var h = e.node(e.predecessors(i)[0]), v = e.node(e.predecessors(s)[0]);
+    Object.prototype.hasOwnProperty.call(c, "barycenter") || (c.barycenter = 0, c.weight = 0), c.barycenter = (c.barycenter * c.weight + h.order + v.order) / (c.weight + 2), c.weight += 2;
+  }
+  return c;
+}
+function Pi(e, n) {
+  l(e, function(r) {
+    r.vs = M(
+      r.vs.map(function(t) {
+        return n[t] ? n[t].vs : t;
+      })
+    );
+  });
+}
+function Ti(e, n) {
+  L(e.barycenter) ? (e.barycenter = n.barycenter, e.weight = n.weight) : (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight);
+}
+function Si(e) {
+  var n = Cn(e), r = Ze(e, k(1, n + 1), "inEdges"), t = Ze(e, k(n - 1, -1, -1), "outEdges"), a = mi(e);
+  Qe(e, a);
+  for (var o = Number.POSITIVE_INFINITY, i, s = 0, d = 0; d < 4; ++s, ++d) {
+    Ci(s % 2 ? r : t, s % 4 >= 2), a = ne(e);
+    var u = bi(e, a);
+    u < o && (d = 0, i = ra(a), o = u);
+  }
+  Qe(e, i);
+}
+function Ze(e, n, r) {
+  return E(n, function(t) {
+    return gi(e, t, r);
+  });
+}
+function Ci(e, n) {
+  var r = new N();
+  l(e, function(t) {
+    var a = t.graph().root, o = Fn(t, a, r, n);
+    l(o.vs, function(i, s) {
+      t.node(i).order = s;
+    }), pi(t, r, o.vs);
+  });
+}
+function Qe(e, n) {
+  l(n, function(r) {
+    l(r, function(t, a) {
+      e.node(t).order = a;
+    });
+  });
+}
+function Ii(e) {
+  var n = ki(e);
+  l(e.graph().dummyChains, function(r) {
+    for (var t = e.node(r), a = t.edgeObj, o = Ri(e, n, a.v, a.w), i = o.path, s = o.lca, d = 0, u = i[d], f = !0; r !== a.w; ) {
+      if (t = e.node(r), f) {
+        for (; (u = i[d]) !== s && e.node(u).maxRank < t.rank; )
+          d++;
+        u === s && (f = !1);
+      }
+      if (!f) {
+        for (; d < i.length - 1 && e.node(u = i[d + 1]).minRank <= t.rank; )
+          d++;
+        u = i[d];
+      }
+      e.setParent(r, u), r = e.successors(r)[0];
+    }
+  });
+}
+function Ri(e, n, r, t) {
+  var a = [], o = [], i = Math.min(n[r].low, n[t].low), s = Math.max(n[r].lim, n[t].lim), d, u;
+  d = r;
+  do
+    d = e.parent(d), a.push(d);
+  while (d && (n[d].low > i || s > n[d].lim));
+  for (u = d, d = t; (d = e.parent(d)) !== u; )
+    o.push(d);
+  return { path: a.concat(o.reverse()), lca: u };
+}
+function ki(e) {
+  var n = {}, r = 0;
+  function t(a) {
+    var o = r;
+    l(e.children(a), t), n[a] = { low: o, lim: r++ };
+  }
+  return l(e.children(), t), n;
+}
+function _i(e, n) {
+  var r = {};
+  function t(a, o) {
+    var i = 0, s = 0, d = a.length, u = W(o);
+    return l(o, function(f, c) {
+      var h = Ai(e, f), v = h ? e.node(h).order : d;
+      (h || f === u) && (l(o.slice(s, c + 1), function(p) {
+        l(e.predecessors(p), function(g) {
+          var b = e.node(g), w = b.order;
+          (w < i || v < w) && !(b.dummy && e.node(p).dummy) && Xn(r, g, p);
+        });
+      }), s = c + 1, i = v);
+    }), o;
+  }
+  return J(n, t), r;
+}
+function Mi(e, n) {
+  var r = {};
+  function t(o, i, s, d, u) {
+    var f;
+    l(k(i, s), function(c) {
+      f = o[c], e.node(f).dummy && l(e.predecessors(f), function(h) {
+        var v = e.node(h);
+        v.dummy && (v.order < d || v.order > u) && Xn(r, h, f);
+      });
+    });
+  }
+  function a(o, i) {
+    var s = -1, d, u = 0;
+    return l(i, function(f, c) {
+      if (e.node(f).dummy === "border") {
+        var h = e.predecessors(f);
+        h.length && (d = e.node(h[0]).order, t(i, u, c, s, d), u = c, s = d);
+      }
+      t(i, u, i.length, d, o.length);
+    }), i;
+  }
+  return J(n, a), r;
+}
+function Ai(e, n) {
+  if (e.node(n).dummy)
+    return we(e.predecessors(n), function(r) {
+      return e.node(r).dummy;
+    });
+}
+function Xn(e, n, r) {
+  if (n > r) {
+    var t = n;
+    n = r, r = t;
+  }
+  Object.prototype.hasOwnProperty.call(e, n) || Object.defineProperty(e, n, {
+    enumerable: !0,
+    configurable: !0,
+    value: {},
+    writable: !0
+  });
+  var a = e[n];
+  Object.defineProperty(a, r, {
+    enumerable: !0,
+    configurable: !0,
+    value: !0,
+    writable: !0
+  });
+}
+function ji(e, n, r) {
+  if (n > r) {
+    var t = n;
+    n = r, r = t;
+  }
+  return !!e[n] && Object.prototype.hasOwnProperty.call(e[n], r);
+}
+function Di(e, n, r, t) {
+  var a = {}, o = {}, i = {};
+  return l(n, function(s) {
+    l(s, function(d, u) {
+      a[d] = d, o[d] = d, i[d] = u;
+    });
+  }), l(n, function(s) {
+    var d = -1;
+    l(s, function(u) {
+      var f = t(u);
+      if (f.length) {
+        f = F(f, function(g) {
+          return i[g];
+        });
+        for (var c = (f.length - 1) / 2, h = Math.floor(c), v = Math.ceil(c); h <= v; ++h) {
+          var p = f[h];
+          o[u] === u && d < i[p] && !ji(r, u, p) && (o[p] = u, o[u] = a[u] = a[p], d = i[p]);
+        }
+      }
+    });
+  }), { root: a, align: o };
+}
+function Bi(e, n, r, t, a) {
+  var o = {}, i = $i(e, n, r, a), s = a ? "borderLeft" : "borderRight";
+  function d(c, h) {
+    for (var v = i.nodes(), p = v.pop(), g = {}; p; )
+      g[p] ? c(p) : (g[p] = !0, v.push(p), v = v.concat(h(p))), p = v.pop();
+  }
+  function u(c) {
+    o[c] = i.inEdges(c).reduce(function(h, v) {
+      return Math.max(h, o[v.v] + i.edge(v));
+    }, 0);
+  }
+  function f(c) {
+    var h = i.outEdges(c).reduce(function(p, g) {
+      return Math.min(p, o[g.w] - i.edge(g));
+    }, Number.POSITIVE_INFINITY), v = e.node(c);
+    h !== Number.POSITIVE_INFINITY && v.borderType !== s && (o[c] = Math.max(o[c], h));
+  }
+  return d(u, i.predecessors.bind(i)), d(f, i.successors.bind(i)), l(t, function(c) {
+    o[c] = o[r[c]];
+  }), o;
+}
+function $i(e, n, r, t) {
+  var a = new N(), o = e.graph(), i = Ui(o.nodesep, o.edgesep, t);
+  return l(n, function(s) {
+    var d;
+    l(s, function(u) {
+      var f = r[u];
+      if (a.setNode(f), d) {
+        var c = r[d], h = a.edge(c, f);
+        a.setEdge(c, f, Math.max(i(e, u, d), h || 0));
+      }
+      d = u;
+    });
+  }), a;
+}
+function Fi(e, n) {
+  return ye(R(n), function(r) {
+    var t = Number.NEGATIVE_INFINITY, a = Number.POSITIVE_INFINITY;
+    return fa(r, function(o, i) {
+      var s = Vi(e, i) / 2;
+      t = Math.max(o + s, t), a = Math.min(o - s, a);
+    }), t - a;
+  });
+}
+function Xi(e, n) {
+  var r = R(n), t = D(r), a = S(r);
+  l(["u", "d"], function(o) {
+    l(["l", "r"], function(i) {
+      var s = o + i, d = e[s], u;
+      if (d !== n) {
+        var f = R(d);
+        u = i === "l" ? t - D(f) : a - S(f), u && (e[s] = ee(d, function(c) {
+          return c + u;
+        }));
+      }
+    });
+  });
+}
+function Gi(e, n) {
+  return ee(e.ul, function(r, t) {
+    if (n)
+      return e[n.toLowerCase()][t];
+    var a = F(E(e, t));
+    return (a[1] + a[2]) / 2;
+  });
+}
+function Yi(e) {
+  var n = ne(e), r = ue(_i(e, n), Mi(e, n)), t = {}, a;
+  l(["u", "d"], function(i) {
+    a = i === "u" ? n : R(n).reverse(), l(["l", "r"], function(s) {
+      s === "r" && (a = E(a, function(c) {
+        return R(c).reverse();
+      }));
+      var d = (i === "u" ? e.predecessors : e.successors).bind(e), u = Di(e, a, r, d), f = Bi(e, a, u.root, u.align, s === "r");
+      s === "r" && (f = ee(f, function(c) {
+        return -c;
+      })), t[i + s] = f;
+    });
+  });
+  var o = Fi(e, t);
+  return Xi(t, o), Gi(t, e.graph().align);
+}
+function Ui(e, n, r) {
+  return function(t, a, o) {
+    var i = t.node(a), s = t.node(o), d = 0, u;
+    if (d += i.width / 2, Object.prototype.hasOwnProperty.call(i, "labelpos"))
+      switch (i.labelpos.toLowerCase()) {
+        case "l":
+          u = -i.width / 2;
+          break;
+        case "r":
+          u = i.width / 2;
+          break;
+      }
+    if (u && (d += r ? u : -u), u = 0, d += (i.dummy ? n : e) / 2, d += (s.dummy ? n : e) / 2, d += s.width / 2, Object.prototype.hasOwnProperty.call(s, "labelpos"))
+      switch (s.labelpos.toLowerCase()) {
+        case "l":
+          u = s.width / 2;
+          break;
+        case "r":
+          u = -s.width / 2;
+          break;
+      }
+    return u && (d += r ? u : -u), u = 0, d;
+  };
+}
+function Vi(e, n) {
+  return e.node(n).width;
+}
+function Wi(e) {
+  e = Sn(e), qi(e), ca(Yi(e), function(n, r) {
+    e.node(r).x = n;
+  });
+}
+function qi(e) {
+  var n = ne(e), r = e.graph().ranksep, t = 0;
+  l(n, function(a) {
+    var o = S(
+      E(a, function(i) {
+        return e.node(i).height;
+      })
+    );
+    l(a, function(i) {
+      e.node(i).y = t + o / 2;
+    }), t += o + r;
+  });
+}
+function Hi(e, n) {
+  var r = Ya;
+  r("layout", () => {
+    var t = r("  buildLayoutGraph", () => io(e));
+    r("  runLayout", () => zi(t, r)), r("  updateInputGraph", () => Ji(e, t));
+  });
+}
+function zi(e, n) {
+  n("    makeSpaceForEdgeLabels", () => oo(e)), n("    removeSelfEdges", () => vo(e)), n("    acyclic", () => ja(e)), n("    nestingGraph.run", () => fi(e)), n("    rank", () => si(Sn(e))), n("    injectEdgeLabelProxies", () => so(e)), n("    removeEmptyRanks", () => Xa(e)), n("    nestingGraph.cleanup", () => hi(e)), n("    normalizeRanks", () => Fa(e)), n("    assignRankMinMax", () => uo(e)), n("    removeEdgeLabelProxies", () => fo(e)), n("    normalize.run", () => za(e)), n("    parentDummyChains", () => Ii(e)), n("    addBorderSegments", () => Ua(e)), n("    order", () => Si(e)), n("    insertSelfEdges", () => bo(e)), n("    adjustCoordinateSystem", () => Va(e)), n("    position", () => Wi(e)), n("    positionSelfEdges", () => wo(e)), n("    removeBorderNodes", () => go(e)), n("    normalize.undo", () => Ka(e)), n("    fixupEdgeLabelCoords", () => ho(e)), n("    undoCoordinateSystem", () => Wa(e)), n("    translateGraph", () => co(e)), n("    assignNodeIntersects", () => lo(e)), n("    reversePoints", () => po(e)), n("    acyclic.undo", () => Ba(e));
+}
+function Ji(e, n) {
+  l(e.nodes(), function(r) {
+    var t = e.node(r), a = n.node(r);
+    t && (t.x = a.x, t.y = a.y, n.children(r).length && (t.width = a.width, t.height = a.height));
+  }), l(e.edges(), function(r) {
+    var t = e.edge(r), a = n.edge(r);
+    t.points = a.points, Object.prototype.hasOwnProperty.call(a, "x") && (t.x = a.x, t.y = a.y);
+  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+}
+var Ki = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Zi = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Qi = ["acyclicer", "ranker", "rankdir", "align"], eo = ["width", "height"], no = { width: 0, height: 0 }, ro = ["minlen", "weight", "width", "height", "labeloffset"], to = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, ao = ["labelpos"];
+function io(e) {
+  var n = new N({ multigraph: !0, compound: !0 }), r = oe(e.graph());
+  return n.setGraph(
+    ue({}, Zi, ie(r, Ki), q(r, Qi))
+  ), l(e.nodes(), function(t) {
+    var a = oe(e.node(t));
+    n.setNode(t, aa(ie(a, eo), no)), n.setParent(t, e.parent(t));
+  }), l(e.edges(), function(t) {
+    var a = oe(e.edge(t));
+    n.setEdge(
+      t,
+      ue({}, to, ie(a, ro), q(a, ao))
+    );
+  }), n;
+}
+function oo(e) {
+  var n = e.graph();
+  n.ranksep /= 2, l(e.edges(), function(r) {
+    var t = e.edge(r);
+    t.minlen *= 2, t.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? t.width += t.labeloffset : t.height += t.labeloffset);
+  });
+}
+function so(e) {
+  l(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (r.width && r.height) {
+      var t = e.node(n.v), a = e.node(n.w), o = { rank: (a.rank - t.rank) / 2 + t.rank, e: n };
+      A(e, "edge-proxy", o, "_ep");
+    }
+  });
+}
+function uo(e) {
+  var n = 0;
+  l(e.nodes(), function(r) {
+    var t = e.node(r);
+    t.borderTop && (t.minRank = e.node(t.borderTop).rank, t.maxRank = e.node(t.borderBottom).rank, n = S(n, t.maxRank));
+  }), e.graph().maxRank = n;
+}
+function fo(e) {
+  l(e.nodes(), function(n) {
+    var r = e.node(n);
+    r.dummy === "edge-proxy" && (e.edge(r.e).labelRank = r.rank, e.removeNode(n));
+  });
+}
+function co(e) {
+  var n = Number.POSITIVE_INFINITY, r = 0, t = Number.POSITIVE_INFINITY, a = 0, o = e.graph(), i = o.marginx || 0, s = o.marginy || 0;
+  function d(u) {
+    var f = u.x, c = u.y, h = u.width, v = u.height;
+    n = Math.min(n, f - h / 2), r = Math.max(r, f + h / 2), t = Math.min(t, c - v / 2), a = Math.max(a, c + v / 2);
+  }
+  l(e.nodes(), function(u) {
+    d(e.node(u));
+  }), l(e.edges(), function(u) {
+    var f = e.edge(u);
+    Object.prototype.hasOwnProperty.call(f, "x") && d(f);
+  }), n -= i, t -= s, l(e.nodes(), function(u) {
+    var f = e.node(u);
+    f.x -= n, f.y -= t;
+  }), l(e.edges(), function(u) {
+    var f = e.edge(u);
+    l(f.points, function(c) {
+      c.x -= n, c.y -= t;
+    }), Object.prototype.hasOwnProperty.call(f, "x") && (f.x -= n), Object.prototype.hasOwnProperty.call(f, "y") && (f.y -= t);
+  }), o.width = r - n + i, o.height = a - t + s;
+}
+function lo(e) {
+  l(e.edges(), function(n) {
+    var r = e.edge(n), t = e.node(n.v), a = e.node(n.w), o, i;
+    r.points ? (o = r.points[0], i = r.points[r.points.length - 1]) : (r.points = [], o = a, i = t), r.points.unshift(Ve(t, o)), r.points.push(Ve(a, i));
+  });
+}
+function ho(e) {
+  l(e.edges(), function(n) {
+    var r = e.edge(n);
+    if (Object.prototype.hasOwnProperty.call(r, "x"))
+      switch ((r.labelpos === "l" || r.labelpos === "r") && (r.width -= r.labeloffset), r.labelpos) {
+        case "l":
+          r.x -= r.width / 2 + r.labeloffset;
+          break;
+        case "r":
+          r.x += r.width / 2 + r.labeloffset;
+          break;
+      }
+  });
+}
+function po(e) {
+  l(e.edges(), function(n) {
+    var r = e.edge(n);
+    r.reversed && r.points.reverse();
+  });
+}
+function go(e) {
+  l(e.nodes(), function(n) {
+    if (e.children(n).length) {
+      var r = e.node(n), t = e.node(r.borderTop), a = e.node(r.borderBottom), o = e.node(W(r.borderLeft)), i = e.node(W(r.borderRight));
+      r.width = Math.abs(i.x - o.x), r.height = Math.abs(a.y - t.y), r.x = o.x + r.width / 2, r.y = t.y + r.height / 2;
+    }
+  }), l(e.nodes(), function(n) {
+    e.node(n).dummy === "border" && e.removeNode(n);
+  });
+}
+function vo(e) {
+  l(e.edges(), function(n) {
+    if (n.v === n.w) {
+      var r = e.node(n.v);
+      r.selfEdges || (r.selfEdges = []), r.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n);
+    }
+  });
+}
+function bo(e) {
+  var n = ne(e);
+  l(n, function(r) {
+    var t = 0;
+    l(r, function(a, o) {
+      var i = e.node(a);
+      i.order = o + t, l(i.selfEdges, function(s) {
+        A(
+          e,
+          "selfedge",
+          {
+            width: s.label.width,
+            height: s.label.height,
+            rank: i.rank,
+            order: o + ++t,
+            e: s.e,
+            label: s.label
+          },
+          "_se"
+        );
+      }), delete i.selfEdges;
+    });
+  });
+}
+function wo(e) {
+  l(e.nodes(), function(n) {
+    var r = e.node(n);
+    if (r.dummy === "selfedge") {
+      var t = e.node(r.e.v), a = t.x + t.width / 2, o = t.y, i = r.x - a, s = t.height / 2;
+      e.setEdge(r.e, r.label), e.removeNode(n), r.label.points = [
+        { x: a + 2 * i / 3, y: o - s },
+        { x: a + 5 * i / 6, y: o - s },
+        { x: a + i, y: o },
+        { x: a + 5 * i / 6, y: o + s },
+        { x: a + 2 * i / 3, y: o + s }
+      ], r.label.x = r.x, r.label.y = r.y;
+    }
+  });
+}
+function ie(e, n) {
+  return ee(q(e, n), Number);
+}
+function oe(e) {
+  var n = {};
+  return l(e, function(r, t) {
+    n[t.toLowerCase()] = r;
+  }), n;
+}
+var en = /* @__PURE__ */ x((e, n, r) => Math.max(n, Math.min(r, e)), "clamp"), nn = /* @__PURE__ */ x((e = "TB") => {
+  switch (e) {
+    case "BT":
+      return "bottom";
+    case "LR":
+      return "right";
+    case "RL":
+      return "left";
+    case "TB":
+    default:
+      return "top";
+  }
+}, "getDefaultSelfLoopSide"), mo = /* @__PURE__ */ x((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram" || e === "er" || e === "classDiagram", "shouldMergeSelfLoopSegments"), yo = [
+  "x",
+  "y",
+  "width",
+  "height",
+  "labelBBox",
+  "intersect",
+  "calcIntersect",
+  "diff",
+  "clusterNode"
+], xo = /* @__PURE__ */ x((e, n, r, t, a) => {
+  const o = [], i = /* @__PURE__ */ new Set();
+  if (r.forEach(({ start: f, end: c }) => {
+    f !== t && i.add(f), c !== t && i.add(c);
+  }), i.forEach((f) => {
+    const c = e.node(f);
+    typeof c?.x == "number" && typeof c?.y == "number" && o.push(c);
+  }), o.length === 0 && r.forEach(({ edge: f }) => {
+    (f.points ?? []).forEach((c) => {
+      typeof c?.x == "number" && typeof c?.y == "number" && o.push(c);
+    });
+  }), o.length === 0)
+    return nn(a);
+  const s = o.reduce(
+    (f, c) => ({
+      x: f.x + c.x / o.length,
+      y: f.y + c.y / o.length
+    }),
+    { x: 0, y: 0 }
+  ), d = s.x - n.x, u = s.y - n.y;
+  return Math.abs(d) > Math.abs(u) ? d > 0 ? "right" : "left" : Math.abs(u) > 0 ? u > 0 ? "bottom" : "top" : nn(a);
+}, "getSelfLoopSide"), Eo = /* @__PURE__ */ x((e, n = "top", r = 0, t = 0) => {
+  const a = e.x, o = e.y - r, i = e.width / 2, s = e.height / 2, d = Math.max(36, Math.min(100, e.width * 0.8)), u = en(Math.max(t, e.width * 0.35), 36, d), f = en(Math.min(e.width, e.height) * 0.45, 24, 48);
+  switch (n) {
+    case "bottom": {
+      const c = o + s;
+      return [
+        { x: a - u / 2, y: c },
+        { x: a - u / 2, y: c + f },
+        { x: a + u / 2, y: c + f },
+        { x: a + u / 2, y: c }
+      ];
+    }
+    case "right": {
+      const c = a + i;
+      return [
+        { x: c, y: o - u / 2 },
+        { x: c + f, y: o - u / 2 },
+        { x: c + f, y: o + u / 2 },
+        { x: c, y: o + u / 2 }
+      ];
+    }
+    case "left": {
+      const c = a - i;
+      return [
+        { x: c, y: o - u / 2 },
+        { x: c - f, y: o - u / 2 },
+        { x: c - f, y: o + u / 2 },
+        { x: c, y: o + u / 2 }
+      ];
+    }
+    case "top":
+    default: {
+      const c = o - s;
+      return [
+        { x: a - u / 2, y: c },
+        { x: a - u / 2, y: c - f },
+        { x: a + u / 2, y: c - f },
+        { x: a + u / 2, y: c }
+      ];
+    }
+  }
+}, "getSelfLoopPoints"), Lo = /* @__PURE__ */ x((e, n, r = "top", t = 0, a = {}) => {
+  const i = e.x, s = e.y - t, d = a.width ?? 0, u = a.height ?? 0;
+  switch (r) {
+    case "bottom":
+      return { x: i, y: Math.max(...n.map((f) => f.y)) + u / 2 + 4 };
+    case "right":
+      return { x: Math.max(...n.map((f) => f.x)) + d / 2 + 4, y: s };
+    case "left":
+      return { x: Math.min(...n.map((f) => f.x)) - d / 2 - 4, y: s };
+    case "top":
+    default:
+      return { x: i, y: Math.min(...n.map((f) => f.y)) - u / 2 - 4 };
+  }
+}, "getSelfLoopLabelPosition"), Gn = /* @__PURE__ */ x((e, n = 0, { mergeSelfLoops: r = !0 } = {}) => {
+  const t = /* @__PURE__ */ new Map(), a = [], o = e.graph()?.rankdir;
+  return e.edges().forEach((i) => {
+    const s = e.edge(i);
+    if (r && s.selfLoop) {
+      const d = s.selfLoop.id;
+      t.has(d) || t.set(d, []), t.get(d).push({ edge: s, start: i.v, end: i.w });
+    } else
+      a.push({ edge: s, start: i.v, end: i.w });
+  }), t.forEach((i) => {
+    if (i.length !== 3) {
+      i.forEach((w) => a.push(w));
+      return;
+    }
+    i.sort((w, P) => w.edge.selfLoop.order - P.edge.selfLoop.order);
+    const [s, d, u] = i, f = s.edge.originalEdge ?? d.edge.originalEdge ?? u.edge.originalEdge ?? d.edge, c = e.node(f.start);
+    if (!c) {
+      i.forEach((w) => a.push(w));
+      return;
+    }
+    const h = {
+      width: d.edge.width,
+      height: d.edge.height
+    }, v = xo(e, c, i, f.start, o), p = Eo(c, v, n, h.width ?? 0), g = Lo(c, p, v, n, h), b = {
+      ...d.edge,
+      ...f,
+      id: f.id,
+      points: p,
+      start: f.start,
+      end: f.end,
+      x: g.x,
+      y: g.y,
+      width: h.width,
+      height: h.height,
+      labelStyle: d.edge.labelStyle,
+      fromCluster: s.edge.fromCluster ?? d.edge.fromCluster ?? u.edge.fromCluster,
+      toCluster: s.edge.toCluster ?? d.edge.toCluster ?? u.edge.toCluster
+    };
+    delete b.selfLoop, delete b.originalEdge, a.push({ edge: b, start: b.start, end: b.end });
+  }), a;
+}, "getEdgesToRender"), Yn = /* @__PURE__ */ x(async ({
+  element: e,
+  graph: n,
+  diagramType: r,
+  id: t,
+  parentCluster: a,
+  siteConfig: o
+}) => {
+  const i = n.graph().rankdir;
+  m.trace("Dir in recursive render - dir:", i);
+  const {
+    clusters: s,
+    edgePaths: d,
+    edgeLabels: u,
+    nodes: f,
+    rootGroups: c
+  } = Hn(e, {
+    edgePathsClass: "edgePaths"
+  });
+  n.nodes() ? m.info("Recursive render XXX", n.nodes()) : m.info("No nodes found for", n), n.edges().length > 0 && m.info("Recursive edges", n.edge(n.edges()[0]));
+  const h = mo(r);
+  await Promise.all(
+    n.nodes().map(async function(g) {
+      const b = n.node(g);
+      if (a !== void 0) {
+        const w = JSON.parse(JSON.stringify(a.clusterData));
+        m.trace(
+          `Setting data for parent cluster XXX
+ Node.id = `,
+          g,
+          `
+ data=`,
+          w.height,
+          `
+Parent cluster`,
+          a.height
+        ), n.setNode(a.id, w), n.parent(g) || (m.trace("Setting parent", g, a.id), n.setParent(g, a.id, w));
+      }
+      if (m.info("(Insert) Node XXX" + g + ": " + JSON.stringify(n.node(g))), b?.clusterNode) {
+        m.info("Cluster identified XBX", g, b.width, n.node(g));
+        const { ranksep: w, nodesep: P } = n.graph();
+        b.graph.setGraph({
+          ...b.graph.graph(),
+          ranksep: w + 25,
+          nodesep: P
+        });
+        const Ne = await So({
+          element: f,
+          graph: b.graph,
+          diagramType: r,
+          id: t,
+          parentCluster: n.node(g),
+          siteConfig: o
+        }), Pe = Ne.elem;
+        Kn(b, Pe), b.diff = Ne.diff || 0, m.info(
+          "New compound node after recursive render XAX",
+          g,
+          "width",
+          // node,
+          b.width,
+          "height",
+          b.height
+          // node.x,
+          // node.y
+        ), Zn(Pe, b);
+      } else
+        n.children(g).length > 0 ? (m.trace(
+          "Cluster - the non recursive path XBX",
+          g,
+          b.id,
+          b,
+          b.width,
+          "Graph:",
+          n
+        ), m.trace(Te(b.id, n)), T.set(b.id, { id: Te(b.id, n), node: b })) : (m.trace("Node - the non recursive path XAX", g, f, n.node(g), i), await zn(f, n.node(g), { config: o, dir: i }));
+    })
+  ), await (/* @__PURE__ */ x(async () => {
+    const g = n.edges().map(async function(b) {
+      const w = n.edge(b.v, b.w, b.name);
+      if (m.info("Edge " + b.v + " -> " + b.w + ": " + JSON.stringify(b)), m.info("Edge " + b.v + " -> " + b.w + ": ", b, " ", JSON.stringify(n.edge(b))), m.info(
+        "Fix",
+        T,
+        "ids:",
+        b.v,
+        b.w,
+        "Translating: ",
+        T.get(b.v),
+        T.get(b.w)
+      ), h && w.selfLoop) {
+        if (w.selfLoop.order !== 1)
+          return;
+        const P = {
+          ...w.originalEdge,
+          ...w,
+          id: w.selfLoop.id,
+          startLabelLeft: w.originalEdge?.startLabelLeft ?? w.startLabelLeft,
+          startLabelRight: w.originalEdge?.startLabelRight ?? w.startLabelRight,
+          endLabelLeft: w.originalEdge?.endLabelLeft ?? w.endLabelLeft,
+          endLabelRight: w.originalEdge?.endLabelRight ?? w.endLabelRight
+        };
+        await Se(u, P), w.width = P.width, w.height = P.height, w.labelStyle = P.labelStyle;
+        return;
+      }
+      await Se(u, w);
+    });
+    await Promise.all(g);
+  }, "processEdges"))();
+  const { subGraphTitleTotalMargin: p } = Qn(o);
+  return {
+    elem: c,
+    graph: n,
+    groups: { clusters: s, edgePaths: d, edgeLabels: u, nodes: f, rootGroups: c },
+    diagramType: r,
+    id: t,
+    mergeSelfLoops: h,
+    subGraphTitleTotalMargin: p
+  };
+}, "measureDagreGraph"), Un = /* @__PURE__ */ x((e) => {
+  m.info("############################################# XXX"), m.info("###                Layout                 ### XXX"), m.info("############################################# XXX"), Hi(e);
+}, "runDagreGraphLayout"), Oo = /* @__PURE__ */ x((e, n, r) => {
+  const t = e.node(n);
+  if (!t)
+    return;
+  const a = { ...t };
+  return t?.clusterNode ? a.y = (t.y ?? 0) + r : e.children(n).length > 0 ? a.height = (t.height ?? 0) + r : a.y = (t.y ?? 0) + r / 2, a;
+}, "normalizeDagreNode"), rn = /* @__PURE__ */ x((e, n) => {
+  yo.forEach((r) => {
+    n[r] !== void 0 && (e[r] = n[r]);
+  });
+}, "applyDagreNodeLayout"), No = /* @__PURE__ */ x((e, n, r, t) => ({
+  ...e,
+  start: e.start ?? n,
+  end: e.end ?? r,
+  points: (e.points ?? []).map((a) => ({
+    ...a,
+    y: typeof a.y == "number" ? a.y + t : a.y
+  }))
+}), "normalizeDagreEdge"), Po = /* @__PURE__ */ x((e, n) => {
+  const { graph: r, mergeSelfLoops: t, subGraphTitleTotalMargin: a = 0 } = n, o = new Map(e.nodes.map((s) => [s.id, s]));
+  ce(r).forEach((s) => {
+    const d = Oo(r, s, a);
+    if (!d)
+      return;
+    rn(r.node(s), d);
+    const u = o.get(s);
+    u && rn(u, d);
+  });
+  const i = a / 2;
+  return e.edges = Gn(r, i, { mergeSelfLoops: t }).map(
+    ({ edge: s, start: d, end: u }) => No(s, d, u, i)
+  ), e;
+}, "applyDagreLayoutResult"), To = /* @__PURE__ */ x(async ({
+  elem: e,
+  graph: n,
+  groups: { clusters: r, edgePaths: t },
+  diagramType: a,
+  id: o,
+  mergeSelfLoops: i,
+  subGraphTitleTotalMargin: s
+}) => {
+  let d = 0;
+  await Promise.all(
+    ce(n).map(async function(c) {
+      const h = n.node(c);
+      if (m.info(
+        "Position XBX => " + c + ": (" + h.x,
+        "," + h.y,
+        ") width: ",
+        h.width,
+        " height: ",
+        h.height
+      ), h?.clusterNode)
+        h.y += s, m.info(
+          "A tainted cluster node XBX1",
+          c,
+          h.id,
+          h.width,
+          h.height,
+          h.x,
+          h.y,
+          n.parent(c)
+        ), T.get(h.id).node = h, Ce(h);
+      else if (n.children(c).length > 0) {
+        m.info(
+          "A pure cluster node XBX1",
+          c,
+          h.id,
+          h.x,
+          h.y,
+          h.width,
+          h.height,
+          n.parent(c)
+        ), h.height += s, n.node(h.parentId);
+        const v = h?.padding / 2 || 0, p = h?.labelBBox?.height || 0, g = p - v || 0;
+        m.debug("OffsetY", g, "labelHeight", p, "halfPadding", v), await er(r, h), T.get(h.id).node = h;
+      } else {
+        const v = n.node(h.parentId);
+        h.y += s / 2, m.info(
+          "A regular node XBX1 - using the padding",
+          h.id,
+          "parent",
+          h.parentId,
+          h.width,
+          h.height,
+          h.x,
+          h.y,
+          "offsetY",
+          h.offsetY,
+          "parent",
+          v,
+          v?.offsetY,
+          h
+        ), Ce(h);
+      }
+    })
+  );
+  const u = s / 2;
+  return Gn(n, u, { mergeSelfLoops: i }).forEach(function({ edge: c, start: h, end: v }) {
+    m.info("Edge " + h + " -> " + v + ": " + JSON.stringify(c), c), c.points.forEach((w) => w.y += u);
+    const p = n.node(h), g = n.node(v), b = nr(t, c, T, a, p, g, o);
+    rr(c, b);
+  }), n.nodes().forEach(function(c) {
+    const h = n.node(c);
+    m.info(c, h.type, h.diff), h.isGroup && (d = h.diff);
+  }), m.warn("Returning from recursive render XAX", e, d), { elem: e, diff: d };
+}, "paintDagreLayoutCore"), So = /* @__PURE__ */ x(async (e) => {
+  const n = await Yn(e);
+  return Un(n.graph), await To(n);
+}, "renderDagreSubgraph"), Vn = /* @__PURE__ */ x((e) => {
+  const n = new N({
+    multigraph: !0,
+    compound: !0
+  }).setGraph({
+    rankdir: e.direction,
+    // Precedence: an explicit top-level config override (only present when a
+    // user sets it - it has no schema default) > the value the diagram's own
+    // renderer put on data4Layout (usually derived from that diagram's config)
+    // > the flowchart config as a generic fallback. The flowchart keys have
+    // schema defaults and therefore always exist, so they must come last or
+    // they silently shadow every diagram's own spacing (see #7932).
+    nodesep: e.config?.nodeSpacing || e.nodeSpacing || e.config?.flowchart?.nodeSpacing,
+    ranksep: e.config?.rankSpacing || e.rankSpacing || e.config?.flowchart?.rankSpacing,
+    marginx: 8,
+    marginy: 8
+  }).setDefaultEdgeLabel(function() {
+    return {};
+  });
+  return e.nodes.forEach((r) => {
+    n.setNode(r.id, { ...r }), r.parentId && n.setParent(r.id, r.parentId);
+  }), m.debug("Edges:", e.edges), e.edges.forEach((r) => {
+    if (r.start === r.end) {
+      const t = r.start, a = t + "---" + t + "---1", o = t + "---" + t + "---2", i = n.node(t);
+      n.setNode(a, {
+        domId: a,
+        id: a,
+        parentId: i.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        // shape: 'rect',
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(a, i.parentId), n.setNode(o, {
+        domId: o,
+        id: o,
+        parentId: i.parentId,
+        labelStyle: "",
+        padding: 0,
+        // shape: 'rect',
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(o, i.parentId);
+      const s = structuredClone(r), d = structuredClone(r), u = structuredClone(r), f = structuredClone(r);
+      d.originalEdge = s, d.selfLoop = { id: s.id, order: 0 }, u.originalEdge = s, u.selfLoop = { id: s.id, order: 1 }, f.originalEdge = s, f.selfLoop = { id: s.id, order: 2 }, d.label = "", d.arrowTypeEnd = "none", d.endLabelLeft = "", d.endLabelRight = "", d.startLabelLeft = "", d.id = t + "-cyclic-special-1", u.startLabelRight = "", u.startLabelLeft = "", u.endLabelLeft = "", u.endLabelRight = "", u.arrowTypeStart = "none", u.arrowTypeEnd = "none", u.id = t + "-cyclic-special-mid", f.label = "", f.startLabelRight = "", f.startLabelLeft = "", f.arrowTypeStart = "none", i.isGroup && (d.fromCluster = t, f.toCluster = t), f.id = t + "-cyclic-special-2", f.arrowTypeStart = "none", n.setEdge(t, a, d, t + "-cyclic-special-0"), n.setEdge(a, o, u, t + "-cyclic-special-1"), n.setEdge(o, t, f, t + "-cyclic-special-2");
+    } else
+      n.setEdge(r.start, r.end, { ...r }, r.id);
+  }), Wn(n), { graph: n };
+}, "prepareLayoutForDagre"), Co = /* @__PURE__ */ x(async (e, { element: n, preparedLayout: r }) => {
+  const t = r ?? Vn(e), a = Jn(), o = await Yn({
+    element: n,
+    graph: t.graph,
+    diagramType: e.type,
+    id: e.diagramId,
+    parentCluster: void 0,
+    siteConfig: a
+  });
+  return t.measuredLayout = o, o;
+}, "measureDagreLayout"), Io = /* @__PURE__ */ x((e, n) => {
+  const r = n.preparedLayout?.measuredLayout;
+  if (!r)
+    throw new Error("runDagreLayoutCore requires measureDagreLayout to run first");
+  return Un(r.graph), Po(e, r), r;
+}, "runDagreLayoutCore"), Ro = /* @__PURE__ */ x((e, { measure: n }) => ce(n.graph).map((r) => n.graph.node(r)).filter(Boolean), "getDagrePaintNodes"), ko = /* @__PURE__ */ x((e, n, { measure: r }) => e ? r.graph.node(e) : void 0, "getDagreEdgeNode"), jo = qn({
+  prepareLayout: Vn,
+  measureLayout: Co,
+  runLayoutCore: Io,
+  paintOptions: {
+    clusterDb: T,
+    getNodes: Ro,
+    getEdgeNode: ko,
+    skipNode: /* @__PURE__ */ x((e, { measure: n }) => !n.graph.hasNode(e.id), "skipNode"),
+    isCluster: /* @__PURE__ */ x((e, { measure: n }) => n.graph.hasNode(e.id) && (n.graph.children(e.id) ?? []).length > 0, "isCluster")
+  }
+});
+export {
+  Po as applyDagreLayoutResult,
+  Gn as getEdgesToRender,
+  Co as measureDagreLayout,
+  Vn as prepareLayoutForDagre,
+  jo as render,
+  Io as runDagreLayoutCore
+};