ranui 0.2.1-alpha.1 → 0.2.1-alpha.3

package/dist/dagre-D8GLTwuf.js

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