@versini/sassysaint 8.109.0 → 8.109.2

package/dist/chunks/layout.DHq6HJUe.js

@@ -1,1332 +0,0 @@
-import { Graph as g } from "./graph.CYf6HeGF.js";
-import { baseClone as Te, castFunction as ce, baseForOwn as le, baseIteratee as z, isSymbol as ee, arrayMap as F, baseGet as Ie, hasIn as Me, baseFlatten as Se, toString as je, forEach as s, isUndefined as m, filter as _, values as x, reduce as M } from "./_baseUniq.CrQICPim.js";
-import { flatten as O, baseExtremum as he, baseLt as Fe, baseMap as Ve, basePickBy as Ae, toFinite as V, map as w, min as P, has as ve, find as X, last as T, defaults as Be } from "./_basePickBy.DH8qu2bB.js";
-import { setToString as Ge, overRest as Ye, baseFor as De, keysIn as $e, baseAssignValue as qe, identity as pe, isArray as we, baseUnary as We, isIterateeCall as $, baseRest as ze, assignValue as Xe, constant$1 as Ue, merge as q } from "./rehype-mermaid.BZ1zaur1.js";
-function He(e) {
-  return Ge(Ye(e, void 0, O), e + "");
-}
-var Je = 1, Ze = 4;
-function Ke(e) {
-  return Te(e, Je | Ze);
-}
-function Qe(e, n) {
-  return e == null ? e : De(e, ce(n), $e);
-}
-function en(e, n) {
-  return e && le(e, ce(n));
-}
-function nn(e, n) {
-  return e > n;
-}
-function S(e, n) {
-  var r = {};
-  return n = z(n), le(e, function(t, i, a) {
-    qe(r, i, n(t, i, a));
-  }), r;
-}
-function y(e) {
-  return e && e.length ? he(e, pe, nn) : void 0;
-}
-function U(e, n) {
-  return e && e.length ? he(e, z(n), Fe) : void 0;
-}
-function rn(e, n) {
-  var r = e.length;
-  for (e.sort(n); r--; )
-    e[r] = e[r].value;
-  return e;
-}
-function tn(e, n) {
-  if (e !== n) {
-    var r = e !== void 0, t = e === null, i = e === e, a = ee(e), o = n !== void 0, u = n === null, d = n === n, f = ee(n);
-    if (!u && !f && !a && e > n || a && o && d && !u && !f || t && o && d || !r && d || !i)
-      return 1;
-    if (!t && !a && !f && e < n || f && r && i && !t && !a || u && r && i || !o && i || !d)
-      return -1;
-  }
-  return 0;
-}
-function an(e, n, r) {
-  for (var t = -1, i = e.criteria, a = n.criteria, o = i.length, u = r.length; ++t < o; ) {
-    var d = tn(i[t], a[t]);
-    if (d) {
-      if (t >= u)
-        return d;
-      var f = r[t];
-      return d * (f == "desc" ? -1 : 1);
-    }
-  }
-  return e.index - n.index;
-}
-function on(e, n, r) {
-  n.length ? n = F(n, function(a) {
-    return we(a) ? function(o) {
-      return Ie(o, a.length === 1 ? a[0] : a);
-    } : a;
-  }) : n = [pe];
-  var t = -1;
-  n = F(n, We(z));
-  var i = Ve(e, function(a, o, u) {
-    var d = F(n, function(f) {
-      return f(a);
-    });
-    return { criteria: d, index: ++t, value: a };
-  });
-  return rn(i, function(a, o) {
-    return an(a, o, r);
-  });
-}
-function un(e, n) {
-  return Ae(e, n, function(r, t) {
-    return Me(e, t);
-  });
-}
-var I = He(function(e, n) {
-  return e == null ? {} : un(e, n);
-}), dn = Math.ceil, fn = Math.max;
-function sn(e, n, r, t) {
-  for (var i = -1, a = fn(dn((n - e) / (r || 1)), 0), o = Array(a); a--; )
-    o[++i] = e, e += r;
-  return o;
-}
-function cn(e) {
-  return function(n, r, t) {
-    return t && typeof t != "number" && $(n, r, t) && (r = t = void 0), n = V(n), r === void 0 ? (r = n, n = 0) : r = V(r), t = t === void 0 ? n < r ? 1 : -1 : V(t), sn(n, r, t);
-  };
-}
-var E = cn(), R = ze(function(e, n) {
-  if (e == null)
-    return [];
-  var r = n.length;
-  return r > 1 && $(e, n[0], n[1]) ? n = [] : r > 2 && $(n[0], n[1], n[2]) && (n = [n[0]]), on(e, Se(n), []);
-}), ln = 0;
-function H(e) {
-  var n = ++ln;
-  return je(e) + n;
-}
-function hn(e, n, r) {
-  for (var t = -1, i = e.length, a = n.length, o = {}; ++t < i; ) {
-    var u = t < a ? n[t] : void 0;
-    r(o, e[t], u);
-  }
-  return o;
-}
-function vn(e, n) {
-  return hn(e || [], n || [], Xe);
-}
-class pn {
-  constructor() {
-    var n = {};
-    n._next = n._prev = n, this._sentinel = n;
-  }
-  dequeue() {
-    var n = this._sentinel, r = n._prev;
-    if (r !== n)
-      return ne(r), r;
-  }
-  enqueue(n) {
-    var r = this._sentinel;
-    n._prev && n._next && ne(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, wn)), t = t._prev;
-    return "[" + n.join(", ") + "]";
-  }
-}
-function ne(e) {
-  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
-}
-function wn(e, n) {
-  if (e !== "_next" && e !== "_prev")
-    return n;
-}
-var bn = Ue(1);
-function mn(e, n) {
-  if (e.nodeCount() <= 1)
-    return [];
-  var r = yn(e, n || bn), t = gn(r.graph, r.buckets, r.zeroIdx);
-  return O(
-    w(t, function(i) {
-      return e.outEdges(i.v, i.w);
-    })
-  );
-}
-function gn(e, n, r) {
-  for (var t = [], i = n[n.length - 1], a = n[0], o; e.nodeCount(); ) {
-    for (; o = a.dequeue(); )
-      A(e, n, r, o);
-    for (; o = i.dequeue(); )
-      A(e, n, r, o);
-    if (e.nodeCount()) {
-      for (var u = n.length - 2; u > 0; --u)
-        if (o = n[u].dequeue(), o) {
-          t = t.concat(A(e, n, r, o, !0));
-          break;
-        }
-    }
-  }
-  return t;
-}
-function A(e, n, r, t, i) {
-  var a = i ? [] : void 0;
-  return s(e.inEdges(t.v), function(o) {
-    var u = e.edge(o), d = e.node(o.v);
-    i && a.push({ v: o.v, w: o.w }), d.out -= u, W(n, r, d);
-  }), s(e.outEdges(t.v), function(o) {
-    var u = e.edge(o), d = o.w, f = e.node(d);
-    f.in -= u, W(n, r, f);
-  }), e.removeNode(t.v), a;
-}
-function yn(e, n) {
-  var r = new g(), t = 0, i = 0;
-  s(e.nodes(), function(u) {
-    r.setNode(u, { v: u, in: 0, out: 0 });
-  }), s(e.edges(), function(u) {
-    var d = r.edge(u.v, u.w) || 0, f = n(u), c = d + f;
-    r.setEdge(u.v, u.w, c), i = Math.max(i, r.node(u.v).out += f), t = Math.max(t, r.node(u.w).in += f);
-  });
-  var a = E(i + t + 3).map(function() {
-    return new pn();
-  }), o = t + 1;
-  return s(r.nodes(), function(u) {
-    W(a, o, r.node(u));
-  }), { graph: r, buckets: a, zeroIdx: o };
-}
-function W(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 kn(e) {
-  var n = e.graph().acyclicer === "greedy" ? mn(e, r(e)) : xn(e);
-  s(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, H("rev"));
-  });
-  function r(t) {
-    return function(i) {
-      return t.edge(i).weight;
-    };
-  }
-}
-function xn(e) {
-  var n = [], r = {}, t = {};
-  function i(a) {
-    Object.prototype.hasOwnProperty.call(t, a) || (t[a] = !0, r[a] = !0, s(e.outEdges(a), function(o) {
-      Object.prototype.hasOwnProperty.call(r, o.w) ? n.push(o) : i(o.w);
-    }), delete r[a]);
-  }
-  return s(e.nodes(), i), n;
-}
-function En(e) {
-  s(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 L(e, n, r, t) {
-  var i;
-  do
-    i = H(t);
-  while (e.hasNode(i));
-  return r.dummy = n, e.setNode(i, r), i;
-}
-function On(e) {
-  var n = new g().setGraph(e.graph());
-  return s(e.nodes(), function(r) {
-    n.setNode(r, e.node(r));
-  }), s(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 be(e) {
-  var n = new g({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-  return s(e.nodes(), function(r) {
-    e.children(r).length || n.setNode(r, e.node(r));
-  }), s(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, a = n.y - t, o = e.width / 2, u = e.height / 2;
-  if (!i && !a)
-    throw new Error("Not possible to find intersection inside of the rectangle");
-  var d, f;
-  return Math.abs(a) * o > Math.abs(i) * u ? (a < 0 && (u = -u), d = u * i / a, f = u) : (i < 0 && (o = -o), d = o, f = o * a / i), { x: r + d, y: t + f };
-}
-function j(e) {
-  var n = w(E(me(e) + 1), function() {
-    return [];
-  });
-  return s(e.nodes(), function(r) {
-    var t = e.node(r), i = t.rank;
-    m(i) || (n[i][t.order] = r);
-  }), n;
-}
-function Ln(e) {
-  var n = P(
-    w(e.nodes(), function(r) {
-      return e.node(r).rank;
-    })
-  );
-  s(e.nodes(), function(r) {
-    var t = e.node(r);
-    ve(t, "rank") && (t.rank -= n);
-  });
-}
-function Nn(e) {
-  var n = P(
-    w(e.nodes(), function(a) {
-      return e.node(a).rank;
-    })
-  ), r = [];
-  s(e.nodes(), function(a) {
-    var o = e.node(a).rank - n;
-    r[o] || (r[o] = []), r[o].push(a);
-  });
-  var t = 0, i = e.graph().nodeRankFactor;
-  s(r, function(a, o) {
-    m(a) && o % i !== 0 ? --t : t && s(a, function(u) {
-      e.node(u).rank += t;
-    });
-  });
-}
-function te(e, n, r, t) {
-  var i = {
-    width: 0,
-    height: 0
-  };
-  return arguments.length >= 4 && (i.rank = r, i.order = t), L(e, "border", i, n);
-}
-function me(e) {
-  return y(
-    w(e.nodes(), function(n) {
-      var r = e.node(n).rank;
-      if (!m(r))
-        return r;
-    })
-  );
-}
-function Pn(e, n) {
-  var r = { lhs: [], rhs: [] };
-  return s(e, function(t) {
-    n(t) ? r.lhs.push(t) : r.rhs.push(t);
-  }), r;
-}
-function Cn(e, n) {
-  return n();
-}
-function _n(e) {
-  function n(r) {
-    var t = e.children(r), i = e.node(r);
-    if (t.length && s(t, n), Object.prototype.hasOwnProperty.call(i, "minRank")) {
-      i.borderLeft = [], i.borderRight = [];
-      for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a)
-        ie(e, "borderLeft", "_bl", r, i, a), ie(e, "borderRight", "_br", r, i, a);
-    }
-  }
-  s(e.children(), n);
-}
-function ie(e, n, r, t, i, a) {
-  var o = { width: 0, height: 0, rank: a, borderType: n }, u = i[n][a - 1], d = L(e, "border", o, r);
-  i[n][a] = d, e.setParent(d, t), u && e.setEdge(u, d, { weight: 1 });
-}
-function Rn(e) {
-  var n = e.graph().rankdir.toLowerCase();
-  (n === "lr" || n === "rl") && ge(e);
-}
-function Tn(e) {
-  var n = e.graph().rankdir.toLowerCase();
-  (n === "bt" || n === "rl") && In(e), (n === "lr" || n === "rl") && (Mn(e), ge(e));
-}
-function ge(e) {
-  s(e.nodes(), function(n) {
-    ae(e.node(n));
-  }), s(e.edges(), function(n) {
-    ae(e.edge(n));
-  });
-}
-function ae(e) {
-  var n = e.width;
-  e.width = e.height, e.height = n;
-}
-function In(e) {
-  s(e.nodes(), function(n) {
-    B(e.node(n));
-  }), s(e.edges(), function(n) {
-    var r = e.edge(n);
-    s(r.points, B), Object.prototype.hasOwnProperty.call(r, "y") && B(r);
-  });
-}
-function B(e) {
-  e.y = -e.y;
-}
-function Mn(e) {
-  s(e.nodes(), function(n) {
-    G(e.node(n));
-  }), s(e.edges(), function(n) {
-    var r = e.edge(n);
-    s(r.points, G), Object.prototype.hasOwnProperty.call(r, "x") && G(r);
-  });
-}
-function G(e) {
-  var n = e.x;
-  e.x = e.y, e.y = n;
-}
-function Sn(e) {
-  e.graph().dummyChains = [], s(e.edges(), function(n) {
-    jn(e, n);
-  });
-}
-function jn(e, n) {
-  var r = n.v, t = e.node(r).rank, i = n.w, a = e.node(i).rank, o = n.name, u = e.edge(n), d = u.labelRank;
-  if (a !== t + 1) {
-    e.removeEdge(n);
-    var f = void 0, c, l;
-    for (l = 0, ++t; t < a; ++l, ++t)
-      u.points = [], f = {
-        width: 0,
-        height: 0,
-        edgeLabel: u,
-        edgeObj: n,
-        rank: t
-      }, c = L(e, "edge", f, "_d"), t === d && (f.width = u.width, f.height = u.height, f.dummy = "edge-label", f.labelpos = u.labelpos), e.setEdge(r, c, { weight: u.weight }, o), l === 0 && e.graph().dummyChains.push(c), r = c;
-    e.setEdge(r, i, { weight: u.weight }, o);
-  }
-}
-function Fn(e) {
-  s(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 J(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 a = P(
-      w(e.outEdges(t), function(o) {
-        return r(o.w) - e.edge(o).minlen;
-      })
-    );
-    return (a === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
-    a === void 0 || // return value of _.map([]) for Lodash 4
-    a === null) && (a = 0), i.rank = a;
-  }
-  s(e.sources(), r);
-}
-function C(e, n) {
-  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
-}
-function ye(e) {
-  var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
-  n.setNode(r, {});
-  for (var i, a; Vn(n, e) < t; )
-    i = An(n, e), a = n.hasNode(i.v) ? C(e, i) : -C(e, i), Bn(n, e, a);
-  return n;
-}
-function Vn(e, n) {
-  function r(t) {
-    s(n.nodeEdges(t), function(i) {
-      var a = i.v, o = t === a ? i.w : a;
-      !e.hasNode(o) && !C(n, i) && (e.setNode(o, {}), e.setEdge(t, o, {}), r(o));
-    });
-  }
-  return s(e.nodes(), r), e.nodeCount();
-}
-function An(e, n) {
-  return U(n.edges(), function(r) {
-    if (e.hasNode(r.v) !== e.hasNode(r.w))
-      return C(n, r);
-  });
-}
-function Bn(e, n, r) {
-  s(e.nodes(), function(t) {
-    n.node(t).rank += r;
-  });
-}
-function ke(e, n, r) {
-  we(n) || (n = [n]);
-  var t = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
-  return s(n, function(o) {
-    if (!e.hasNode(o))
-      throw new Error("Graph does not have node: " + o);
-    xe(e, o, r === "post", a, t, i);
-  }), i;
-}
-function xe(e, n, r, t, i, a) {
-  Object.prototype.hasOwnProperty.call(t, n) || (t[n] = !0, r || a.push(n), s(i(n), function(o) {
-    xe(e, o, r, t, i, a);
-  }), r && a.push(n));
-}
-function Gn(e, n) {
-  return ke(e, n, "post");
-}
-function Yn(e, n) {
-  return ke(e, n, "pre");
-}
-k.initLowLimValues = K;
-k.initCutValues = Z;
-k.calcCutValue = Ee;
-k.leaveEdge = Le;
-k.enterEdge = Ne;
-k.exchangeEdges = Pe;
-function k(e) {
-  e = On(e), J(e);
-  var n = ye(e);
-  K(n), Z(n, e);
-  for (var r, t; r = Le(n); )
-    t = Ne(n, e, r), Pe(n, e, r, t);
-}
-function Z(e, n) {
-  var r = Gn(e, e.nodes());
-  r = r.slice(0, r.length - 1), s(r, function(t) {
-    Dn(e, n, t);
-  });
-}
-function Dn(e, n, r) {
-  var t = e.node(r), i = t.parent;
-  e.edge(r, i).cutvalue = Ee(e, n, r);
-}
-function Ee(e, n, r) {
-  var t = e.node(r), i = t.parent, a = !0, o = n.edge(r, i), u = 0;
-  return o || (a = !1, o = n.edge(i, r)), u = o.weight, s(n.nodeEdges(r), function(d) {
-    var f = d.v === r, c = f ? d.w : d.v;
-    if (c !== i) {
-      var l = f === a, h = n.edge(d).weight;
-      if (u += l ? h : -h, qn(e, r, c)) {
-        var v = e.edge(r, c).cutvalue;
-        u += l ? -v : v;
-      }
-    }
-  }), u;
-}
-function K(e, n) {
-  arguments.length < 2 && (n = e.nodes()[0]), Oe(e, {}, 1, n);
-}
-function Oe(e, n, r, t, i) {
-  var a = r, o = e.node(t);
-  return n[t] = !0, s(e.neighbors(t), function(u) {
-    Object.prototype.hasOwnProperty.call(n, u) || (r = Oe(e, n, r, u, t));
-  }), o.low = a, o.lim = r++, i ? o.parent = i : delete o.parent, r;
-}
-function Le(e) {
-  return X(e.edges(), function(n) {
-    return e.edge(n).cutvalue < 0;
-  });
-}
-function Ne(e, n, r) {
-  var t = r.v, i = r.w;
-  n.hasEdge(t, i) || (t = r.w, i = r.v);
-  var a = e.node(t), o = e.node(i), u = a, d = !1;
-  a.lim > o.lim && (u = o, d = !0);
-  var f = _(n.edges(), function(c) {
-    return d === oe(e, e.node(c.v), u) && d !== oe(e, e.node(c.w), u);
-  });
-  return U(f, function(c) {
-    return C(n, c);
-  });
-}
-function Pe(e, n, r, t) {
-  var i = r.v, a = r.w;
-  e.removeEdge(i, a), e.setEdge(t.v, t.w, {}), K(e), Z(e, n), $n(e, n);
-}
-function $n(e, n) {
-  var r = X(e.nodes(), function(i) {
-    return !n.node(i).parent;
-  }), t = Yn(e, r);
-  t = t.slice(1), s(t, function(i) {
-    var a = e.node(i).parent, o = n.edge(i, a), u = !1;
-    o || (o = n.edge(a, i), u = !0), n.node(i).rank = n.node(a).rank + (u ? o.minlen : -o.minlen);
-  });
-}
-function qn(e, n, r) {
-  return e.hasEdge(n, r);
-}
-function oe(e, n, r) {
-  return r.low <= n.lim && n.lim <= r.lim;
-}
-function Wn(e) {
-  switch (e.graph().ranker) {
-    case "network-simplex":
-      ue(e);
-      break;
-    case "tight-tree":
-      Xn(e);
-      break;
-    case "longest-path":
-      zn(e);
-      break;
-    default:
-      ue(e);
-  }
-}
-var zn = J;
-function Xn(e) {
-  J(e), ye(e);
-}
-function ue(e) {
-  k(e);
-}
-function Un(e) {
-  var n = L(e, "root", {}, "_root"), r = Hn(e), t = y(x(r)) - 1, i = 2 * t + 1;
-  e.graph().nestingRoot = n, s(e.edges(), function(o) {
-    e.edge(o).minlen *= i;
-  });
-  var a = Jn(e) + 1;
-  s(e.children(), function(o) {
-    Ce(e, n, i, a, t, r, o);
-  }), e.graph().nodeRankFactor = i;
-}
-function Ce(e, n, r, t, i, a, o) {
-  var u = e.children(o);
-  if (!u.length) {
-    o !== n && e.setEdge(n, o, { weight: 0, minlen: r });
-    return;
-  }
-  var d = te(e, "_bt"), f = te(e, "_bb"), c = e.node(o);
-  e.setParent(d, o), c.borderTop = d, e.setParent(f, o), c.borderBottom = f, s(u, function(l) {
-    Ce(e, n, r, t, i, a, l);
-    var h = e.node(l), v = h.borderTop ? h.borderTop : l, p = h.borderBottom ? h.borderBottom : l, b = h.borderTop ? t : 2 * t, N = v !== p ? 1 : i - a[o] + 1;
-    e.setEdge(d, v, {
-      weight: b,
-      minlen: N,
-      nestingEdge: !0
-    }), e.setEdge(p, f, {
-      weight: b,
-      minlen: N,
-      nestingEdge: !0
-    });
-  }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: i + a[o] });
-}
-function Hn(e) {
-  var n = {};
-  function r(t, i) {
-    var a = e.children(t);
-    a && a.length && s(a, function(o) {
-      r(o, i + 1);
-    }), n[t] = i;
-  }
-  return s(e.children(), function(t) {
-    r(t, 1);
-  }), n;
-}
-function Jn(e) {
-  return M(
-    e.edges(),
-    function(n, r) {
-      return n + e.edge(r).weight;
-    },
-    0
-  );
-}
-function Zn(e) {
-  var n = e.graph();
-  e.removeNode(n.nestingRoot), delete n.nestingRoot, s(e.edges(), function(r) {
-    var t = e.edge(r);
-    t.nestingEdge && e.removeEdge(r);
-  });
-}
-function Kn(e, n, r) {
-  var t = {}, i;
-  s(r, function(a) {
-    for (var o = e.parent(a), u, d; o; ) {
-      if (u = e.parent(o), u ? (d = t[u], t[u] = o) : (d = i, i = o), d && d !== o) {
-        n.setEdge(d, o);
-        return;
-      }
-      o = u;
-    }
-  });
-}
-function Qn(e, n, r) {
-  var t = er(e), i = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(a) {
-    return e.node(a);
-  });
-  return s(e.nodes(), function(a) {
-    var o = e.node(a), u = e.parent(a);
-    (o.rank === n || o.minRank <= n && n <= o.maxRank) && (i.setNode(a), i.setParent(a, u || t), s(e[r](a), function(d) {
-      var f = d.v === a ? d.w : d.v, c = i.edge(f, a), l = m(c) ? 0 : c.weight;
-      i.setEdge(f, a, { weight: e.edge(d).weight + l });
-    }), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
-      borderLeft: o.borderLeft[n],
-      borderRight: o.borderRight[n]
-    }));
-  }), i;
-}
-function er(e) {
-  for (var n; e.hasNode(n = H("_root")); ) ;
-  return n;
-}
-function nr(e, n) {
-  for (var r = 0, t = 1; t < n.length; ++t)
-    r += rr(e, n[t - 1], n[t]);
-  return r;
-}
-function rr(e, n, r) {
-  for (var t = vn(
-    r,
-    w(r, function(f, c) {
-      return c;
-    })
-  ), i = O(
-    w(n, function(f) {
-      return R(
-        w(e.outEdges(f), function(c) {
-          return { pos: t[c.w], weight: e.edge(c).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;
-  }), d = 0;
-  return s(
-    // @ts-expect-error
-    i.forEach(function(f) {
-      var c = f.pos + a;
-      u[c] += f.weight;
-      for (var l = 0; c > 0; )
-        c % 2 && (l += u[c + 1]), c = c - 1 >> 1, u[c] += f.weight;
-      d += f.weight * l;
-    })
-  ), d;
-}
-function tr(e) {
-  var n = {}, r = _(e.nodes(), function(u) {
-    return !e.children(u).length;
-  }), t = y(
-    w(r, function(u) {
-      return e.node(u).rank;
-    })
-  ), i = w(E(t + 1), function() {
-    return [];
-  });
-  function a(u) {
-    if (!ve(n, u)) {
-      n[u] = !0;
-      var d = e.node(u);
-      i[d.rank].push(u), s(e.successors(u), a);
-    }
-  }
-  var o = R(r, function(u) {
-    return e.node(u).rank;
-  });
-  return s(o, a), i;
-}
-function ir(e, n) {
-  return w(n, function(r) {
-    var t = e.inEdges(r);
-    if (t.length) {
-      var i = M(
-        t,
-        function(a, o) {
-          var u = e.edge(o), d = e.node(o.v);
-          return {
-            sum: a.sum + u.weight * d.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 ar(e, n) {
-  var r = {};
-  s(e, function(i, a) {
-    var o = r[i.v] = {
-      indegree: 0,
-      in: [],
-      out: [],
-      vs: [i.v],
-      i: a
-    };
-    m(i.barycenter) || (o.barycenter = i.barycenter, o.weight = i.weight);
-  }), s(n.edges(), function(i) {
-    var a = r[i.v], o = r[i.w];
-    !m(a) && !m(o) && (o.indegree++, a.out.push(r[i.w]));
-  });
-  var t = _(r, function(i) {
-    return !i.indegree;
-  });
-  return or(t);
-}
-function or(e) {
-  var n = [];
-  function r(a) {
-    return function(o) {
-      o.merged || (m(o.barycenter) || m(a.barycenter) || o.barycenter >= a.barycenter) && ur(a, o);
-    };
-  }
-  function t(a) {
-    return function(o) {
-      o.in.push(a), --o.indegree === 0 && e.push(o);
-    };
-  }
-  for (; e.length; ) {
-    var i = e.pop();
-    n.push(i), s(i.in.reverse(), r(i)), s(i.out, t(i));
-  }
-  return w(
-    _(n, function(a) {
-      return !a.merged;
-    }),
-    function(a) {
-      return I(a, ["vs", "i", "barycenter", "weight"]);
-    }
-  );
-}
-function ur(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 dr(e, n) {
-  var r = Pn(e, function(c) {
-    return Object.prototype.hasOwnProperty.call(c, "barycenter");
-  }), t = r.lhs, i = R(r.rhs, function(c) {
-    return -c.i;
-  }), a = [], o = 0, u = 0, d = 0;
-  t.sort(fr(!!n)), d = de(a, i, d), s(t, function(c) {
-    d += c.vs.length, a.push(c.vs), o += c.barycenter * c.weight, u += c.weight, d = de(a, i, d);
-  });
-  var f = { vs: O(a) };
-  return u && (f.barycenter = o / u, f.weight = u), f;
-}
-function de(e, n, r) {
-  for (var t; n.length && (t = T(n)).i <= r; )
-    n.pop(), e.push(t.vs), r++;
-  return r;
-}
-function fr(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 _e(e, n, r, t) {
-  var i = e.children(n), a = e.node(n), o = a ? a.borderLeft : void 0, u = a ? a.borderRight : void 0, d = {};
-  o && (i = _(i, function(p) {
-    return p !== o && p !== u;
-  }));
-  var f = ir(e, i);
-  s(f, function(p) {
-    if (e.children(p.v).length) {
-      var b = _e(e, p.v, r, t);
-      d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && cr(p, b);
-    }
-  });
-  var c = ar(f, r);
-  sr(c, d);
-  var l = dr(c, t);
-  if (o && (l.vs = O([o, l.vs, u]), e.predecessors(o).length)) {
-    var h = e.node(e.predecessors(o)[0]), v = 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 + v.order) / (l.weight + 2), l.weight += 2;
-  }
-  return l;
-}
-function sr(e, n) {
-  s(e, function(r) {
-    r.vs = O(
-      r.vs.map(function(t) {
-        return n[t] ? n[t].vs : t;
-      })
-    );
-  });
-}
-function cr(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 lr(e) {
-  var n = me(e), r = fe(e, E(1, n + 1), "inEdges"), t = fe(e, E(n - 1, -1, -1), "outEdges"), i = tr(e);
-  se(e, i);
-  for (var a = Number.POSITIVE_INFINITY, o, u = 0, d = 0; d < 4; ++u, ++d) {
-    hr(u % 2 ? r : t, u % 4 >= 2), i = j(e);
-    var f = nr(e, i);
-    f < a && (d = 0, o = Ke(i), a = f);
-  }
-  se(e, o);
-}
-function fe(e, n, r) {
-  return w(n, function(t) {
-    return Qn(e, t, r);
-  });
-}
-function hr(e, n) {
-  var r = new g();
-  s(e, function(t) {
-    var i = t.graph().root, a = _e(t, i, r, n);
-    s(a.vs, function(o, u) {
-      t.node(o).order = u;
-    }), Kn(t, r, a.vs);
-  });
-}
-function se(e, n) {
-  s(n, function(r) {
-    s(r, function(t, i) {
-      e.node(t).order = i;
-    });
-  });
-}
-function vr(e) {
-  var n = wr(e);
-  s(e.graph().dummyChains, function(r) {
-    for (var t = e.node(r), i = t.edgeObj, a = pr(e, n, i.v, i.w), o = a.path, u = a.lca, d = 0, f = o[d], c = !0; r !== i.w; ) {
-      if (t = e.node(r), c) {
-        for (; (f = o[d]) !== u && e.node(f).maxRank < t.rank; )
-          d++;
-        f === u && (c = !1);
-      }
-      if (!c) {
-        for (; d < o.length - 1 && e.node(f = o[d + 1]).minRank <= t.rank; )
-          d++;
-        f = o[d];
-      }
-      e.setParent(r, f), r = e.successors(r)[0];
-    }
-  });
-}
-function pr(e, n, r, t) {
-  var i = [], a = [], o = Math.min(n[r].low, n[t].low), u = Math.max(n[r].lim, n[t].lim), d, f;
-  d = r;
-  do
-    d = e.parent(d), i.push(d);
-  while (d && (n[d].low > o || u > n[d].lim));
-  for (f = d, d = t; (d = e.parent(d)) !== f; )
-    a.push(d);
-  return { path: i.concat(a.reverse()), lca: f };
-}
-function wr(e) {
-  var n = {}, r = 0;
-  function t(i) {
-    var a = r;
-    s(e.children(i), t), n[i] = { low: a, lim: r++ };
-  }
-  return s(e.children(), t), n;
-}
-function br(e, n) {
-  var r = {};
-  function t(i, a) {
-    var o = 0, u = 0, d = i.length, f = T(a);
-    return s(a, function(c, l) {
-      var h = gr(e, c), v = h ? e.node(h).order : d;
-      (h || c === f) && (s(a.slice(u, l + 1), function(p) {
-        s(e.predecessors(p), function(b) {
-          var N = e.node(b), Q = N.order;
-          (Q < o || v < Q) && !(N.dummy && e.node(p).dummy) && Re(r, b, p);
-        });
-      }), u = l + 1, o = v);
-    }), a;
-  }
-  return M(n, t), r;
-}
-function mr(e, n) {
-  var r = {};
-  function t(a, o, u, d, f) {
-    var c;
-    s(E(o, u), function(l) {
-      c = a[l], e.node(c).dummy && s(e.predecessors(c), function(h) {
-        var v = e.node(h);
-        v.dummy && (v.order < d || v.order > f) && Re(r, h, c);
-      });
-    });
-  }
-  function i(a, o) {
-    var u = -1, d, f = 0;
-    return s(o, function(c, l) {
-      if (e.node(c).dummy === "border") {
-        var h = e.predecessors(c);
-        h.length && (d = e.node(h[0]).order, t(o, f, l, u, d), f = l, u = d);
-      }
-      t(o, f, o.length, d, a.length);
-    }), o;
-  }
-  return M(n, i), r;
-}
-function gr(e, n) {
-  if (e.node(n).dummy)
-    return X(e.predecessors(n), function(r) {
-      return e.node(r).dummy;
-    });
-}
-function Re(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 yr(e, n, r) {
-  if (n > r) {
-    var t = n;
-    n = r, r = t;
-  }
-  return !!e[n] && Object.prototype.hasOwnProperty.call(e[n], r);
-}
-function kr(e, n, r, t) {
-  var i = {}, a = {}, o = {};
-  return s(n, function(u) {
-    s(u, function(d, f) {
-      i[d] = d, a[d] = d, o[d] = f;
-    });
-  }), s(n, function(u) {
-    var d = -1;
-    s(u, function(f) {
-      var c = t(f);
-      if (c.length) {
-        c = R(c, function(b) {
-          return o[b];
-        });
-        for (var l = (c.length - 1) / 2, h = Math.floor(l), v = Math.ceil(l); h <= v; ++h) {
-          var p = c[h];
-          a[f] === f && d < o[p] && !yr(r, f, p) && (a[p] = f, a[f] = i[f] = i[p], d = o[p]);
-        }
-      }
-    });
-  }), { root: i, align: a };
-}
-function xr(e, n, r, t, i) {
-  var a = {}, o = Er(e, n, r, i), u = i ? "borderLeft" : "borderRight";
-  function d(l, h) {
-    for (var v = o.nodes(), p = v.pop(), b = {}; p; )
-      b[p] ? l(p) : (b[p] = !0, v.push(p), v = v.concat(h(p))), p = v.pop();
-  }
-  function f(l) {
-    a[l] = o.inEdges(l).reduce(function(h, v) {
-      return Math.max(h, a[v.v] + o.edge(v));
-    }, 0);
-  }
-  function c(l) {
-    var h = o.outEdges(l).reduce(function(p, b) {
-      return Math.min(p, a[b.w] - o.edge(b));
-    }, Number.POSITIVE_INFINITY), v = e.node(l);
-    h !== Number.POSITIVE_INFINITY && v.borderType !== u && (a[l] = Math.max(a[l], h));
-  }
-  return d(f, o.predecessors.bind(o)), d(c, o.successors.bind(o)), s(t, function(l) {
-    a[l] = a[r[l]];
-  }), a;
-}
-function Er(e, n, r, t) {
-  var i = new g(), a = e.graph(), o = Cr(a.nodesep, a.edgesep, t);
-  return s(n, function(u) {
-    var d;
-    s(u, function(f) {
-      var c = r[f];
-      if (i.setNode(c), d) {
-        var l = r[d], h = i.edge(l, c);
-        i.setEdge(l, c, Math.max(o(e, f, d), h || 0));
-      }
-      d = f;
-    });
-  }), i;
-}
-function Or(e, n) {
-  return U(x(n), function(r) {
-    var t = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
-    return Qe(r, function(a, o) {
-      var u = _r(e, o) / 2;
-      t = Math.max(a + u, t), i = Math.min(a - u, i);
-    }), t - i;
-  });
-}
-function Lr(e, n) {
-  var r = x(n), t = P(r), i = y(r);
-  s(["u", "d"], function(a) {
-    s(["l", "r"], function(o) {
-      var u = a + o, d = e[u], f;
-      if (d !== n) {
-        var c = x(d);
-        f = o === "l" ? t - P(c) : i - y(c), f && (e[u] = S(d, function(l) {
-          return l + f;
-        }));
-      }
-    });
-  });
-}
-function Nr(e, n) {
-  return S(e.ul, function(r, t) {
-    if (n)
-      return e[n.toLowerCase()][t];
-    var i = R(w(e, t));
-    return (i[1] + i[2]) / 2;
-  });
-}
-function Pr(e) {
-  var n = j(e), r = q(br(e, n), mr(e, n)), t = {}, i;
-  s(["u", "d"], function(o) {
-    i = o === "u" ? n : x(n).reverse(), s(["l", "r"], function(u) {
-      u === "r" && (i = w(i, function(l) {
-        return x(l).reverse();
-      }));
-      var d = (o === "u" ? e.predecessors : e.successors).bind(e), f = kr(e, i, r, d), c = xr(e, i, f.root, f.align, u === "r");
-      u === "r" && (c = S(c, function(l) {
-        return -l;
-      })), t[o + u] = c;
-    });
-  });
-  var a = Or(e, t);
-  return Lr(t, a), Nr(t, e.graph().align);
-}
-function Cr(e, n, r) {
-  return function(t, i, a) {
-    var o = t.node(i), u = t.node(a), d = 0, f;
-    if (d += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos"))
-      switch (o.labelpos.toLowerCase()) {
-        case "l":
-          f = -o.width / 2;
-          break;
-        case "r":
-          f = o.width / 2;
-          break;
-      }
-    if (f && (d += r ? f : -f), f = 0, d += (o.dummy ? n : e) / 2, d += (u.dummy ? n : e) / 2, d += u.width / 2, Object.prototype.hasOwnProperty.call(u, "labelpos"))
-      switch (u.labelpos.toLowerCase()) {
-        case "l":
-          f = u.width / 2;
-          break;
-        case "r":
-          f = -u.width / 2;
-          break;
-      }
-    return f && (d += r ? f : -f), f = 0, d;
-  };
-}
-function _r(e, n) {
-  return e.node(n).width;
-}
-function Rr(e) {
-  e = be(e), Tr(e), en(Pr(e), function(n, r) {
-    e.node(r).x = n;
-  });
-}
-function Tr(e) {
-  var n = j(e), r = e.graph().ranksep, t = 0;
-  s(n, function(i) {
-    var a = y(
-      w(i, function(o) {
-        return e.node(o).height;
-      })
-    );
-    s(i, function(o) {
-      e.node(o).y = t + a / 2;
-    }), t += a + r;
-  });
-}
-function at(e, n) {
-  var r = Cn;
-  r("layout", () => {
-    var t = r("  buildLayoutGraph", () => Dr(e));
-    r("  runLayout", () => Ir(t, r)), r("  updateInputGraph", () => Mr(e, t));
-  });
-}
-function Ir(e, n) {
-  n("    makeSpaceForEdgeLabels", () => $r(e)), n("    removeSelfEdges", () => Kr(e)), n("    acyclic", () => kn(e)), n("    nestingGraph.run", () => Un(e)), n("    rank", () => Wn(be(e))), n("    injectEdgeLabelProxies", () => qr(e)), n("    removeEmptyRanks", () => Nn(e)), n("    nestingGraph.cleanup", () => Zn(e)), n("    normalizeRanks", () => Ln(e)), n("    assignRankMinMax", () => Wr(e)), n("    removeEdgeLabelProxies", () => zr(e)), n("    normalize.run", () => Sn(e)), n("    parentDummyChains", () => vr(e)), n("    addBorderSegments", () => _n(e)), n("    order", () => lr(e)), n("    insertSelfEdges", () => Qr(e)), n("    adjustCoordinateSystem", () => Rn(e)), n("    position", () => Rr(e)), n("    positionSelfEdges", () => et(e)), n("    removeBorderNodes", () => Zr(e)), n("    normalize.undo", () => Fn(e)), n("    fixupEdgeLabelCoords", () => Hr(e)), n("    undoCoordinateSystem", () => Tn(e)), n("    translateGraph", () => Xr(e)), n("    assignNodeIntersects", () => Ur(e)), n("    reversePoints", () => Jr(e)), n("    acyclic.undo", () => En(e));
-}
-function Mr(e, n) {
-  s(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));
-  }), s(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 Sr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Fr = ["acyclicer", "ranker", "rankdir", "align"], Vr = ["width", "height"], Ar = { width: 0, height: 0 }, Br = ["minlen", "weight", "width", "height", "labeloffset"], Gr = {
-  minlen: 1,
-  weight: 1,
-  width: 0,
-  height: 0,
-  labeloffset: 10,
-  labelpos: "r"
-}, Yr = ["labelpos"];
-function Dr(e) {
-  var n = new g({ multigraph: !0, compound: !0 }), r = D(e.graph());
-  return n.setGraph(
-    q({}, jr, Y(r, Sr), I(r, Fr))
-  ), s(e.nodes(), function(t) {
-    var i = D(e.node(t));
-    n.setNode(t, Be(Y(i, Vr), Ar)), n.setParent(t, e.parent(t));
-  }), s(e.edges(), function(t) {
-    var i = D(e.edge(t));
-    n.setEdge(
-      t,
-      q({}, Gr, Y(i, Br), I(i, Yr))
-    );
-  }), n;
-}
-function $r(e) {
-  var n = e.graph();
-  n.ranksep /= 2, s(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 qr(e) {
-  s(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), a = { rank: (i.rank - t.rank) / 2 + t.rank, e: n };
-      L(e, "edge-proxy", a, "_ep");
-    }
-  });
-}
-function Wr(e) {
-  var n = 0;
-  s(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 = y(n));
-  }), e.graph().maxRank = n;
-}
-function zr(e) {
-  s(e.nodes(), function(n) {
-    var r = e.node(n);
-    r.dummy === "edge-proxy" && (e.edge(r.e).labelRank = r.rank, e.removeNode(n));
-  });
-}
-function Xr(e) {
-  var n = Number.POSITIVE_INFINITY, r = 0, t = Number.POSITIVE_INFINITY, i = 0, a = e.graph(), o = a.marginx || 0, u = a.marginy || 0;
-  function d(f) {
-    var c = f.x, l = f.y, h = f.width, v = f.height;
-    n = Math.min(n, c - h / 2), r = Math.max(r, c + h / 2), t = Math.min(t, l - v / 2), i = Math.max(i, l + v / 2);
-  }
-  s(e.nodes(), function(f) {
-    d(e.node(f));
-  }), s(e.edges(), function(f) {
-    var c = e.edge(f);
-    Object.prototype.hasOwnProperty.call(c, "x") && d(c);
-  }), n -= o, t -= u, s(e.nodes(), function(f) {
-    var c = e.node(f);
-    c.x -= n, c.y -= t;
-  }), s(e.edges(), function(f) {
-    var c = e.edge(f);
-    s(c.points, function(l) {
-      l.x -= n, l.y -= t;
-    }), Object.prototype.hasOwnProperty.call(c, "x") && (c.x -= n), Object.prototype.hasOwnProperty.call(c, "y") && (c.y -= t);
-  }), a.width = r - n + o, a.height = i - t + u;
-}
-function Ur(e) {
-  s(e.edges(), function(n) {
-    var r = e.edge(n), t = e.node(n.v), i = e.node(n.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(re(t, a)), r.points.push(re(i, o));
-  });
-}
-function Hr(e) {
-  s(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 Jr(e) {
-  s(e.edges(), function(n) {
-    var r = e.edge(n);
-    r.reversed && r.points.reverse();
-  });
-}
-function Zr(e) {
-  s(e.nodes(), function(n) {
-    if (e.children(n).length) {
-      var r = e.node(n), t = e.node(r.borderTop), i = e.node(r.borderBottom), a = e.node(T(r.borderLeft)), o = e.node(T(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;
-    }
-  }), s(e.nodes(), function(n) {
-    e.node(n).dummy === "border" && e.removeNode(n);
-  });
-}
-function Kr(e) {
-  s(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 Qr(e) {
-  var n = j(e);
-  s(n, function(r) {
-    var t = 0;
-    s(r, function(i, a) {
-      var o = e.node(i);
-      o.order = a + t, s(o.selfEdges, function(u) {
-        L(
-          e,
-          "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 et(e) {
-  s(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, a = t.y, o = r.x - i, u = t.height / 2;
-      e.setEdge(r.e, r.label), e.removeNode(n), 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 Y(e, n) {
-  return S(I(e, n), Number);
-}
-function D(e) {
-  var n = {};
-  return s(e, function(r, t) {
-    n[t.toLowerCase()] = r;
-  }), n;
-}
-export {
-  at as layout
-};