@life-exe/wiki-engine 0.1.0

package/dist/chunks/layout-CgV9vOdp.js

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