@kestra-io/ui-libs 0.0.300 → 0.0.302

package/dist/{VueFlowUtils-Ca_LeFFY.js → VueFlowUtils-l5Oh8tEj.js}

@@ -23,10 +23,12 @@ const uh = {
   EXPAND_DEPENDENCIES: "expandDependencies",
   SHOW_CONDITION: "showCondition",
   RUN_TASK: "runTask",
-  SHOW_CUSTOM_ACTION: "showCustomAction"
+  SHOW_CUSTOM_ACTION: "showCustomAction",
+  SHOW_DETAILS: "showDetails"
 }, ie = "cluster_", Z = {
   TASK_WIDTH: 184,
   TASK_HEIGHT: 44,
+  TASK_EXPANDED_FALLBACK_HEIGHT: 140,
   TRIGGER_WIDTH: 184,
   TRIGGER_HEIGHT: 44,
   DOT_WIDTH: 5,
@@ -52,46 +54,46 @@ function yf() {
   }
   return Oe = e, Oe;
 }
-var xe, Oi;
+var Ne, Oi;
 function si() {
-  if (Oi) return xe;
+  if (Oi) return Ne;
   Oi = 1;
   var e = yf(), a = e();
-  return xe = a, xe;
+  return Ne = a, Ne;
 }
-var Ne, xi;
+var xe, Ni;
 function oi() {
-  if (xi) return Ne;
-  xi = 1;
+  if (Ni) return xe;
+  Ni = 1;
   var e = si(), a = ue();
   function u(n, r) {
     return n && e(n, r, a);
   }
-  return Ne = u, Ne;
+  return xe = u, xe;
 }
-var ke, Ni;
+var Ae, xi;
 function Ef() {
-  if (Ni) return ke;
-  Ni = 1;
+  if (xi) return Ae;
+  xi = 1;
   var e = "__lodash_hash_undefined__";
   function a(u) {
     return this.__data__.set(u, e), this;
   }
-  return ke = a, ke;
+  return Ae = a, Ae;
 }
-var Ae, ki;
+var ke, Ai;
 function qf() {
-  if (ki) return Ae;
-  ki = 1;
+  if (Ai) return ke;
+  Ai = 1;
   function e(a) {
     return this.__data__.has(a);
   }
-  return Ae = e, Ae;
+  return ke = e, ke;
 }
