@kong-ui-public/documentation 0.3.42 → 0.4.0

package/dist/layout-2-aEcfuw-BqqWy5wB.js

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