@ucap-llm/ai-ui 1.1.20 → 1.1.22

package/{layout-b7402112.mjs → layout-UCl5QdSx.mjs}

@@ -1,46 +1,42 @@
-import { G as g } from "./graph-c2e1b9d5.mjs";
-import { b as Ie, o as le, p as he, g as z, e as ee, k as j, n as Me, q as Se, c as Fe, s as je, d as f, i as m, f as _, v as x, r as M } from "./_baseUniq-83e8b0cb.mjs";
-import { f as O, b as ve, a as Be, c as Ve, d as Ae, t as B, m as w, e as P, h as pe, g as U, l as T, i as Ge } from "./_basePickBy-576eaf6e.mjs";
-import { b6 as Ye, b7 as $e, b8 as De, b9 as qe, aO as We, ba as ze, aS as we, aR as be, bb as Ue, aN as D, az as Xe, aU as He, aB as Je, bc as q } from "./index-4283477e.mjs";
+import { G as g } from "./graph-BqoU6xY2.mjs";
+import { b as Te, o as ce, p as le, g as z, e as ee, k as j, n as Me, q as Ie, c as Se, s as Fe, d as f, i as m, f as _, v as x, r as I } from "./_baseUniq-Duw-LCxN.mjs";
+import { f as O, b as he, a as je, c as Ve, d as Be, t as V, m as w, e as P, h as ve, g as X, l as T, i as Ae } from "./_basePickBy-49aBLVXj.mjs";
+import { b5 as Ge, b6 as Ye, b7 as De, aN as qe, b8 as $e, aR as pe, aQ as we, b9 as We, aM as q, az as ze, aT as Xe, aB as Ue, ba as $ } from "./index-LXAHF7dZ.mjs";
+function He(e) {
+  return Ge(Ye(e, void 0, O), e + "");
+}
+var Je = 1, Qe = 4;
 function Ze(e) {
-  return Ye($e(e, void 0, O), e + "");
+  return Te(e, Je | Qe);
 }