-var Pe, Ai;
+var Pe, ki;
 function to() {
-  if (Ai) return Pe;
-  Ai = 1;
+  if (ki) return Pe;
+  ki = 1;
   var e = Xs(), a = Ef(), u = qf();
   function n(r) {
     var t = -1, s = r == null ? 0 : r.length;
@@ -127,32 +129,32 @@ function ao() {
   Mi = 1;
   var e = to(), a = wf(), u = io(), n = 1, r = 2;
   function t(s, i, f, d, o, c) {
-    var h = f & n, l = s.length, b = i.length;
-    if (l != b && !(h && b > l))
+    var h = f & n, l = s.length, y = i.length;
+    if (l != y && !(h && y > l))
       return !1;
     var p = c.get(s), v = c.get(i);
     if (p && v)
       return p == i && v == s;
     var g = -1, m = !0, _ = f & r ? new e() : void 0;
     for (c.set(s, i), c.set(i, s); ++g < l; ) {
-      var y = s[g], E = i[g];
+      var b = s[g], q = i[g];
       if (d)
-        var R = h ? d(E, y, g, i, s, c) : d(y, E, g, s, i, c);
-      if (R !== void 0) {
-        if (R)
+        var w = h ? d(q, b, g, i, s, c) : d(b, q, g, s, i, c);
+      if (w !== void 0) {
+        if (w)
           continue;
         m = !1;
         break;
       }
       if (_) {
-        if (!a(i, function(w, q) {
-          if (!u(_, q) && (y === w || o(y, w, f, d, c)))
-            return _.push(q);
+        if (!a(i, function(R, C) {
+          if (!u(_, C) && (b === R || o(b, R, f, d, c)))
+            return _.push(C);
         })) {
           m = !1;
           break;
         }
-      } else if (!(y === E || o(y, E, f, d, c))) {
+      } else if (!(b === q || o(b, q, f, d, c))) {
         m = !1;
         break;
       }
@@ -189,43 +191,43 @@ var Be, Di;
 function If() {
   if (Di) return Be;
   Di = 1;
-  var e = ri(), a = Qo(), u = pe(), n = ao(), r = Rf(), t = fi(), s = 1, i = 2, f = "[object Boolean]", d = "[object Date]", o = "[object Error]", c = "[object Map]", h = "[object Number]", l = "[object RegExp]", b = "[object Set]", p = "[object String]", v = "[object Symbol]", g = "[object ArrayBuffer]", m = "[object DataView]", _ = e ? e.prototype : void 0, y = _ ? _.valueOf : void 0;
-  function E(R, w, q, C, T, x, A) {
-    switch (q) {
+  var e = ri(), a = Qo(), u = pe(), n = ao(), r = Rf(), t = fi(), s = 1, i = 2, f = "[object Boolean]", d = "[object Date]", o = "[object Error]", c = "[object Map]", h = "[object Number]", l = "[object RegExp]", y = "[object Set]", p = "[object String]", v = "[object Symbol]", g = "[object ArrayBuffer]", m = "[object DataView]", _ = e ? e.prototype : void 0, b = _ ? _.valueOf : void 0;
+  function q(w, R, C, E, T, N, x) {
+    switch (C) {
       case m:
-        if (R.byteLength != w.byteLength || R.byteOffset != w.byteOffset)
+        if (w.byteLength != R.byteLength || w.byteOffset != R.byteOffset)
           return !1;
-        R = R.buffer, w = w.buffer;
+        w = w.buffer, R = R.buffer;
       case g:
-        return !(R.byteLength != w.byteLength || !x(new a(R), new a(w)));
+        return !(w.byteLength != R.byteLength || !N(new a(w), new a(R)));
       case f:
       case d:
       case h:
-        return u(+R, +w);
+        return u(+w, +R);
       case o:
-        return R.name == w.name && R.message == w.message;
+        return w.name == R.name && w.message == R.message;
       case l:
       case p:
-        return R == w + "";
+        return w == R + "";
       case c:
-        var N = r;
-      case b:
-        var P = C & s;
-        if (N || (N = t), R.size != w.size && !P)
+        var k = r;
+      case y:
+        var P = E & s;
+        if (k || (k = t), w.size != R.size && !P)
           return !1;
-        var M = A.get(R);
+        var M = x.get(w);
         if (M)
-          return M == w;
-        C |= i, A.set(R, w);
-        var B = n(N(R), N(w), C, T, x, A);
-        return A.delete(R), B;
+          return M == R;
+        E |= i, x.set(w, R);
+        var D = n(k(w), k(R), E, T, N, x);
+        return x.delete(w), D;
       case v:
-        if (y)
-          return y.call(R) == y.call(w);
+        if (b)
+          return b.call(w) == b.call(R);
     }
     return !1;
   }
-  return Be = E, Be;
+  return Be = q, Be;
 }
 var Ue, Bi;
 function Tf() {
@@ -233,7 +235,7 @@ function Tf() {
   Bi = 1;
   var e = Jo(), a = 1, u = Object.prototype, n = u.hasOwnProperty;
   function r(t, s, i, f, d, o) {
-    var c = i & a, h = e(t), l = h.length, b = e(s), p = b.length;
+    var c = i & a, h = e(t), l = h.length, y = e(s), p = y.length;
     if (l != p && !c)
       return !1;
     for (var v = l; v--; ) {
@@ -244,68 +246,68 @@ function Tf() {
     var m = o.get(t), _ = o.get(s);
     if (m && _)
       return m == s && _ == t;
-    var y = !0;
+    var b = !0;
     o.set(t, s), o.set(s, t);
-    for (var E = c; ++v < l; ) {
+    for (var q = c; ++v < l; ) {
       g = h[v];
-      var R = t[g], w = s[g];
+      var w = t[g], R = s[g];
       if (f)
-        var q = c ? f(w, R, g, s, t, o) : f(R, w, g, t, s, o);
-      if (!(q === void 0 ? R === w || d(R, w, i, f, o) : q)) {
-        y = !1;
+        var C = c ? f(R, w, g, s, t, o) : f(w, R, g, t, s, o);
+      if (!(C === void 0 ? w === R || d(w, R, i, f, o) : C)) {
+        b = !1;
         break;
       }
-      E || (E = g == "constructor");
+      q || (q = g == "constructor");
     }
-    if (y && !E) {
-      var C = t.constructor, T = s.constructor;
-      C != T && "constructor" in t && "constructor" in s && !(typeof C == "function" && C instanceof C && typeof T == "function" && T instanceof T) && (y = !1);
+    if (b && !q) {
+      var E = t.constructor, T = s.constructor;
+      E != T && "constructor" in t && "constructor" in s && !(typeof E == "function" && E instanceof E && typeof T == "function" && T instanceof T) && (b = !1);
     }
-    return o.delete(t), o.delete(s), y;
+    return o.delete(t), o.delete(s), b;
   }
   return Ue = r, Ue;
 }
-var We, Ui;
+var He, Ui;
 function Sf() {
-  if (Ui) return We;
+  if (Ui) return He;
   Ui = 1;
   var e = ni(), a = ao(), u = If(), n = Tf(), r = ti(), t = U(), s = ge(), i = _e(), f = 1, d = "[object Arguments]", o = "[object Array]", c = "[object Object]", h = Object.prototype, l = h.hasOwnProperty;
-  function b(p, v, g, m, _, y) {
-    var E = t(p), R = t(v), w = E ? o : r(p), q = R ? o : r(v);
-    w = w == d ? c : w, q = q == d ? c : q;
-    var C = w == c, T = q == c, x = w == q;
-    if (x && s(p)) {
+  function y(p, v, g, m, _, b) {
+    var q = t(p), w = t(v), R = q ? o : r(p), C = w ? o : r(v);
+    R = R == d ? c : R, C = C == d ? c : C;
+    var E = R == c, T = C == c, N = R == C;
+    if (N && s(p)) {
       if (!s(v))
         return !1;
-      E = !0, C = !1;
+      q = !0, E = !1;
     }
-    if (x && !C)
-      return y || (y = new e()), E || i(p) ? a(p, v, g, m, _, y) : u(p, v, w, g, m, _, y);
+    if (N && !E)
+      return b || (b = new e()), q || i(p) ? a(p, v, g, m, _, b) : u(p, v, R, g, m, _, b);
     if (!(g & f)) {
-      var A = C && l.call(p, "__wrapped__"), N = T && l.call(v, "__wrapped__");
-      if (A || N) {
-        var P = A ? p.value() : p, M = N ? v.value() : v;
-        return y || (y = new e()), _(P, M, g, m, y);
+      var x = E && l.call(p, "__wrapped__"), k = T && l.call(v, "__wrapped__");
+      if (x || k) {
+        var P = x ? p.value() : p, M = k ? v.value() : v;
+        return b || (b = new e()), _(P, M, g, m, b);
       }
     }
-    return x ? (y || (y = new e()), n(p, v, g, m, _, y)) : !1;
+    return N ? (b || (b = new e()), n(p, v, g, m, _, b)) : !1;
   }
-  return We = b, We;
+  return He = y, He;
 }
-var He, Wi;
+var We, Hi;
 function di() {
-  if (Wi) return He;
-  Wi = 1;
+  if (Hi) return We;
+  Hi = 1;
   var e = Sf(), a = se();
   function u(n, r, t, s, i) {
     return n === r ? !0 : n == null || r == null || !a(n) && !a(r) ? n !== n && r !== r : e(n, r, t, s, u, i);
   }
-  return He = u, He;
+  return We = u, We;
 }
-var Ve, Hi;
+var Ve, Wi;
 function Cf() {
-  if (Hi) return Ve;
-  Hi = 1;
+  if (Wi) return Ve;
+  Wi = 1;
   var e = ni(), a = di(), u = 1, n = 2;
   function r(t, s, i, f) {
     var d = i.length, o = d, c = !f;
@@ -318,15 +320,15 @@ function Cf() {
     }
     for (; ++d < o; ) {
       h = i[d];
-      var l = h[0], b = t[l], p = h[1];
+      var l = h[0], y = t[l], p = h[1];
       if (c && h[2]) {
-        if (b === void 0 && !(l in t))
+        if (y === void 0 && !(l in t))
           return !1;
       } else {
         var v = new e();
         if (f)
-          var g = f(b, p, l, t, s, v);
-        if (!(g === void 0 ? a(p, b, u | n, f, v) : g))
+          var g = f(y, p, l, t, s, v);
+        if (!(g === void 0 ? a(p, y, u | n, f, v) : g))
           return !1;
       }
     }
@@ -370,7 +372,7 @@ function so() {
   return Ke = e, Ke;
 }
 var Ye, Ki;
-function xf() {
+function Nf() {
   if (Ki) return Ye;
   Ki = 1;
   var e = Cf(), a = Of(), u = so();
@@ -406,7 +408,7 @@ function ci() {
   return Xe = r, Xe;
 }
 var Ze, Xi;
-function Nf() {
+function xf() {
   if (Xi) return Ze;
   Xi = 1;
   var e = Xs(), a = "Expected a function";
@@ -425,10 +427,10 @@ function Nf() {
   return u.Cache = e, Ze = u, Ze;
 }
 var Qe, Zi;
-function kf() {
+function Af() {
   if (Zi) return Qe;
   Zi = 1;
-  var e = Nf(), a = 500;
+  var e = xf(), a = 500;
   function u(n) {
     var r = e(n, function(s) {
       return t.size === a && t.clear(), s;
@@ -438,10 +440,10 @@ function kf() {
   return Qe = u, Qe;
 }
 var Je, Qi;
-function Af() {
+function kf() {
   if (Qi) return Je;
   Qi = 1;
-  var e = kf(), a = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, u = /\\(\\)?/g, n = e(function(r) {
+  var e = Af(), a = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, u = /\\(\\)?/g, n = e(function(r) {
     var t = [];
     return r.charCodeAt(0) === 46 && t.push(""), r.replace(a, function(s, i, f, d) {
       t.push(f ? d.replace(u, "$1") : i || s);
@@ -491,7 +493,7 @@ var tr, na;
 function Ee() {
   if (na) return tr;
   na = 1;
-  var e = U(), a = ci(), u = Af(), n = oo();
+  var e = U(), a = ci(), u = kf(), n = oo();
   function r(t, s) {
     return e(t) ? t : a(t, s) ? [t] : u(n(t));
   }
@@ -629,7 +631,7 @@ var pr, va;
 function $() {
   if (va) return pr;
   va = 1;
-  var e = xf(), a = Gf(), u = ee(), n = U(), r = Df();
+  var e = Nf(), a = Gf(), u = ee(), n = U(), r = Df();
   function t(s) {
     return typeof s == "function" ? s : s == null ? u : typeof s == "object" ? n(s) ? a(s[0], s[1]) : e(s) : r(s);
   }
@@ -669,10 +671,10 @@ const Uf = {
     s: () => "s",
     ms: () => "ms"
   }
-}, Wf = "dateFormat", Hf = "timezone", Vf = (e) => e.charAt(0).toUpperCase() + e.slice(1), jf = (e, a) => {
+}, Hf = "dateFormat", Wf = "timezone", Vf = (e) => e.charAt(0).toUpperCase() + e.slice(1), jf = (e, a) => {
   const u = Ti()?.appContext.config.globalProperties.$moment().locale(), n = Ti()?.appContext.config.globalProperties.$moment(e).locale(u);
   let r;
-  return a === "iso" ? r = "YYYY-MM-DD HH:mm:ss.SSS" : r = a ?? localStorage.getItem(Wf) ?? "llll", n.tz(localStorage.getItem(Hf) ?? bf.tz.guess()).format(r);
+  return a === "iso" ? r = "YYYY-MM-DD HH:mm:ss.SSS" : r = a ?? localStorage.getItem(Hf) ?? "llll", n.tz(localStorage.getItem(Wf) ?? bf.tz.guess()).format(r);
 };
 function zf(e, a) {
   return e.split(a).slice(1).join(a);
@@ -833,8 +835,8 @@ function rd() {
       return !0;
     if (r(l) && (n(l) || typeof l == "string" || typeof l.splice == "function" || t(l) || i(l) || u(l)))
       return !l.length;
-    var b = a(l);
-    if (b == f || b == d)
+    var y = a(l);
+    if (y == f || y == d)
       return !l.size;
     if (s(l))
       return !e(l).length;
@@ -845,18 +847,18 @@ function rd() {
   }
   return Or = h, Or;
 }
-var xr, Ca;
+var Nr, Ca;
 function bo() {
-  if (Ca) return xr;
+  if (Ca) return Nr;
   Ca = 1;
   function e(a) {
     return a === void 0;
   }
-  return xr = e, xr;
+  return Nr = e, Nr;
 }
-var Nr, Oa;
+var xr, Oa;
 function yo() {
-  if (Oa) return Nr;
+  if (Oa) return xr;
   Oa = 1;
   var e = we(), a = J();
   function u(n, r) {
@@ -865,35 +867,35 @@ function yo() {
       s[++t] = r(i, f, d);
     }), s;
   }
-  return Nr = u, Nr;
+  return xr = u, xr;
 }
-var kr, xa;
+var Ar, Na;
 function Eo() {
-  if (xa) return kr;
-  xa = 1;
+  if (Na) return Ar;
+  Na = 1;
   var e = ye(), a = $(), u = yo(), n = U();
   function r(t, s) {
     var i = n(t) ? e : u;
     return i(t, a(s, 3));
   }
-  return kr = r, kr;
+  return Ar = r, Ar;
 }
-var Ar, Na;
+var kr, xa;
 function nd() {
-  if (Na) return Ar;
-  Na = 1;
+  if (xa) return kr;
+  xa = 1;
   function e(a, u, n, r) {
     var t = -1, s = a == null ? 0 : a.length;
     for (r && s && (n = a[++t]); ++t < s; )
       n = u(n, a[t], t, a);
     return n;
   }
-  return Ar = e, Ar;
+  return kr = e, kr;
 }
-var Pr, ka;
+var Pr, Aa;
 function td() {
-  if (ka) return Pr;
-  ka = 1;
+  if (Aa) return Pr;
+  Aa = 1;
   function e(a, u, n, r, t) {
     return t(a, function(s, i, f) {
       n = r ? (r = !1, s) : u(n, s, i, f);
@@ -901,10 +903,10 @@ function td() {
   }
   return Pr = e, Pr;
 }
-var Lr, Aa;
+var Lr, ka;
 function qo() {
-  if (Aa) return Lr;
-  Aa = 1;
+  if (ka) return Lr;
+  ka = 1;
   var e = nd(), a = we(), u = $(), n = td(), r = U();
   function t(s, i, f) {
     var d = r(s) ? e : n, o = arguments.length < 3;
@@ -943,13 +945,13 @@ var Dr, Ga;
 function sd() {
   if (Ga) return Dr;
   Ga = 1;
-  var e = "\\ud800-\\udfff", a = "\\u0300-\\u036f", u = "\\ufe20-\\ufe2f", n = "\\u20d0-\\u20ff", r = a + u + n, t = "\\ufe0e\\ufe0f", s = "[" + e + "]", i = "[" + r + "]", f = "\\ud83c[\\udffb-\\udfff]", d = "(?:" + i + "|" + f + ")", o = "[^" + e + "]", c = "(?:\\ud83c[\\udde6-\\uddff]){2}", h = "[\\ud800-\\udbff][\\udc00-\\udfff]", l = "\\u200d", b = d + "?", p = "[" + t + "]?", v = "(?:" + l + "(?:" + [o, c, h].join("|") + ")" + p + b + ")*", g = p + b + v, m = "(?:" + [o + i + "?", i, c, h, s].join("|") + ")", _ = RegExp(f + "(?=" + f + ")|" + m + g, "g");
-  function y(E) {
-    for (var R = _.lastIndex = 0; _.test(E); )
-      ++R;
-    return R;
+  var e = "\\ud800-\\udfff", a = "\\u0300-\\u036f", u = "\\ufe20-\\ufe2f", n = "\\u20d0-\\u20ff", r = a + u + n, t = "\\ufe0e\\ufe0f", s = "[" + e + "]", i = "[" + r + "]", f = "\\ud83c[\\udffb-\\udfff]", d = "(?:" + i + "|" + f + ")", o = "[^" + e + "]", c = "(?:\\ud83c[\\udde6-\\uddff]){2}", h = "[\\ud800-\\udbff][\\udc00-\\udfff]", l = "\\u200d", y = d + "?", p = "[" + t + "]?", v = "(?:" + l + "(?:" + [o, c, h].join("|") + ")" + p + y + ")*", g = p + y + v, m = "(?:" + [o + i + "?", i, c, h, s].join("|") + ")", _ = RegExp(f + "(?=" + f + ")|" + m + g, "g");
+  function b(q) {
+    for (var w = _.lastIndex = 0; _.test(q); )
+      ++w;
+    return w;
   }
-  return Dr = y, Dr;
+  return Dr = b, Dr;
 }
 var Br, Fa;
 function od() {
@@ -976,37 +978,37 @@ function fd() {
   }
   return Ur = i, Ur;
 }
-var Wr, Ba;
+var Hr, Ba;
 function dd() {
-  if (Ba) return Wr;
+  if (Ba) return Hr;
   Ba = 1;
   var e = Qs(), a = af(), u = oi(), n = $(), r = eo(), t = U(), s = ge(), i = ui(), f = Q(), d = _e();
   function o(c, h, l) {
-    var b = t(c), p = b || s(c) || d(c);
+    var y = t(c), p = y || s(c) || d(c);
     if (h = n(h, 4), l == null) {
       var v = c && c.constructor;
-      p ? l = b ? new v() : [] : f(c) ? l = i(v) ? a(r(c)) : {} : l = {};
+      p ? l = y ? new v() : [] : f(c) ? l = i(v) ? a(r(c)) : {} : l = {};
     }
     return (p ? e : u)(c, function(g, m, _) {
       return h(l, g, m, _);
     }), l;
   }
-  return Wr = o, Wr;
+  return Hr = o, Hr;
 }
-var Hr, Ua;
+var Wr, Ua;
 function cd() {
-  if (Ua) return Hr;
+  if (Ua) return Wr;
   Ua = 1;
   var e = ri(), a = me(), u = U(), n = e ? e.isConcatSpreadable : void 0;
   function r(t) {
     return u(t) || a(t) || !!(n && t && t[n]);
   }
-  return Hr = r, Hr;
+  return Wr = r, Wr;
 }
-var Vr, Wa;
+var Vr, Ha;
 function vi() {
-  if (Wa) return Vr;
-  Wa = 1;
+  if (Ha) return Vr;
+  Ha = 1;
   var e = uf(), a = cd();
   function u(n, r, t, s, i) {
     var f = -1, d = n.length;
@@ -1018,10 +1020,10 @@ function vi() {
   }
   return Vr = u, Vr;
 }
-var jr, Ha;
+var jr, Wa;
 function hd() {
-  if (Ha) return jr;
-  Ha = 1;
+  if (Wa) return jr;
+  Wa = 1;
   function e(a, u, n) {
     switch (n.length) {
       case 0:
@@ -1193,22 +1195,22 @@ function qd() {
   tu = 1;
   var e = to(), a = md(), u = bd(), n = io(), r = Ed(), t = fi(), s = 200;
   function i(f, d, o) {
-    var c = -1, h = a, l = f.length, b = !0, p = [], v = p;
+    var c = -1, h = a, l = f.length, y = !0, p = [], v = p;
     if (o)
-      b = !1, h = u;
+      y = !1, h = u;
     else if (l >= s) {
       var g = d ? null : r(f);
       if (g)
         return t(g);
-      b = !1, h = n, v = new e();
+      y = !1, h = n, v = new e();
     } else
       v = d ? [] : p;
     e:
       for (; ++c < l; ) {
         var m = f[c], _ = d ? d(m) : m;
-        if (m = o || m !== 0 ? m : 0, b && _ === _) {
-          for (var y = v.length; y--; )
-            if (v[y] === _)
+        if (m = o || m !== 0 ? m : 0, y && _ === _) {
+          for (var b = v.length; b--; )
+            if (v[b] === _)
               continue e;
           d && v.push(_), p.push(m);
         } else h(v, _, o) || (v !== p && v.push(_), p.push(m));
@@ -1325,8 +1327,8 @@ function pi() {
     });
   }, r.prototype.setNodes = function(o, c) {
     var h = arguments, l = this;
-    return e.each(o, function(b) {
-      h.length > 1 ? l.setNode(b, c) : l.setNode(b);
+    return e.each(o, function(y) {
+      h.length > 1 ? l.setNode(y, c) : l.setNode(y);
     }), this;
   }, r.prototype.setNode = function(o, c) {
     return e.has(this._nodes, o) ? (arguments.length > 1 && (this._nodes[o] = c), this) : (this._nodes[o] = arguments.length > 1 ? c : this._defaultNodeLabelFn(o), this._isCompound && (this._parent[o] = u, this._children[o] = {}, this._children[u][o] = !0), this._in[o] = {}, this._preds[o] = {}, this._out[o] = {}, this._sucs[o] = {}, ++this._nodeCount, this);
@@ -1406,12 +1408,12 @@ function pi() {
       c.hasNode(p.v) && c.hasNode(p.w) && c.setEdge(p, h.edge(p));
     });
     var l = {};
-    function b(p) {
+    function y(p) {
       var v = h.parent(p);
-      return v === void 0 || c.hasNode(v) ? (l[p] = v, v) : v in l ? l[v] : b(v);
+      return v === void 0 || c.hasNode(v) ? (l[p] = v, v) : v in l ? l[v] : y(v);
     }
     return this._isCompound && e.each(c.nodes(), function(p) {
-      c.setParent(p, b(p));
+      c.setParent(p, y(p));
     }), c;
   }, r.prototype.setDefaultEdgeLabel = function(o) {
     return e.isFunction(o) || (o = e.constant(o)), this._defaultEdgeLabelFn = o, this;
@@ -1421,18 +1423,18 @@ function pi() {
     return e.values(this._edgeObjs);
   }, r.prototype.setPath = function(o, c) {
     var h = this, l = arguments;
-    return e.reduce(o, function(b, p) {
-      return l.length > 1 ? h.setEdge(b, p, c) : h.setEdge(b, p), p;
+    return e.reduce(o, function(y, p) {
+      return l.length > 1 ? h.setEdge(y, p, c) : h.setEdge(y, p), p;
     }), this;
   }, r.prototype.setEdge = function() {
-    var o, c, h, l, b = !1, p = arguments[0];
-    typeof p == "object" && p !== null && "v" in p ? (o = p.v, c = p.w, h = p.name, arguments.length === 2 && (l = arguments[1], b = !0)) : (o = p, c = arguments[1], h = arguments[3], arguments.length > 2 && (l = arguments[2], b = !0)), o = "" + o, c = "" + c, e.isUndefined(h) || (h = "" + h);
+    var o, c, h, l, y = !1, p = arguments[0];
+    typeof p == "object" && p !== null && "v" in p ? (o = p.v, c = p.w, h = p.name, arguments.length === 2 && (l = arguments[1], y = !0)) : (o = p, c = arguments[1], h = arguments[3], arguments.length > 2 && (l = arguments[2], y = !0)), o = "" + o, c = "" + c, e.isUndefined(h) || (h = "" + h);
     var v = i(this._isDirected, o, c, h);
     if (e.has(this._edgeLabels, v))
-      return b && (this._edgeLabels[v] = l), this;
+      return y && (this._edgeLabels[v] = l), this;
     if (!e.isUndefined(h) && !this._isMultigraph)
       throw new Error("Cannot set a named edge when isMultigraph = false");
-    this.setNode(o), this.setNode(c), this._edgeLabels[v] = b ? l : this._defaultEdgeLabelFn(o, c, h);
+    this.setNode(o), this.setNode(c), this._edgeLabels[v] = y ? l : this._defaultEdgeLabelFn(o, c, h);
     var g = f(this._isDirected, o, c, h);
     return o = g.v, c = g.w, Object.freeze(g), this._edgeObjs[v] = g, t(this._preds[c], o), t(this._sucs[o], c), this._in[c][v] = g, this._out[o][v] = g, this._edgeCount++, this;
   }, r.prototype.edge = function(o, c, h) {
@@ -1442,22 +1444,22 @@ function pi() {
     var l = arguments.length === 1 ? d(this._isDirected, arguments[0]) : i(this._isDirected, o, c, h);
     return e.has(this._edgeLabels, l);
   }, r.prototype.removeEdge = function(o, c, h) {
-    var l = arguments.length === 1 ? d(this._isDirected, arguments[0]) : i(this._isDirected, o, c, h), b = this._edgeObjs[l];
-    return b && (o = b.v, c = b.w, delete this._edgeLabels[l], delete this._edgeObjs[l], s(this._preds[c], o), s(this._sucs[o], c), delete this._in[c][l], delete this._out[o][l], this._edgeCount--), this;
+    var l = arguments.length === 1 ? d(this._isDirected, arguments[0]) : i(this._isDirected, o, c, h), y = this._edgeObjs[l];
+    return y && (o = y.v, c = y.w, delete this._edgeLabels[l], delete this._edgeObjs[l], s(this._preds[c], o), s(this._sucs[o], c), delete this._in[c][l], delete this._out[o][l], this._edgeCount--), this;
   }, r.prototype.inEdges = function(o, c) {
     var h = this._in[o];
     if (h) {
       var l = e.values(h);
-      return c ? e.filter(l, function(b) {
-        return b.v === c;
+      return c ? e.filter(l, function(y) {
+        return y.v === c;
       }) : l;
     }
   }, r.prototype.outEdges = function(o, c) {
     var h = this._out[o];
     if (h) {
       var l = e.values(h);
-      return c ? e.filter(l, function(b) {
-        return b.w === c;
+      return c ? e.filter(l, function(y) {
+        return y.w === c;
       }) : l;
     }
   }, r.prototype.nodeEdges = function(o, c) {
@@ -1472,20 +1474,20 @@ function pi() {
     --o[c] || delete o[c];
   }
   function i(o, c, h, l) {
-    var b = "" + c, p = "" + h;
-    if (!o && b > p) {
-      var v = b;
-      b = p, p = v;
+    var y = "" + c, p = "" + h;
+    if (!o && y > p) {
+      var v = y;
+      y = p, p = v;
     }
-    return b + n + p + n + (e.isUndefined(l) ? a : l);
+    return y + n + p + n + (e.isUndefined(l) ? a : l);
   }
   function f(o, c, h, l) {
-    var b = "" + c, p = "" + h;
-    if (!o && b > p) {
-      var v = b;
-      b = p, p = v;
+    var y = "" + c, p = "" + h;
+    if (!o && y > p) {
+      var v = y;
+      y = p, p = v;
     }
-    var g = { v: b, w: p };
+    var g = { v: y, w: p };
     return l && (g.name = l), g;
   }
   function d(o, c) {
@@ -1634,15 +1636,15 @@ function Oo() {
     );
   }
   function r(t, s, i, f) {
-    var d = {}, o = new a(), c, h, l = function(b) {
-      var p = b.v !== c ? b.v : b.w, v = d[p], g = i(b), m = h.distance + g;
+    var d = {}, o = new a(), c, h, l = function(y) {
+      var p = y.v !== c ? y.v : y.w, v = d[p], g = i(y), m = h.distance + g;
       if (g < 0)
-        throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + b + " Weight: " + g);
+        throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + y + " Weight: " + g);
       m < v.distance && (v.distance = m, v.predecessor = c, o.decrease(p, m));
     };
-    for (t.nodes().forEach(function(b) {
-      var p = b === s ? 0 : Number.POSITIVE_INFINITY;
-      d[b] = { distance: p }, o.add(b, p);
+    for (t.nodes().forEach(function(y) {
+      var p = y === s ? 0 : Number.POSITIVE_INFINITY;
+      d[y] = { distance: p }, o.add(y, p);
     }); o.size() > 0 && (c = o.removeMin(), h = d[c], h.distance !== Number.POSITIVE_INFINITY); )
       f(c).forEach(l);
     return d;
@@ -1663,7 +1665,7 @@ function Od() {
   return bn;
 }
 var yn, _u;
-function xo() {
+function No() {
   if (_u) return yn;
   _u = 1;
   var e = K();
@@ -1693,10 +1695,10 @@ function xo() {
   return yn;
 }
 var En, mu;
-function xd() {
+function Nd() {
   if (mu) return En;
   mu = 1;
-  var e = K(), a = xo();
+  var e = K(), a = No();
   En = u;
   function u(n) {
     return e.filter(a(n), function(r) {
@@ -1706,7 +1708,7 @@ function xd() {
   return En;
 }
 var qn, bu;
-function Nd() {
+function xd() {
   if (bu) return qn;
   bu = 1;
   var e = K();
@@ -1735,7 +1737,7 @@ function Nd() {
       f.forEach(function(c) {
         var h = i[c];
         f.forEach(function(l) {
-          var b = h[d], p = o[l], v = h[l], g = b.distance + p.distance;
+          var y = h[d], p = o[l], v = h[l], g = y.distance + p.distance;
           g < v.distance && (v.distance = g, v.predecessor = p.predecessor);
         });
       });
@@ -1744,7 +1746,7 @@ function Nd() {
   return qn;
 }
 var wn, yu;
-function No() {
+function xo() {
   if (yu) return wn;
   yu = 1;
   var e = K();
@@ -1765,10 +1767,10 @@ function No() {
   return u.prototype = new Error(), wn;
 }
 var Rn, Eu;
-function kd() {
+function Ad() {
   if (Eu) return Rn;
   Eu = 1;
-  var e = No();
+  var e = xo();
   Rn = a;
   function a(u) {
     try {
@@ -1783,7 +1785,7 @@ function kd() {
   return Rn;
 }
 var In, qu;
-function ko() {
+function Ao() {
   if (qu) return In;
   qu = 1;
   var e = K();
@@ -1805,10 +1807,10 @@ function ko() {
   return In;
 }
 var Tn, wu;
-function Ad() {
+function kd() {
   if (wu) return Tn;
   wu = 1;
-  var e = ko();
+  var e = Ao();
   Tn = a;
   function a(u, n) {
     return e(u, n, "post");
@@ -1819,7 +1821,7 @@ var Sn, Ru;
 function Pd() {
   if (Ru) return Sn;
   Ru = 1;
-  var e = ko();
+  var e = Ao();
   Sn = a;
   function a(u, n) {
     return e(u, n, "pre");
@@ -1835,10 +1837,10 @@ function Ld() {
   function n(r, t) {
     var s = new a(), i = {}, f = new u(), d;
     function o(h) {
-      var l = h.v === d ? h.w : h.v, b = f.priority(l);
-      if (b !== void 0) {
+      var l = h.v === d ? h.w : h.v, y = f.priority(l);
+      if (y !== void 0) {
         var p = t(h);
-        p < b && (i[l] = d, f.decrease(l, p));
+        p < y && (i[l] = d, f.decrease(l, p));
       }
     }
     if (r.nodeCount() === 0)
@@ -1866,31 +1868,31 @@ function Md() {
     components: Cd(),
     dijkstra: Oo(),
     dijkstraAll: Od(),
-    findCycles: xd(),
-    floydWarshall: Nd(),
-    isAcyclic: kd(),
-    postorder: Ad(),
+    findCycles: Nd(),
+    floydWarshall: xd(),
+    isAcyclic: Ad(),
+    postorder: kd(),
     preorder: Pd(),
     prim: Ld(),
-    tarjan: xo(),
-    topsort: No()
+    tarjan: No(),
+    topsort: xo()
   }), On;
 }
-var xn, Su;
+var Nn, Su;
 function Gd() {
-  if (Su) return xn;
+  if (Su) return Nn;
   Su = 1;
   var e = Td();
-  return xn = {
+  return Nn = {
     Graph: e.Graph,
     json: Sd(),
     alg: Md(),
     version: e.version
-  }, xn;
+  }, Nn;
 }
-var Nn, Cu;
+var xn, Cu;
 function Y() {
-  if (Cu) return Nn;
+  if (Cu) return xn;
   Cu = 1;
   var e;
   if (typeof hi == "function")
@@ -1898,11 +1900,11 @@ function Y() {
       e = Gd();
     } catch {
     }
-  return e || (e = window.graphlib), Nn = e, Nn;
+  return e || (e = window.graphlib), xn = e, xn;
 }
-var kn, Ou;
+var An, Ou;
 function Ie() {
-  if (Ou) return kn;
+  if (Ou) return An;
   Ou = 1;
   var e = pe(), a = J(), u = ai(), n = Q();
   function r(t, s, i) {
@@ -1911,28 +1913,28 @@ function Ie() {
     var f = typeof s;
     return (f == "number" ? a(i) && u(s, i.length) : f == "string" && s in i) ? e(i[s], t) : !1;
   }
-  return kn = r, kn;
+  return An = r, An;
 }
-var An, xu;
+var kn, Nu;
 function Fd() {
-  if (xu) return An;
-  xu = 1;
+  if (Nu) return kn;
+  Nu = 1;
   var e = Re(), a = pe(), u = Ie(), n = be(), r = Object.prototype, t = r.hasOwnProperty, s = e(function(i, f) {
     i = Object(i);
     var d = -1, o = f.length, c = o > 2 ? f[2] : void 0;
     for (c && u(f[0], f[1], c) && (o = 1); ++d < o; )
-      for (var h = f[d], l = n(h), b = -1, p = l.length; ++b < p; ) {
-        var v = l[b], g = i[v];
+      for (var h = f[d], l = n(h), y = -1, p = l.length; ++y < p; ) {
+        var v = l[y], g = i[v];
         (g === void 0 || a(g, r[v]) && !t.call(i, v)) && (i[v] = h[v]);
       }
     return i;
   });
-  return An = s, An;
+  return kn = s, kn;
 }
-var Pn, Nu;
+var Pn, xu;
 function Dd() {
-  if (Nu) return Pn;
-  Nu = 1;
+  if (xu) return Pn;
+  xu = 1;
   var e = $(), a = J(), u = ue();
   function n(r) {
     return function(t, s, i) {
@@ -1949,10 +1951,10 @@ function Dd() {
   }
   return Pn = n, Pn;
 }
-var Ln, ku;
+var Ln, Au;
 function Bd() {
-  if (ku) return Ln;
-  ku = 1;
+  if (Au) return Ln;
+  Au = 1;
   var e = /\s/;
   function a(u) {
     for (var n = u.length; n-- && e.test(u.charAt(n)); )
@@ -1961,10 +1963,10 @@ function Bd() {
   }
   return Ln = a, Ln;
 }
-var Mn, Au;
+var Mn, ku;
 function Ud() {
-  if (Au) return Mn;
-  Au = 1;
+  if (ku) return Mn;
+  ku = 1;
   var e = Bd(), a = /^\s+/;
   function u(n) {
     return n && n.slice(0, e(n) + 1).replace(a, "");
@@ -1972,7 +1974,7 @@ function Ud() {
   return Mn = u, Mn;
 }
 var Gn, Pu;
-function Wd() {
+function Hd() {
   if (Pu) return Gn;
   Pu = 1;
   var e = Ud(), a = Q(), u = re(), n = NaN, r = /^[-+]0x[0-9a-f]+$/i, t = /^0b[01]+$/i, s = /^0o[0-7]+$/i, i = parseInt;
@@ -1994,10 +1996,10 @@ function Wd() {
   return Gn = f, Gn;
 }
 var Fn, Lu;
-function Ao() {
+function ko() {
   if (Lu) return Fn;
   Lu = 1;
-  var e = Wd(), a = 1 / 0, u = 17976931348623157e292;
+  var e = Hd(), a = 1 / 0, u = 17976931348623157e292;
   function n(r) {
     if (!r)
       return r === 0 ? r : 0;
@@ -2010,10 +2012,10 @@ function Ao() {
   return Fn = n, Fn;
 }
 var Dn, Mu;
-function Hd() {
+function Wd() {
   if (Mu) return Dn;
   Mu = 1;
-  var e = Ao();
+  var e = ko();
   function a(u) {
     var n = e(u), r = n % 1;
     return n === n ? r ? n - r : n : 0;
@@ -2024,7 +2026,7 @@ var Bn, Gu;
 function Vd() {
   if (Gu) return Bn;
   Gu = 1;
-  var e = Io(), a = $(), u = Hd(), n = Math.max;
+  var e = Io(), a = $(), u = Wd(), n = Math.max;
   function r(t, s, i) {
     var f = t == null ? 0 : t.length;
     if (!f)
@@ -2041,26 +2043,26 @@ function jd() {
   var e = Dd(), a = Vd(), u = e(a);
   return Un = u, Un;
 }
-var Wn, Du;
+var Hn, Du;
 function Po() {
-  if (Du) return Wn;
+  if (Du) return Hn;
   Du = 1;
   var e = vi();
   function a(u) {
     var n = u == null ? 0 : u.length;
     return n ? e(u, 1) : [];
   }
-  return Wn = a, Wn;
+  return Hn = a, Hn;
 }
-var Hn, Bu;
+var Wn, Bu;
 function zd() {
-  if (Bu) return Hn;
+  if (Bu) return Wn;
   Bu = 1;
   var e = si(), a = vo(), u = be();
   function n(r, t) {
     return r == null ? r : e(r, a(t), u);
   }
-  return Hn = n, Hn;
+  return Wn = n, Wn;
 }
 var Vn, Uu;
 function Kd() {
@@ -2072,10 +2074,10 @@ function Kd() {
   }
   return Vn = e, Vn;
 }
-var jn, Wu;
+var jn, Hu;
 function gi() {
-  if (Wu) return jn;
-  Wu = 1;
+  if (Hu) return jn;
+  Hu = 1;
   var e = re();
   function a(u, n, r) {
     for (var t = -1, s = u.length; ++t < s; ) {
@@ -2087,10 +2089,10 @@ function gi() {
   }
   return jn = a, jn;
 }
-var zn, Hu;
+var zn, Wu;
 function Yd() {
-  if (Hu) return zn;
-  Hu = 1;
+  if (Wu) return zn;
+  Wu = 1;
   function e(a, u) {
     return a > u;
   }
@@ -2156,19 +2158,19 @@ var Qn, $u;
 function Qd() {
   if ($u) return Qn;
   $u = 1;
-  var e = Lo(), a = df(), u = cf(), n = hf(), r = lf(), t = me(), s = U(), i = To(), f = ge(), d = ui(), o = Q(), c = Xd(), h = _e(), l = Mo(), b = Zd();
-  function p(v, g, m, _, y, E, R) {
-    var w = l(v, m), q = l(g, m), C = R.get(q);
-    if (C) {
-      e(v, m, C);
+  var e = Lo(), a = df(), u = cf(), n = hf(), r = lf(), t = me(), s = U(), i = To(), f = ge(), d = ui(), o = Q(), c = Xd(), h = _e(), l = Mo(), y = Zd();
+  function p(v, g, m, _, b, q, w) {
+    var R = l(v, m), C = l(g, m), E = w.get(C);
+    if (E) {
+      e(v, m, E);
       return;
     }
-    var T = E ? E(w, q, m + "", v, g, R) : void 0, x = T === void 0;
-    if (x) {
-      var A = s(q), N = !A && f(q), P = !A && !N && h(q);
-      T = q, A || N || P ? s(w) ? T = w : i(w) ? T = n(w) : N ? (x = !1, T = a(q, !0)) : P ? (x = !1, T = u(q, !0)) : T = [] : c(q) || t(q) ? (T = w, t(w) ? T = b(w) : (!o(w) || d(w)) && (T = r(q))) : x = !1;
+    var T = q ? q(R, C, m + "", v, g, w) : void 0, N = T === void 0;
+    if (N) {
+      var x = s(C), k = !x && f(C), P = !x && !k && h(C);
+      T = C, x || k || P ? s(R) ? T = R : i(R) ? T = n(R) : k ? (N = !1, T = a(C, !0)) : P ? (N = !1, T = u(C, !0)) : T = [] : c(C) || t(C) ? (T = R, t(R) ? T = y(R) : (!o(R) || d(R)) && (T = r(C))) : N = !1;
     }
-    x && (R.set(q, T), y(T, q, _, E, R), R.delete(q)), e(v, m, T);
+    N && (w.set(C, T), b(T, C, _, q, w), w.delete(C)), e(v, m, T);
   }
   return Qn = p, Qn;
 }
@@ -2178,12 +2180,12 @@ function Jd() {
   Xu = 1;
   var e = ni(), a = Lo(), u = si(), n = Qd(), r = Q(), t = be(), s = Mo();
   function i(f, d, o, c, h) {
-    f !== d && u(d, function(l, b) {
+    f !== d && u(d, function(l, y) {
       if (h || (h = new e()), r(l))
-        n(f, d, b, o, i, c, h);
+        n(f, d, y, o, i, c, h);
       else {
-        var p = c ? c(s(f, b), l, b + "", f, d, h) : void 0;
-        p === void 0 && (p = l), a(f, b, p);
+        var p = c ? c(s(f, y), l, y + "", f, d, h) : void 0;
+        p === void 0 && (p = l), a(f, y, p);
       }
     }, t);
   }
@@ -2263,14 +2265,14 @@ function ac() {
       return s;
     i = a(i, s);
     for (var o = -1, c = i.length, h = c - 1, l = s; l != null && ++o < c; ) {
-      var b = r(i[o]), p = f;
-      if (b === "__proto__" || b === "constructor" || b === "prototype")
+      var y = r(i[o]), p = f;
+      if (y === "__proto__" || y === "constructor" || y === "prototype")
         return s;
       if (o != h) {
-        var v = l[b];
-        p = d ? d(v, b, l) : void 0, p === void 0 && (p = n(v) ? v : u(i[o + 1]) ? [] : {});
+        var v = l[y];
+        p = d ? d(v, y, l) : void 0, p === void 0 && (p = n(v) ? v : u(i[o + 1]) ? [] : {});
       }
-      e(l, b, p), l = l[b];
+      e(l, y, p), l = l[y];
     }
     return s;
   }
@@ -2337,7 +2339,7 @@ var ht, fs;
 function cc() {
   if (fs) return ht;
   fs = 1;
-  var e = dc(), a = Ie(), u = Ao();
+  var e = dc(), a = Ie(), u = ko();
   function n(r) {
     return function(t, s, i) {
       return i && typeof i != "number" && a(t, s, i) && (s = i = void 0), t = u(t), s === void 0 ? (s = t, t = 0) : s = u(s), i = i === void 0 ? t < s ? 1 : -1 : u(i), e(t, s, i, r);
@@ -2413,13 +2415,13 @@ function gc() {
     }) : c = [i];
     var l = -1;
     c = e(c, t(u));
-    var b = n(o, function(p, v, g) {
+    var y = n(o, function(p, v, g) {
       var m = e(c, function(_) {
         return _(p);
       });
       return { criteria: m, index: ++l, value: p };
     });
-    return r(b, function(p, v) {
+    return r(y, function(p, v) {
       return s(p, v, h);
     });
   }
@@ -2555,8 +2557,8 @@ function qc() {
     }), !0);
   }
   function t(d, o, c) {
-    for (var h = [], l = o[o.length - 1], b = o[0], p; d.nodeCount(); ) {
-      for (; p = b.dequeue(); )
+    for (var h = [], l = o[o.length - 1], y = o[0], p; d.nodeCount(); ) {
+      for (; p = y.dequeue(); )
         s(d, o, c, p);
       for (; p = l.dequeue(); )
         s(d, o, c, p);
@@ -2571,14 +2573,14 @@ function qc() {
     return h;
   }
   function s(d, o, c, h, l) {
-    var b = l ? [] : void 0;
+    var y = l ? [] : void 0;
     return e.forEach(d.inEdges(h.v), function(p) {
       var v = d.edge(p), g = d.node(p.v);
-      l && b.push({ v: p.v, w: p.w }), g.out -= v, f(o, c, g);
+      l && y.push({ v: p.v, w: p.w }), g.out -= v, f(o, c, g);
     }), e.forEach(d.outEdges(h.v), function(p) {
       var v = d.edge(p), g = p.w, m = d.node(g);
       m.in -= v, f(o, c, m);
-    }), d.removeNode(h.v), b;
+    }), d.removeNode(h.v), y;
   }
   function i(d, o) {
     var c = new a(), h = 0, l = 0;
@@ -2588,12 +2590,12 @@ function qc() {
       var g = c.edge(v.v, v.w) || 0, m = o(v), _ = g + m;
       c.setEdge(v.v, v.w, _), l = Math.max(l, c.node(v.v).out += m), h = Math.max(h, c.node(v.w).in += m);
     });
-    var b = e.range(l + h + 3).map(function() {
+    var y = e.range(l + h + 3).map(function() {
       return new u();
     }), p = h + 1;
     return e.forEach(c.nodes(), function(v) {
-      f(b, p, c.node(v));
-    }), { graph: c, buckets: b, zeroIdx: p };
+      f(y, p, c.node(v));
+    }), { graph: c, buckets: y, zeroIdx: p };
   }
   function f(d, o, c) {
     c.out ? c.in ? d[c.out - c.in + o].enqueue(c) : d[d.length - 1].enqueue(c) : d[0].enqueue(c);
@@ -2643,7 +2645,7 @@ function wc() {
   return It;
 }
 var Tt, ws;
-function H() {
+function W() {
   if (ws) return Tt;
   ws = 1;
   var e = G(), a = Y().Graph;
@@ -2660,25 +2662,25 @@ function H() {
     addBorderNode: c,
     maxRank: h,
     partition: l,
-    time: b,
+    time: y,
     notime: p
   };
   function u(v, g, m, _) {
-    var y;
+    var b;
     do
-      y = e.uniqueId(_);
-    while (v.hasNode(y));
-    return m.dummy = g, v.setNode(y, m), y;
+      b = e.uniqueId(_);
+    while (v.hasNode(b));
+    return m.dummy = g, v.setNode(b, m), b;
   }
   function n(v) {
     var g = new a().setGraph(v.graph());
     return e.forEach(v.nodes(), function(m) {
       g.setNode(m, v.node(m));
     }), e.forEach(v.edges(), function(m) {
-      var _ = g.edge(m.v, m.w) || { weight: 0, minlen: 1 }, y = v.edge(m);
+      var _ = g.edge(m.v, m.w) || { weight: 0, minlen: 1 }, b = v.edge(m);
       g.setEdge(m.v, m.w, {
-        weight: _.weight + y.weight,
-        minlen: Math.max(_.minlen, y.minlen)
+        weight: _.weight + b.weight,
+        minlen: Math.max(_.minlen, b.minlen)
       });
     }), g;
   }
@@ -2693,8 +2695,8 @@ function H() {
   function t(v) {
     var g = e.map(v.nodes(), function(m) {
       var _ = {};
-      return e.forEach(v.outEdges(m), function(y) {
-        _[y.w] = (_[y.w] || 0) + v.edge(y).weight;
+      return e.forEach(v.outEdges(m), function(b) {
+        _[b.w] = (_[b.w] || 0) + v.edge(b).weight;
       }), _;
     });
     return e.zipObject(v.nodes(), g);
@@ -2702,26 +2704,26 @@ function H() {
   function s(v) {
     var g = e.map(v.nodes(), function(m) {
       var _ = {};
-      return e.forEach(v.inEdges(m), function(y) {
-        _[y.v] = (_[y.v] || 0) + v.edge(y).weight;
+      return e.forEach(v.inEdges(m), function(b) {
+        _[b.v] = (_[b.v] || 0) + v.edge(b).weight;
       }), _;
     });
     return e.zipObject(v.nodes(), g);
   }
   function i(v, g) {
-    var m = v.x, _ = v.y, y = g.x - m, E = g.y - _, R = v.width / 2, w = v.height / 2;
-    if (!y && !E)
+    var m = v.x, _ = v.y, b = g.x - m, q = g.y - _, w = v.width / 2, R = v.height / 2;
+    if (!b && !q)
       throw new Error("Not possible to find intersection inside of the rectangle");
-    var q, C;
-    return Math.abs(E) * R > Math.abs(y) * w ? (E < 0 && (w = -w), q = w * y / E, C = w) : (y < 0 && (R = -R), q = R, C = R * E / y), { x: m + q, y: _ + C };
+    var C, E;
+    return Math.abs(q) * w > Math.abs(b) * R ? (q < 0 && (R = -R), C = R * b / q, E = R) : (b < 0 && (w = -w), C = w, E = w * q / b), { x: m + C, y: _ + E };
   }
   function f(v) {
     var g = e.map(e.range(h(v) + 1), function() {
       return [];
     });
     return e.forEach(v.nodes(), function(m) {
-      var _ = v.node(m), y = _.rank;
-      e.isUndefined(y) || (g[y][_.order] = m);
+      var _ = v.node(m), b = _.rank;
+      e.isUndefined(b) || (g[b][_.order] = m);
     }), g;
   }
   function d(v) {
@@ -2734,26 +2736,26 @@ function H() {
     });
   }
   function o(v) {
-    var g = e.min(e.map(v.nodes(), function(E) {
-      return v.node(E).rank;
+    var g = e.min(e.map(v.nodes(), function(q) {
+      return v.node(q).rank;
     })), m = [];
-    e.forEach(v.nodes(), function(E) {
-      var R = v.node(E).rank - g;
-      m[R] || (m[R] = []), m[R].push(E);
+    e.forEach(v.nodes(), function(q) {
+      var w = v.node(q).rank - g;
+      m[w] || (m[w] = []), m[w].push(q);
     });
-    var _ = 0, y = v.graph().nodeRankFactor;
-    e.forEach(m, function(E, R) {
-      e.isUndefined(E) && R % y !== 0 ? --_ : _ && e.forEach(E, function(w) {
-        v.node(w).rank += _;
+    var _ = 0, b = v.graph().nodeRankFactor;
+    e.forEach(m, function(q, w) {
+      e.isUndefined(q) && w % b !== 0 ? --_ : _ && e.forEach(q, function(R) {
+        v.node(R).rank += _;
       });
     });
   }
   function c(v, g, m, _) {
-    var y = {
+    var b = {
       width: 0,
       height: 0
     };
-    return arguments.length >= 4 && (y.rank = m, y.order = _), u(v, "border", y, g);
+    return arguments.length >= 4 && (b.rank = m, b.order = _), u(v, "border", b, g);
   }
   function h(v) {
     return e.max(e.map(v.nodes(), function(g) {
@@ -2768,7 +2770,7 @@ function H() {
       g(_) ? m.lhs.push(_) : m.rhs.push(_);
     }), m;
   }
-  function b(v, g) {
+  function y(v, g) {
     var m = e.now();
     try {
       return g();
@@ -2785,7 +2787,7 @@ var St, Rs;
 function Rc() {
   if (Rs) return St;
   Rs = 1;
-  var e = G(), a = H();
+  var e = G(), a = W();
   St = {
     run: u,
     undo: r
@@ -2799,7 +2801,7 @@ function Rc() {
     var i = s.v, f = t.node(i).rank, d = s.w, o = t.node(d).rank, c = s.name, h = t.edge(s), l = h.labelRank;
     if (o !== f + 1) {
       t.removeEdge(s);
-      var b, p, v;
+      var y, p, v;
       for (v = 0, ++f; f < o; ++v, ++f)
         h.points = [], p = {
           width: 0,
@@ -2807,7 +2809,7 @@ function Rc() {
           edgeLabel: h,
           edgeObj: s,
           rank: f
-        }, b = a.addDummyNode(t, "edge", p, "_d"), f === l && (p.width = h.width, p.height = h.height, p.dummy = "edge-label", p.labelpos = h.labelpos), t.setEdge(i, b, { weight: h.weight }, c), v === 0 && t.graph().dummyChains.push(b), i = b;
+        }, y = a.addDummyNode(t, "edge", p, "_d"), f === l && (p.width = h.width, p.height = h.height, p.dummy = "edge-label", p.labelpos = h.labelpos), t.setEdge(i, y, { weight: h.weight }, c), v === 0 && t.graph().dummyChains.push(y), i = y;
       t.setEdge(i, d, { weight: h.weight }, c);
     }
   }
@@ -2885,95 +2887,95 @@ function Fo() {
   }
   return Ot;
 }
-var xt, Ss;
+var Nt, Ss;
 function Ic() {
-  if (Ss) return xt;
+  if (Ss) return Nt;
   Ss = 1;
-  var e = G(), a = Fo(), u = ce().slack, n = ce().longestPath, r = Y().alg.preorder, t = Y().alg.postorder, s = H().simplify;
-  xt = i, i.initLowLimValues = c, i.initCutValues = f, i.calcCutValue = o, i.leaveEdge = l, i.enterEdge = b, i.exchangeEdges = p;
+  var e = G(), a = Fo(), u = ce().slack, n = ce().longestPath, r = Y().alg.preorder, t = Y().alg.postorder, s = W().simplify;
+  Nt = i, i.initLowLimValues = c, i.initCutValues = f, i.calcCutValue = o, i.leaveEdge = l, i.enterEdge = y, i.exchangeEdges = p;
   function i(_) {
     _ = s(_), n(_);
-    var y = a(_);
-    c(y), f(y, _);
-    for (var E, R; E = l(y); )
-      R = b(y, _, E), p(y, _, E, R);
-  }
-  function f(_, y) {
-    var E = t(_, _.nodes());
-    E = E.slice(0, E.length - 1), e.forEach(E, function(R) {
-      d(_, y, R);
+    var b = a(_);
+    c(b), f(b, _);
+    for (var q, w; q = l(b); )
+      w = y(b, _, q), p(b, _, q, w);
+  }
+  function f(_, b) {
+    var q = t(_, _.nodes());
+    q = q.slice(0, q.length - 1), e.forEach(q, function(w) {
+      d(_, b, w);
     });
   }
-  function d(_, y, E) {
-    var R = _.node(E), w = R.parent;
-    _.edge(E, w).cutvalue = o(_, y, E);
-  }
-  function o(_, y, E) {
-    var R = _.node(E), w = R.parent, q = !0, C = y.edge(E, w), T = 0;
-    return C || (q = !1, C = y.edge(w, E)), T = C.weight, e.forEach(y.nodeEdges(E), function(x) {
-      var A = x.v === E, N = A ? x.w : x.v;
-      if (N !== w) {
-        var P = A === q, M = y.edge(x).weight;
-        if (T += P ? M : -M, g(_, E, N)) {
-          var B = _.edge(E, N).cutvalue;
-          T += P ? -B : B;
+  function d(_, b, q) {
+    var w = _.node(q), R = w.parent;
+    _.edge(q, R).cutvalue = o(_, b, q);
+  }
+  function o(_, b, q) {
+    var w = _.node(q), R = w.parent, C = !0, E = b.edge(q, R), T = 0;
+    return E || (C = !1, E = b.edge(R, q)), T = E.weight, e.forEach(b.nodeEdges(q), function(N) {
+      var x = N.v === q, k = x ? N.w : N.v;
+      if (k !== R) {
+        var P = x === C, M = b.edge(N).weight;
+        if (T += P ? M : -M, g(_, q, k)) {
+          var D = _.edge(q, k).cutvalue;
+          T += P ? -D : D;
         }
       }
     }), T;
   }
-  function c(_, y) {
-    arguments.length < 2 && (y = _.nodes()[0]), h(_, {}, 1, y);
+  function c(_, b) {
+    arguments.length < 2 && (b = _.nodes()[0]), h(_, {}, 1, b);
   }
-  function h(_, y, E, R, w) {
-    var q = E, C = _.node(R);
-    return y[R] = !0, e.forEach(_.neighbors(R), function(T) {
-      e.has(y, T) || (E = h(_, y, E, T, R));
-    }), C.low = q, C.lim = E++, w ? C.parent = w : delete C.parent, E;
+  function h(_, b, q, w, R) {
+    var C = q, E = _.node(w);
+    return b[w] = !0, e.forEach(_.neighbors(w), function(T) {
+      e.has(b, T) || (q = h(_, b, q, T, w));
+    }), E.low = C, E.lim = q++, R ? E.parent = R : delete E.parent, q;
   }
   function l(_) {
-    return e.find(_.edges(), function(y) {
-      return _.edge(y).cutvalue < 0;
+    return e.find(_.edges(), function(b) {
+      return _.edge(b).cutvalue < 0;
     });
   }
-  function b(_, y, E) {
-    var R = E.v, w = E.w;
-    y.hasEdge(R, w) || (R = E.w, w = E.v);
-    var q = _.node(R), C = _.node(w), T = q, x = !1;
-    q.lim > C.lim && (T = C, x = !0);
-    var A = e.filter(y.edges(), function(N) {
-      return x === m(_, _.node(N.v), T) && x !== m(_, _.node(N.w), T);
+  function y(_, b, q) {
+    var w = q.v, R = q.w;
+    b.hasEdge(w, R) || (w = q.w, R = q.v);
+    var C = _.node(w), E = _.node(R), T = C, N = !1;
+    C.lim > E.lim && (T = E, N = !0);
+    var x = e.filter(b.edges(), function(k) {
+      return N === m(_, _.node(k.v), T) && N !== m(_, _.node(k.w), T);
     });
-    return e.minBy(A, function(N) {
-      return u(y, N);
+    return e.minBy(x, function(k) {
+      return u(b, k);
     });
   }
-  function p(_, y, E, R) {
-    var w = E.v, q = E.w;
-    _.removeEdge(w, q), _.setEdge(R.v, R.w, {}), c(_), f(_, y), v(_, y);
-  }
-  function v(_, y) {
-    var E = e.find(_.nodes(), function(w) {
-      return !y.node(w).parent;
-    }), R = r(_, E);
-    R = R.slice(1), e.forEach(R, function(w) {
-      var q = _.node(w).parent, C = y.edge(w, q), T = !1;
-      C || (C = y.edge(q, w), T = !0), y.node(w).rank = y.node(q).rank + (T ? C.minlen : -C.minlen);
+  function p(_, b, q, w) {
+    var R = q.v, C = q.w;
+    _.removeEdge(R, C), _.setEdge(w.v, w.w, {}), c(_), f(_, b), v(_, b);
+  }
+  function v(_, b) {
+    var q = e.find(_.nodes(), function(R) {
+      return !b.node(R).parent;
+    }), w = r(_, q);
+    w = w.slice(1), e.forEach(w, function(R) {
+      var C = _.node(R).parent, E = b.edge(R, C), T = !1;
+      E || (E = b.edge(C, R), T = !0), b.node(R).rank = b.node(C).rank + (T ? E.minlen : -E.minlen);
     });
   }
-  function g(_, y, E) {
-    return _.hasEdge(y, E);
+  function g(_, b, q) {
+    return _.hasEdge(b, q);
   }
-  function m(_, y, E) {
-    return E.low <= y.lim && y.lim <= E.lim;
+  function m(_, b, q) {
+    return q.low <= b.lim && b.lim <= q.lim;
   }
-  return xt;
+  return Nt;
 }
-var Nt, Cs;
+var xt, Cs;
 function Tc() {
-  if (Cs) return Nt;
+  if (Cs) return xt;
   Cs = 1;
   var e = ce(), a = e.longestPath, u = Fo(), n = Ic();
-  Nt = r;
+  xt = r;
   function r(f) {
     switch (f.graph().ranker) {
       case "network-simplex":
@@ -2996,24 +2998,24 @@ function Tc() {
   function i(f) {
     n(f);
   }
-  return Nt;
+  return xt;
 }
-var kt, Os;
+var At, Os;
 function Sc() {
-  if (Os) return kt;
+  if (Os) return At;
   Os = 1;
   var e = G();
-  kt = a;
+  At = a;
   function a(r) {
     var t = n(r);
     e.forEach(r.graph().dummyChains, function(s) {
-      for (var i = r.node(s), f = i.edgeObj, d = u(r, t, f.v, f.w), o = d.path, c = d.lca, h = 0, l = o[h], b = !0; s !== f.w; ) {
-        if (i = r.node(s), b) {
+      for (var i = r.node(s), f = i.edgeObj, d = u(r, t, f.v, f.w), o = d.path, c = d.lca, h = 0, l = o[h], y = !0; s !== f.w; ) {
+        if (i = r.node(s), y) {
           for (; (l = o[h]) !== c && r.node(l).maxRank < i.rank; )
             h++;
-          l === c && (b = !1);
+          l === c && (y = !1);
         }
-        if (!b) {
+        if (!y) {
           for (; h < o.length - 1 && r.node(l = o[h + 1]).minRank <= i.rank; )
             h++;
           l = o[h];
@@ -3040,14 +3042,14 @@ function Sc() {
     }
     return e.forEach(r.children(), i), t;
   }
-  return kt;
+  return At;
 }
-var At, xs;
+var kt, Ns;
 function Cc() {
-  if (xs) return At;
-  xs = 1;
-  var e = G(), a = H();
-  At = {
+  if (Ns) return kt;
+  Ns = 1;
+  var e = G(), a = W();
+  kt = {
     run: u,
     cleanup: s
   };
@@ -3062,22 +3064,22 @@ function Cc() {
     }), i.graph().nodeRankFactor = c;
   }
   function n(i, f, d, o, c, h, l) {
-    var b = i.children(l);
-    if (!b.length) {
+    var y = i.children(l);
+    if (!y.length) {
       l !== f && i.setEdge(f, l, { weight: 0, minlen: d });
       return;
     }
     var p = a.addBorderNode(i, "_bt"), v = a.addBorderNode(i, "_bb"), g = i.node(l);
-    i.setParent(p, l), g.borderTop = p, i.setParent(v, l), g.borderBottom = v, e.forEach(b, function(m) {
+    i.setParent(p, l), g.borderTop = p, i.setParent(v, l), g.borderBottom = v, e.forEach(y, function(m) {
       n(i, f, d, o, c, h, m);
-      var _ = i.node(m), y = _.borderTop ? _.borderTop : m, E = _.borderBottom ? _.borderBottom : m, R = _.borderTop ? o : 2 * o, w = y !== E ? 1 : c - h[l] + 1;
-      i.setEdge(p, y, {
-        weight: R,
-        minlen: w,
+      var _ = i.node(m), b = _.borderTop ? _.borderTop : m, q = _.borderBottom ? _.borderBottom : m, w = _.borderTop ? o : 2 * o, R = b !== q ? 1 : c - h[l] + 1;
+      i.setEdge(p, b, {
+        weight: w,
+        minlen: R,
         nestingEdge: !0
-      }), i.setEdge(E, v, {
-        weight: R,
-        minlen: w,
+      }), i.setEdge(q, v, {
+        weight: w,
+        minlen: R,
         nestingEdge: !0
       });
     }), i.parent(l) || i.setEdge(f, p, { weight: 0, minlen: c + h[l] });
@@ -3106,13 +3108,13 @@ function Cc() {
       o.nestingEdge && i.removeEdge(d);
     });
   }
-  return At;
+  return kt;
 }
-var Pt, Ns;
+var Pt, xs;
 function Oc() {
-  if (Ns) return Pt;
-  Ns = 1;
-  var e = G(), a = H();
+  if (xs) return Pt;
+  xs = 1;
+  var e = G(), a = W();
   Pt = u;
   function u(r) {
     function t(s) {
@@ -3131,10 +3133,10 @@ function Oc() {
   }
   return Pt;
 }
-var Lt, ks;
-function xc() {
-  if (ks) return Lt;
-  ks = 1;
+var Lt, As;
+function Nc() {
+  if (As) return Lt;
+  As = 1;
   var e = G();
   Lt = {
     adjust: a,
@@ -3184,10 +3186,10 @@ function xc() {
   }
   return Lt;
 }
-var Mt, As;
-function Nc() {
-  if (As) return Mt;
-  As = 1;
+var Mt, ks;
+function xc() {
+  if (ks) return Mt;
+  ks = 1;
   var e = G();
   Mt = a;
   function a(u) {
@@ -3213,7 +3215,7 @@ function Nc() {
   return Mt;
 }
 var Gt, Ps;
-function kc() {
+function Ac() {
   if (Ps) return Gt;
   Ps = 1;
   var e = G();
@@ -3242,15 +3244,15 @@ function kc() {
     return e.forEach(i.forEach(function(h) {
       var l = h.pos + f;
       o[l] += h.weight;
-      for (var b = 0; l > 0; )
-        l % 2 && (b += o[l + 1]), l = l - 1 >> 1, o[l] += h.weight;
-      c += h.weight * b;
+      for (var y = 0; l > 0; )
+        l % 2 && (y += o[l + 1]), l = l - 1 >> 1, o[l] += h.weight;
+      c += h.weight * y;
     })), c;
   }
   return Gt;
 }
 var Ft, Ls;
-function Ac() {
+function kc() {
   if (Ls) return Ft;
   Ls = 1;
   var e = G();
@@ -3338,7 +3340,7 @@ var Bt, Gs;
 function Lc() {
   if (Gs) return Bt;
   Gs = 1;
-  var e = G(), a = H();
+  var e = G(), a = W();
   Bt = u;
   function u(t, s) {
     var i = a.partition(t, function(p) {
@@ -3349,8 +3351,8 @@ function Lc() {
     f.sort(r(!!s)), l = n(o, d, l), e.forEach(f, function(p) {
       l += p.vs.length, o.push(p.vs), c += p.barycenter * p.weight, h += p.weight, l = n(o, d, l);
     });
-    var b = { vs: e.flatten(o, !0) };
-    return h && (b.barycenter = c / h, b.weight = h), b;
+    var y = { vs: e.flatten(o, !0) };
+    return h && (y.barycenter = c / h, y.weight = h), y;
   }
   function n(t, s, i) {
     for (var f; s.length && (f = e.last(s)).i <= i; )
@@ -3368,26 +3370,26 @@ var Ut, Fs;
 function Mc() {
   if (Fs) return Ut;
   Fs = 1;
-  var e = G(), a = Ac(), u = Pc(), n = Lc();
+  var e = G(), a = kc(), u = Pc(), n = Lc();
   Ut = r;
   function r(i, f, d, o) {
-    var c = i.children(f), h = i.node(f), l = h ? h.borderLeft : void 0, b = h ? h.borderRight : void 0, p = {};
-    l && (c = e.filter(c, function(E) {
-      return E !== l && E !== b;
+    var c = i.children(f), h = i.node(f), l = h ? h.borderLeft : void 0, y = h ? h.borderRight : void 0, p = {};
+    l && (c = e.filter(c, function(q) {
+      return q !== l && q !== y;
     }));
     var v = a(i, c);
-    e.forEach(v, function(E) {
-      if (i.children(E.v).length) {
-        var R = r(i, E.v, d, o);
-        p[E.v] = R, e.has(R, "barycenter") && s(E, R);
+    e.forEach(v, function(q) {
+      if (i.children(q.v).length) {
+        var w = r(i, q.v, d, o);
+        p[q.v] = w, e.has(w, "barycenter") && s(q, w);
       }
     });
     var g = u(v, d);
     t(g, p);
     var m = n(g, o);
-    if (l && (m.vs = e.flatten([l, m.vs, b], !0), i.predecessors(l).length)) {
-      var _ = i.node(i.predecessors(l)[0]), y = i.node(i.predecessors(b)[0]);
-      e.has(m, "barycenter") || (m.barycenter = 0, m.weight = 0), m.barycenter = (m.barycenter * m.weight + _.order + y.order) / (m.weight + 2), m.weight += 2;
+    if (l && (m.vs = e.flatten([l, m.vs, y], !0), i.predecessors(l).length)) {
+      var _ = i.node(i.predecessors(l)[0]), b = i.node(i.predecessors(y)[0]);
+      e.has(m, "barycenter") || (m.barycenter = 0, m.weight = 0), m.barycenter = (m.barycenter * m.weight + _.order + b.order) / (m.weight + 2), m.weight += 2;
     }
     return m;
   }
@@ -3403,12 +3405,12 @@ function Mc() {
   }
   return Ut;
 }
-var Wt, Ds;
+var Ht, Ds;
 function Gc() {
-  if (Ds) return Wt;
+  if (Ds) return Ht;
   Ds = 1;
   var e = G(), a = Y().Graph;
-  Wt = u;
+  Ht = u;
   function u(r, t, s) {
     var i = n(r), f = new a({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel(function(d) {
       return r.node(d);
@@ -3416,7 +3418,7 @@ function Gc() {
     return e.forEach(r.nodes(), function(d) {
       var o = r.node(d), c = r.parent(d);
       (o.rank === t || o.minRank <= t && t <= o.maxRank) && (f.setNode(d), f.setParent(d, c || i), e.forEach(r[s](d), function(h) {
-        var l = h.v === d ? h.w : h.v, b = f.edge(l, d), p = e.isUndefined(b) ? 0 : b.weight;
+        var l = h.v === d ? h.w : h.v, y = f.edge(l, d), p = e.isUndefined(y) ? 0 : y.weight;
         f.setEdge(l, d, { weight: r.edge(h).weight + p });
       }), e.has(o, "minRank") && f.setNode(d, {
         borderLeft: o.borderLeft[t],
@@ -3428,14 +3430,14 @@ function Gc() {
     for (var t; r.hasNode(t = e.uniqueId("_root")); ) ;
     return t;
   }
-  return Wt;
+  return Ht;
 }
-var Ht, Bs;
+var Wt, Bs;
 function Fc() {
-  if (Bs) return Ht;
+  if (Bs) return Wt;
   Bs = 1;
   var e = G();
-  Ht = a;
+  Wt = a;
   function a(u, n, r) {
     var t = {}, s;
     e.forEach(r, function(i) {
@@ -3448,54 +3450,54 @@ function Fc() {
       }
     });
   }
-  return Ht;
+  return Wt;
 }
 var Vt, Us;
 function Dc() {
   if (Us) return Vt;
   Us = 1;
-  var e = G(), a = Nc(), u = kc(), n = Mc(), r = Gc(), t = Fc(), s = Y().Graph, i = H();
+  var e = G(), a = xc(), u = Ac(), n = Mc(), r = Gc(), t = Fc(), s = Y().Graph, i = W();
   Vt = f;
   function f(h) {
-    var l = i.maxRank(h), b = d(h, e.range(1, l + 1), "inEdges"), p = d(h, e.range(l - 1, -1, -1), "outEdges"), v = a(h);
+    var l = i.maxRank(h), y = d(h, e.range(1, l + 1), "inEdges"), p = d(h, e.range(l - 1, -1, -1), "outEdges"), v = a(h);
     c(h, v);
-    for (var g = Number.POSITIVE_INFINITY, m, _ = 0, y = 0; y < 4; ++_, ++y) {
-      o(_ % 2 ? b : p, _ % 4 >= 2), v = i.buildLayerMatrix(h);
-      var E = u(h, v);
-      E < g && (y = 0, m = e.cloneDeep(v), g = E);
+    for (var g = Number.POSITIVE_INFINITY, m, _ = 0, b = 0; b < 4; ++_, ++b) {
+      o(_ % 2 ? y : p, _ % 4 >= 2), v = i.buildLayerMatrix(h);
+      var q = u(h, v);
+      q < g && (b = 0, m = e.cloneDeep(v), g = q);
     }
     c(h, m);
   }
-  function d(h, l, b) {
+  function d(h, l, y) {
     return e.map(l, function(p) {
-      return r(h, p, b);
+      return r(h, p, y);
     });
   }
   function o(h, l) {
-    var b = new s();
+    var y = new s();
     e.forEach(h, function(p) {
-      var v = p.graph().root, g = n(p, v, b, l);
+      var v = p.graph().root, g = n(p, v, y, l);
       e.forEach(g.vs, function(m, _) {
         p.node(m).order = _;
-      }), t(p, b, g.vs);
+      }), t(p, y, g.vs);
     });
   }
   function c(h, l) {
-    e.forEach(l, function(b) {
-      e.forEach(b, function(p, v) {
+    e.forEach(l, function(y) {
+      e.forEach(y, function(p, v) {
         h.node(p).order = v;
       });
     });
   }
   return Vt;
 }
-var jt, Ws;
+var jt, Hs;
 function Bc() {
-  if (Ws) return jt;
-  Ws = 1;
-  var e = G(), a = Y().Graph, u = H();
+  if (Hs) return jt;
+  Hs = 1;
+  var e = G(), a = Y().Graph, u = W();
   jt = {
-    positionX: b,
+    positionX: y,
     findType1Conflicts: n,
     findType2Conflicts: r,
     addConflict: s,
@@ -3508,42 +3510,42 @@ function Bc() {
   };
   function n(g, m) {
     var _ = {};
-    function y(E, R) {
-      var w = 0, q = 0, C = E.length, T = e.last(R);
-      return e.forEach(R, function(x, A) {
-        var N = t(g, x), P = N ? g.node(N).order : C;
-        (N || x === T) && (e.forEach(R.slice(q, A + 1), function(M) {
-          e.forEach(g.predecessors(M), function(B) {
-            var fe = g.node(B), de = fe.order;
-            (de < w || P < de) && !(fe.dummy && g.node(M).dummy) && s(_, B, M);
+    function b(q, w) {
+      var R = 0, C = 0, E = q.length, T = e.last(w);
+      return e.forEach(w, function(N, x) {
+        var k = t(g, N), P = k ? g.node(k).order : E;
+        (k || N === T) && (e.forEach(w.slice(C, x + 1), function(M) {
+          e.forEach(g.predecessors(M), function(D) {
+            var fe = g.node(D), de = fe.order;
+            (de < R || P < de) && !(fe.dummy && g.node(M).dummy) && s(_, D, M);
           });
-        }), q = A + 1, w = P);
-      }), R;
+        }), C = x + 1, R = P);
+      }), w;
     }
-    return e.reduce(m, y), _;
+    return e.reduce(m, b), _;
   }
   function r(g, m) {
     var _ = {};
-    function y(R, w, q, C, T) {
-      var x;
-      e.forEach(e.range(w, q), function(A) {
-        x = R[A], g.node(x).dummy && e.forEach(g.predecessors(x), function(N) {
-          var P = g.node(N);
-          P.dummy && (P.order < C || P.order > T) && s(_, N, x);
+    function b(w, R, C, E, T) {
+      var N;
+      e.forEach(e.range(R, C), function(x) {
+        N = w[x], g.node(N).dummy && e.forEach(g.predecessors(N), function(k) {
+          var P = g.node(k);
+          P.dummy && (P.order < E || P.order > T) && s(_, k, N);
         });
       });
     }
-    function E(R, w) {
-      var q = -1, C, T = 0;
-      return e.forEach(w, function(x, A) {
-        if (g.node(x).dummy === "border") {
-          var N = g.predecessors(x);
-          N.length && (C = g.node(N[0]).order, y(w, T, A, q, C), T = A, q = C);
+    function q(w, R) {
+      var C = -1, E, T = 0;
+      return e.forEach(R, function(N, x) {
+        if (g.node(N).dummy === "border") {
+          var k = g.predecessors(N);
+          k.length && (E = g.node(k[0]).order, b(R, T, x, C, E), T = x, C = E);
         }
-        y(w, T, w.length, C, R.length);
-      }), w;
+        b(R, T, R.length, E, w.length);
+      }), R;
     }
-    return e.reduce(m, E), _;
+    return e.reduce(m, q), _;
   }
   function t(g, m) {
     if (g.node(m).dummy)
@@ -3553,154 +3555,154 @@ function Bc() {
   }
   function s(g, m, _) {
     if (m > _) {
-      var y = m;
-      m = _, _ = y;
+      var b = m;
+      m = _, _ = b;
     }
-    var E = g[m];
-    E || (g[m] = E = {}), E[_] = !0;
+    var q = g[m];
+    q || (g[m] = q = {}), q[_] = !0;
   }
   function i(g, m, _) {
     if (m > _) {
-      var y = m;
-      m = _, _ = y;
+      var b = m;
+      m = _, _ = b;
     }
     return e.has(g[m], _);
   }
-  function f(g, m, _, y) {
-    var E = {}, R = {}, w = {};
-    return e.forEach(m, function(q) {
-      e.forEach(q, function(C, T) {
-        E[C] = C, R[C] = C, w[C] = T;
+  function f(g, m, _, b) {
+    var q = {}, w = {}, R = {};
+    return e.forEach(m, function(C) {
+      e.forEach(C, function(E, T) {
+        q[E] = E, w[E] = E, R[E] = T;
       });
-    }), e.forEach(m, function(q) {
-      var C = -1;
-      e.forEach(q, function(T) {
-        var x = y(T);
-        if (x.length) {
-          x = e.sortBy(x, function(B) {
-            return w[B];
+    }), e.forEach(m, function(C) {
+      var E = -1;
+      e.forEach(C, function(T) {
+        var N = b(T);
+        if (N.length) {
+          N = e.sortBy(N, function(D) {
+            return R[D];
           });
-          for (var A = (x.length - 1) / 2, N = Math.floor(A), P = Math.ceil(A); N <= P; ++N) {
-            var M = x[N];
-            R[T] === T && C < w[M] && !i(_, T, M) && (R[M] = T, R[T] = E[T] = E[M], C = w[M]);
+          for (var x = (N.length - 1) / 2, k = Math.floor(x), P = Math.ceil(x); k <= P; ++k) {
+            var M = N[k];
+            w[T] === T && E < R[M] && !i(_, T, M) && (w[M] = T, w[T] = q[T] = q[M], E = R[M]);
           }
         }
       });
-    }), { root: E, align: R };
+    }), { root: q, align: w };
   }
-  function d(g, m, _, y, E) {
-    var R = {}, w = o(g, m, _, E), q = E ? "borderLeft" : "borderRight";
-    function C(A, N) {
-      for (var P = w.nodes(), M = P.pop(), B = {}; M; )
-        B[M] ? A(M) : (B[M] = !0, P.push(M), P = P.concat(N(M))), M = P.pop();
+  function d(g, m, _, b, q) {
+    var w = {}, R = o(g, m, _, q), C = q ? "borderLeft" : "borderRight";
+    function E(x, k) {
+      for (var P = R.nodes(), M = P.pop(), D = {}; M; )
+        D[M] ? x(M) : (D[M] = !0, P.push(M), P = P.concat(k(M))), M = P.pop();
     }
-    function T(A) {
-      R[A] = w.inEdges(A).reduce(function(N, P) {
-        return Math.max(N, R[P.v] + w.edge(P));
+    function T(x) {
+      w[x] = R.inEdges(x).reduce(function(k, P) {
+        return Math.max(k, w[P.v] + R.edge(P));
       }, 0);
     }
-    function x(A) {
-      var N = w.outEdges(A).reduce(function(M, B) {
-        return Math.min(M, R[B.w] - w.edge(B));
-      }, Number.POSITIVE_INFINITY), P = g.node(A);
-      N !== Number.POSITIVE_INFINITY && P.borderType !== q && (R[A] = Math.max(R[A], N));
+    function N(x) {
+      var k = R.outEdges(x).reduce(function(M, D) {
+        return Math.min(M, w[D.w] - R.edge(D));
+      }, Number.POSITIVE_INFINITY), P = g.node(x);
+      k !== Number.POSITIVE_INFINITY && P.borderType !== C && (w[x] = Math.max(w[x], k));
     }
-    return C(T, w.predecessors.bind(w)), C(x, w.successors.bind(w)), e.forEach(y, function(A) {
-      R[A] = R[_[A]];
-    }), R;
-  }
-  function o(g, m, _, y) {
-    var E = new a(), R = g.graph(), w = p(R.nodesep, R.edgesep, y);
-    return e.forEach(m, function(q) {
-      var C;
-      e.forEach(q, function(T) {
-        var x = _[T];
-        if (E.setNode(x), C) {
-          var A = _[C], N = E.edge(A, x);
-          E.setEdge(A, x, Math.max(w(g, T, C), N || 0));
+    return E(T, R.predecessors.bind(R)), E(N, R.successors.bind(R)), e.forEach(b, function(x) {
+      w[x] = w[_[x]];
+    }), w;
+  }
+  function o(g, m, _, b) {
+    var q = new a(), w = g.graph(), R = p(w.nodesep, w.edgesep, b);
+    return e.forEach(m, function(C) {
+      var E;
+      e.forEach(C, function(T) {
+        var N = _[T];
+        if (q.setNode(N), E) {
+          var x = _[E], k = q.edge(x, N);
+          q.setEdge(x, N, Math.max(R(g, T, E), k || 0));
         }
-        C = T;
+        E = T;
       });
-    }), E;
+    }), q;
   }
   function c(g, m) {
     return e.minBy(e.values(m), function(_) {
-      var y = Number.NEGATIVE_INFINITY, E = Number.POSITIVE_INFINITY;
-      return e.forIn(_, function(R, w) {
-        var q = v(g, w) / 2;
-        y = Math.max(R + q, y), E = Math.min(R - q, E);
-      }), y - E;
+      var b = Number.NEGATIVE_INFINITY, q = Number.POSITIVE_INFINITY;
+      return e.forIn(_, function(w, R) {
+        var C = v(g, R) / 2;
+        b = Math.max(w + C, b), q = Math.min(w - C, q);
+      }), b - q;
     });
   }
   function h(g, m) {
-    var _ = e.values(m), y = e.min(_), E = e.max(_);
-    e.forEach(["u", "d"], function(R) {
-      e.forEach(["l", "r"], function(w) {
-        var q = R + w, C = g[q], T;
-        if (C !== m) {
-          var x = e.values(C);
-          T = w === "l" ? y - e.min(x) : E - e.max(x), T && (g[q] = e.mapValues(C, function(A) {
-            return A + T;
+    var _ = e.values(m), b = e.min(_), q = e.max(_);
+    e.forEach(["u", "d"], function(w) {
+      e.forEach(["l", "r"], function(R) {
+        var C = w + R, E = g[C], T;
+        if (E !== m) {
+          var N = e.values(E);
+          T = R === "l" ? b - e.min(N) : q - e.max(N), T && (g[C] = e.mapValues(E, function(x) {
+            return x + T;
           }));
         }
       });
     });
   }
   function l(g, m) {
-    return e.mapValues(g.ul, function(_, y) {
+    return e.mapValues(g.ul, function(_, b) {
       if (m)
-        return g[m.toLowerCase()][y];
-      var E = e.sortBy(e.map(g, y));
-      return (E[1] + E[2]) / 2;
+        return g[m.toLowerCase()][b];
+      var q = e.sortBy(e.map(g, b));
+      return (q[1] + q[2]) / 2;
     });
   }
-  function b(g) {
+  function y(g) {
     var m = u.buildLayerMatrix(g), _ = e.merge(
       n(g, m),
       r(g, m)
-    ), y = {}, E;
-    e.forEach(["u", "d"], function(w) {
-      E = w === "u" ? m : e.values(m).reverse(), e.forEach(["l", "r"], function(q) {
-        q === "r" && (E = e.map(E, function(A) {
-          return e.values(A).reverse();
+    ), b = {}, q;
+    e.forEach(["u", "d"], function(R) {
+      q = R === "u" ? m : e.values(m).reverse(), e.forEach(["l", "r"], function(C) {
+        C === "r" && (q = e.map(q, function(x) {
+          return e.values(x).reverse();
         }));
-        var C = (w === "u" ? g.predecessors : g.successors).bind(g), T = f(g, E, _, C), x = d(
+        var E = (R === "u" ? g.predecessors : g.successors).bind(g), T = f(g, q, _, E), N = d(
           g,
-          E,
+          q,
           T.root,
           T.align,
-          q === "r"
+          C === "r"
         );
-        q === "r" && (x = e.mapValues(x, function(A) {
-          return -A;
-        })), y[w + q] = x;
+        C === "r" && (N = e.mapValues(N, function(x) {
+          return -x;
+        })), b[R + C] = N;
       });
     });
-    var R = c(g, y);
-    return h(y, R), l(y, g.graph().align);
+    var w = c(g, b);
+    return h(b, w), l(b, g.graph().align);
   }
   function p(g, m, _) {
-    return function(y, E, R) {
-      var w = y.node(E), q = y.node(R), C = 0, T;
-      if (C += w.width / 2, e.has(w, "labelpos"))
-        switch (w.labelpos.toLowerCase()) {
+    return function(b, q, w) {
+      var R = b.node(q), C = b.node(w), E = 0, T;
+      if (E += R.width / 2, e.has(R, "labelpos"))
+        switch (R.labelpos.toLowerCase()) {
           case "l":
-            T = -w.width / 2;
+            T = -R.width / 2;
             break;
           case "r":
-            T = w.width / 2;
+            T = R.width / 2;
             break;
         }
-      if (T && (C += _ ? T : -T), T = 0, C += (w.dummy ? m : g) / 2, C += (q.dummy ? m : g) / 2, C += q.width / 2, e.has(q, "labelpos"))
-        switch (q.labelpos.toLowerCase()) {
+      if (T && (E += _ ? T : -T), T = 0, E += (R.dummy ? m : g) / 2, E += (C.dummy ? m : g) / 2, E += C.width / 2, e.has(C, "labelpos"))
+        switch (C.labelpos.toLowerCase()) {
           case "l":
-            T = q.width / 2;
+            T = C.width / 2;
             break;
           case "r":
-            T = -q.width / 2;
+            T = -C.width / 2;
             break;
         }
-      return T && (C += _ ? T : -T), T = 0, C;
+      return T && (E += _ ? T : -T), T = 0, E;
     };
   }
   function v(g, m) {
@@ -3708,11 +3710,11 @@ function Bc() {
   }
   return jt;
 }
-var zt, Hs;
+var zt, Ws;
 function Uc() {
-  if (Hs) return zt;
-  Hs = 1;
-  var e = G(), a = H(), u = Bc().positionX;
+  if (Ws) return zt;
+  Ws = 1;
+  var e = G(), a = W(), u = Bc().positionX;
   zt = n;
   function n(t) {
     t = a.asNonCompoundGraph(t), r(t), e.forEach(u(t), function(s, i) {
@@ -3733,21 +3735,21 @@ function Uc() {
   return zt;
 }
 var Kt, Vs;
-function Wc() {
+function Hc() {
   if (Vs) return Kt;
   Vs = 1;
-  var e = G(), a = wc(), u = Rc(), n = Tc(), r = H().normalizeRanks, t = Sc(), s = H().removeEmptyRanks, i = Cc(), f = Oc(), d = xc(), o = Dc(), c = Uc(), h = H(), l = Y().Graph;
-  Kt = b;
-  function b(I, S) {
+  var e = G(), a = wc(), u = Rc(), n = Tc(), r = W().normalizeRanks, t = Sc(), s = W().removeEmptyRanks, i = Cc(), f = Oc(), d = Nc(), o = Dc(), c = Uc(), h = W(), l = Y().Graph;
+  Kt = y;
+  function y(I, S) {
     var O = S && S.debugTiming ? h.time : h.notime;
     O("layout", function() {
-      var k = O("  buildLayoutGraph", function() {
-        return C(I);
+      var A = O("  buildLayoutGraph", function() {
+        return E(I);
       });
       O("  runLayout", function() {
-        p(k, O);
+        p(A, O);
       }), O("  updateInputGraph", function() {
-        v(I, k);
+        v(I, A);
       });
     });
   }
@@ -3763,7 +3765,7 @@ function Wc() {
     }), S("    rank", function() {
       n(h.asNonCompoundGraph(I));
     }), S("    injectEdgeLabelProxies", function() {
-      x(I);
+      N(I);
     }), S("    removeEmptyRanks", function() {
       s(I);
     }), S("    nestingGraph.cleanup", function() {
@@ -3771,9 +3773,9 @@ function Wc() {
     }), S("    normalizeRanks", function() {
       r(I);
     }), S("    assignRankMinMax", function() {
-      A(I);
+      x(I);
     }), S("    removeEdgeLabelProxies", function() {
-      N(I);
+      k(I);
     }), S("    normalize.run", function() {
       u.run(I);
     }), S("    parentDummyChains", function() {
@@ -3795,7 +3797,7 @@ function Wc() {
     }), S("    normalize.undo", function() {
       u.undo(I);
     }), S("    fixupEdgeLabelCoords", function() {
-      B(I);
+      D(I);
     }), S("    undoCoordinateSystem", function() {
       d.undo(I);
     }), S("    translateGraph", function() {
@@ -3810,98 +3812,98 @@ function Wc() {
   }
   function v(I, S) {
     e.forEach(I.nodes(), function(O) {
-      var k = I.node(O), L = S.node(O);
-      k && (k.x = L.x, k.y = L.y, S.children(O).length && (k.width = L.width, k.height = L.height));
+      var A = I.node(O), L = S.node(O);
+      A && (A.x = L.x, A.y = L.y, S.children(O).length && (A.width = L.width, A.height = L.height));
     }), e.forEach(I.edges(), function(O) {
-      var k = I.edge(O), L = S.edge(O);
-      k.points = L.points, e.has(L, "x") && (k.x = L.x, k.y = L.y);
+      var A = I.edge(O), L = S.edge(O);
+      A.points = L.points, e.has(L, "x") && (A.x = L.x, A.y = L.y);
     }), I.graph().width = S.graph().width, I.graph().height = S.graph().height;
   }
-  var g = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], m = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, _ = ["acyclicer", "ranker", "rankdir", "align"], y = ["width", "height"], E = { width: 0, height: 0 }, R = ["minlen", "weight", "width", "height", "labeloffset"], w = {
+  var g = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], m = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, _ = ["acyclicer", "ranker", "rankdir", "align"], b = ["width", "height"], q = { width: 0, height: 0 }, w = ["minlen", "weight", "width", "height", "labeloffset"], R = {
     minlen: 1,
     weight: 1,
     width: 0,
     height: 0,
     labeloffset: 10,
     labelpos: "r"
-  }, q = ["labelpos"];
-  function C(I) {
+  }, C = ["labelpos"];
+  function E(I) {
     var S = new l({ multigraph: !0, compound: !0 }), O = Ce(I.graph());
     return S.setGraph(e.merge(
       {},
       m,
       Se(O, g),
       e.pick(O, _)
-    )), e.forEach(I.nodes(), function(k) {
-      var L = Ce(I.node(k));
-      S.setNode(k, e.defaults(Se(L, y), E)), S.setParent(k, I.parent(k));
-    }), e.forEach(I.edges(), function(k) {
-      var L = Ce(I.edge(k));
-      S.setEdge(k, e.merge(
+    )), e.forEach(I.nodes(), function(A) {
+      var L = Ce(I.node(A));
+      S.setNode(A, e.defaults(Se(L, b), q)), S.setParent(A, I.parent(A));
+    }), e.forEach(I.edges(), function(A) {
+      var L = Ce(I.edge(A));
+      S.setEdge(A, e.merge(
         {},
-        w,
-        Se(L, R),
-        e.pick(L, q)
+        R,
+        Se(L, w),
+        e.pick(L, C)
       ));
     }), S;
   }
   function T(I) {
     var S = I.graph();
     S.ranksep /= 2, e.forEach(I.edges(), function(O) {
-      var k = I.edge(O);
-      k.minlen *= 2, k.labelpos.toLowerCase() !== "c" && (S.rankdir === "TB" || S.rankdir === "BT" ? k.width += k.labeloffset : k.height += k.labeloffset);
+      var A = I.edge(O);
+      A.minlen *= 2, A.labelpos.toLowerCase() !== "c" && (S.rankdir === "TB" || S.rankdir === "BT" ? A.width += A.labeloffset : A.height += A.labeloffset);
     });
   }
-  function x(I) {
+  function N(I) {
     e.forEach(I.edges(), function(S) {
       var O = I.edge(S);
       if (O.width && O.height) {
-        var k = I.node(S.v), L = I.node(S.w), F = { rank: (L.rank - k.rank) / 2 + k.rank, e: S };
+        var A = I.node(S.v), L = I.node(S.w), F = { rank: (L.rank - A.rank) / 2 + A.rank, e: S };
         h.addDummyNode(I, "edge-proxy", F, "_ep");
       }
     });
   }
-  function A(I) {
+  function x(I) {
     var S = 0;
     e.forEach(I.nodes(), function(O) {
-      var k = I.node(O);
-      k.borderTop && (k.minRank = I.node(k.borderTop).rank, k.maxRank = I.node(k.borderBottom).rank, S = e.max(S, k.maxRank));
+      var A = I.node(O);
+      A.borderTop && (A.minRank = I.node(A.borderTop).rank, A.maxRank = I.node(A.borderBottom).rank, S = e.max(S, A.maxRank));
     }), I.graph().maxRank = S;
   }
-  function N(I) {
+  function k(I) {
     e.forEach(I.nodes(), function(S) {
       var O = I.node(S);
       O.dummy === "edge-proxy" && (I.edge(O.e).labelRank = O.rank, I.removeNode(S));
     });
   }
   function P(I) {
-    var S = Number.POSITIVE_INFINITY, O = 0, k = Number.POSITIVE_INFINITY, L = 0, F = I.graph(), D = F.marginx || 0, V = F.marginy || 0;
+    var S = Number.POSITIVE_INFINITY, O = 0, A = Number.POSITIVE_INFINITY, L = 0, F = I.graph(), B = F.marginx || 0, V = F.marginy || 0;
     function wi(j) {
-      var W = j.x, te = j.y, Ri = j.width, Ii = j.height;
-      S = Math.min(S, W - Ri / 2), O = Math.max(O, W + Ri / 2), k = Math.min(k, te - Ii / 2), L = Math.max(L, te + Ii / 2);
+      var H = j.x, te = j.y, Ri = j.width, Ii = j.height;
+      S = Math.min(S, H - Ri / 2), O = Math.max(O, H + Ri / 2), A = Math.min(A, te - Ii / 2), L = Math.max(L, te + Ii / 2);
     }
     e.forEach(I.nodes(), function(j) {
       wi(I.node(j));
     }), e.forEach(I.edges(), function(j) {
-      var W = I.edge(j);
-      e.has(W, "x") && wi(W);
-    }), S -= D, k -= V, e.forEach(I.nodes(), function(j) {
-      var W = I.node(j);
-      W.x -= S, W.y -= k;
+      var H = I.edge(j);
+      e.has(H, "x") && wi(H);
+    }), S -= B, A -= V, e.forEach(I.nodes(), function(j) {
+      var H = I.node(j);
+      H.x -= S, H.y -= A;
     }), e.forEach(I.edges(), function(j) {
-      var W = I.edge(j);
-      e.forEach(W.points, function(te) {
-        te.x -= S, te.y -= k;
-      }), e.has(W, "x") && (W.x -= S), e.has(W, "y") && (W.y -= k);
-    }), F.width = O - S + D, F.height = L - k + V;
+      var H = I.edge(j);
+      e.forEach(H.points, function(te) {
+        te.x -= S, te.y -= A;
+      }), e.has(H, "x") && (H.x -= S), e.has(H, "y") && (H.y -= A);
+    }), F.width = O - S + B, F.height = L - A + V;
   }
   function M(I) {
     e.forEach(I.edges(), function(S) {
-      var O = I.edge(S), k = I.node(S.v), L = I.node(S.w), F, D;
-      O.points ? (F = O.points[0], D = O.points[O.points.length - 1]) : (O.points = [], F = L, D = k), O.points.unshift(h.intersectRect(k, F)), O.points.push(h.intersectRect(L, D));
+      var O = I.edge(S), A = I.node(S.v), L = I.node(S.w), F, B;
+      O.points ? (F = O.points[0], B = O.points[O.points.length - 1]) : (O.points = [], F = L, B = A), O.points.unshift(h.intersectRect(A, F)), O.points.push(h.intersectRect(L, B));
     });
   }
-  function B(I) {
+  function D(I) {
     e.forEach(I.edges(), function(S) {
       var O = I.edge(S);
       if (e.has(O, "x"))
@@ -3924,8 +3926,8 @@ function Wc() {
   function de(I) {
     e.forEach(I.nodes(), function(S) {
       if (I.children(S).length) {
-        var O = I.node(S), k = I.node(O.borderTop), L = I.node(O.borderBottom), F = I.node(e.last(O.borderLeft)), D = I.node(e.last(O.borderRight));
-        O.width = Math.abs(D.x - F.x), O.height = Math.abs(L.y - k.y), O.x = F.x + O.width / 2, O.y = k.y + O.height / 2;
+        var O = I.node(S), A = I.node(O.borderTop), L = I.node(O.borderBottom), F = I.node(e.last(O.borderLeft)), B = I.node(e.last(O.borderRight));
+        O.width = Math.abs(B.x - F.x), O.height = Math.abs(L.y - A.y), O.x = F.x + O.width / 2, O.y = A.y + O.height / 2;
       }
     }), e.forEach(I.nodes(), function(S) {
       I.node(S).dummy === "border" && I.removeNode(S);
@@ -3942,19 +3944,19 @@ function Wc() {
   function $o(I) {
     var S = h.buildLayerMatrix(I);
     e.forEach(S, function(O) {
-      var k = 0;
+      var A = 0;
       e.forEach(O, function(L, F) {
-        var D = I.node(L);
-        D.order = F + k, e.forEach(D.selfEdges, function(V) {
+        var B = I.node(L);
+        B.order = F + A, e.forEach(B.selfEdges, function(V) {
           h.addDummyNode(I, "selfedge", {
             width: V.label.width,
             height: V.label.height,
-            rank: D.rank,
-            order: F + ++k,
+            rank: B.rank,
+            order: F + ++A,
             e: V.e,
             label: V.label
           }, "_se");
-        }), delete D.selfEdges;
+        }), delete B.selfEdges;
       });
     });
   }
@@ -3962,13 +3964,13 @@ function Wc() {
     e.forEach(I.nodes(), function(S) {
       var O = I.node(S);
       if (O.dummy === "selfedge") {
-        var k = I.node(O.e.v), L = k.x + k.width / 2, F = k.y, D = O.x - L, V = k.height / 2;
+        var A = I.node(O.e.v), L = A.x + A.width / 2, F = A.y, B = O.x - L, V = A.height / 2;
         I.setEdge(O.e, O.label), I.removeNode(S), O.label.points = [
-          { x: L + 2 * D / 3, y: F - V },
-          { x: L + 5 * D / 6, y: F - V },
-          { x: L + D, y: F },
-          { x: L + 5 * D / 6, y: F + V },
-          { x: L + 2 * D / 3, y: F + V }
+          { x: L + 2 * B / 3, y: F - V },
+          { x: L + 5 * B / 6, y: F - V },
+          { x: L + B, y: F },
+          { x: L + 5 * B / 6, y: F + V },
+          { x: L + 2 * B / 3, y: F + V }
         ], O.label.x = O.x, O.label.y = O.y;
       }
     });
@@ -3978,17 +3980,17 @@ function Wc() {
   }
   function Ce(I) {
     var S = {};
-    return e.forEach(I, function(O, k) {
-      S[k.toLowerCase()] = O;
+    return e.forEach(I, function(O, A) {
+      S[A.toLowerCase()] = O;
     }), S;
   }
   return Kt;
 }
 var Yt, js;
-function Hc() {
+function Wc() {
   if (js) return Yt;
   js = 1;
-  var e = G(), a = H(), u = Y().Graph;
+  var e = G(), a = W(), u = Y().Graph;
   Yt = {
     debugOrdering: n
   };
@@ -4015,11 +4017,11 @@ var Xt, Ks;
 function jc() {
   return Ks || (Ks = 1, Xt = {
     graphlib: Y(),
-    layout: Wc(),
-    debug: Hc(),
+    layout: Hc(),
+    debug: Wc(),
     util: {
-      time: H().time,
-      notime: H().notime
+      time: W().time,
+      notime: W().notime
     },
     version: Vc()
   }), Xt;
@@ -4169,10 +4171,10 @@ function Zc(e) {
 function Uo(e) {
   return e ? _f(e) : !1;
 }
-function Wo(e, a) {
+function Ho(e, a) {
   return e.uid === X || Te(e) || ne(e) ? "success" : e.type.endsWith("SubflowGraphTask") ? "primary" : e.branchType == "ERROR" ? "danger" : e.branchType == "FINALLY" ? "warning" : a.has(e.uid) ? "blue" : "default";
 }
-function Ho(e, a, u, n) {
+function Wo(e, a, u, n) {
   if (n.some(
     (d) => e.source.startsWith(d) && e.target.startsWith(d)
   ) || u.includes(e.target) || e.source.startsWith(X) || e.target.startsWith(X))
@@ -4210,13 +4212,13 @@ function Vo(e, a, u) {
     /* FINALLY */
   ) ? "warning" : null;
 }
-function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
-  width: p(b),
-  height: v(b)
-})) {
-  const b = [], p = [ie + X];
+function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (p, v, g) => ({
+  width: v(p),
+  height: g(p)
+}), y = !0) {
+  const p = [], v = [ie + X];
   if (!n || r && !Uo(r)) {
-    console.warn("No flow graph or tasks found"), b.push({
+    console.warn("No flow graph or tasks found"), p.push({
       id: "start",
       type: "dot",
       position: { x: 0, y: 0 },
@@ -4228,7 +4230,7 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
       targetPosition: s ? z.Left : z.Top,
       parentNode: void 0,
       draggable: !1
-    }), b.push({
+    }), p.push({
       id: "end",
       type: "dot",
       position: s ? { x: 50, y: 0 } : { x: 0, y: 50 },
@@ -4240,7 +4242,7 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
       targetPosition: s ? z.Left : z.Top,
       parentNode: void 0,
       draggable: !1
-    }), b.push({
+    }), p.push({
       id: "start|end",
       source: "start",
       target: "end",
@@ -4258,130 +4260,130 @@ function Qc(e, a, u, n, r, t, s, i, f, d, o, c, h, l = (b, p, v) => ({
     });
     return;
   }
-  const v = Do(
+  const g = Do(
     n,
     t,
     s,
-    p,
+    v,
     i,
     f,
     d,
     l
-  ), g = {}, m = n.clusters || [], _ = m.map((q) => q.cluster), y = _.filter((q) => q.type.endsWith("SubflowGraphCluster")).map((q) => q.taskNode.uid), E = Object.fromEntries(
-    n.nodes.concat(d).map((q) => [q.uid, q])
+  ), m = {}, _ = n.clusters || [], b = _.map((E) => E.cluster), q = b.filter((E) => E.type.endsWith("SubflowGraphCluster")).map((E) => E.taskNode.uid), w = Object.fromEntries(
+    n.nodes.concat(d).map((E) => [E.uid, E])
   );
-  for (const q of m)
-    if (!i[q.cluster.uid] && !f.has(q.cluster.uid)) {
-      q.cluster.taskNode?.task?.type === "io.kestra.core.tasks.flows.Dag" && y.push(q.cluster.taskNode.uid);
-      for (const N of q.nodes)
-        g[N] = q.cluster;
-      const C = q.cluster.uid, T = v.node(C), x = q.parents ? q.parents[q.parents.length - 1] : void 0, A = jo(q.cluster);
-      b.push({
-        id: C,
+  for (const E of _)
+    if (!i[E.cluster.uid] && !f.has(E.cluster.uid)) {
+      E.cluster.taskNode?.task?.type === "io.kestra.core.tasks.flows.Dag" && q.push(E.cluster.taskNode.uid);
+      for (const P of E.nodes)
+        m[P] = E.cluster;
+      const T = E.cluster.uid, N = g.node(T), x = E.parents ? E.parents[E.parents.length - 1] : void 0, k = jo(E.cluster);
+      p.push({
+        id: T,
         type: "cluster",
         parentNode: x,
         position: he(
-          T,
-          x ? v.node(x) : void 0
+          N,
+          x ? g.node(x) : void 0
         ),
         style: {
-          width: C === X && s ? Z.TRIGGER_CLUSTER_WIDTH + "px" : T.width + "px",
-          height: C === X && !s ? Z.TRIGGER_CLUSTER_HEIGHT + "px" : T.height + "px"
+          width: T === X && s ? Z.TRIGGER_CLUSTER_WIDTH + "px" : N.width + "px",
+          height: T === X && !s ? Z.TRIGGER_CLUSTER_HEIGHT + "px" : N.height + "px"
         },
         data: {
           collapsable: !0,
-          color: A,
-          taskNode: q.cluster.taskNode,
-          unused: q.cluster.taskNode ? E[q.cluster.taskNode.uid].unused : !1
+          color: k,
+          taskNode: E.cluster.taskNode,
+          unused: E.cluster.taskNode ? w[E.cluster.taskNode.uid].unused : !1
         },
-        class: `ks-topology-${A}-border rounded p-2`
+        class: `ks-topology-${k}-border rounded p-2`
       });
     }
-  for (const q of n.nodes.concat(d))
-    if (!t.includes(q.uid)) {
-      const C = v.node(q.uid);
-      let T = "task";
-      Qt(q) ? T = "dot" : q.type.endsWith("CustomGraphNode") ? T = "custom" : q.type.includes("GraphTrigger") ? T = "trigger" : q.type === "collapsedcluster" && (T = "collapsedcluster");
-      const x = Wo(q, f), A = o || q.task?.type?.includes("$") || y.some(
-        (M) => q.uid.startsWith(M + ".")
-      ), N = g[q.uid], P = l(q, le, ve);
-      b.push({
-        id: q.uid,
-        type: T,
+  for (const E of n.nodes.concat(d))
+    if (!t.includes(E.uid)) {
+      const T = g.node(E.uid);
+      let N = "task";
+      Qt(E) ? N = "dot" : E.type.endsWith("CustomGraphNode") ? N = "custom" : E.type.includes("GraphTrigger") ? N = "trigger" : E.type === "collapsedcluster" && (N = "collapsedcluster");
+      const x = Ho(E, f), k = o || E.task?.type?.includes("$") || q.some(
+        (D) => E.uid.startsWith(D + ".")
+      ), P = m[E.uid], M = l(E, le, ve);
+      p.push({
+        id: E.uid,
+        type: N,
         position: he(
-          C,
-          N ? v.node(N.uid) : void 0
+          T,
+          P ? g.node(P.uid) : void 0
         ),
         style: {
-          width: P.width + "px",
-          height: P.height + "px"
+          width: M.width + "px",
+          height: M.height + "px"
         },
         sourcePosition: s ? z.Right : z.Bottom,
         targetPosition: s ? z.Left : z.Top,
-        parentNode: N ? N.uid : void 0,
-        draggable: T === "task" ? !A : !1,
+        parentNode: P ? P.uid : void 0,
+        draggable: N === "task" ? !k : !1,
         data: {
-          node: q,
-          parent: N || void 0,
-          namespace: N?.taskNode?.task?.namespace ?? u,
-          flowId: N?.taskNode?.task?.flowId ?? a,
-          isFlowable: N?.uid === ie + q.uid && !q.type.endsWith("SubflowGraphTask"),
+          node: E,
+          parent: P || void 0,
+          namespace: P?.taskNode?.task?.namespace ?? u,
+          flowId: P?.taskNode?.task?.flowId ?? a,
+          isFlowable: P?.uid === ie + E.uid && !E.type.endsWith("SubflowGraphTask"),
           color: x,
           expandable: zo(
-            q,
-            g,
+            E,
+            m,
             i,
             h
           ),
-          isReadOnly: A,
-          iconComponent: ne(q) ? "lightning-bolt" : null,
-          executionId: q.executionId,
-          unused: q.unused
+          isReadOnly: k,
+          iconComponent: ne(E) ? "lightning-bolt" : null,
+          executionId: E.executionId,
+          unused: E.unused
         },
-        class: q.type === "collapsedcluster" ? `ks-topology-${x}-border rounded` : ""
+        class: E.type === "collapsedcluster" ? `ks-topology-${x}-border rounded` : ""
       });
     }
-  const R = _.filter((q) => q.taskNode).map((q) => q.taskNode.uid), w = n.edges ?? [];
-  for (const q of w) {
-    const C = qi(
-      q.source,
-      q.target,
+  const R = b.filter((E) => E.taskNode).map((E) => E.taskNode.uid), C = n.edges ?? [];
+  for (const E of C) {
+    const T = qi(
+      E.source,
+      E.target,
       i,
       t
     );
-    if (C) {
-      const T = Vo(q, E, g), x = E[C.target]?.type ?? "", A = E[C.source]?.type ?? "";
-      let N;
-      typeof x == "string" && x.endsWith("GraphClusterRoot") ? N = "top" : typeof A == "string" && A.endsWith("GraphClusterEnd") && (N = "bottom"), b.push({
-        id: C.source + "|" + C.target,
-        source: C.source,
-        target: C.target,
+    if (T) {
+      const N = Vo(E, w, m), x = w[T.target]?.type ?? "", k = w[T.source]?.type ?? "";
+      let P;
+      typeof x == "string" && x.endsWith("GraphClusterRoot") ? P = "top" : typeof k == "string" && k.endsWith("GraphClusterEnd") && (P = "bottom"), p.push({
+        id: T.source + "|" + T.target,
+        source: T.source,
+        target: T.target,
         type: "edge",
-        markerEnd: Qt(E[C.target]) ? "" : {
-          id: "marker-" + (E[C.target].branchType ? E[C.target].branchType?.toLocaleLowerCase() : "custom"),
+        markerEnd: Qt(w[T.target]) ? "" : {
+          id: "marker-" + (w[T.target].branchType ? w[T.target].branchType?.toLocaleLowerCase() : "custom"),
           type: Zo.ArrowClosed,
-          color: T ? `var(--ks-border-${T})` : "var(--ks-topology-edge-color)"
+          color: N ? `var(--ks-border-${N})` : "var(--ks-topology-edge-color)"
         },
         data: {
-          haveAdd: !o && c && Ho(
-            q,
+          haveAdd: !o && c && Wo(
             E,
+            w,
             R,
-            y
+            q
           ),
-          edgeBoundary: N,
-          haveDashArray: E[q.source].type.endsWith("GraphTrigger") || E[q.target].type.endsWith("GraphTrigger") || q.source.startsWith(X),
-          color: T,
-          unused: q.unused
+          edgeBoundary: P,
+          haveDashArray: w[E.source].type.endsWith("GraphTrigger") || w[E.target].type.endsWith("GraphTrigger") || E.source.startsWith(X),
+          color: N,
+          unused: E.unused
         },
         style: {
           zIndex: 10
         },
-        animated: !0
+        animated: y
       });
     }
   }
-  return b;
+  return p;
 }
 function Qt(e) {
   return ["GraphClusterRoot", "GraphClusterFinally", "GraphClusterAfterExecution", "GraphClusterEnd"].some(
@@ -4446,7 +4448,7 @@ const oh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   getNodeWidth: le,
   getRootNodes: Jt,
   getTargetNodesEdges: Ko,
-  haveAdd: Ho,
+  haveAdd: Wo,
   isClusterRootOrEnd: Qt,
   isCollapsedCluster: ne,
   isCustomNode: Bo,
@@ -4454,7 +4456,7 @@ const oh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   isTaskNode: Ei,
   isTriggerNode: Te,
   linkedElements: Xc,
-  nodeColor: Wo,
+  nodeColor: Ho,
   predecessorsEdge: _i,
   predecessorsNode: bi,
   replaceIfCollapsed: qi,
@@ -4462,7 +4464,7 @@ const oh = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   successorsNode: yi
 }, Symbol.toStringTag, { value: "Module" }));
 export {
-  Wo as A,
+  Ho as A,
   _i as B,
   ie as C,
   bi as D,
@@ -4482,23 +4484,23 @@ export {
   Uo as f,
   Qc as g,
   Kf as h,
-  Do as i,
-  Vo as j,
-  ei as k,
+  Ei as i,
+  Do as j,
+  Vo as k,
   Xc as l,
-  ve as m,
-  he as n,
-  le as o,
-  Jt as p,
-  Ko as q,
+  ei as m,
+  ve as n,
+  he as o,
+  le as p,
+  Jt as q,
   Bf as r,
   Xf as s,
-  Ho as t,
-  Qt as u,
-  ne as v,
-  Bo as w,
-  zo as x,
-  Ei as y,
+  Ko as t,
+  Wo as u,
+  Qt as v,
+  ne as w,
+  Bo as x,
+  zo as y,
   Te as z
 };
-//# sourceMappingURL=VueFlowUtils-Ca_LeFFY.js.map
+//# sourceMappingURL=VueFlowUtils-l5Oh8tEj.js.map