@foris/avocado-not-front 1.11.7-beta.4 → 1.12.0

package/dist/layout-Q6wQN5dr-BC95Y2G0.js

@@ -0,0 +1,1727 @@
+import { w as Sr, y as kn, C as U, s as fn, W as Tr, i as Lr, k as z, I as Wn, c as x, Q as J, V as Kn, K as Cr, U as Qn, m as Zn, d as $, J as V, a as dn, e as Hn, O as sn, b as Xn, f as Fr, h as Vr, j as _, B as Br, l as En, Z as Gr, n as Ur, o as nr, p as rr, q as vn, r as Yr, A as Nn, t as hn, M as qr, u as gn, v as tr, L as Dr, x as zr, S as s, g as O, Y as Jr, z as Wr, D as Kr, G as _n, E as er, F as Y, N as j, H as I, P as W, R as or, T as Qr, X as Zr, _ as L, $ as Hr, a0 as Xr, a1 as nt } from "./graph-DB2UxkYH-Bs-uwV4G.js";
+var rt = /\s/;
+function tt(n) {
+  for (var r = n.length; r-- && rt.test(n.charAt(r)); )
+    ;
+  return r;
+}
+var et = /^\s+/;
+function ot(n) {
+  return n && n.slice(0, tt(n) + 1).replace(et, "");
+}
+var In = NaN, it = /^[-+]0x[0-9a-f]+$/i, at = /^0b[01]+$/i, ut = /^0o[0-7]+$/i, ct = parseInt;
+function ft(n) {
+  if (typeof n == "number")
+    return n;
+  if (Y(n))
+    return In;
+  if (x(n)) {
+    var r = typeof n.valueOf == "function" ? n.valueOf() : n;
+    n = x(r) ? r + "" : r;
+  }
+  if (typeof n != "string")
+    return n === 0 ? n : +n;
+  n = ot(n);
+  var t = at.test(n);
+  return t || ut.test(n) ? ct(n.slice(2), t ? 2 : 8) : it.test(n) ? In : +n;
+}
+var Pn = 1 / 0, dt = 17976931348623157e292;
+function B(n) {
+  if (!n)
+    return n === 0 ? n : 0;
+  if (n = ft(n), n === Pn || n === -Pn) {
+    var r = n < 0 ? -1 : 1;
+    return r * dt;
+  }
+  return n === n ? n : 0;
+}
+function st(n) {
+  var r = B(n), t = r % 1;
+  return r === r ? t ? r - t : r : 0;
+}
+var $n = Object.create, vt = /* @__PURE__ */ function() {
+  function n() {
+  }
+  return function(r) {
+    if (!x(r))
+      return {};
+    if ($n)
+      return $n(r);
+    n.prototype = r;
+    var t = new n();
+    return n.prototype = void 0, t;
+  };
+}();
+function ir(n, r) {
+  var t = -1, e = n.length;
+  for (r || (r = Array(e)); ++t < e; )
+    r[t] = n[t];
+  return r;
+}
+function K(n, r, t) {
+  r == "__proto__" && Nn ? Nn(n, r, {
+    configurable: !0,
+    enumerable: !0,
+    value: t,
+    writable: !0
+  }) : n[r] = t;
+}
+var ht = Object.prototype, gt = ht.hasOwnProperty;
+function Q(n, r, t) {
+  var e = n[r];
+  (!(gt.call(n, r) && z(e, t)) || t === void 0 && !(r in n)) && K(n, r, t);
+}
+function C(n, r, t, e) {
+  var o = !t;
+  t || (t = {});
+  for (var a = -1, i = r.length; ++a < i; ) {
+    var u = r[a], c = void 0;
+    c === void 0 && (c = n[u]), o ? K(t, u, c) : Q(t, u, c);
+  }
+  return t;
+}
+function R(n, r, t) {
+  if (!x(t))
+    return !1;
+  var e = typeof r;
+  return (e == "number" ? J(t) && Kn(r, t.length) : e == "string" && r in t) ? z(t[r], n) : !1;
+}
+function lt(n) {
+  return fn(function(r, t) {
+    var e = -1, o = t.length, a = o > 1 ? t[o - 1] : void 0, i = o > 2 ? t[2] : void 0;
+    for (a = n.length > 3 && typeof a == "function" ? (o--, a) : void 0, i && R(t[0], t[1], i) && (a = o < 3 ? void 0 : a, o = 1), r = Object(r); ++e < o; ) {
+      var u = t[e];
+      u && n(r, u, e, a);
+    }
+    return r;
+  });
+}
+function pt(n) {
+  var r = [];
+  if (n != null)
+    for (var t in Object(n))
+      r.push(t);
+  return r;
+}
+var bt = Object.prototype, wt = bt.hasOwnProperty;
+function yt(n) {
+  if (!x(n))
+    return pt(n);
+  var r = Hn(n), t = [];
+  for (var e in n)
+    e == "constructor" && (r || !wt.call(n, e)) || t.push(e);
+  return t;
+}
+function E(n) {
+  return J(n) ? Cr(n, !0) : yt(n);
+}
+function M(n) {
+  var r = n == null ? 0 : n.length;
+  return r ? Wn(n) : [];
+}
+function mt(n) {
+  return Tr(Lr(n, void 0, M), n + "");
+}
+var ln = Jr(Object.getPrototypeOf, Object), jt = "[object Object]", xt = Function.prototype, Ot = Object.prototype, ar = xt.toString, kt = Ot.hasOwnProperty, Et = ar.call(Object);
+function Nt(n) {
+  if (!hn(n) || qr(n) != jt)
+    return !1;
+  var r = ln(n);
+  if (r === null)
+    return !0;
+  var t = kt.call(r, "constructor") && r.constructor;
+  return typeof t == "function" && t instanceof t && ar.call(t) == Et;
+}
+function _t(n, r) {
+  return n && C(r, gn(r), n);
+}
+function It(n, r) {
+  return n && C(r, E(r), n);
+}
+var ur = typeof exports == "object" && exports && !exports.nodeType && exports, Mn = ur && typeof module == "object" && module && !module.nodeType && module, Pt = Mn && Mn.exports === ur, An = Pt ? Sr.Buffer : void 0, Rn = An ? An.allocUnsafe : void 0;
+function cr(n, r) {
+  if (r)
+    return n.slice();
+  var t = n.length, e = Rn ? Rn(t) : new n.constructor(t);
+  return n.copy(e), e;
+}
+function $t(n, r) {
+  return C(n, tr(n), r);
+}
+var Mt = Object.getOwnPropertySymbols, fr = Mt ? function(n) {
+  for (var r = []; n; )
+    Wr(r, tr(n)), n = ln(n);
+  return r;
+} : Kr;
+function At(n, r) {
+  return C(n, fr(n), r);
+}
+function Rt(n) {
+  return Hr(n, E, fr);
+}
+var St = Object.prototype, Tt = St.hasOwnProperty;
+function Lt(n) {
+  var r = n.length, t = new n.constructor(r);
+  return r && typeof n[0] == "string" && Tt.call(n, "index") && (t.index = n.index, t.input = n.input), t;
+}
+function pn(n) {
+  var r = new n.constructor(n.byteLength);
+  return new _n(r).set(new _n(n)), r;
+}
+function Ct(n, r) {
+  var t = r ? pn(n.buffer) : n.buffer;
+  return new n.constructor(t, n.byteOffset, n.byteLength);
+}
+var Ft = /\w*$/;
+function Vt(n) {
+  var r = new n.constructor(n.source, Ft.exec(n));
+  return r.lastIndex = n.lastIndex, r;
+}
+var Sn = kn ? kn.prototype : void 0, Tn = Sn ? Sn.valueOf : void 0;
+function Bt(n) {
+  return Tn ? Object(Tn.call(n)) : {};
+}
+function dr(n, r) {
+  var t = r ? pn(n.buffer) : n.buffer;
+  return new n.constructor(t, n.byteOffset, n.length);
+}
+var Gt = "[object Boolean]", Ut = "[object Date]", Yt = "[object Map]", qt = "[object Number]", Dt = "[object RegExp]", zt = "[object Set]", Jt = "[object String]", Wt = "[object Symbol]", Kt = "[object ArrayBuffer]", Qt = "[object DataView]", Zt = "[object Float32Array]", Ht = "[object Float64Array]", Xt = "[object Int8Array]", ne = "[object Int16Array]", re = "[object Int32Array]", te = "[object Uint8Array]", ee = "[object Uint8ClampedArray]", oe = "[object Uint16Array]", ie = "[object Uint32Array]";
+function ae(n, r, t) {
+  var e = n.constructor;
+  switch (r) {
+    case Kt:
+      return pn(n);
+    case Gt:
+    case Ut:
+      return new e(+n);
+    case Qt:
+      return Ct(n, t);
+    case Zt:
+    case Ht:
+    case Xt:
+    case ne:
+    case re:
+    case te:
+    case ee:
+    case oe:
+    case ie:
+      return dr(n, t);
+    case Yt:
+      return new e();
+    case qt:
+    case Jt:
+      return new e(n);
+    case Dt:
+      return Vt(n);
+    case zt:
+      return new e();
+    case Wt:
+      return Bt(n);
+  }
+}
+function sr(n) {
+  return typeof n.constructor == "function" && !Hn(n) ? vt(ln(n)) : {};
+}
+var ue = "[object Map]";
+function ce(n) {
+  return hn(n) && sn(n) == ue;
+}
+var Ln = U && U.isMap, fe = Ln ? vn(Ln) : ce, de = "[object Set]";
+function se(n) {
+  return hn(n) && sn(n) == de;
+}
+var Cn = U && U.isSet, ve = Cn ? vn(Cn) : se, he = 1, ge = 2, le = 4, vr = "[object Arguments]", pe = "[object Array]", be = "[object Boolean]", we = "[object Date]", ye = "[object Error]", hr = "[object Function]", me = "[object GeneratorFunction]", je = "[object Map]", xe = "[object Number]", gr = "[object Object]", Oe = "[object RegExp]", ke = "[object Set]", Ee = "[object String]", Ne = "[object Symbol]", _e = "[object WeakMap]", Ie = "[object ArrayBuffer]", Pe = "[object DataView]", $e = "[object Float32Array]", Me = "[object Float64Array]", Ae = "[object Int8Array]", Re = "[object Int16Array]", Se = "[object Int32Array]", Te = "[object Uint8Array]", Le = "[object Uint8ClampedArray]", Ce = "[object Uint16Array]", Fe = "[object Uint32Array]", p = {};
+p[vr] = p[pe] = p[Ie] = p[Pe] = p[be] = p[we] = p[$e] = p[Me] = p[Ae] = p[Re] = p[Se] = p[je] = p[xe] = p[gr] = p[Oe] = p[ke] = p[Ee] = p[Ne] = p[Te] = p[Le] = p[Ce] = p[Fe] = !0;
+p[ye] = p[hr] = p[_e] = !1;
+function G(n, r, t, e, o, a) {
+  var i, u = r & he, c = r & ge, f = r & le;
+  if (i !== void 0)
+    return i;
+  if (!x(n))
+    return n;
+  var d = _(n);
+  if (d) {
+    if (i = Lt(n), !u)
+      return ir(n, i);
+  } else {
+    var v = sn(n), h = v == hr || v == me;
+    if (Xn(n))
+      return cr(n, u);
+    if (v == gr || v == vr || h && !o) {
+      if (i = c || h ? {} : sr(n), !u)
+        return c ? At(n, It(i, n)) : $t(n, _t(i, n));
+    } else {
+      if (!p[v])
+        return o ? n : {};
+      i = ae(n, v, u);
+    }
+  }
+  a || (a = new Zn());
+  var g = a.get(n);
+  if (g)
+    return g;
+  a.set(n, i), ve(n) ? n.forEach(function(y) {
+    i.add(G(y, r, t, y, n, a));
+  }) : fe(n) && n.forEach(function(y, m) {
+    i.set(m, G(y, r, t, m, n, a));
+  });
+  var l = f ? c ? Rt : Dr : c ? E : gn, b = d ? void 0 : l(n);
+  return Fr(b || n, function(y, m) {
+    b && (m = y, y = n[m]), Q(i, m, G(y, r, t, m, n, a));
+  }), i;
+}
+var Ve = 1, Be = 4;
+function Ge(n) {
+  return G(n, Ve | Be);
+}
+var lr = Object.prototype, Ue = lr.hasOwnProperty, Ye = fn(function(n, r) {
+  n = Object(n);
+  var t = -1, e = r.length, o = e > 2 ? r[2] : void 0;
+  for (o && R(r[0], r[1], o) && (e = 1); ++t < e; )
+    for (var a = r[t], i = E(a), u = -1, c = i.length; ++u < c; ) {
+      var f = i[u], d = n[f];
+      (d === void 0 || z(d, lr[f]) && !Ue.call(n, f)) && (n[f] = a[f]);
+    }
+  return n;
+});
+function on(n, r, t) {
+  (t !== void 0 && !z(n[r], t) || t === void 0 && !(r in n)) && K(n, r, t);
+}
+function an(n, r) {
+  if (!(r === "constructor" && typeof n[r] == "function") && r != "__proto__")
+    return n[r];
+}
+function qe(n) {
+  return C(n, E(n));
+}
+function De(n, r, t, e, o, a, i) {
+  var u = an(n, t), c = an(r, t), f = i.get(c);
+  if (f) {
+    on(n, t, f);
+    return;
+  }
+  var d = a ? a(u, c, t + "", n, r, i) : void 0, v = d === void 0;
+  if (v) {
+    var h = _(c), g = !h && Xn(c), l = !h && !g && Vr(c);
+    d = c, h || g || l ? _(u) ? d = u : Br(u) ? d = ir(u) : g ? (v = !1, d = cr(c, !0)) : l ? (v = !1, d = dr(c, !0)) : d = [] : Nt(c) || En(c) ? (d = u, En(u) ? d = qe(u) : (!x(u) || Gr(u)) && (d = sr(c))) : v = !1;
+  }
+  v && (i.set(c, d), o(d, c, e, a, i), i.delete(c)), on(n, t, d);
+}
+function pr(n, r, t, e, o) {
+  n !== r && Qn(r, function(a, i) {
+    if (o || (o = new Zn()), x(a))
+      De(n, r, i, t, pr, e, o);
+    else {
+      var u = e ? e(an(n, i), a, i + "", n, r, o) : void 0;
+      u === void 0 && (u = a), on(n, i, u);
+    }
+  }, E);
+}
+function q(n) {
+  var r = n == null ? 0 : n.length;
+  return r ? n[r - 1] : void 0;
+}
+function ze(n) {
+  return function(r, t, e) {
+    var o = Object(r);
+    if (!J(r)) {
+      var a = $(t);
+      r = gn(r), t = function(u) {
+        return a(o[u], u, o);
+      };
+    }
+    var i = n(r, t, e);
+    return i > -1 ? o[a ? r[i] : i] : void 0;
+  };
+}
+var Je = Math.max;
+function We(n, r, t) {
+  var e = n == null ? 0 : n.length;
+  if (!e)
+    return -1;
+  var o = t == null ? 0 : st(t);
+  return o < 0 && (o = Je(e + o, 0)), nt(n, $(r), o);
+}
+var bn = ze(We);
+function br(n, r) {
+  var t = -1, e = J(n) ? Array(n.length) : [];
+  return Ur(n, function(o, a, i) {
+    e[++t] = r(o, a, i);
+  }), e;
+}
+function w(n, r) {
+  var t = _(n) ? V : br;
+  return t(n, $(r));
+}
+function Ke(n, r) {
+  return n == null ? n : Qn(n, or(r), E);
+}
+function Qe(n, r) {
+  return n && er(n, or(r));
+}
+function Ze(n, r) {
+  return n > r;
+}
+var He = Object.prototype, Xe = He.hasOwnProperty;
+function no(n, r) {
+  return n != null && Xe.call(n, r);
+}
+function wr(n, r) {
+  return n != null && Qr(n, r, no);
+}
+function yr(n, r) {
+  return n < r;
+}
+function Z(n, r) {
+  var t = {};
+  return r = $(r), er(n, function(e, o, a) {
+    K(t, o, r(e, o, a));
+  }), t;
+}
+function wn(n, r, t) {
+  for (var e = -1, o = n.length; ++e < o; ) {
+    var a = n[e], i = r(a);
+    if (i != null && (u === void 0 ? i === i && !Y(i) : t(i, u)))
+      var u = i, c = a;
+  }
+  return c;
+}
+function k(n) {
+  return n && n.length ? wn(n, dn, Ze) : void 0;
+}
+var un = lt(function(n, r, t) {
+  pr(n, r, t);
+});
+function S(n) {
+  return n && n.length ? wn(n, dn, yr) : void 0;
+}
+function yn(n, r) {
+  return n && n.length ? wn(n, $(r), yr) : void 0;
+}
+function ro(n, r, t, e) {
+  if (!x(n))
+    return n;
+  r = rr(r, n);
+  for (var o = -1, a = r.length, i = a - 1, u = n; u != null && ++o < a; ) {
+    var c = zr(r[o]), f = t;
+    if (c === "__proto__" || c === "constructor" || c === "prototype")
+      return n;
+    if (o != i) {
+      var d = u[c];
+      f = void 0, f === void 0 && (f = x(d) ? d : Kn(r[o + 1]) ? [] : {});
+    }
+    Q(u, c, f), u = u[c];
+  }
+  return n;
+}
+function to(n, r, t) {
+  for (var e = -1, o = r.length, a = {}; ++e < o; ) {
+    var i = r[e], u = nr(n, i);
+    t(u, i) && ro(a, rr(i, n), u);
+  }
+  return a;
+}
+function eo(n, r) {
+  var t = n.length;
+  for (n.sort(r); t--; )
+    n[t] = n[t].value;
+  return n;
+}
+function oo(n, r) {
+  if (n !== r) {
+    var t = n !== void 0, e = n === null, o = n === n, a = Y(n), i = r !== void 0, u = r === null, c = r === r, f = Y(r);
+    if (!u && !f && !a && n > r || a && i && c && !u && !f || e && i && c || !t && c || !o)
+      return 1;
+    if (!e && !a && !f && n < r || f && t && o && !e && !a || u && t && o || !i && o || !c)
+      return -1;
+  }
+  return 0;
+}
+function io(n, r, t) {
+  for (var e = -1, o = n.criteria, a = r.criteria, i = o.length, u = t.length; ++e < i; ) {
+    var c = oo(o[e], a[e]);
+    if (c) {
+      if (e >= u)
+        return c;
+      var f = t[e];
+      return c * (f == "desc" ? -1 : 1);
+    }
+  }
+  return n.index - r.index;
+}
+function ao(n, r, t) {
+  r.length ? r = V(r, function(a) {
+    return _(a) ? function(i) {
+      return nr(i, a.length === 1 ? a[0] : a);
+    } : a;
+  }) : r = [dn];
+  var e = -1;
+  r = V(r, vn($));
+  var o = br(n, function(a, i, u) {
+    var c = V(r, function(f) {
+      return f(a);
+    });
+    return { criteria: c, index: ++e, value: a };
+  });
+  return eo(o, function(a, i) {
+    return io(a, i, t);
+  });
+}
+function uo(n, r) {
+  return to(n, r, function(t, e) {
+    return Yr(n, e);
+  });
+}
+var D = mt(function(n, r) {
+  return n == null ? {} : uo(n, r);
+}), co = Math.ceil, fo = Math.max;
+function so(n, r, t, e) {
+  for (var o = -1, a = fo(co((r - n) / (t || 1)), 0), i = Array(a); a--; )
+    i[++o] = n, n += t;
+  return i;
+}
+function vo(n) {
+  return function(r, t, e) {
+    return e && typeof e != "number" && R(r, t, e) && (t = e = void 0), r = B(r), t === void 0 ? (t = r, r = 0) : t = B(t), e = e === void 0 ? r < t ? 1 : -1 : B(e), so(r, t, e);
+  };
+}
+var P = vo(), F = fn(function(n, r) {
+  if (n == null)
+    return [];
+  var t = r.length;
+  return t > 1 && R(n, r[0], r[1]) ? r = [] : t > 2 && R(r[0], r[1], r[2]) && (r = [r[0]]), ao(n, Wn(r), []);
+}), ho = 0;
+function mn(n) {
+  var r = ++ho;
+  return Zr(n) + r;
+}
+function go(n, r, t) {
+  for (var e = -1, o = n.length, a = r.length, i = {}; ++e < o; ) {
+    var u = e < a ? r[e] : void 0;
+    t(i, n[e], u);
+  }
+  return i;
+}
+function lo(n, r) {
+  return go(n || [], r || [], Q);
+}
+class po {
+  constructor() {
+    var r = {};
+    r._next = r._prev = r, this._sentinel = r;
+  }
+  dequeue() {
+    var r = this._sentinel, t = r._prev;
+    if (t !== r)
+      return Fn(t), t;
+  }
+  enqueue(r) {
+    var t = this._sentinel;
+    r._prev && r._next && Fn(r), r._next = t._next, t._next._prev = r, t._next = r, r._prev = t;
+  }
+  toString() {
+    for (var r = [], t = this._sentinel, e = t._prev; e !== t; )
+      r.push(JSON.stringify(e, bo)), e = e._prev;
+    return "[" + r.join(", ") + "]";
+  }
+}
+function Fn(n) {
+  n._prev._next = n._next, n._next._prev = n._prev, delete n._next, delete n._prev;
+}
+function bo(n, r) {
+  if (n !== "_next" && n !== "_prev")
+    return r;
+}
+var wo = Xr(1);
+function yo(n, r) {
+  if (n.nodeCount() <= 1)
+    return [];
+  var t = jo(n, r || wo), e = mo(t.graph, t.buckets, t.zeroIdx);
+  return M(
+    w(e, function(o) {
+      return n.outEdges(o.v, o.w);
+    })
+  );
+}
+function mo(n, r, t) {
+  for (var e = [], o = r[r.length - 1], a = r[0], i; n.nodeCount(); ) {
+    for (; i = a.dequeue(); )
+      X(n, r, t, i);
+    for (; i = o.dequeue(); )
+      X(n, r, t, i);
+    if (n.nodeCount()) {
+      for (var u = r.length - 2; u > 0; --u)
+        if (i = r[u].dequeue(), i) {
+          e = e.concat(X(n, r, t, i, !0));
+          break;
+        }
+    }
+  }
+  return e;
+}
+function X(n, r, t, e, o) {
+  var a = o ? [] : void 0;
+  return s(n.inEdges(e.v), function(i) {
+    var u = n.edge(i), c = n.node(i.v);
+    o && a.push({ v: i.v, w: i.w }), c.out -= u, cn(r, t, c);
+  }), s(n.outEdges(e.v), function(i) {
+    var u = n.edge(i), c = i.w, f = n.node(c);
+    f.in -= u, cn(r, t, f);
+  }), n.removeNode(e.v), a;
+}
+function jo(n, r) {
+  var t = new O(), e = 0, o = 0;
+  s(n.nodes(), function(u) {
+    t.setNode(u, { v: u, in: 0, out: 0 });
+  }), s(n.edges(), function(u) {
+    var c = t.edge(u.v, u.w) || 0, f = r(u), d = c + f;
+    t.setEdge(u.v, u.w, d), o = Math.max(o, t.node(u.v).out += f), e = Math.max(e, t.node(u.w).in += f);
+  });
+  var a = P(o + e + 3).map(function() {
+    return new po();
+  }), i = e + 1;
+  return s(t.nodes(), function(u) {
+    cn(a, i, t.node(u));
+  }), { graph: t, buckets: a, zeroIdx: i };
+}
+function cn(n, r, t) {
+  t.out ? t.in ? n[t.out - t.in + r].enqueue(t) : n[n.length - 1].enqueue(t) : n[0].enqueue(t);
+}
+function xo(n) {
+  var r = n.graph().acyclicer === "greedy" ? yo(n, t(n)) : Oo(n);
+  s(r, function(e) {
+    var o = n.edge(e);
+    n.removeEdge(e), o.forwardName = e.name, o.reversed = !0, n.setEdge(e.w, e.v, o, mn("rev"));
+  });
+  function t(e) {
+    return function(o) {
+      return e.edge(o).weight;
+    };
+  }
+}
+function Oo(n) {
+  var r = [], t = {}, e = {};
+  function o(a) {
+    Object.prototype.hasOwnProperty.call(e, a) || (e[a] = !0, t[a] = !0, s(n.outEdges(a), function(i) {
+      Object.prototype.hasOwnProperty.call(t, i.w) ? r.push(i) : o(i.w);
+    }), delete t[a]);
+  }
+  return s(n.nodes(), o), r;
+}
+function ko(n) {
+  s(n.edges(), function(r) {
+    var t = n.edge(r);
+    if (t.reversed) {
+      n.removeEdge(r);
+      var e = t.forwardName;
+      delete t.reversed, delete t.forwardName, n.setEdge(r.w, r.v, t, e);
+    }
+  });
+}
+function A(n, r, t, e) {
+  var o;
+  do
+    o = mn(e);
+  while (n.hasNode(o));
+  return t.dummy = r, n.setNode(o, t), o;
+}
+function Eo(n) {
+  var r = new O().setGraph(n.graph());
+  return s(n.nodes(), function(t) {
+    r.setNode(t, n.node(t));
+  }), s(n.edges(), function(t) {
+    var e = r.edge(t.v, t.w) || { weight: 0, minlen: 1 }, o = n.edge(t);
+    r.setEdge(t.v, t.w, {
+      weight: e.weight + o.weight,
+      minlen: Math.max(e.minlen, o.minlen)
+    });
+  }), r;
+}
+function mr(n) {
+  var r = new O({ multigraph: n.isMultigraph() }).setGraph(n.graph());
+  return s(n.nodes(), function(t) {
+    n.children(t).length || r.setNode(t, n.node(t));
+  }), s(n.edges(), function(t) {
+    r.setEdge(t, n.edge(t));
+  }), r;
+}
+function Vn(n, r) {
+  var t = n.x, e = n.y, o = r.x - t, a = r.y - e, i = n.width / 2, u = n.height / 2;
+  if (!o && !a)
+    throw new Error("Not possible to find intersection inside of the rectangle");
+  var c, f;
+  return Math.abs(a) * i > Math.abs(o) * u ? (a < 0 && (u = -u), c = u * o / a, f = u) : (o < 0 && (i = -i), c = i, f = i * a / o), { x: t + c, y: e + f };
+}
+function H(n) {
+  var r = w(P(jr(n) + 1), function() {
+    return [];
+  });
+  return s(n.nodes(), function(t) {
+    var e = n.node(t), o = e.rank;
+    j(o) || (r[o][e.order] = t);
+  }), r;
+}
+function No(n) {
+  var r = S(
+    w(n.nodes(), function(t) {
+      return n.node(t).rank;
+    })
+  );
+  s(n.nodes(), function(t) {
+    var e = n.node(t);
+    wr(e, "rank") && (e.rank -= r);
+  });
+}
+function _o(n) {
+  var r = S(
+    w(n.nodes(), function(a) {
+      return n.node(a).rank;
+    })
+  ), t = [];
+  s(n.nodes(), function(a) {
+    var i = n.node(a).rank - r;
+    t[i] || (t[i] = []), t[i].push(a);
+  });
+  var e = 0, o = n.graph().nodeRankFactor;
+  s(t, function(a, i) {
+    j(a) && i % o !== 0 ? --e : e && s(a, function(u) {
+      n.node(u).rank += e;
+    });
+  });
+}
+function Bn(n, r, t, e) {
+  var o = {
+    width: 0,
+    height: 0
+  };
+  return arguments.length >= 4 && (o.rank = t, o.order = e), A(n, "border", o, r);
+}
+function jr(n) {
+  return k(
+    w(n.nodes(), function(r) {
+      var t = n.node(r).rank;
+      if (!j(t))
+        return t;
+    })
+  );
+}
+function Io(n, r) {
+  var t = { lhs: [], rhs: [] };
+  return s(n, function(e) {
+    r(e) ? t.lhs.push(e) : t.rhs.push(e);
+  }), t;
+}
+function Po(n, r) {
+  return r();
+}
+function $o(n) {
+  function r(t) {
+    var e = n.children(t), o = n.node(t);
+    if (e.length && s(e, r), Object.prototype.hasOwnProperty.call(o, "minRank")) {
+      o.borderLeft = [], o.borderRight = [];
+      for (var a = o.minRank, i = o.maxRank + 1; a < i; ++a)
+        Gn(n, "borderLeft", "_bl", t, o, a), Gn(n, "borderRight", "_br", t, o, a);
+    }
+  }
+  s(n.children(), r);
+}
+function Gn(n, r, t, e, o, a) {
+  var i = { width: 0, height: 0, rank: a, borderType: r }, u = o[r][a - 1], c = A(n, "border", i, t);
+  o[r][a] = c, n.setParent(c, e), u && n.setEdge(u, c, { weight: 1 });
+}
+function Mo(n) {
+  var r = n.graph().rankdir.toLowerCase();
+  (r === "lr" || r === "rl") && xr(n);
+}
+function Ao(n) {
+  var r = n.graph().rankdir.toLowerCase();
+  (r === "bt" || r === "rl") && Ro(n), (r === "lr" || r === "rl") && (So(n), xr(n));
+}
+function xr(n) {
+  s(n.nodes(), function(r) {
+    Un(n.node(r));
+  }), s(n.edges(), function(r) {
+    Un(n.edge(r));
+  });
+}
+function Un(n) {
+  var r = n.width;
+  n.width = n.height, n.height = r;
+}
+function Ro(n) {
+  s(n.nodes(), function(r) {
+    nn(n.node(r));
+  }), s(n.edges(), function(r) {
+    var t = n.edge(r);
+    s(t.points, nn), Object.prototype.hasOwnProperty.call(t, "y") && nn(t);
+  });
+}
+function nn(n) {
+  n.y = -n.y;
+}
+function So(n) {
+  s(n.nodes(), function(r) {
+    rn(n.node(r));
+  }), s(n.edges(), function(r) {
+    var t = n.edge(r);
+    s(t.points, rn), Object.prototype.hasOwnProperty.call(t, "x") && rn(t);
+  });
+}
+function rn(n) {
+  var r = n.x;
+  n.x = n.y, n.y = r;
+}
+function To(n) {
+  n.graph().dummyChains = [], s(n.edges(), function(r) {
+    Lo(n, r);
+  });
+}
+function Lo(n, r) {
+  var t = r.v, e = n.node(t).rank, o = r.w, a = n.node(o).rank, i = r.name, u = n.edge(r), c = u.labelRank;
+  if (a !== e + 1) {
+    n.removeEdge(r);
+    var f = void 0, d, v;
+    for (v = 0, ++e; e < a; ++v, ++e)
+      u.points = [], f = {
+        width: 0,
+        height: 0,
+        edgeLabel: u,
+        edgeObj: r,
+        rank: e
+      }, d = A(n, "edge", f, "_d"), e === c && (f.width = u.width, f.height = u.height, f.dummy = "edge-label", f.labelpos = u.labelpos), n.setEdge(t, d, { weight: u.weight }, i), v === 0 && n.graph().dummyChains.push(d), t = d;
+    n.setEdge(t, o, { weight: u.weight }, i);
+  }
+}
+function Co(n) {
+  s(n.graph().dummyChains, function(r) {
+    var t = n.node(r), e = t.edgeLabel, o;
+    for (n.setEdge(t.edgeObj, e); t.dummy; )
+      o = n.successors(r)[0], n.removeNode(r), e.points.push({ x: t.x, y: t.y }), t.dummy === "edge-label" && (e.x = t.x, e.y = t.y, e.width = t.width, e.height = t.height), r = o, t = n.node(r);
+  });
+}
+function jn(n) {
+  var r = {};
+  function t(e) {
+    var o = n.node(e);
+    if (Object.prototype.hasOwnProperty.call(r, e))
+      return o.rank;
+    r[e] = !0;
+    var a = S(
+      w(n.outEdges(e), function(i) {
+        return t(i.w) - n.edge(i).minlen;
+      })
+    );
+    return (a === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+    a === void 0 || // return value of _.map([]) for Lodash 4
+    a === null) && (a = 0), o.rank = a;
+  }
+  s(n.sources(), t);
+}
+function T(n, r) {
+  return n.node(r.w).rank - n.node(r.v).rank - n.edge(r).minlen;
+}
+function Or(n) {
+  var r = new O({ directed: !1 }), t = n.nodes()[0], e = n.nodeCount();
+  r.setNode(t, {});
+  for (var o, a; Fo(r, n) < e; )
+    o = Vo(r, n), a = r.hasNode(o.v) ? T(n, o) : -T(n, o), Bo(r, n, a);
+  return r;
+}
+function Fo(n, r) {
+  function t(e) {
+    s(r.nodeEdges(e), function(o) {
+      var a = o.v, i = e === a ? o.w : a;
+      !n.hasNode(i) && !T(r, o) && (n.setNode(i, {}), n.setEdge(e, i, {}), t(i));
+    });
+  }
+  return s(n.nodes(), t), n.nodeCount();
+}
+function Vo(n, r) {
+  return yn(r.edges(), function(t) {
+    if (n.hasNode(t.v) !== n.hasNode(t.w))
+      return T(r, t);
+  });
+}
+function Bo(n, r, t) {
+  s(n.nodes(), function(e) {
+    r.node(e).rank += t;
+  });
+}
+function kr(n, r, t) {
+  _(r) || (r = [r]);
+  var e = (n.isDirected() ? n.successors : n.neighbors).bind(n), o = [], a = {};
+  return s(r, function(i) {
+    if (!n.hasNode(i))
+      throw new Error("Graph does not have node: " + i);
+    Er(n, i, t === "post", a, e, o);
+  }), o;
+}
+function Er(n, r, t, e, o, a) {
+  Object.prototype.hasOwnProperty.call(e, r) || (e[r] = !0, t || a.push(r), s(o(r), function(i) {
+    Er(n, i, t, e, o, a);
+  }), t && a.push(r));
+}
+function Go(n, r) {
+  return kr(n, r, "post");
+}
+function Uo(n, r) {
+  return kr(n, r, "pre");
+}
+N.initLowLimValues = On;
+N.initCutValues = xn;
+N.calcCutValue = Nr;
+N.leaveEdge = Ir;
+N.enterEdge = Pr;
+N.exchangeEdges = $r;
+function N(n) {
+  n = Eo(n), jn(n);
+  var r = Or(n);
+  On(r), xn(r, n);
+  for (var t, e; t = Ir(r); )
+    e = Pr(r, n, t), $r(r, n, t, e);
+}
+function xn(n, r) {
+  var t = Go(n, n.nodes());
+  t = t.slice(0, t.length - 1), s(t, function(e) {
+    Yo(n, r, e);
+  });
+}
+function Yo(n, r, t) {
+  var e = n.node(t), o = e.parent;
+  n.edge(t, o).cutvalue = Nr(n, r, t);
+}
+function Nr(n, r, t) {
+  var e = n.node(t), o = e.parent, a = !0, i = r.edge(t, o), u = 0;
+  return i || (a = !1, i = r.edge(o, t)), u = i.weight, s(r.nodeEdges(t), function(c) {
+    var f = c.v === t, d = f ? c.w : c.v;
+    if (d !== o) {
+      var v = f === a, h = r.edge(c).weight;
+      if (u += v ? h : -h, Do(n, t, d)) {
+        var g = n.edge(t, d).cutvalue;
+        u += v ? -g : g;
+      }
+    }
+  }), u;
+}
+function On(n, r) {
+  arguments.length < 2 && (r = n.nodes()[0]), _r(n, {}, 1, r);
+}
+function _r(n, r, t, e, o) {
+  var a = t, i = n.node(e);
+  return r[e] = !0, s(n.neighbors(e), function(u) {
+    Object.prototype.hasOwnProperty.call(r, u) || (t = _r(n, r, t, u, e));
+  }), i.low = a, i.lim = t++, o ? i.parent = o : delete i.parent, t;
+}
+function Ir(n) {
+  return bn(n.edges(), function(r) {
+    return n.edge(r).cutvalue < 0;
+  });
+}
+function Pr(n, r, t) {
+  var e = t.v, o = t.w;
+  r.hasEdge(e, o) || (e = t.w, o = t.v);
+  var a = n.node(e), i = n.node(o), u = a, c = !1;
+  a.lim > i.lim && (u = i, c = !0);
+  var f = L(r.edges(), function(d) {
+    return c === Yn(n, n.node(d.v), u) && c !== Yn(n, n.node(d.w), u);
+  });
+  return yn(f, function(d) {
+    return T(r, d);
+  });
+}
+function $r(n, r, t, e) {
+  var o = t.v, a = t.w;
+  n.removeEdge(o, a), n.setEdge(e.v, e.w, {}), On(n), xn(n, r), qo(n, r);
+}
+function qo(n, r) {
+  var t = bn(n.nodes(), function(o) {
+    return !r.node(o).parent;
+  }), e = Uo(n, t);
+  e = e.slice(1), s(e, function(o) {
+    var a = n.node(o).parent, i = r.edge(o, a), u = !1;
+    i || (i = r.edge(a, o), u = !0), r.node(o).rank = r.node(a).rank + (u ? i.minlen : -i.minlen);
+  });
+}
+function Do(n, r, t) {
+  return n.hasEdge(r, t);
+}
+function Yn(n, r, t) {
+  return t.low <= r.lim && r.lim <= t.lim;
+}
+function zo(n) {
+  switch (n.graph().ranker) {
+    case "network-simplex":
+      qn(n);
+      break;
+    case "tight-tree":
+      Wo(n);
+      break;
+    case "longest-path":
+      Jo(n);
+      break;
+    default:
+      qn(n);
+  }
+}
+var Jo = jn;
+function Wo(n) {
+  jn(n), Or(n);
+}
+function qn(n) {
+  N(n);
+}
+function Ko(n) {
+  var r = A(n, "root", {}, "_root"), t = Qo(n), e = k(I(t)) - 1, o = 2 * e + 1;
+  n.graph().nestingRoot = r, s(n.edges(), function(i) {
+    n.edge(i).minlen *= o;
+  });
+  var a = Zo(n) + 1;
+  s(n.children(), function(i) {
+    Mr(n, r, o, a, e, t, i);
+  }), n.graph().nodeRankFactor = o;
+}
+function Mr(n, r, t, e, o, a, i) {
+  var u = n.children(i);
+  if (!u.length) {
+    i !== r && n.setEdge(r, i, { weight: 0, minlen: t });
+    return;
+  }
+  var c = Bn(n, "_bt"), f = Bn(n, "_bb"), d = n.node(i);
+  n.setParent(c, i), d.borderTop = c, n.setParent(f, i), d.borderBottom = f, s(u, function(v) {
+    Mr(n, r, t, e, o, a, v);
+    var h = n.node(v), g = h.borderTop ? h.borderTop : v, l = h.borderBottom ? h.borderBottom : v, b = h.borderTop ? e : 2 * e, y = g !== l ? 1 : o - a[i] + 1;
+    n.setEdge(c, g, {
+      weight: b,
+      minlen: y,
+      nestingEdge: !0
+    }), n.setEdge(l, f, {
+      weight: b,
+      minlen: y,
+      nestingEdge: !0
+    });
+  }), n.parent(i) || n.setEdge(r, c, { weight: 0, minlen: o + a[i] });
+}
+function Qo(n) {
+  var r = {};
+  function t(e, o) {
+    var a = n.children(e);
+    a && a.length && s(a, function(i) {
+      t(i, o + 1);
+    }), r[e] = o;
+  }
+  return s(n.children(), function(e) {
+    t(e, 1);
+  }), r;
+}
+function Zo(n) {
+  return W(
+    n.edges(),
+    function(r, t) {
+      return r + n.edge(t).weight;
+    },
+    0
+  );
+}
+function Ho(n) {
+  var r = n.graph();
+  n.removeNode(r.nestingRoot), delete r.nestingRoot, s(n.edges(), function(t) {
+    var e = n.edge(t);
+    e.nestingEdge && n.removeEdge(t);
+  });
+}
+function Xo(n, r, t) {
+  var e = {}, o;
+  s(t, function(a) {
+    for (var i = n.parent(a), u, c; i; ) {
+      if (u = n.parent(i), u ? (c = e[u], e[u] = i) : (c = o, o = i), c && c !== i) {
+        r.setEdge(c, i);
+        return;
+      }
+      i = u;
+    }
+  });
+}
+function ni(n, r, t) {
+  var e = ri(n), o = new O({ compound: !0 }).setGraph({ root: e }).setDefaultNodeLabel(function(a) {
+    return n.node(a);
+  });
+  return s(n.nodes(), function(a) {
+    var i = n.node(a), u = n.parent(a);
+    (i.rank === r || i.minRank <= r && r <= i.maxRank) && (o.setNode(a), o.setParent(a, u || e), s(n[t](a), function(c) {
+      var f = c.v === a ? c.w : c.v, d = o.edge(f, a), v = j(d) ? 0 : d.weight;
+      o.setEdge(f, a, { weight: n.edge(c).weight + v });
+    }), Object.prototype.hasOwnProperty.call(i, "minRank") && o.setNode(a, {
+      borderLeft: i.borderLeft[r],
+      borderRight: i.borderRight[r]
+    }));
+  }), o;
+}
+function ri(n) {
+  for (var r; n.hasNode(r = mn("_root")); )
+    ;
+  return r;
+}
+function ti(n, r) {
+  for (var t = 0, e = 1; e < r.length; ++e)
+    t += ei(n, r[e - 1], r[e]);
+  return t;
+}
+function ei(n, r, t) {
+  for (var e = lo(
+    t,
+    w(t, function(f, d) {
+      return d;
+    })
+  ), o = M(
+    w(r, function(f) {
+      return F(
+        w(n.outEdges(f), function(d) {
+          return { pos: e[d.w], weight: n.edge(d).weight };
+        }),
+        "pos"
+      );
+    })
+  ), a = 1; a < t.length; )
+    a <<= 1;
+  var i = 2 * a - 1;
+  a -= 1;
+  var u = w(new Array(i), function() {
+    return 0;
+  }), c = 0;
+  return s(
+    // @ts-expect-error
+    o.forEach(function(f) {
+      var d = f.pos + a;
+      u[d] += f.weight;
+      for (var v = 0; d > 0; )
+        d % 2 && (v += u[d + 1]), d = d - 1 >> 1, u[d] += f.weight;
+      c += f.weight * v;
+    })
+  ), c;
+}
+function oi(n) {
+  var r = {}, t = L(n.nodes(), function(u) {
+    return !n.children(u).length;
+  }), e = k(
+    w(t, function(u) {
+      return n.node(u).rank;
+    })
+  ), o = w(P(e + 1), function() {
+    return [];
+  });
+  function a(u) {
+    if (!wr(r, u)) {
+      r[u] = !0;
+      var c = n.node(u);
+      o[c.rank].push(u), s(n.successors(u), a);
+    }
+  }
+  var i = F(t, function(u) {
+    return n.node(u).rank;
+  });
+  return s(i, a), o;
+}
+function ii(n, r) {
+  return w(r, function(t) {
+    var e = n.inEdges(t);
+    if (e.length) {
+      var o = W(
+        e,
+        function(a, i) {
+          var u = n.edge(i), c = n.node(i.v);
+          return {
+            sum: a.sum + u.weight * c.order,
+            weight: a.weight + u.weight
+          };
+        },
+        { sum: 0, weight: 0 }
+      );
+      return {
+        v: t,
+        barycenter: o.sum / o.weight,
+        weight: o.weight
+      };
+    } else
+      return { v: t };
+  });
+}
+function ai(n, r) {
+  var t = {};
+  s(n, function(o, a) {
+    var i = t[o.v] = {
+      indegree: 0,
+      in: [],
+      out: [],
+      vs: [o.v],
+      i: a
+    };
+    j(o.barycenter) || (i.barycenter = o.barycenter, i.weight = o.weight);
+  }), s(r.edges(), function(o) {
+    var a = t[o.v], i = t[o.w];
+    !j(a) && !j(i) && (i.indegree++, a.out.push(t[o.w]));
+  });
+  var e = L(t, function(o) {
+    return !o.indegree;
+  });
+  return ui(e);
+}
+function ui(n) {
+  var r = [];
+  function t(a) {
+    return function(i) {
+      i.merged || (j(i.barycenter) || j(a.barycenter) || i.barycenter >= a.barycenter) && ci(a, i);
+    };
+  }
+  function e(a) {
+    return function(i) {
+      i.in.push(a), --i.indegree === 0 && n.push(i);
+    };
+  }
+  for (; n.length; ) {
+    var o = n.pop();
+    r.push(o), s(o.in.reverse(), t(o)), s(o.out, e(o));
+  }
+  return w(
+    L(r, function(a) {
+      return !a.merged;
+    }),
+    function(a) {
+      return D(a, ["vs", "i", "barycenter", "weight"]);
+    }
+  );
+}
+function ci(n, r) {
+  var t = 0, e = 0;
+  n.weight && (t += n.barycenter * n.weight, e += n.weight), r.weight && (t += r.barycenter * r.weight, e += r.weight), n.vs = r.vs.concat(n.vs), n.barycenter = t / e, n.weight = e, n.i = Math.min(r.i, n.i), r.merged = !0;
+}
+function fi(n, r) {
+  var t = Io(n, function(d) {
+    return Object.prototype.hasOwnProperty.call(d, "barycenter");
+  }), e = t.lhs, o = F(t.rhs, function(d) {
+    return -d.i;
+  }), a = [], i = 0, u = 0, c = 0;
+  e.sort(di(!!r)), c = Dn(a, o, c), s(e, function(d) {
+    c += d.vs.length, a.push(d.vs), i += d.barycenter * d.weight, u += d.weight, c = Dn(a, o, c);
+  });
+  var f = { vs: M(a) };
+  return u && (f.barycenter = i / u, f.weight = u), f;
+}
+function Dn(n, r, t) {
+  for (var e; r.length && (e = q(r)).i <= t; )
+    r.pop(), n.push(e.vs), t++;
+  return t;
+}
+function di(n) {
+  return function(r, t) {
+    return r.barycenter < t.barycenter ? -1 : r.barycenter > t.barycenter ? 1 : n ? t.i - r.i : r.i - t.i;
+  };
+}
+function Ar(n, r, t, e) {
+  var o = n.children(r), a = n.node(r), i = a ? a.borderLeft : void 0, u = a ? a.borderRight : void 0, c = {};
+  i && (o = L(o, function(l) {
+    return l !== i && l !== u;
+  }));
+  var f = ii(n, o);
+  s(f, function(l) {
+    if (n.children(l.v).length) {
+      var b = Ar(n, l.v, t, e);
+      c[l.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && vi(l, b);
+    }
+  });
+  var d = ai(f, t);
+  si(d, c);
+  var v = fi(d, e);
+  if (i && (v.vs = M([i, v.vs, u]), n.predecessors(i).length)) {
+    var h = n.node(n.predecessors(i)[0]), g = n.node(n.predecessors(u)[0]);
+    Object.prototype.hasOwnProperty.call(v, "barycenter") || (v.barycenter = 0, v.weight = 0), v.barycenter = (v.barycenter * v.weight + h.order + g.order) / (v.weight + 2), v.weight += 2;
+  }
+  return v;
+}
+function si(n, r) {
+  s(n, function(t) {
+    t.vs = M(
+      t.vs.map(function(e) {
+        return r[e] ? r[e].vs : e;
+      })
+    );
+  });
+}
+function vi(n, r) {
+  j(n.barycenter) ? (n.barycenter = r.barycenter, n.weight = r.weight) : (n.barycenter = (n.barycenter * n.weight + r.barycenter * r.weight) / (n.weight + r.weight), n.weight += r.weight);
+}
+function hi(n) {
+  var r = jr(n), t = zn(n, P(1, r + 1), "inEdges"), e = zn(n, P(r - 1, -1, -1), "outEdges"), o = oi(n);
+  Jn(n, o);
+  for (var a = Number.POSITIVE_INFINITY, i, u = 0, c = 0; c < 4; ++u, ++c) {
+    gi(u % 2 ? t : e, u % 4 >= 2), o = H(n);
+    var f = ti(n, o);
+    f < a && (c = 0, i = Ge(o), a = f);
+  }
+  Jn(n, i);
+}
+function zn(n, r, t) {
+  return w(r, function(e) {
+    return ni(n, e, t);
+  });
+}
+function gi(n, r) {
+  var t = new O();
+  s(n, function(e) {
+    var o = e.graph().root, a = Ar(e, o, t, r);
+    s(a.vs, function(i, u) {
+      e.node(i).order = u;
+    }), Xo(e, t, a.vs);
+  });
+}
+function Jn(n, r) {
+  s(r, function(t) {
+    s(t, function(e, o) {
+      n.node(e).order = o;
+    });
+  });
+}
+function li(n) {
+  var r = bi(n);
+  s(n.graph().dummyChains, function(t) {
+    for (var e = n.node(t), o = e.edgeObj, a = pi(n, r, o.v, o.w), i = a.path, u = a.lca, c = 0, f = i[c], d = !0; t !== o.w; ) {
+      if (e = n.node(t), d) {
+        for (; (f = i[c]) !== u && n.node(f).maxRank < e.rank; )
+          c++;
+        f === u && (d = !1);
+      }
+      if (!d) {
+        for (; c < i.length - 1 && n.node(f = i[c + 1]).minRank <= e.rank; )
+          c++;
+        f = i[c];
+      }
+      n.setParent(t, f), t = n.successors(t)[0];
+    }
+  });
+}
+function pi(n, r, t, e) {
+  var o = [], a = [], i = Math.min(r[t].low, r[e].low), u = Math.max(r[t].lim, r[e].lim), c, f;
+  c = t;
+  do
+    c = n.parent(c), o.push(c);
+  while (c && (r[c].low > i || u > r[c].lim));
+  for (f = c, c = e; (c = n.parent(c)) !== f; )
+    a.push(c);
+  return { path: o.concat(a.reverse()), lca: f };
+}
+function bi(n) {
+  var r = {}, t = 0;
+  function e(o) {
+    var a = t;
+    s(n.children(o), e), r[o] = { low: a, lim: t++ };
+  }
+  return s(n.children(), e), r;
+}
+function wi(n, r) {
+  var t = {};
+  function e(o, a) {
+    var i = 0, u = 0, c = o.length, f = q(a);
+    return s(a, function(d, v) {
+      var h = mi(n, d), g = h ? n.node(h).order : c;
+      (h || d === f) && (s(a.slice(u, v + 1), function(l) {
+        s(n.predecessors(l), function(b) {
+          var y = n.node(b), m = y.order;
+          (m < i || g < m) && !(y.dummy && n.node(l).dummy) && Rr(t, b, l);
+        });
+      }), u = v + 1, i = g);
+    }), a;
+  }
+  return W(r, e), t;
+}
+function yi(n, r) {
+  var t = {};
+  function e(a, i, u, c, f) {
+    var d;
+    s(P(i, u), function(v) {
+      d = a[v], n.node(d).dummy && s(n.predecessors(d), function(h) {
+        var g = n.node(h);
+        g.dummy && (g.order < c || g.order > f) && Rr(t, h, d);
+      });
+    });
+  }
+  function o(a, i) {
+    var u = -1, c, f = 0;
+    return s(i, function(d, v) {
+      if (n.node(d).dummy === "border") {
+        var h = n.predecessors(d);
+        h.length && (c = n.node(h[0]).order, e(i, f, v, u, c), f = v, u = c);
+      }
+      e(i, f, i.length, c, a.length);
+    }), i;
+  }
+  return W(r, o), t;
+}
+function mi(n, r) {
+  if (n.node(r).dummy)
+    return bn(n.predecessors(r), function(t) {
+      return n.node(t).dummy;
+    });
+}
+function Rr(n, r, t) {
+  if (r > t) {
+    var e = r;
+    r = t, t = e;
+  }
+  Object.prototype.hasOwnProperty.call(n, r) || Object.defineProperty(n, r, {
+    enumerable: !0,
+    configurable: !0,
+    value: {},
+    writable: !0
+  });
+  var o = n[r];
+  Object.defineProperty(o, t, {
+    enumerable: !0,
+    configurable: !0,
+    value: !0,
+    writable: !0
+  });
+}
+function ji(n, r, t) {
+  if (r > t) {
+    var e = r;
+    r = t, t = e;
+  }
+  return !!n[r] && Object.prototype.hasOwnProperty.call(n[r], t);
+}
+function xi(n, r, t, e) {
+  var o = {}, a = {}, i = {};
+  return s(r, function(u) {
+    s(u, function(c, f) {
+      o[c] = c, a[c] = c, i[c] = f;
+    });
+  }), s(r, function(u) {
+    var c = -1;
+    s(u, function(f) {
+      var d = e(f);
+      if (d.length) {
+        d = F(d, function(b) {
+          return i[b];
+        });
+        for (var v = (d.length - 1) / 2, h = Math.floor(v), g = Math.ceil(v); h <= g; ++h) {
+          var l = d[h];
+          a[f] === f && c < i[l] && !ji(t, f, l) && (a[l] = f, a[f] = o[f] = o[l], c = i[l]);
+        }
+      }
+    });
+  }), { root: o, align: a };
+}
+function Oi(n, r, t, e, o) {
+  var a = {}, i = ki(n, r, t, o), u = o ? "borderLeft" : "borderRight";
+  function c(v, h) {
+    for (var g = i.nodes(), l = g.pop(), b = {}; l; )
+      b[l] ? v(l) : (b[l] = !0, g.push(l), g = g.concat(h(l))), l = g.pop();
+  }
+  function f(v) {
+    a[v] = i.inEdges(v).reduce(function(h, g) {
+      return Math.max(h, a[g.v] + i.edge(g));
+    }, 0);
+  }
+  function d(v) {
+    var h = i.outEdges(v).reduce(function(l, b) {
+      return Math.min(l, a[b.w] - i.edge(b));
+    }, Number.POSITIVE_INFINITY), g = n.node(v);
+    h !== Number.POSITIVE_INFINITY && g.borderType !== u && (a[v] = Math.max(a[v], h));
+  }
+  return c(f, i.predecessors.bind(i)), c(d, i.successors.bind(i)), s(e, function(v) {
+    a[v] = a[t[v]];
+  }), a;
+}
+function ki(n, r, t, e) {
+  var o = new O(), a = n.graph(), i = Pi(a.nodesep, a.edgesep, e);
+  return s(r, function(u) {
+    var c;
+    s(u, function(f) {
+      var d = t[f];
+      if (o.setNode(d), c) {
+        var v = t[c], h = o.edge(v, d);
+        o.setEdge(v, d, Math.max(i(n, f, c), h || 0));
+      }
+      c = f;
+    });
+  }), o;
+}
+function Ei(n, r) {
+  return yn(I(r), function(t) {
+    var e = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
+    return Ke(t, function(a, i) {
+      var u = $i(n, i) / 2;
+      e = Math.max(a + u, e), o = Math.min(a - u, o);
+    }), e - o;
+  });
+}
+function Ni(n, r) {
+  var t = I(r), e = S(t), o = k(t);
+  s(["u", "d"], function(a) {
+    s(["l", "r"], function(i) {
+      var u = a + i, c = n[u], f;
+      if (c !== r) {
+        var d = I(c);
+        f = i === "l" ? e - S(d) : o - k(d), f && (n[u] = Z(c, function(v) {
+          return v + f;
+        }));
+      }
+    });
+  });
+}
+function _i(n, r) {
+  return Z(n.ul, function(t, e) {
+    if (r)
+      return n[r.toLowerCase()][e];
+    var o = F(w(n, e));
+    return (o[1] + o[2]) / 2;
+  });
+}
+function Ii(n) {
+  var r = H(n), t = un(wi(n, r), yi(n, r)), e = {}, o;
+  s(["u", "d"], function(i) {
+    o = i === "u" ? r : I(r).reverse(), s(["l", "r"], function(u) {
+      u === "r" && (o = w(o, function(v) {
+        return I(v).reverse();
+      }));
+      var c = (i === "u" ? n.predecessors : n.successors).bind(n), f = xi(n, o, t, c), d = Oi(n, o, f.root, f.align, u === "r");
+      u === "r" && (d = Z(d, function(v) {
+        return -v;
+      })), e[i + u] = d;
+    });
+  });
+  var a = Ei(n, e);
+  return Ni(e, a), _i(e, n.graph().align);
+}
+function Pi(n, r, t) {
+  return function(e, o, a) {
+    var i = e.node(o), u = e.node(a), c = 0, f;
+    if (c += i.width / 2, Object.prototype.hasOwnProperty.call(i, "labelpos"))
+      switch (i.labelpos.toLowerCase()) {
+        case "l":
+          f = -i.width / 2;
+          break;
+        case "r":
+          f = i.width / 2;
+          break;
+      }
+    if (f && (c += t ? f : -f), f = 0, c += (i.dummy ? r : n) / 2, c += (u.dummy ? r : n) / 2, c += u.width / 2, Object.prototype.hasOwnProperty.call(u, "labelpos"))
+      switch (u.labelpos.toLowerCase()) {
+        case "l":
+          f = u.width / 2;
+          break;
+        case "r":
+          f = -u.width / 2;
+          break;
+      }
+    return f && (c += t ? f : -f), f = 0, c;
+  };
+}
+function $i(n, r) {
+  return n.node(r).width;
+}
+function Mi(n) {
+  n = mr(n), Ai(n), Qe(Ii(n), function(r, t) {
+    n.node(t).x = r;
+  });
+}
+function Ai(n) {
+  var r = H(n), t = n.graph().ranksep, e = 0;
+  s(r, function(o) {
+    var a = k(
+      w(o, function(i) {
+        return n.node(i).height;
+      })
+    );
+    s(o, function(i) {
+      n.node(i).y = e + a / 2;
+    }), e += a + t;
+  });
+}
+function ea(n, r) {
+  var t = Po;
+  t("layout", () => {
+    var e = t("  buildLayoutGraph", () => Yi(n));
+    t("  runLayout", () => Ri(e, t)), t("  updateInputGraph", () => Si(n, e));
+  });
+}
+function Ri(n, r) {
+  r("    makeSpaceForEdgeLabels", () => qi(n)), r("    removeSelfEdges", () => Xi(n)), r("    acyclic", () => xo(n)), r("    nestingGraph.run", () => Ko(n)), r("    rank", () => zo(mr(n))), r("    injectEdgeLabelProxies", () => Di(n)), r("    removeEmptyRanks", () => _o(n)), r("    nestingGraph.cleanup", () => Ho(n)), r("    normalizeRanks", () => No(n)), r("    assignRankMinMax", () => zi(n)), r("    removeEdgeLabelProxies", () => Ji(n)), r("    normalize.run", () => To(n)), r("    parentDummyChains", () => li(n)), r("    addBorderSegments", () => $o(n)), r("    order", () => hi(n)), r("    insertSelfEdges", () => na(n)), r("    adjustCoordinateSystem", () => Mo(n)), r("    position", () => Mi(n)), r("    positionSelfEdges", () => ra(n)), r("    removeBorderNodes", () => Hi(n)), r("    normalize.undo", () => Co(n)), r("    fixupEdgeLabelCoords", () => Qi(n)), r("    undoCoordinateSystem", () => Ao(n)), r("    translateGraph", () => Wi(n)), r("    assignNodeIntersects", () => Ki(n)), r("    reversePoints", () => Zi(n)), r("    acyclic.undo", () => ko(n));
+}
+function Si(n, r) {
+  s(n.nodes(), function(t) {
+    var e = n.node(t), o = r.node(t);
+    e && (e.x = o.x, e.y = o.y, r.children(t).length && (e.width = o.width, e.height = o.height));
+  }), s(n.edges(), function(t) {
+    var e = n.edge(t), o = r.edge(t);
+    e.points = o.points, Object.prototype.hasOwnProperty.call(o, "x") && (e.x = o.x, e.y = o.y);
+  }), n.graph().width = r.graph().width, n.graph().height = r.graph().height;
+}
+var Ti = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Li = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Ci = ["acyclicer", "ranker", "rankdir", "align"], Fi = ["width", "height"], Vi = { width: 0, height: 0 }, Bi = ["minlen", "weight", "width", "height", "labeloffset"], Gi = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, Ui = ["labelpos"];
+function Yi(n) {
+  var r = new O({ multigraph: !0, compound: !0 }), t = en(n.graph());
+  return r.setGraph(
+    un({}, Li, tn(t, Ti), D(t, Ci))
+  ), s(n.nodes(), function(e) {
+    var o = en(n.node(e));
+    r.setNode(e, Ye(tn(o, Fi), Vi)), r.setParent(e, n.parent(e));
+  }), s(n.edges(), function(e) {
+    var o = en(n.edge(e));
+    r.setEdge(
+      e,
+      un({}, Gi, tn(o, Bi), D(o, Ui))
+    );
+  }), r;
+}
+function qi(n) {
+  var r = n.graph();
+  r.ranksep /= 2, s(n.edges(), function(t) {
+    var e = n.edge(t);
+    e.minlen *= 2, e.labelpos.toLowerCase() !== "c" && (r.rankdir === "TB" || r.rankdir === "BT" ? e.width += e.labeloffset : e.height += e.labeloffset);
+  });
+}
+function Di(n) {
+  s(n.edges(), function(r) {
+    var t = n.edge(r);
+    if (t.width && t.height) {
+      var e = n.node(r.v), o = n.node(r.w), a = { rank: (o.rank - e.rank) / 2 + e.rank, e: r };
+      A(n, "edge-proxy", a, "_ep");
+    }
+  });
+}
+function zi(n) {
+  var r = 0;
+  s(n.nodes(), function(t) {
+    var e = n.node(t);
+    e.borderTop && (e.minRank = n.node(e.borderTop).rank, e.maxRank = n.node(e.borderBottom).rank, r = k(r, e.maxRank));
+  }), n.graph().maxRank = r;
+}
+function Ji(n) {
+  s(n.nodes(), function(r) {
+    var t = n.node(r);
+    t.dummy === "edge-proxy" && (n.edge(t.e).labelRank = t.rank, n.removeNode(r));
+  });
+}
+function Wi(n) {
+  var r = Number.POSITIVE_INFINITY, t = 0, e = Number.POSITIVE_INFINITY, o = 0, a = n.graph(), i = a.marginx || 0, u = a.marginy || 0;
+  function c(f) {
+    var d = f.x, v = f.y, h = f.width, g = f.height;
+    r = Math.min(r, d - h / 2), t = Math.max(t, d + h / 2), e = Math.min(e, v - g / 2), o = Math.max(o, v + g / 2);
+  }
+  s(n.nodes(), function(f) {
+    c(n.node(f));
+  }), s(n.edges(), function(f) {
+    var d = n.edge(f);
+    Object.prototype.hasOwnProperty.call(d, "x") && c(d);
+  }), r -= i, e -= u, s(n.nodes(), function(f) {
+    var d = n.node(f);
+    d.x -= r, d.y -= e;
+  }), s(n.edges(), function(f) {
+    var d = n.edge(f);
+    s(d.points, function(v) {
+      v.x -= r, v.y -= e;
+    }), Object.prototype.hasOwnProperty.call(d, "x") && (d.x -= r), Object.prototype.hasOwnProperty.call(d, "y") && (d.y -= e);
+  }), a.width = t - r + i, a.height = o - e + u;
+}
+function Ki(n) {
+  s(n.edges(), function(r) {
+    var t = n.edge(r), e = n.node(r.v), o = n.node(r.w), a, i;
+    t.points ? (a = t.points[0], i = t.points[t.points.length - 1]) : (t.points = [], a = o, i = e), t.points.unshift(Vn(e, a)), t.points.push(Vn(o, i));
+  });
+}
+function Qi(n) {
+  s(n.edges(), function(r) {
+    var t = n.edge(r);
+    if (Object.prototype.hasOwnProperty.call(t, "x"))
+      switch ((t.labelpos === "l" || t.labelpos === "r") && (t.width -= t.labeloffset), t.labelpos) {
+        case "l":
+          t.x -= t.width / 2 + t.labeloffset;
+          break;
+        case "r":
+          t.x += t.width / 2 + t.labeloffset;
+          break;
+      }
+  });
+}
+function Zi(n) {
+  s(n.edges(), function(r) {
+    var t = n.edge(r);
+    t.reversed && t.points.reverse();
+  });
+}
+function Hi(n) {
+  s(n.nodes(), function(r) {
+    if (n.children(r).length) {
+      var t = n.node(r), e = n.node(t.borderTop), o = n.node(t.borderBottom), a = n.node(q(t.borderLeft)), i = n.node(q(t.borderRight));
+      t.width = Math.abs(i.x - a.x), t.height = Math.abs(o.y - e.y), t.x = a.x + t.width / 2, t.y = e.y + t.height / 2;
+    }
+  }), s(n.nodes(), function(r) {
+    n.node(r).dummy === "border" && n.removeNode(r);
+  });
+}
+function Xi(n) {
+  s(n.edges(), function(r) {
+    if (r.v === r.w) {
+      var t = n.node(r.v);
+      t.selfEdges || (t.selfEdges = []), t.selfEdges.push({ e: r, label: n.edge(r) }), n.removeEdge(r);
+    }
+  });
+}
+function na(n) {
+  var r = H(n);
+  s(r, function(t) {
+    var e = 0;
+    s(t, function(o, a) {
+      var i = n.node(o);
+      i.order = a + e, s(i.selfEdges, function(u) {
+        A(
+          n,
+          "selfedge",
+          {
+            width: u.label.width,
+            height: u.label.height,
+            rank: i.rank,
+            order: a + ++e,
+            e: u.e,
+            label: u.label
+          },
+          "_se"
+        );
+      }), delete i.selfEdges;
+    });
+  });
+}
+function ra(n) {
+  s(n.nodes(), function(r) {
+    var t = n.node(r);
+    if (t.dummy === "selfedge") {
+      var e = n.node(t.e.v), o = e.x + e.width / 2, a = e.y, i = t.x - o, u = e.height / 2;
+      n.setEdge(t.e, t.label), n.removeNode(r), t.label.points = [
+        { x: o + 2 * i / 3, y: a - u },
+        { x: o + 5 * i / 6, y: a - u },
+        { x: o + i, y: a },
+        { x: o + 5 * i / 6, y: a + u },
+        { x: o + 2 * i / 3, y: a + u }
+      ], t.label.x = t.x, t.label.y = t.y;
+    }
+  });
+}
+function tn(n, r) {
+  return Z(D(n, r), Number);
+}
+function en(n) {
+  var r = {};
+  return s(n, function(t, e) {
+    r[e.toLowerCase()] = t;
+  }), r;
+}
+export {
+  G as D,
+  w as g,
+  ea as t
+};