-var Ke = 1, Qe = 4;
-function en(e) {
-  return Ie(e, Ke | Qe);
+function Ke(e, n) {
+  return e == null ? e : De(e, ce(n), qe);
 }
-var nn = function() {
-  return De.Date.now();
-};
-const ne = nn;
-function rn(e, n) {
-  return e == null ? e : qe(e, le(n), We);
+function en(e, n) {
+  return e && le(e, ce(n));
 }
-function tn(e, n) {
-  return e && he(e, le(n));
-}
-function an(e, n) {
+function nn(e, n) {
   return e > n;
 }
 function S(e, n) {
   var r = {};
-  return n = z(n), he(e, function(t, a, i) {
-    ze(r, a, n(t, a, i));
+  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 ? ve(e, we, an) : void 0;
+  return e && e.length ? he(e, pe, nn) : void 0;
 }
-function X(e, n) {
-  return e && e.length ? ve(e, z(n), Be) : void 0;
+function U(e, n) {
+  return e && e.length ? he(e, z(n), je) : void 0;
 }
-function on(e, n) {
+function rn(e, n) {
   var r = e.length;
   for (e.sort(n); r--; )
     e[r] = e[r].value;
   return e;
 }
-function un(e, n) {
+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)
@@ -50,9 +46,9 @@ function un(e, n) {
   }
   return 0;
 }
-function dn(e, n, r) {
+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 = un(a[t], i[t]);
+    var d = tn(a[t], i[t]);
     if (d) {
       if (t >= u)
         return d;
@@ -62,69 +58,63 @@ function dn(e, n, r) {
   }
   return e.index - n.index;
 }
-function sn(e, n, r) {
+function on(e, n, r) {
   n.length ? n = j(n, function(i) {
-    return be(i) ? function(o) {
+    return we(i) ? function(o) {
       return Me(o, i.length === 1 ? i[0] : i);
     } : i;
-  }) : n = [we];
+  }) : n = [pe];
   var t = -1;
-  n = j(n, Ue(z));
+  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 on(a, function(i, o) {
-    return dn(i, o, r);
+  return rn(a, function(i, o) {
+    return an(i, o, r);
   });
 }
-function fn(e, n) {
-  return Ae(e, n, function(r, t) {
-    return Se(e, t);
+function un(e, n) {
+  return Be(e, n, function(r, t) {
+    return Ie(e, t);
   });
 }
-var cn = Ze(function(e, n) {
-  return e == null ? {} : fn(e, n);
-});
-const I = cn;
-var ln = Math.ceil, hn = Math.max;
-function vn(e, n, r, t) {
-  for (var a = -1, i = hn(ln((n - e) / (r || 1)), 0), o = Array(i); i--; )
-    o[t ? i : ++a] = e, e += r;
+var M = 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 pn(e) {
+function cn(e) {
   return function(n, r, t) {
-    return t && typeof t != "number" && D(n, r, t) && (r = t = void 0), n = B(n), r === void 0 ? (r = n, n = 0) : r = B(r), t = t === void 0 ? n < r ? 1 : -1 : B(t), vn(n, r, t, e);
+    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 wn = pn();
-const E = wn;
-var bn = Xe(function(e, n) {
+var E = cn(), R = ze(function(e, n) {
   if (e == null)
     return [];
   var r = n.length;
-  return r > 1 && D(e, n[0], n[1]) ? n = [] : r > 2 && D(n[0], n[1], n[2]) && (n = [n[0]]), sn(e, Fe(n, 1), []);
-});
-const R = bn;
-var mn = 0;
+  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 = ++mn;
-  return je(e) + n;
+  var n = ++ln;
+  return Fe(e) + n;
 }
-function gn(e, n, r) {
+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 yn(e, n) {
-  return gn(e || [], n || [], He);
+function vn(e, n) {
+  return hn(e || [], n || [], Xe);
 }
-class kn {
+class pn {
   constructor() {
     var n = {};
     n._next = n._prev = n, this._sentinel = n;
@@ -132,53 +122,53 @@ class kn {
   dequeue() {
     var n = this._sentinel, r = n._prev;
     if (r !== n)
-      return re(r), r;
+      return ne(r), r;
   }
   enqueue(n) {
     var r = this._sentinel;
-    n._prev && n._next && re(n), n._next = r._next, r._next._prev = n, r._next = n, n._prev = r;
+    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, xn)), t = t._prev;
+      n.push(JSON.stringify(t, wn)), t = t._prev;
     return "[" + n.join(", ") + "]";
   }
 }
-function re(e) {
+function ne(e) {
   e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function xn(e, n) {
+function wn(e, n) {
   if (e !== "_next" && e !== "_prev")
     return n;
 }
-var En = Je(1);
-function On(e, n) {
+var bn = Ue(1);
+function mn(e, n) {
   if (e.nodeCount() <= 1)
     return [];
-  var r = Nn(e, n || En), t = Ln(r.graph, r.buckets, r.zeroIdx);
+  var r = yn(e, n || bn), t = gn(r.graph, r.buckets, r.zeroIdx);
   return O(
     w(t, function(a) {
       return e.outEdges(a.v, a.w);
     })
   );
 }
-function Ln(e, n, r) {
+function gn(e, n, r) {
   for (var t = [], a = n[n.length - 1], i = n[0], o; e.nodeCount(); ) {
     for (; o = i.dequeue(); )
-      V(e, n, r, o);
+      B(e, n, r, o);
     for (; o = a.dequeue(); )
-      V(e, n, r, o);
+      B(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(V(e, n, r, o, !0));
+          t = t.concat(B(e, n, r, o, !0));
           break;
         }
     }
   }
   return t;
 }
-function V(e, n, r, t, a) {
+function B(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);
@@ -188,7 +178,7 @@ function V(e, n, r, t, a) {
     s.in -= u, W(n, r, s);
   }), e.removeNode(t.v), i;
 }
-function Nn(e, n) {
+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 });
@@ -197,7 +187,7 @@ function Nn(e, n) {
     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);
   });
   var i = E(a + t + 3).map(function() {
-    return new kn();
+    return new pn();
   }), o = t + 1;
   return f(r.nodes(), function(u) {
     W(i, o, r.node(u));
@@ -206,8 +196,8 @@ function Nn(e, n) {
 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 Pn(e) {
-  var n = e.graph().acyclicer === "greedy" ? On(e, r(e)) : Cn(e);
+function kn(e) {
+  var n = e.graph().acyclicer === "greedy" ? mn(e, r(e)) : xn(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"));
@@ -218,7 +208,7 @@ function Pn(e) {
     };
   }
 }
-function Cn(e) {
+function xn(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) {
@@ -227,7 +217,7 @@ function Cn(e) {
   }
   return f(e.nodes(), a), n;
 }
-function _n(e) {
+function En(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (r.reversed) {
@@ -244,7 +234,7 @@ function L(e, n, r, t) {
   while (e.hasNode(a));
   return r.dummy = n, e.setNode(a, r), a;
 }
-function Rn(e) {
+function On(e) {
   var n = new g().setGraph(e.graph());
   return f(e.nodes(), function(r) {
     n.setNode(r, e.node(r));
@@ -256,7 +246,7 @@ function Rn(e) {
     });
   }), n;
 }
-function me(e) {
+function be(e) {
   var n = new g({ multigraph: e.isMultigraph() }).setGraph(e.graph());
   return f(e.nodes(), function(r) {
     e.children(r).length || n.setNode(r, e.node(r));
@@ -264,7 +254,7 @@ function me(e) {
     n.setEdge(r, e.edge(r));
   }), n;
 }
-function te(e, 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)
     throw new Error("Not possible to find intersection inside of the rectangle");
@@ -272,7 +262,7 @@ function te(e, n) {
   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 };
 }
 function F(e) {
-  var n = w(E(ge(e) + 1), function() {
+  var n = w(E(me(e) + 1), function() {
     return [];
   });
   return f(e.nodes(), function(r) {
@@ -280,7 +270,7 @@ function F(e) {
     m(a) || (n[a][t.order] = r);
   }), n;
 }
-function Tn(e) {
+function Ln(e) {
   var n = P(
     w(e.nodes(), function(r) {
       return e.node(r).rank;
@@ -288,10 +278,10 @@ function Tn(e) {
   );
   f(e.nodes(), function(r) {
     var t = e.node(r);
-    pe(t, "rank") && (t.rank -= n);
+    ve(t, "rank") && (t.rank -= n);
   });
 }
-function In(e) {
+function Nn(e) {
   var n = P(
     w(e.nodes(), function(i) {
       return e.node(i).rank;
@@ -308,14 +298,14 @@ function In(e) {
     });
   });
 }
-function ae(e, n, r, t) {
+function te(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);
 }
-function ge(e) {
+function me(e) {
   return y(
     w(e.nodes(), function(n) {
       var r = e.node(n).rank;
@@ -324,58 +314,50 @@ function ge(e) {
     })
   );
 }
-function Mn(e, n) {
+function Pn(e, n) {
   var r = { lhs: [], rhs: [] };
   return f(e, function(t) {
     n(t) ? r.lhs.push(t) : r.rhs.push(t);
   }), r;
 }
-function Sn(e, n) {
-  var r = ne();
-  try {
-    return n();
-  } finally {
-    console.log(e + " time: " + (ne() - r) + "ms");
-  }
-}
-function Fn(e, n) {
+function Cn(e, n) {
   return n();
 }
-function jn(e) {
+function _n(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)
-        ie(e, "borderLeft", "_bl", r, a, i), ie(e, "borderRight", "_br", r, a, i);
+        ae(e, "borderLeft", "_bl", r, a, i), ae(e, "borderRight", "_br", r, a, i);
     }
   }
   f(e.children(), n);
 }
-function ie(e, n, r, t, a, i) {
+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 Bn(e) {
+function Rn(e) {
   var n = e.graph().rankdir.toLowerCase();
-  (n === "lr" || n === "rl") && ye(e);
+  (n === "lr" || n === "rl") && ge(e);
 }
-function Vn(e) {
+function Tn(e) {
   var n = e.graph().rankdir.toLowerCase();
-  (n === "bt" || n === "rl") && An(e), (n === "lr" || n === "rl") && (Gn(e), ye(e));
+  (n === "bt" || n === "rl") && Mn(e), (n === "lr" || n === "rl") && (In(e), ge(e));
 }
-function ye(e) {
+function ge(e) {
   f(e.nodes(), function(n) {
-    oe(e.node(n));
+    ie(e.node(n));
   }), f(e.edges(), function(n) {
-    oe(e.edge(n));
+    ie(e.edge(n));
   });
 }
-function oe(e) {
+function ie(e) {
   var n = e.width;
   e.width = e.height, e.height = n;
 }
-function An(e) {
+function Mn(e) {
   f(e.nodes(), function(n) {
     A(e.node(n));
   }), f(e.edges(), function(n) {
@@ -386,7 +368,7 @@ function An(e) {
 function A(e) {
   e.y = -e.y;
 }
-function Gn(e) {
+function In(e) {
   f(e.nodes(), function(n) {
     G(e.node(n));
   }), f(e.edges(), function(n) {
@@ -398,12 +380,12 @@ function G(e) {
   var n = e.x;
   e.x = e.y, e.y = n;
 }
-function Yn(e) {
+function Sn(e) {
   e.graph().dummyChains = [], f(e.edges(), function(n) {
-    $n(e, n);
+    Fn(e, n);
   });
 }
-function $n(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) {
     e.removeEdge(n);
@@ -419,7 +401,7 @@ function $n(e, n) {
     e.setEdge(r, a, { weight: u.weight }, o);
   }
 }
-function Dn(e) {
+function jn(e) {
   f(e.graph().dummyChains, function(n) {
     var r = e.node(n), t = r.edgeLabel, a;
     for (e.setEdge(r.edgeObj, t); r.dummy; )
@@ -447,14 +429,14 @@ function J(e) {
 function C(e, n) {
   return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
 }
-function ke(e) {
+function ye(e) {
   var n = new g({ directed: !1 }), r = e.nodes()[0], t = e.nodeCount();
   n.setNode(r, {});
-  for (var a, i; qn(n, e) < t; )
-    a = Wn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), zn(n, e, i);
+  for (var a, i; Vn(n, e) < t; )
+    a = Bn(n, e), i = n.hasNode(a.v) ? C(e, a) : -C(e, a), An(n, e, i);
   return n;
 }
-function qn(e, n) {
+function Vn(e, n) {
   function r(t) {
     f(n.nodeEdges(t), function(a) {
       var i = a.v, o = t === i ? a.w : i;
@@ -463,162 +445,162 @@ function qn(e, n) {
   }
   return f(e.nodes(), r), e.nodeCount();
 }
-function Wn(e, n) {
-  return X(n.edges(), function(r) {
+function Bn(e, n) {
+  return U(n.edges(), function(r) {
     if (e.hasNode(r.v) !== e.hasNode(r.w))
       return C(n, r);
   });
 }
-function zn(e, n, r) {
+function An(e, n, r) {
   f(e.nodes(), function(t) {
     n.node(t).rank += r;
   });
 }
-function Un() {
+function Gn() {
 }
-Un.prototype = new Error();
-function xe(e, n, r) {
-  be(n) || (n = [n]);
+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);
-    Ee(e, o, r === "post", i, t, a);
+    xe(e, o, r === "post", i, t, a);
   }), a;
 }
-function Ee(e, n, r, t, a, i) {
+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) {
-    Ee(e, o, r, t, a, i);
+    xe(e, o, r, t, a, i);
   }), r && i.push(n));
 }
-function Xn(e, n) {
-  return xe(e, n, "post");
+function Yn(e, n) {
+  return ke(e, n, "post");
 }
-function Hn(e, n) {
-  return xe(e, n, "pre");
+function Dn(e, n) {
+  return ke(e, n, "pre");
 }
-k.initLowLimValues = K;
-k.initCutValues = Z;
-k.calcCutValue = Oe;
-k.leaveEdge = Ne;
-k.enterEdge = Pe;
-k.exchangeEdges = Ce;
+k.initLowLimValues = Z;
+k.initCutValues = Q;
+k.calcCutValue = Ee;
+k.leaveEdge = Le;
+k.enterEdge = Ne;
+k.exchangeEdges = Pe;
 function k(e) {
-  e = Rn(e), J(e);
-  var n = ke(e);
-  K(n), Z(n, e);
-  for (var r, t; r = Ne(n); )
-    t = Pe(n, e, r), Ce(n, e, r, t);
-}
-function Z(e, n) {
-  var r = Xn(e, e.nodes());
+  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());
   r = r.slice(0, r.length - 1), f(r, function(t) {
-    Jn(e, n, t);
+    qn(e, n, t);
   });
 }
-function Jn(e, n, r) {
+function qn(e, n, r) {
   var t = e.node(r), a = t.parent;
-  e.edge(r, a).cutvalue = Oe(e, n, r);
+  e.edge(r, a).cutvalue = Ee(e, n, r);
 }
-function Oe(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;
     if (c !== a) {
       var l = s === i, h = n.edge(d).weight;
-      if (u += l ? h : -h, Kn(e, r, c)) {
+      if (u += l ? h : -h, Wn(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]), Le(e, {}, 1, n);
+function Z(e, n) {
+  arguments.length < 2 && (n = e.nodes()[0]), Oe(e, {}, 1, n);
 }
-function Le(e, n, r, t, a) {
+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 = Le(e, n, r, u, t));
+    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 Ne(e) {
-  return U(e.edges(), function(n) {
+function Le(e) {
+  return X(e.edges(), function(n) {
     return e.edge(n).cutvalue < 0;
   });
 }
-function Pe(e, n, r) {
+function Ne(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 === ue(e, e.node(c.v), u) && d !== ue(e, e.node(c.w), u);
+    return d === oe(e, e.node(c.v), u) && d !== oe(e, e.node(c.w), u);
   });
-  return X(s, function(c) {
+  return U(s, function(c) {
     return C(n, c);
   });
 }
-function Ce(e, n, r, t) {
+function Pe(e, n, r, t) {
   var a = r.v, i = r.w;
-  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), K(e), Z(e, n), Zn(e, n);
+  e.removeEdge(a, i), e.setEdge(t.v, t.w, {}), Z(e), Q(e, n), $n(e, n);
 }
-function Zn(e, n) {
-  var r = U(e.nodes(), function(a) {
+function $n(e, n) {
+  var r = X(e.nodes(), function(a) {
     return !n.node(a).parent;
-  }), t = Hn(e, r);
+  }), t = Dn(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);
   });
 }
-function Kn(e, n, r) {
+function Wn(e, n, r) {
   return e.hasEdge(n, r);
 }
-function ue(e, n, r) {
+function oe(e, n, r) {
   return r.low <= n.lim && n.lim <= r.lim;
 }
-function Qn(e) {
+function zn(e) {
   switch (e.graph().ranker) {
     case "network-simplex":
-      de(e);
+      ue(e);
       break;
     case "tight-tree":
-      nr(e);
+      Un(e);
       break;
     case "longest-path":
-      er(e);
+      Xn(e);
       break;
     default:
-      de(e);
+      ue(e);
   }
 }
-var er = J;
-function nr(e) {
-  J(e), ke(e);
+var Xn = J;
+function Un(e) {
+  J(e), ye(e);
 }
-function de(e) {
+function ue(e) {
   k(e);
 }
-function rr(e) {
-  var n = L(e, "root", {}, "_root"), r = tr(e), t = y(x(r)) - 1, a = 2 * t + 1;
+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;
   });
-  var i = ar(e) + 1;
+  var i = Qn(e) + 1;
   f(e.children(), function(o) {
-    _e(e, n, a, i, t, r, o);
+    Ce(e, n, a, i, t, r, o);
   }), e.graph().nodeRankFactor = a;
 }
-function _e(e, n, r, t, a, i, o) {
+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 });
     return;
   }
-  var d = ae(e, "_bt"), s = ae(e, "_bb"), c = e.node(o);
+  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) {
-    _e(e, n, r, t, a, i, 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,
@@ -631,7 +613,7 @@ function _e(e, n, r, t, a, i, o) {
     });
   }), e.parent(o) || e.setEdge(n, d, { weight: 0, minlen: a + i[o] });
 }
-function tr(e) {
+function Jn(e) {
   var n = {};
   function r(t, a) {
     var i = e.children(t);
@@ -643,8 +625,8 @@ function tr(e) {
     r(t, 1);
   }), n;
 }
-function ar(e) {
-  return M(
+function Qn(e) {
+  return I(
     e.edges(),
     function(n, r) {
       return n + e.edge(r).weight;
@@ -652,14 +634,14 @@ function ar(e) {
     0
   );
 }
-function ir(e) {
+function Zn(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 or(e, n, r) {
+function Kn(e, n, r) {
   var t = {}, a;
   f(r, function(i) {
     for (var o = e.parent(i), u, d; o; ) {
@@ -671,8 +653,8 @@ function or(e, n, r) {
     }
   });
 }
-function ur(e, n, r) {
-  var t = dr(e), a = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
+function er(e, n, r) {
+  var t = nr(e), a = new g({ compound: !0 }).setGraph({ root: t }).setDefaultNodeLabel(function(i) {
     return e.node(i);
   });
   return f(e.nodes(), function(i) {
@@ -686,18 +668,17 @@ function ur(e, n, r) {
     }));
   }), a;
 }
-function dr(e) {
-  for (var n; e.hasNode(n = H("_root")); )
-    ;
+function nr(e) {
+  for (var n; e.hasNode(n = H("_root")); ) ;
   return n;
 }
-function sr(e, n) {
+function rr(e, n) {
   for (var r = 0, t = 1; t < n.length; ++t)
-    r += fr(e, n[t - 1], n[t]);
+    r += tr(e, n[t - 1], n[t]);
   return r;
 }
-function fr(e, n, r) {
-  for (var t = yn(
+function tr(e, n, r) {
+  for (var t = vn(
     r,
     w(r, function(s, c) {
       return c;
@@ -711,8 +692,7 @@ function fr(e, n, r) {
         "pos"
       );
     })
-  ), i = 1; i < r.length; )
-    i <<= 1;
+  ), i = 1; i < r.length; ) i <<= 1;
   var o = 2 * i - 1;
   i -= 1;
   var u = w(new Array(o), function() {
@@ -729,7 +709,7 @@ function fr(e, n, r) {
     })
   ), d;
 }
-function cr(e) {
+function ar(e) {
   var n = {}, r = _(e.nodes(), function(u) {
     return !e.children(u).length;
   }), t = y(
@@ -740,7 +720,7 @@ function cr(e) {
     return [];
   });
   function i(u) {
-    if (!pe(n, u)) {
+    if (!ve(n, u)) {
       n[u] = !0;
       var d = e.node(u);
       a[d.rank].push(u), f(e.successors(u), i);
@@ -751,11 +731,11 @@ function cr(e) {
   });
   return f(o, i), a;
 }
-function lr(e, n) {
+function ir(e, n) {
   return w(n, function(r) {
     var t = e.inEdges(r);
     if (t.length) {
-      var a = M(
+      var a = I(
         t,
         function(i, o) {
           var u = e.edge(o), d = e.node(o.v);
@@ -775,7 +755,7 @@ function lr(e, n) {
       return { v: r };
   });
 }
-function hr(e, n) {
+function or(e, n) {
   var r = {};
   f(e, function(a, i) {
     var o = r[a.v] = {
@@ -793,13 +773,13 @@ function hr(e, n) {
   var t = _(r, function(a) {
     return !a.indegree;
   });
-  return vr(t);
+  return ur(t);
 }
-function vr(e) {
+function ur(e) {
   var n = [];
   function r(i) {
     return function(o) {
-      o.merged || (m(o.barycenter) || m(i.barycenter) || o.barycenter >= i.barycenter) && pr(i, o);
+      o.merged || (m(o.barycenter) || m(i.barycenter) || o.barycenter >= i.barycenter) && dr(i, o);
     };
   }
   function t(i) {
@@ -816,58 +796,58 @@ function vr(e) {
       return !i.merged;
     }),
     function(i) {
-      return I(i, ["vs", "i", "barycenter", "weight"]);
+      return M(i, ["vs", "i", "barycenter", "weight"]);
     }
   );
 }
-function pr(e, n) {
+function dr(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 wr(e, n) {
-  var r = Mn(e, function(c) {
+function sr(e, n) {
+  var r = Pn(e, function(c) {
     return Object.prototype.hasOwnProperty.call(c, "barycenter");
   }), t = r.lhs, a = R(r.rhs, function(c) {
     return -c.i;
   }), i = [], o = 0, u = 0, d = 0;
-  t.sort(br(!!n)), d = se(i, a, d), f(t, function(c) {
-    d += c.vs.length, i.push(c.vs), o += c.barycenter * c.weight, u += c.weight, d = se(i, a, d);
+  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);
   });
   var s = { vs: O(i) };
   return u && (s.barycenter = o / u, s.weight = u), s;
 }
-function se(e, n, r) {
+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 br(e) {
+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 Re(e, n, r, t) {
+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;
   }));
-  var s = lr(e, a);
+  var s = ir(e, a);
   f(s, function(p) {
     if (e.children(p.v).length) {
-      var b = Re(e, p.v, r, t);
-      d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && gr(p, b);
+      var b = _e(e, p.v, r, t);
+      d[p.v] = b, Object.prototype.hasOwnProperty.call(b, "barycenter") && lr(p, b);
     }
   });
-  var c = hr(s, r);
-  mr(c, d);
-  var l = wr(c, t);
+  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]);
     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 mr(e, n) {
+function cr(e, n) {
   f(e, function(r) {
     r.vs = O(
       r.vs.map(function(t) {
@@ -876,44 +856,44 @@ function mr(e, n) {
     );
   });
 }
-function gr(e, n) {
+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 yr(e) {
-  var n = ge(e), r = fe(e, E(1, n + 1), "inEdges"), t = fe(e, E(n - 1, -1, -1), "outEdges"), a = cr(e);
-  ce(e, a);
+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) {
-    kr(u % 2 ? r : t, u % 4 >= 2), a = F(e);
-    var s = sr(e, a);
-    s < i && (d = 0, o = en(a), i = s);
+    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);
   }
-  ce(e, o);
+  fe(e, o);
 }
-function fe(e, n, r) {
+function se(e, n, r) {
   return w(n, function(t) {
-    return ur(e, t, r);
+    return er(e, t, r);
   });
 }
-function kr(e, n) {
+function vr(e, n) {
   var r = new g();
   f(e, function(t) {
-    var a = t.graph().root, i = Re(t, a, r, n);
+    var a = t.graph().root, i = _e(t, a, r, n);
     f(i.vs, function(o, u) {
       t.node(o).order = u;
-    }), or(t, r, i.vs);
+    }), Kn(t, r, i.vs);
   });
 }
-function ce(e, n) {
+function fe(e, n) {
   f(n, function(r) {
     f(r, function(t, a) {
       e.node(t).order = a;
     });
   });
 }
-function xr(e) {
-  var n = Or(e);
+function pr(e) {
+  var n = br(e);
   f(e.graph().dummyChains, function(r) {
-    for (var t = e.node(r), a = t.edgeObj, i = Er(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, i = wr(e, n, a.v, a.w), o = i.path, u = i.lca, d = 0, s = o[d], c = !0; r !== a.w; ) {
       if (t = e.node(r), c) {
         for (; (s = o[d]) !== u && e.node(s).maxRank < t.rank; )
           d++;
@@ -928,7 +908,7 @@ function xr(e) {
     }
   });
 }
-function Er(e, n, r, t) {
+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;
   do
@@ -938,7 +918,7 @@ function Er(e, n, r, t) {
     i.push(d);
   return { path: a.concat(i.reverse()), lca: s };
 }
-function Or(e) {
+function br(e) {
   var n = {}, r = 0;
   function t(a) {
     var i = r;
@@ -946,30 +926,30 @@ function Or(e) {
   }
   return f(e.children(), t), n;
 }
-function Lr(e, n) {
+function mr(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 = Pr(e, c), v = h ? e.node(h).order : d;
+      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), Q = N.order;
-          (Q < o || v < Q) && !(N.dummy && e.node(p).dummy) && Te(r, b, p);
+          var N = e.node(b), K = N.order;
+          (K < o || v < K) && !(N.dummy && e.node(p).dummy) && Re(r, b, p);
         });
       }), u = l + 1, o = v);
     }), i;
   }
-  return M(n, t), r;
+  return I(n, t), r;
 }
-function Nr(e, n) {
+function gr(e, n) {
   var r = {};
   function t(i, o, u, d, s) {
     var c;
     f(E(o, u), function(l) {
       c = i[l], e.node(c).dummy && f(e.predecessors(c), function(h) {
         var v = e.node(h);
-        v.dummy && (v.order < d || v.order > s) && Te(r, h, c);
+        v.dummy && (v.order < d || v.order > s) && Re(r, h, c);
       });
     });
   }
@@ -983,15 +963,15 @@ function Nr(e, n) {
       t(o, s, o.length, d, i.length);
     }), o;
   }
-  return M(n, a), r;
+  return I(n, a), r;
 }
-function Pr(e, n) {
+function yr(e, n) {
   if (e.node(n).dummy)
-    return U(e.predecessors(n), function(r) {
+    return X(e.predecessors(n), function(r) {
       return e.node(r).dummy;
     });
 }
-function Te(e, n, r) {
+function Re(e, n, r) {
   if (n > r) {
     var t = n;
     n = r, r = t;
@@ -999,14 +979,14 @@ function Te(e, n, r) {
   var a = e[n];
   a || (e[n] = a = {}), a[r] = !0;
 }
-function Cr(e, n, r) {
+function kr(e, n, r) {
   if (n > r) {
     var t = n;
     n = r, r = t;
   }
   return !!e[n] && Object.prototype.hasOwnProperty.call(e[n], r);
 }
-function _r(e, n, r, t) {
+function xr(e, n, r, t) {
   var a = {}, i = {}, o = {};
   return f(n, function(u) {
     f(u, function(d, s) {
@@ -1022,14 +1002,14 @@ function _r(e, n, r, t) {
         });
         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] && !Cr(r, s, p) && (i[p] = s, i[s] = a[s] = a[p], d = o[p]);
+          i[s] === s && d < o[p] && !kr(r, s, p) && (i[p] = s, i[s] = a[s] = a[p], d = o[p]);
         }
       }
     });
   }), { root: a, align: i };
 }
-function Rr(e, n, r, t, a) {
-  var i = {}, o = Tr(e, n, r, a), u = a ? "borderLeft" : "borderRight";
+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();
@@ -1049,8 +1029,8 @@ function Rr(e, n, r, t, a) {
     i[l] = i[r[l]];
   }), i;
 }
-function Tr(e, n, r, t) {
-  var a = new g(), i = e.graph(), o = jr(i.nodesep, i.edgesep, t);
+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) {
@@ -1063,16 +1043,16 @@ function Tr(e, n, r, t) {
     });
   }), a;
 }
-function Ir(e, n) {
-  return X(x(n), function(r) {
+function Lr(e, n) {
+  return U(x(n), function(r) {
     var t = Number.NEGATIVE_INFINITY, a = Number.POSITIVE_INFINITY;
-    return rn(r, function(i, o) {
-      var u = Br(e, o) / 2;
+    return Ke(r, function(i, o) {
+      var u = Rr(e, o) / 2;
       t = Math.max(i + u, t), a = Math.min(i - u, a);
     }), t - a;
   });
 }
-function Mr(e, n) {
+function Nr(e, n) {
   var r = x(n), t = P(r), a = y(r);
   f(["u", "d"], function(i) {
     f(["l", "r"], function(o) {
@@ -1086,7 +1066,7 @@ function Mr(e, n) {
     });
   });
 }
-function Sr(e, n) {
+function Pr(e, n) {
   return S(e.ul, function(r, t) {
     if (n)
       return e[n.toLowerCase()][t];
@@ -1094,23 +1074,23 @@ function Sr(e, n) {
     return (a[1] + a[2]) / 2;
   });
 }
-function Fr(e) {
-  var n = F(e), r = q(Lr(e, n), Nr(e, n)), t = {}, a;
+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();
       }));
-      var d = (o === "u" ? e.predecessors : e.successors).bind(e), s = _r(e, a, r, d), c = Rr(e, a, s.root, s.align, u === "r");
+      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) {
         return -l;
       })), t[o + u] = c;
     });
   });
-  var i = Ir(e, t);
-  return Mr(t, i), Sr(t, e.graph().align);
+  var i = Lr(e, t);
+  return Nr(t, i), Pr(t, e.graph().align);
 }
-function jr(e, n, r) {
+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"))
@@ -1134,15 +1114,15 @@ function jr(e, n, r) {
     return s && (d += r ? s : -s), s = 0, d;
   };
 }
-function Br(e, n) {
+function Rr(e, n) {
   return e.node(n).width;
 }
-function Vr(e) {
-  e = me(e), Ar(e), tn(Fr(e), function(n, r) {
+function Tr(e) {
+  e = be(e), Mr(e), en(Cr(e), function(n, r) {
     e.node(r).x = n;
   });
 }
-function Ar(e) {
+function Mr(e) {
   var n = F(e), r = e.graph().ranksep, t = 0;
   f(n, function(a) {
     var i = y(
@@ -1155,17 +1135,17 @@ function Ar(e) {
     }), t += i + r;
   });
 }
-function ht(e, n) {
-  var r = n && n.debugTiming ? Sn : Fn;
+function ot(e, n) {
+  var r = Cn;
   r("layout", () => {
-    var t = r("  buildLayoutGraph", () => Jr(e));
-    r("  runLayout", () => Gr(t, r)), r("  updateInputGraph", () => Yr(e, t));
+    var t = r("  buildLayoutGraph", () => qr(e));
+    r("  runLayout", () => Ir(t, r)), r("  updateInputGraph", () => Sr(e, t));
   });
 }
-function Gr(e, n) {
-  n("    makeSpaceForEdgeLabels", () => Zr(e)), n("    removeSelfEdges", () => ot(e)), n("    acyclic", () => Pn(e)), n("    nestingGraph.run", () => rr(e)), n("    rank", () => Qn(me(e))), n("    injectEdgeLabelProxies", () => Kr(e)), n("    removeEmptyRanks", () => In(e)), n("    nestingGraph.cleanup", () => ir(e)), n("    normalizeRanks", () => Tn(e)), n("    assignRankMinMax", () => Qr(e)), n("    removeEdgeLabelProxies", () => et(e)), n("    normalize.run", () => Yn(e)), n("    parentDummyChains", () => xr(e)), n("    addBorderSegments", () => jn(e)), n("    order", () => yr(e)), n("    insertSelfEdges", () => ut(e)), n("    adjustCoordinateSystem", () => Bn(e)), n("    position", () => Vr(e)), n("    positionSelfEdges", () => dt(e)), n("    removeBorderNodes", () => it(e)), n("    normalize.undo", () => Dn(e)), n("    fixupEdgeLabelCoords", () => tt(e)), n("    undoCoordinateSystem", () => Vn(e)), n("    translateGraph", () => nt(e)), n("    assignNodeIntersects", () => rt(e)), n("    reversePoints", () => at(e)), n("    acyclic.undo", () => _n(e));
+function Ir(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 Yr(e, n) {
+function Sr(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));
@@ -1174,37 +1154,37 @@ function Yr(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 $r = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Dr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, qr = ["acyclicer", "ranker", "rankdir", "align"], Wr = ["width", "height"], zr = { width: 0, height: 0 }, Ur = ["minlen", "weight", "width", "height", "labeloffset"], Xr = {
+var Fr = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], jr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Vr = ["acyclicer", "ranker", "rankdir", "align"], Br = ["width", "height"], Ar = { width: 0, height: 0 }, Gr = ["minlen", "weight", "width", "height", "labeloffset"], Yr = {
   minlen: 1,
   weight: 1,
   width: 0,
   height: 0,
   labeloffset: 10,
   labelpos: "r"
-}, Hr = ["labelpos"];
-function Jr(e) {
-  var n = new g({ multigraph: !0, compound: !0 }), r = $(e.graph());
+}, Dr = ["labelpos"];
+function qr(e) {
+  var n = new g({ multigraph: !0, compound: !0 }), r = D(e.graph());
   return n.setGraph(
-    q({}, Dr, Y(r, $r), I(r, qr))
+    $({}, jr, Y(r, Fr), M(r, Vr))
   ), f(e.nodes(), function(t) {
-    var a = $(e.node(t));
-    n.setNode(t, Ge(Y(a, Wr), zr)), n.setParent(t, e.parent(t));
+    var a = D(e.node(t));
+    n.setNode(t, Ae(Y(a, Br), Ar)), n.setParent(t, e.parent(t));
   }), f(e.edges(), function(t) {
-    var a = $(e.edge(t));
+    var a = D(e.edge(t));
     n.setEdge(
       t,
-      q({}, Xr, Y(a, Ur), I(a, Hr))
+      $({}, Yr, Y(a, Gr), M(a, Dr))
     );
   }), n;
 }
-function Zr(e) {
+function $r(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 Kr(e) {
+function Wr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (r.width && r.height) {
@@ -1213,20 +1193,20 @@ function Kr(e) {
     }
   });
 }
-function Qr(e) {
+function zr(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));
   }), e.graph().maxRank = n;
 }
-function et(e) {
+function Xr(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 nt(e) {
+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) {
     var c = s.x, l = s.y, h = s.width, v = s.height;
@@ -1247,13 +1227,13 @@ function nt(e) {
     }), 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;
 }
-function rt(e) {
+function Hr(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(te(t, i)), r.points.push(te(a, 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));
   });
 }
-function tt(e) {
+function Jr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     if (Object.prototype.hasOwnProperty.call(r, "x"))
@@ -1267,13 +1247,13 @@ function tt(e) {
       }
   });
 }
-function at(e) {
+function Qr(e) {
   f(e.edges(), function(n) {
     var r = e.edge(n);
     r.reversed && r.points.reverse();
   });
 }
-function it(e) {
+function Zr(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));
@@ -1283,7 +1263,7 @@ function it(e) {
     e.node(n).dummy === "border" && e.removeNode(n);
   });
 }
-function ot(e) {
+function Kr(e) {
   f(e.edges(), function(n) {
     if (n.v === n.w) {
       var r = e.node(n.v);
@@ -1291,7 +1271,7 @@ function ot(e) {
     }
   });
 }
-function ut(e) {
+function et(e) {
   var n = F(e);
   f(n, function(r) {
     var t = 0;
@@ -1315,7 +1295,7 @@ function ut(e) {
     });
   });
 }
-function dt(e) {
+function nt(e) {
   f(e.nodes(), function(n) {
     var r = e.node(n);
     if (r.dummy === "selfedge") {
@@ -1331,14 +1311,14 @@ function dt(e) {
   });
 }
 function Y(e, n) {
-  return S(I(e, n), Number);
+  return S(M(e, n), Number);
 }
-function $(e) {
+function D(e) {
   var n = {};
   return f(e, function(r, t) {
     n[t.toLowerCase()] = r;
   }), n;
 }
 export {
-  ht as l
+  ot as l
 };