@altimateai/ui-components 0.0.78 → 0.0.79-beta.2

package/dist/layout.js

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