@sme.up/ketchup2 2.0.0-SNAPSHOT-20250908152453 → 2.0.0-SNAPSHOT-20250909100819

package/dist/{architectureDiagram-KFL7JDKH-Dzqraep6.js → architectureDiagram-W76B3OCA-Bj05bf6s.js}

@@ -1,6 +1,6 @@
-import { aH as ke, _ as dt, H as Ze, V as qe, l as Se, b as Qe, a as Je, p as Ke, q as je, g as _e, s as tr, y as er, D as rr, E as ir, F as ar, c as Ee, ak as me, aI as pe, i as nr, d as or, aJ as sr, aK as hr } from "./index-VJw3klPt.js";
-import { p as lr } from "./chunk-ANTBXLJU-BdaEgFx7.js";
-import { p as fr } from "./mermaid-parser.core-BnvQOoyE.js";
+import { aJ as Ze, _ as dt, H as ke, V as qe, l as Se, b as Qe, a as Je, p as Ke, q as je, g as _e, s as tr, y as er, D as rr, E as ir, F as ar, c as Ee, am as me, aK as pe, i as nr, d as or, aL as sr, aM as hr } from "./index-kj0EuvQM.js";
+import { p as lr } from "./chunk-4BX2VUAB-Dc8D0um4.js";
+import { p as fr } from "./mermaid-parser.core-Blpz4SbD.js";
 import { c as Fe } from "./cytoscape.esm-CamnA8MN.js";
 var he = { exports: {} }, le = { exports: {} }, fe = { exports: {} }, cr = fe.exports, we;
 function gr() {
@@ -366,14 +366,14 @@ function gr() {
               }
               return c == h.MAX_VALUE ? null : (L[0].getParent().paddingLeft != null ? v = L[0].getParent().paddingLeft : v = this.margin, this.left = l - v, this.top = c - v, new g(this.left, this.top));
             }, o.prototype.updateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, Z, Y = this.nodes, K = Y.length, O = 0; O < K; O++) {
+              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, k, Y = this.nodes, K = Y.length, O = 0; O < K; O++) {
                 var it = Y[O];
                 c && it.child != null && it.updateBounds(), L = it.getLeft(), b = it.getRight(), C = it.getTop(), G = it.getBottom(), l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
               }
               var n = new i(l, d, T - l, v - d);
-              l == h.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), Y[0].getParent().paddingLeft != null ? Z = Y[0].getParent().paddingLeft : Z = this.margin, this.left = n.x - Z, this.right = n.x + n.width + Z, this.top = n.y - Z, this.bottom = n.y + n.height + Z;
+              l == h.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), Y[0].getParent().paddingLeft != null ? k = Y[0].getParent().paddingLeft : k = this.margin, this.left = n.x - k, this.right = n.x + n.width + k, this.top = n.y - k, this.bottom = n.y + n.height + k;
             }, o.calculateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, Z = c.length, Y = 0; Y < Z; Y++) {
+              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, k = c.length, Y = 0; Y < k; Y++) {
                 var K = c[Y];
                 L = K.getLeft(), b = K.getRight(), C = K.getTop(), G = K.getBottom(), l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
               }
@@ -403,8 +403,8 @@ function gr() {
               }); l.length !== 0; ) {
                 d = l.shift(), v = d.getEdges();
                 for (var C = v.length, G = 0; G < C; G++) {
-                  var Z = v[G];
-                  if (L = Z.getOtherEndInGraph(d, this), L != null && !T.has(L)) {
+                  var k = v[G];
+                  if (L = k.getOtherEndInGraph(d, this), L != null && !T.has(L)) {
                     var Y = L.withChildren();
                     Y.forEach(function(O) {
                       l.push(O), T.add(O);
@@ -637,7 +637,7 @@ function gr() {
               var f = a.getCenterX(), i = a.getCenterY(), g = e.getCenterX(), t = e.getCenterY();
               if (a.intersects(e))
                 return r[0] = f, r[1] = i, r[2] = g, r[3] = t, !0;
-              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), d = a.getRight(), v = a.getWidthHalf(), L = a.getHeightHalf(), b = e.getX(), C = e.getY(), G = e.getRight(), Z = e.getX(), Y = e.getBottom(), K = e.getRight(), O = e.getWidthHalf(), it = e.getHeightHalf(), n = !1, m = !1;
+              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), d = a.getRight(), v = a.getWidthHalf(), L = a.getHeightHalf(), b = e.getX(), C = e.getY(), G = e.getRight(), k = e.getX(), Y = e.getBottom(), K = e.getRight(), O = e.getWidthHalf(), it = e.getHeightHalf(), n = !1, m = !1;
               if (f === g) {
                 if (i > t)
                   return r[0] = f, r[1] = s, r[2] = g, r[3] = Y, !1;
@@ -650,7 +650,7 @@ function gr() {
                   return r[0] = c, r[1] = i, r[2] = b, r[3] = t, !1;
               } else {
                 var p = a.height / a.width, E = e.height / e.width, y = (t - i) / (g - f), R = void 0, M = void 0, S = void 0, W = void 0, D = void 0, q = void 0;
-                if (-p === y ? f > g ? (r[0] = l, r[1] = T, n = !0) : (r[0] = c, r[1] = s, n = !0) : p === y && (f > g ? (r[0] = o, r[1] = s, n = !0) : (r[0] = d, r[1] = T, n = !0)), -E === y ? g > f ? (r[2] = Z, r[3] = Y, m = !0) : (r[2] = G, r[3] = C, m = !0) : E === y && (g > f ? (r[2] = b, r[3] = C, m = !0) : (r[2] = K, r[3] = Y, m = !0)), n && m)
+                if (-p === y ? f > g ? (r[0] = l, r[1] = T, n = !0) : (r[0] = c, r[1] = s, n = !0) : p === y && (f > g ? (r[0] = o, r[1] = s, n = !0) : (r[0] = d, r[1] = T, n = !0)), -E === y ? g > f ? (r[2] = k, r[3] = Y, m = !0) : (r[2] = G, r[3] = C, m = !0) : E === y && (g > f ? (r[2] = b, r[3] = C, m = !0) : (r[2] = K, r[3] = Y, m = !0)), n && m)
                   return !1;
                 if (f > g ? i > t ? (R = this.getCardinalDirection(p, y, 4), M = this.getCardinalDirection(E, y, 2)) : (R = this.getCardinalDirection(-p, y, 3), M = this.getCardinalDirection(-E, y, 1)) : i > t ? (R = this.getCardinalDirection(-p, y, 1), M = this.getCardinalDirection(-E, y, 3)) : (R = this.getCardinalDirection(p, y, 2), M = this.getCardinalDirection(E, y, 4)), !n)
                   switch (R) {
@@ -679,7 +679,7 @@ function gr() {
                       q = Y, D = g + it / y, r[2] = D, r[3] = q;
                       break;
                     case 4:
-                      D = Z, q = t + -O * y, r[2] = D, r[3] = q;
+                      D = k, q = t + -O * y, r[2] = D, r[3] = q;
                       break;
                   }
               }
@@ -689,8 +689,8 @@ function gr() {
             }, h.getIntersection = function(a, e, r, f) {
               if (f == null)
                 return this.getIntersection2(a, e, r);
-              var i = a.x, g = a.y, t = e.x, o = e.y, s = r.x, c = r.y, l = f.x, T = f.y, d = void 0, v = void 0, L = void 0, b = void 0, C = void 0, G = void 0, Z = void 0, Y = void 0, K = void 0;
-              return L = o - g, C = i - t, Z = t * g - i * o, b = T - c, G = s - l, Y = l * c - s * T, K = L * G - b * C, K === 0 ? null : (d = (C * Y - G * Z) / K, v = (b * Z - L * Y) / K, new u(d, v));
+              var i = a.x, g = a.y, t = e.x, o = e.y, s = r.x, c = r.y, l = f.x, T = f.y, d = void 0, v = void 0, L = void 0, b = void 0, C = void 0, G = void 0, k = void 0, Y = void 0, K = void 0;
+              return L = o - g, C = i - t, k = t * g - i * o, b = T - c, G = s - l, Y = l * c - s * T, K = L * G - b * C, K === 0 ? null : (d = (C * Y - G * k) / K, v = (b * k - L * Y) / K, new u(d, v));
             }, h.angleOfVector = function(a, e, r, f) {
               var i = void 0;
               return a !== r ? (i = Math.atan((f - e) / (r - a)), r < a ? i += Math.PI : f < e && (i += this.TWO_PI)) : f < e ? i = this.ONE_AND_HALF_PI : i = this.HALF_PI, i;
@@ -1037,8 +1037,8 @@ function gr() {
                 for (L.push(C[0]); L.length > 0 && c; ) {
                   var G = L[0];
                   L.splice(0, 1), v.add(G);
-                  for (var Z = G.getEdges(), d = 0; d < Z.length; d++) {
-                    var Y = Z[d].getOtherEnd(G);
+                  for (var k = G.getEdges(), d = 0; d < k.length; d++) {
+                    var Y = k[d].getOtherEnd(G);
                     if (b.get(G) != Y)
                       if (!v.has(Y))
                         L.push(Y), b.set(Y, G);
@@ -1109,8 +1109,8 @@ function gr() {
               }
               var G = [];
               for (G = G.concat(l); !d; ) {
-                var Z = [];
-                Z = Z.concat(G), G = [];
+                var k = [];
+                k = k.concat(G), G = [];
                 for (var L = 0; L < c.length; L++) {
                   var b = c[L], Y = c.indexOf(b);
                   Y >= 0 && c.splice(Y, 1);
@@ -1246,13 +1246,13 @@ function gr() {
                 return;
               l = t.getLength(), l != 0 && (T = t.edgeElasticity * (l - o), d = T * (t.lengthX / l), v = T * (t.lengthY / l), s.springForceX += d, s.springForceY += v, c.springForceX -= d, c.springForceY -= v);
             }, i.prototype.calcRepulsionForce = function(t, o) {
-              var s = t.getRect(), c = o.getRect(), l = new Array(2), T = new Array(4), d, v, L, b, C, G, Z;
+              var s = t.getRect(), c = o.getRect(), l = new Array(2), T = new Array(4), d, v, L, b, C, G, k;
               if (s.intersects(c)) {
-                r.calcSeparationAmount(s, c, l, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * l[0], Z = 2 * l[1];
+                r.calcSeparationAmount(s, c, l, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * l[0], k = 2 * l[1];
                 var Y = t.noOfChildren * o.noOfChildren / (t.noOfChildren + o.noOfChildren);
-                t.repulsionForceX -= Y * G, t.repulsionForceY -= Y * Z, o.repulsionForceX += Y * G, o.repulsionForceY += Y * Z;
+                t.repulsionForceX -= Y * G, t.repulsionForceY -= Y * k, o.repulsionForceX += Y * G, o.repulsionForceY += Y * k;
               } else
-                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (d = c.getCenterX() - s.getCenterX(), v = c.getCenterY() - s.getCenterY()) : (r.getIntersection(s, c, T), d = T[2] - T[0], v = T[3] - T[1]), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), Math.abs(v) < a.MIN_REPULSION_DIST && (v = f.sign(v) * a.MIN_REPULSION_DIST), L = d * d + v * v, b = Math.sqrt(L), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / L, G = C * d / b, Z = C * v / b, t.repulsionForceX -= G, t.repulsionForceY -= Z, o.repulsionForceX += G, o.repulsionForceY += Z;
+                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (d = c.getCenterX() - s.getCenterX(), v = c.getCenterY() - s.getCenterY()) : (r.getIntersection(s, c, T), d = T[2] - T[0], v = T[3] - T[1]), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), Math.abs(v) < a.MIN_REPULSION_DIST && (v = f.sign(v) * a.MIN_REPULSION_DIST), L = d * d + v * v, b = Math.sqrt(L), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / L, G = C * d / b, k = C * v / b, t.repulsionForceX -= G, t.repulsionForceY -= k, o.repulsionForceX += G, o.repulsionForceY += k;
             }, i.prototype.calcGravitationalForce = function(t) {
               var o, s, c, l, T, d, v, L;
               o = t.getOwner(), s = (o.getRight() + o.getLeft()) / 2, c = (o.getTop() + o.getBottom()) / 2, l = t.getCenterX() - s, T = t.getCenterY() - c, d = Math.abs(l) + t.getWidth() / 2, v = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (L = o.getEstimatedSize() * this.gravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * l, t.gravitationForceY = -this.gravityConstant * T)) : (L = o.getEstimatedSize() * this.compoundGravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * l * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
@@ -1618,8 +1618,8 @@ function gr() {
                     for (var C = t + 1; C < this.m; C++)
                       r[C] = 0;
                     for (var G = t + 1; G < this.n; G++)
-                      for (var Z = t + 1; Z < this.m; Z++)
-                        r[Z] += e[G] * h[Z][G];
+                      for (var k = t + 1; k < this.m; k++)
+                        r[k] += e[G] * h[k][G];
                     for (var Y = t + 1; Y < this.n; Y++)
                       for (var K = -e[Y] / e[t + 1], O = t + 1; O < this.m; O++)
                         h[O][Y] += K * r[O];
@@ -1718,10 +1718,10 @@ function gr() {
                     break;
                   case 3:
                     {
-                      var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(e[n - 2])), Math.abs(this.s[Q])), Math.abs(e[Q])), Vt = this.s[n - 1] / Yt, F = this.s[n - 2] / Yt, U = e[n - 2] / Yt, $ = this.s[Q] / Yt, J = e[Q] / Yt, k = ((F + Vt) * (F - Vt) + U * U) / 2, at = Vt * U * (Vt * U), ct = 0;
+                      var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(e[n - 2])), Math.abs(this.s[Q])), Math.abs(e[Q])), Vt = this.s[n - 1] / Yt, F = this.s[n - 2] / Yt, U = e[n - 2] / Yt, $ = this.s[Q] / Yt, J = e[Q] / Yt, Z = ((F + Vt) * (F - Vt) + U * U) / 2, at = Vt * U * (Vt * U), ct = 0;
                       /* @__PURE__ */ (function(Tt, Ct) {
                         return Tt || Ct;
-                      })(k !== 0, at !== 0) && (ct = Math.sqrt(k * k + at), k < 0 && (ct = -ct), ct = at / (k + ct));
+                      })(Z !== 0, at !== 0) && (ct = Math.sqrt(Z * Z + at), Z < 0 && (ct = -ct), ct = at / (Z + ct));
                       for (var nt = ($ + Vt) * ($ - Vt) + ct, tt = $ * J, j = Q; j < n - 1; j++) {
                         var ut = u.hypot(nt, tt), Mt = nt / ut, pt = tt / ut;
                         j !== Q && (e[j - 1] = ut), nt = Mt * this.s[j] + pt * e[j], e[j] = Mt * e[j] - pt * this.s[j], tt = pt * this.s[j + 1], this.s[j + 1] = Mt * this.s[j + 1];
@@ -1985,7 +1985,7 @@ function dr() {
             765: (
               /***/
               (a, e, r) => {
-                var f = r(551).FDLayout, i = r(578), g = r(880), t = r(991), o = r(767), s = r(806), c = r(902), l = r(551).FDLayoutConstants, T = r(551).LayoutConstants, d = r(551).Point, v = r(551).PointD, L = r(551).DimensionD, b = r(551).Layout, C = r(551).Integer, G = r(551).IGeometry, Z = r(551).LGraph, Y = r(551).Transform, K = r(551).LinkedList;
+                var f = r(551).FDLayout, i = r(578), g = r(880), t = r(991), o = r(767), s = r(806), c = r(902), l = r(551).FDLayoutConstants, T = r(551).LayoutConstants, d = r(551).Point, v = r(551).PointD, L = r(551).DimensionD, b = r(551).Layout, C = r(551).Integer, G = r(551).IGeometry, k = r(551).LGraph, Y = r(551).Transform, K = r(551).LinkedList;
                 function O() {
                   f.call(this), this.toBeTiled = {}, this.constraints = {};
                 }
@@ -2327,7 +2327,7 @@ function dr() {
                 }, O.radialLayout = function(n, m, p) {
                   var E = Math.max(this.maxDiagonalInTree(n), s.DEFAULT_RADIAL_SEPARATION);
                   O.branchRadialLayout(m, null, 0, 359, 0, E);
-                  var y = Z.calculateBounds(n), R = new Y();
+                  var y = k.calculateBounds(n), R = new Y();
                   R.setDeviceOrgX(y.getMinX()), R.setDeviceOrgY(y.getMinY()), R.setWorldOrgX(p.x), R.setWorldOrgY(p.y);
                   for (var M = 0; M < n.length; M++) {
                     var S = n[M];
@@ -2701,8 +2701,8 @@ function dr() {
                   var l = {};
                   l.fixedNodeConstraint = c.constraints.fixedNodeConstraint, l.alignmentConstraint = c.constraints.alignmentConstraint, l.relativePlacementConstraint = c.constraints.relativePlacementConstraint;
                   for (var T = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), v = [], L = [], b = c.getAllNodes(), C = 0, G = 0; G < b.length; G++) {
-                    var Z = b[G];
-                    Z.getChild() == null && (d.set(Z.id, C++), v.push(Z.getCenterX()), L.push(Z.getCenterY()), T.set(Z.id, Z));
+                    var k = b[G];
+                    k.getChild() == null && (d.set(k.id, C++), v.push(k.getCenterX()), L.push(k.getCenterY()), T.set(k.id, k));
                   }
                   l.relativePlacementConstraint && l.relativePlacementConstraint.forEach(function(F) {
                     !F.gap && F.gap != 0 && (F.left ? F.gap = i.DEFAULT_EDGE_LENGTH + T.get(F.left).getWidth() / 2 + T.get(F.right).getWidth() / 2 : F.gap = i.DEFAULT_EDGE_LENGTH + T.get(F.top).getHeight() / 2 + T.get(F.bottom).getHeight() / 2);
@@ -2711,10 +2711,10 @@ function dr() {
                     return { x: U.x - $.x, y: U.y - $.y };
                   }, K = function(U) {
                     var $ = 0, J = 0;
-                    return U.forEach(function(k) {
-                      $ += v[d.get(k)], J += L[d.get(k)];
+                    return U.forEach(function(Z) {
+                      $ += v[d.get(Z)], J += L[d.get(Z)];
                     }), { x: $ / U.size, y: J / U.size };
-                  }, O = function(U, $, J, k, at) {
+                  }, O = function(U, $, J, Z, at) {
                     function ct(lt, ot) {
                       var Lt = new Set(lt), ft = !0, st = !1, Xt = void 0;
                       try {
@@ -2744,7 +2744,7 @@ function dr() {
                     });
                     var tt = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), ut = new g();
                     nt.forEach(function(lt, ot) {
-                      lt == 0 ? (ut.push(ot), J || ($ == "horizontal" ? tt.set(ot, d.has(ot) ? v[d.get(ot)] : k.get(ot)) : tt.set(ot, d.has(ot) ? L[d.get(ot)] : k.get(ot)))) : tt.set(ot, Number.NEGATIVE_INFINITY), J && j.set(ot, /* @__PURE__ */ new Set([ot]));
+                      lt == 0 ? (ut.push(ot), J || ($ == "horizontal" ? tt.set(ot, d.has(ot) ? v[d.get(ot)] : Z.get(ot)) : tt.set(ot, d.has(ot) ? L[d.get(ot)] : Z.get(ot)))) : tt.set(ot, Number.NEGATIVE_INFINITY), J && j.set(ot, /* @__PURE__ */ new Set([ot]));
                     }), J && at.forEach(function(lt) {
                       var ot = [];
                       if (lt.forEach(function(st) {
@@ -2752,14 +2752,14 @@ function dr() {
                       }), ot.length > 0) {
                         var Lt = 0;
                         ot.forEach(function(st) {
-                          $ == "horizontal" ? (tt.set(st, d.has(st) ? v[d.get(st)] : k.get(st)), Lt += tt.get(st)) : (tt.set(st, d.has(st) ? L[d.get(st)] : k.get(st)), Lt += tt.get(st));
+                          $ == "horizontal" ? (tt.set(st, d.has(st) ? v[d.get(st)] : Z.get(st)), Lt += tt.get(st)) : (tt.set(st, d.has(st) ? L[d.get(st)] : Z.get(st)), Lt += tt.get(st));
                         }), Lt = Lt / ot.length, lt.forEach(function(st) {
                           J.has(st) || tt.set(st, Lt);
                         });
                       } else {
                         var ft = 0;
                         lt.forEach(function(st) {
-                          $ == "horizontal" ? ft += d.has(st) ? v[d.get(st)] : k.get(st) : ft += d.has(st) ? L[d.get(st)] : k.get(st);
+                          $ == "horizontal" ? ft += d.has(st) ? v[d.get(st)] : Z.get(st) : ft += d.has(st) ? L[d.get(st)] : Z.get(st);
                         }), ft = ft / lt.length, lt.forEach(function(st) {
                           tt.set(st, ft);
                         });
@@ -2771,7 +2771,7 @@ function dr() {
                         if (tt.get(ft.id) < tt.get(ot) + ft.gap)
                           if (J && J.has(ft.id)) {
                             var st = void 0;
-                            if ($ == "horizontal" ? st = d.has(ft.id) ? v[d.get(ft.id)] : k.get(ft.id) : st = d.has(ft.id) ? L[d.get(ft.id)] : k.get(ft.id), tt.set(ft.id, st), st < tt.get(ot) + ft.gap) {
+                            if ($ == "horizontal" ? st = d.has(ft.id) ? v[d.get(ft.id)] : Z.get(ft.id) : st = d.has(ft.id) ? L[d.get(ft.id)] : Z.get(ft.id), tt.set(ft.id, st), st < tt.get(ot) + ft.gap) {
                               var Xt = tt.get(ot) + ft.gap - st;
                               j.get(ot).forEach(function(Tt) {
                                 tt.set(Tt, tt.get(Tt) - Xt);
@@ -2809,8 +2809,8 @@ function dr() {
                           }
                           if (!Lt) {
                             var bt = !1, zt = void 0;
-                            xt.forEach(function(St, kt) {
-                              St.has([].concat(f(lt))[0]) && (bt = !0, zt = kt);
+                            xt.forEach(function(St, Zt) {
+                              St.has([].concat(f(lt))[0]) && (bt = !0, zt = Zt);
                             }), bt ? lt.forEach(function(St) {
                               xt[zt].add(St);
                             }) : xt.push(new Set(lt));
@@ -2820,10 +2820,10 @@ function dr() {
                         var Lt = Number.POSITIVE_INFINITY, ft = Number.POSITIVE_INFINITY, st = Number.NEGATIVE_INFINITY, Xt = Number.NEGATIVE_INFINITY, Tt = !0, Ct = !1, Bt = void 0;
                         try {
                           for (var bt = lt[Symbol.iterator](), zt; !(Tt = (zt = bt.next()).done); Tt = !0) {
-                            var St = zt.value, kt = void 0;
-                            $ == "horizontal" ? kt = d.has(St) ? v[d.get(St)] : k.get(St) : kt = d.has(St) ? L[d.get(St)] : k.get(St);
+                            var St = zt.value, Zt = void 0;
+                            $ == "horizontal" ? Zt = d.has(St) ? v[d.get(St)] : Z.get(St) : Zt = d.has(St) ? L[d.get(St)] : Z.get(St);
                             var Kt = tt.get(St);
-                            kt < Lt && (Lt = kt), kt > st && (st = kt), Kt < ft && (ft = Kt), Kt > Xt && (Xt = Kt);
+                            Zt < Lt && (Lt = Zt), Zt > st && (st = Zt), Kt < ft && (ft = Kt), Kt > Xt && (Xt = Kt);
                           }
                         } catch (ee) {
                           Ct = !0, Bt = ee;
@@ -2855,29 +2855,29 @@ function dr() {
                     }
                     return tt;
                   }, it = function(U) {
-                    var $ = 0, J = 0, k = 0, at = 0;
+                    var $ = 0, J = 0, Z = 0, at = 0;
                     if (U.forEach(function(j) {
-                      j.left ? v[d.get(j.left)] - v[d.get(j.right)] >= 0 ? $++ : J++ : L[d.get(j.top)] - L[d.get(j.bottom)] >= 0 ? k++ : at++;
-                    }), $ > J && k > at)
+                      j.left ? v[d.get(j.left)] - v[d.get(j.right)] >= 0 ? $++ : J++ : L[d.get(j.top)] - L[d.get(j.bottom)] >= 0 ? Z++ : at++;
+                    }), $ > J && Z > at)
                       for (var ct = 0; ct < d.size; ct++)
                         v[ct] = -1 * v[ct], L[ct] = -1 * L[ct];
                     else if ($ > J)
                       for (var nt = 0; nt < d.size; nt++)
                         v[nt] = -1 * v[nt];
-                    else if (k > at)
+                    else if (Z > at)
                       for (var tt = 0; tt < d.size; tt++)
                         L[tt] = -1 * L[tt];
                   }, n = function(U) {
-                    var $ = [], J = new g(), k = /* @__PURE__ */ new Set(), at = 0;
+                    var $ = [], J = new g(), Z = /* @__PURE__ */ new Set(), at = 0;
                     return U.forEach(function(ct, nt) {
-                      if (!k.has(nt)) {
+                      if (!Z.has(nt)) {
                         $[at] = [];
                         var tt = nt;
-                        for (J.push(tt), k.add(tt), $[at].push(tt); J.length != 0; ) {
+                        for (J.push(tt), Z.add(tt), $[at].push(tt); J.length != 0; ) {
                           tt = J.shift();
                           var j = U.get(tt);
                           j.forEach(function(ut) {
-                            k.has(ut.id) || (J.push(ut.id), k.add(ut.id), $[at].push(ut.id));
+                            Z.has(ut.id) || (J.push(ut.id), Z.add(ut.id), $[at].push(ut.id));
                           });
                         }
                         at++;
@@ -2885,20 +2885,20 @@ function dr() {
                     }), $;
                   }, m = function(U) {
                     var $ = /* @__PURE__ */ new Map();
-                    return U.forEach(function(J, k) {
-                      $.set(k, []);
-                    }), U.forEach(function(J, k) {
+                    return U.forEach(function(J, Z) {
+                      $.set(Z, []);
+                    }), U.forEach(function(J, Z) {
                       J.forEach(function(at) {
-                        $.get(k).push(at), $.get(at.id).push({ id: k, gap: at.gap, direction: at.direction });
+                        $.get(Z).push(at), $.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
                       });
                     }), $;
                   }, p = function(U) {
                     var $ = /* @__PURE__ */ new Map();
-                    return U.forEach(function(J, k) {
-                      $.set(k, []);
-                    }), U.forEach(function(J, k) {
+                    return U.forEach(function(J, Z) {
+                      $.set(Z, []);
+                    }), U.forEach(function(J, Z) {
                       J.forEach(function(at) {
-                        $.get(at.id).push({ id: k, gap: at.gap, direction: at.direction });
+                        $.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
                       });
                     }), $;
                   }, E = [], y = [], R = !1, M = !1, S = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), q = [];
@@ -2931,18 +2931,18 @@ function dr() {
                           R = !0;
                         }
                         if (l.alignmentConstraint.horizontal) {
-                          for (var k = l.alignmentConstraint.horizontal, at = function(tt) {
+                          for (var Z = l.alignmentConstraint.horizontal, at = function(tt) {
                             var j = /* @__PURE__ */ new Set();
-                            k[tt].forEach(function(pt) {
+                            Z[tt].forEach(function(pt) {
                               j.add(pt);
                             });
                             var ut = new Set([].concat(f(j)).filter(function(pt) {
                               return S.has(pt);
                             })), Mt = void 0;
-                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = K(j).y, k[tt].forEach(function(pt) {
+                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = K(j).y, Z[tt].forEach(function(pt) {
                               E[F] = [v[d.get(pt)], Mt], y[F] = [v[d.get(pt)], L[d.get(pt)]], F++;
                             });
-                          }, ct = 0; ct < k.length; ct++)
+                          }, ct = 0; ct < Z.length; ct++)
                             at(ct);
                           R = !0;
                         }
@@ -2982,8 +2982,8 @@ function dr() {
                     if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 0) {
                       var Et = { x: 0, y: 0 };
                       l.fixedNodeConstraint.forEach(function(F, U) {
-                        var $ = { x: v[d.get(F.nodeId)], y: L[d.get(F.nodeId)] }, J = F.position, k = Y(J, $);
-                        Et.x += k.x, Et.y += k.y;
+                        var $ = { x: v[d.get(F.nodeId)], y: L[d.get(F.nodeId)] }, J = F.position, Z = Y(J, $);
+                        Et.x += Z.x, Et.y += Z.y;
                       }), Et.x /= l.fixedNodeConstraint.length, Et.y /= l.fixedNodeConstraint.length, v.forEach(function(F, U) {
                         v[U] += Et.x;
                       }), L.forEach(function(F, U) {
@@ -3001,9 +3001,9 @@ function dr() {
                           });
                           var J = new Set([].concat(f($)).filter(function(at) {
                             return S.has(at);
-                          })), k = void 0;
-                          J.size > 0 ? k = v[d.get(J.values().next().value)] : k = K($).x, $.forEach(function(at) {
-                            S.has(at) || (v[d.get(at)] = k);
+                          })), Z = void 0;
+                          J.size > 0 ? Z = v[d.get(J.values().next().value)] : Z = K($).x, $.forEach(function(at) {
+                            S.has(at) || (v[d.get(at)] = Z);
                           });
                         }, Ht = 0; Ht < Dt.length; Ht++)
                           Rt(Ht);
@@ -3015,15 +3015,15 @@ function dr() {
                           });
                           var J = new Set([].concat(f($)).filter(function(at) {
                             return S.has(at);
-                          })), k = void 0;
-                          J.size > 0 ? k = L[d.get(J.values().next().value)] : k = K($).y, $.forEach(function(at) {
-                            S.has(at) || (L[d.get(at)] = k);
+                          })), Z = void 0;
+                          J.size > 0 ? Z = L[d.get(J.values().next().value)] : Z = K($).y, $.forEach(function(at) {
+                            S.has(at) || (L[d.get(at)] = Z);
                           });
                         }, Ft = 0; Ft < Ut.length; Ft++)
                           Pt(Ft);
                     }
                     l.relativePlacementConstraint && function() {
-                      var F = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
+                      var F = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
                       if (S.forEach(function(Gt) {
                         ct.add(Gt), nt.add(Gt);
                       }), l.alignmentConstraint) {
@@ -3031,7 +3031,7 @@ function dr() {
                           for (var tt = l.alignmentConstraint.vertical, j = function(yt) {
                             $.set("dummy" + yt, []), tt[yt].forEach(function(wt) {
                               F.set(wt, "dummy" + yt), $.get("dummy" + yt).push(wt), S.has(wt) && ct.add("dummy" + yt);
-                            }), k.set("dummy" + yt, v[d.get(tt[yt][0])]);
+                            }), Z.set("dummy" + yt, v[d.get(tt[yt][0])]);
                           }, ut = 0; ut < tt.length; ut++)
                             j(ut);
                         if (l.alignmentConstraint.horizontal)
@@ -3044,8 +3044,8 @@ function dr() {
                       }
                       var lt = /* @__PURE__ */ new Map(), ot = /* @__PURE__ */ new Map(), Lt = function(yt) {
                         W.get(yt).forEach(function(wt) {
-                          var Zt = void 0, $t = void 0;
-                          wt.direction == "horizontal" ? (Zt = F.get(yt) ? F.get(yt) : yt, F.get(wt.id) ? $t = { id: F.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, lt.has(Zt) ? lt.get(Zt).push($t) : lt.set(Zt, [$t]), lt.has($t.id) || lt.set($t.id, [])) : (Zt = U.get(yt) ? U.get(yt) : yt, U.get(wt.id) ? $t = { id: U.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, ot.has(Zt) ? ot.get(Zt).push($t) : ot.set(Zt, [$t]), ot.has($t.id) || ot.set($t.id, []));
+                          var kt = void 0, $t = void 0;
+                          wt.direction == "horizontal" ? (kt = F.get(yt) ? F.get(yt) : yt, F.get(wt.id) ? $t = { id: F.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, lt.has(kt) ? lt.get(kt).push($t) : lt.set(kt, [$t]), lt.has($t.id) || lt.set($t.id, [])) : (kt = U.get(yt) ? U.get(yt) : yt, U.get(wt.id) ? $t = { id: U.get(wt.id), gap: wt.gap, direction: wt.direction } : $t = wt, ot.has(kt) ? ot.get(kt).push($t) : ot.set(kt, [$t]), ot.has($t.id) || ot.set($t.id, []));
                         });
                       }, ft = !0, st = !1, Xt = void 0;
                       try {
@@ -3063,17 +3063,17 @@ function dr() {
                             throw Xt;
                         }
                       }
-                      var bt = m(lt), zt = m(ot), St = n(bt), kt = n(zt), Kt = p(lt), ce = p(ot), Qt = [], jt = [];
+                      var bt = m(lt), zt = m(ot), St = n(bt), Zt = n(zt), Kt = p(lt), ce = p(ot), Qt = [], jt = [];
                       St.forEach(function(Gt, yt) {
                         Qt[yt] = [], Gt.forEach(function(wt) {
                           Kt.get(wt).length == 0 && Qt[yt].push(wt);
                         });
-                      }), kt.forEach(function(Gt, yt) {
+                      }), Zt.forEach(function(Gt, yt) {
                         jt[yt] = [], Gt.forEach(function(wt) {
                           ce.get(wt).length == 0 && jt[yt].push(wt);
                         });
                       });
-                      var _t = O(lt, "horizontal", ct, k, Qt), Jt = O(ot, "vertical", nt, at, jt), oe = function(yt) {
+                      var _t = O(lt, "horizontal", ct, Z, Qt), Jt = O(ot, "vertical", nt, at, jt), oe = function(yt) {
                         $.get(yt) ? $.get(yt).forEach(function(wt) {
                           v[d.get(wt)] = _t.get(yt);
                         }) : v[d.get(yt)] = _t.get(yt);
@@ -3221,7 +3221,7 @@ function pr() {
                   });
                   return c;
                 }, g.connectComponents = function(t, o, s, c) {
-                  var l = new i(), T = /* @__PURE__ */ new Set(), d = [], v = void 0, L = void 0, b = void 0, C = !1, G = 1, Z = [], Y = [], K = function() {
+                  var l = new i(), T = /* @__PURE__ */ new Set(), d = [], v = void 0, L = void 0, b = void 0, C = !1, G = 1, k = [], Y = [], K = function() {
                     var it = t.collection();
                     Y.push(it);
                     var n = s[0], m = t.collection();
@@ -3252,7 +3252,7 @@ function pr() {
                     }), d.length == s.length && (C = !0), !C || C && G > 1) {
                       L = d[0], b = L.connectedEdges().length, d.forEach(function(y) {
                         y.connectedEdges().length < b && (b = y.connectedEdges().length, L = y);
-                      }), Z.push(L.id());
+                      }), k.push(L.id());
                       var E = t.collection();
                       E.merge(d[0]), d.forEach(function(y) {
                         E.merge(y);
@@ -3262,7 +3262,7 @@ function pr() {
                   do
                     K();
                   while (!C);
-                  return c && Z.length > 0 && c.set("dummy" + (c.size + 1), Z), Y;
+                  return c && k.length > 0 && c.set("dummy" + (c.size + 1), k), Y;
                 }, g.relocateComponent = function(t, o, s) {
                   if (!s.fixedNodeConstraint) {
                     var c = Number.POSITIVE_INFINITY, l = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, d = Number.NEGATIVE_INFINITY;
@@ -3270,7 +3270,7 @@ function pr() {
                       var v = !0, L = !1, b = void 0;
                       try {
                         for (var C = o.nodeIndexes[Symbol.iterator](), G; !(v = (G = C.next()).done); v = !0) {
-                          var Z = G.value, Y = f(Z, 2), K = Y[0], O = Y[1], it = s.cy.getElementById(K);
+                          var k = G.value, Y = f(k, 2), K = Y[0], O = Y[1], it = s.cy.getElementById(K);
                           if (it) {
                             var n = it.boundingBox(), m = o.xCoords[O] - n.w / 2, p = o.xCoords[O] + n.w / 2, E = o.yCoords[O] - n.h / 2, y = o.yCoords[O] + n.h / 2;
                             m < c && (c = m), p > l && (l = p), E < T && (T = E), y > d && (d = y);
@@ -3305,8 +3305,8 @@ function pr() {
                     }
                   }
                 }, g.calcBoundingBox = function(t, o, s, c) {
-                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, d = Number.MAX_SAFE_INTEGER, v = Number.MIN_SAFE_INTEGER, L = void 0, b = void 0, C = void 0, G = void 0, Z = t.descendants().not(":parent"), Y = Z.length, K = 0; K < Y; K++) {
-                    var O = Z[K];
+                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, d = Number.MAX_SAFE_INTEGER, v = Number.MIN_SAFE_INTEGER, L = void 0, b = void 0, C = void 0, G = void 0, k = t.descendants().not(":parent"), Y = k.length, K = 0; K < Y; K++) {
+                    var O = k[K];
                     L = o[c.get(O.id())] - O.width() / 2, b = o[c.get(O.id())] + O.width() / 2, C = s[c.get(O.id())] - O.height() / 2, G = s[c.get(O.id())] + O.height() / 2, l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
                   }
                   var it = {};
@@ -3327,7 +3327,7 @@ function pr() {
               /***/
               (a, e, r) => {
                 var f = r(548), i = r(140).CoSELayout, g = r(140).CoSENode, t = r(140).layoutBase.PointD, o = r(140).layoutBase.DimensionD, s = r(140).layoutBase.LayoutConstants, c = r(140).layoutBase.FDLayoutConstants, l = r(140).CoSEConstants, T = function(v, L) {
-                  var b = v.cy, C = v.eles, G = C.nodes(), Z = C.edges(), Y = void 0, K = void 0, O = void 0, it = {};
+                  var b = v.cy, C = v.eles, G = C.nodes(), k = C.edges(), Y = void 0, K = void 0, O = void 0, it = {};
                   v.randomize && (Y = L.nodeIndexes, K = L.xCoords, O = L.yCoords);
                   var n = function(D) {
                     return typeof D == "function";
@@ -3371,7 +3371,7 @@ function pr() {
                   };
                   v.nestingFactor != null && (l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = v.nestingFactor), v.gravity != null && (l.DEFAULT_GRAVITY_STRENGTH = c.DEFAULT_GRAVITY_STRENGTH = v.gravity), v.numIter != null && (l.MAX_ITERATIONS = c.MAX_ITERATIONS = v.numIter), v.gravityRange != null && (l.DEFAULT_GRAVITY_RANGE_FACTOR = c.DEFAULT_GRAVITY_RANGE_FACTOR = v.gravityRange), v.gravityCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = v.gravityCompound), v.gravityRangeCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = v.gravityRangeCompound), v.initialEnergyOnIncremental != null && (l.DEFAULT_COOLING_FACTOR_INCREMENTAL = c.DEFAULT_COOLING_FACTOR_INCREMENTAL = v.initialEnergyOnIncremental), v.tilingCompareBy != null && (l.TILING_COMPARE_BY = v.tilingCompareBy), v.quality == "proof" ? s.QUALITY = 2 : s.QUALITY = 0, l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = s.NODE_DIMENSIONS_INCLUDE_LABELS = v.nodeDimensionsIncludeLabels, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !v.randomize, l.ANIMATE = c.ANIMATE = s.ANIMATE = v.animate, l.TILE = v.tile, l.TILING_PADDING_VERTICAL = typeof v.tilingPaddingVertical == "function" ? v.tilingPaddingVertical.call() : v.tilingPaddingVertical, l.TILING_PADDING_HORIZONTAL = typeof v.tilingPaddingHorizontal == "function" ? v.tilingPaddingHorizontal.call() : v.tilingPaddingHorizontal, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !0, l.PURE_INCREMENTAL = !v.randomize, s.DEFAULT_UNIFORM_LEAF_NODE_SIZES = v.uniformNodeDimensions, v.step == "transformed" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !1), v.step == "enforced" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !1), v.step == "cose" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !0), v.step == "all" && (v.randomize ? l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !0), v.fixedNodeConstraint || v.alignmentConstraint || v.relativePlacementConstraint ? l.TREE_REDUCTION_ON_INCREMENTAL = !1 : l.TREE_REDUCTION_ON_INCREMENTAL = !0;
                   var M = new i(), S = M.newGraphManager();
-                  return E(S.addRoot(), f.getTopMostNodes(G), M, v), y(M, S, Z), R(M, v), M.runLayout(), it;
+                  return E(S.addRoot(), f.getTopMostNodes(G), M, v), y(M, S, k), R(M, v), M.runLayout(), it;
                 };
                 a.exports = { coseLayout: T };
               }
@@ -3491,12 +3491,12 @@ function pr() {
                   return f(v, [{
                     key: "run",
                     value: function() {
-                      var b = this, C = this.options, G = C.cy, Z = C.eles, Y = [], K = [], O = void 0, it = [];
+                      var b = this, C = this.options, G = C.cy, k = C.eles, Y = [], K = [], O = void 0, it = [];
                       C.fixedNodeConstraint && (!Array.isArray(C.fixedNodeConstraint) || C.fixedNodeConstraint.length == 0) && (C.fixedNodeConstraint = void 0), C.alignmentConstraint && (C.alignmentConstraint.vertical && (!Array.isArray(C.alignmentConstraint.vertical) || C.alignmentConstraint.vertical.length == 0) && (C.alignmentConstraint.vertical = void 0), C.alignmentConstraint.horizontal && (!Array.isArray(C.alignmentConstraint.horizontal) || C.alignmentConstraint.horizontal.length == 0) && (C.alignmentConstraint.horizontal = void 0)), C.relativePlacementConstraint && (!Array.isArray(C.relativePlacementConstraint) || C.relativePlacementConstraint.length == 0) && (C.relativePlacementConstraint = void 0);
                       var n = C.fixedNodeConstraint || C.alignmentConstraint || C.relativePlacementConstraint;
                       n && (C.tile = !1, C.packComponents = !1);
                       var m = void 0, p = !1;
-                      if (G.layoutUtilities && C.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = !0), Z.nodes().length > 0)
+                      if (G.layoutUtilities && C.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = !0), k.nodes().length > 0)
                         if (p) {
                           var R = t.getTopMostNodes(C.eles.nodes());
                           if (O = t.connectComponents(G, C.eles, R), O.forEach(function(vt) {
@@ -3528,7 +3528,7 @@ function pr() {
                             });
                           var w = /* @__PURE__ */ new Set();
                           if (O.length > 1) {
-                            var H = [], B = Z.filter(function(vt) {
+                            var H = [], B = k.filter(function(vt) {
                               return vt.css("display") == "none";
                             });
                             O.forEach(function(vt, rt) {
@@ -3618,10 +3618,10 @@ function pr() {
                         }
                       };
                       if (C.quality == "default" || C.quality == "proof" || C.randomize) {
-                        var It = t.calcParentsWithoutChildren(G, Z), Nt = Z.filter(function(vt) {
+                        var It = t.calcParentsWithoutChildren(G, k), Nt = k.filter(function(vt) {
                           return vt.css("display") == "none";
                         });
-                        C.eles = Z.not(Nt), Z.nodes().not(":parent").not(Nt).layoutPositions(b, C, Q), It.length > 0 && It.forEach(function(vt) {
+                        C.eles = k.not(Nt), k.nodes().not(":parent").not(Nt).layoutPositions(b, C, Q), It.length > 0 && It.forEach(function(vt) {
                           vt.position(Q(vt));
                         });
                       } else
@@ -3637,11 +3637,11 @@ function pr() {
               /***/
               (a, e, r) => {
                 var f = r(548), i = r(140).layoutBase.Matrix, g = r(140).layoutBase.SVD, t = function(s) {
-                  var c = s.cy, l = s.eles, T = l.nodes(), d = l.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), C = [], G = [], Z = [], Y = [], K = [], O = [], it = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, R = s.samplingType, M = s.nodeSeparation, S = void 0, W = function() {
+                  var c = s.cy, l = s.eles, T = l.nodes(), d = l.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), C = [], G = [], k = [], Y = [], K = [], O = [], it = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, R = s.samplingType, M = s.nodeSeparation, S = void 0, W = function() {
                     for (var U = 0, $ = 0, J = !1; $ < S; ) {
                       U = Math.floor(Math.random() * m), J = !1;
-                      for (var k = 0; k < $; k++)
-                        if (Y[k] == U) {
+                      for (var Z = 0; Z < $; Z++)
+                        if (Y[Z] == U) {
                           J = !0;
                           break;
                         }
@@ -3651,12 +3651,12 @@ function pr() {
                         continue;
                     }
                   }, D = function(U, $, J) {
-                    for (var k = [], at = 0, ct = 0, nt = 0, tt = void 0, j = [], ut = 0, Mt = 1, pt = 0; pt < m; pt++)
+                    for (var Z = [], at = 0, ct = 0, nt = 0, tt = void 0, j = [], ut = 0, Mt = 1, pt = 0; pt < m; pt++)
                       j[pt] = p;
-                    for (k[ct] = U, j[U] = 0; ct >= at; ) {
-                      nt = k[at++];
+                    for (Z[ct] = U, j[U] = 0; ct >= at; ) {
+                      nt = Z[at++];
                       for (var xt = C[nt], lt = 0; lt < xt.length; lt++)
-                        tt = L.get(xt[lt]), j[tt] == p && (j[tt] = j[nt] + 1, k[++ct] = tt);
+                        tt = L.get(xt[lt]), j[tt] == p && (j[tt] = j[nt] + 1, Z[++ct] = tt);
                       O[nt][$] = j[nt] * M;
                     }
                     if (J) {
@@ -3670,8 +3670,8 @@ function pr() {
                     var $ = void 0;
                     if (U) {
                       $ = Math.floor(Math.random() * m);
-                      for (var k = 0; k < m; k++)
-                        K[k] = p;
+                      for (var Z = 0; Z < m; Z++)
+                        K[Z] = p;
                       for (var at = 0; at < S; at++)
                         Y[at] = $, $ = D($, at, U);
                     } else {
@@ -3688,16 +3688,16 @@ function pr() {
                       for (var ut = 0; ut < S; ut++)
                         it[j][ut] = O[Y[ut]][j];
                   }, V = function() {
-                    for (var U = g.svd(it), $ = U.S, J = U.U, k = U.V, at = $[0] * $[0] * $[0], ct = [], nt = 0; nt < S; nt++) {
+                    for (var U = g.svd(it), $ = U.S, J = U.U, Z = U.V, at = $[0] * $[0] * $[0], ct = [], nt = 0; nt < S; nt++) {
                       ct[nt] = [];
                       for (var tt = 0; tt < S; tt++)
                         ct[nt][tt] = 0, nt == tt && (ct[nt][tt] = $[nt] / ($[nt] * $[nt] + at / ($[nt] * $[nt])));
                     }
-                    n = i.multMat(i.multMat(k, ct), i.transpose(J));
+                    n = i.multMat(i.multMat(Z, ct), i.transpose(J));
                   }, X = function() {
-                    for (var U = void 0, $ = void 0, J = [], k = [], at = [], ct = [], nt = 0; nt < m; nt++)
-                      J[nt] = Math.random(), k[nt] = Math.random();
-                    J = i.normalize(J), k = i.normalize(k);
+                    for (var U = void 0, $ = void 0, J = [], Z = [], at = [], ct = [], nt = 0; nt < m; nt++)
+                      J[nt] = Math.random(), Z[nt] = Math.random();
+                    J = i.normalize(J), Z = i.normalize(Z);
                     for (var tt = E, j = E, ut = void 0; ; ) {
                       for (var Mt = 0; Mt < m; Mt++)
                         at[Mt] = J[Mt];
@@ -3709,14 +3709,14 @@ function pr() {
                       at[pt] = J[pt];
                     for (j = E; ; ) {
                       for (var xt = 0; xt < m; xt++)
-                        ct[xt] = k[xt];
-                      if (ct = i.minusOp(ct, i.multCons(at, i.dotProduct(at, ct))), k = i.multGamma(i.multL(i.multGamma(ct), O, n)), $ = i.dotProduct(ct, k), k = i.normalize(k), tt = i.dotProduct(ct, k), ut = Math.abs(tt / j), ut <= 1 + y && ut >= 1)
+                        ct[xt] = Z[xt];
+                      if (ct = i.minusOp(ct, i.multCons(at, i.dotProduct(at, ct))), Z = i.multGamma(i.multL(i.multGamma(ct), O, n)), $ = i.dotProduct(ct, Z), Z = i.normalize(Z), tt = i.dotProduct(ct, Z), ut = Math.abs(tt / j), ut <= 1 + y && ut >= 1)
                         break;
                       j = tt;
                     }
                     for (var lt = 0; lt < m; lt++)
-                      ct[lt] = k[lt];
-                    G = i.multCons(at, Math.sqrt(Math.abs(U))), Z = i.multCons(ct, Math.sqrt(Math.abs($)));
+                      ct[lt] = Z[lt];
+                    G = i.multCons(at, Math.sqrt(Math.abs(U))), k = i.multCons(ct, Math.sqrt(Math.abs($)));
                   };
                   f.connectComponents(c, l, f.getTopMostNodes(T), v), d.forEach(function(F) {
                     f.connectComponents(c, l, f.getTopMostNodes(F.descendants().intersection(l)), v);
@@ -3745,8 +3745,8 @@ function pr() {
                     for (var U = F.children().intersection(l); U.nodes(":childless").length == 0; )
                       U = U.nodes()[0].children().intersection(l);
                     var $ = 0, J = U.nodes(":childless")[0].connectedEdges().length;
-                    U.nodes(":childless").forEach(function(k, at) {
-                      k.connectedEdges().length < J && (J = k.connectedEdges().length, $ = at);
+                    U.nodes(":childless").forEach(function(Z, at) {
+                      Z.connectedEdges().length < J && (J = Z.connectedEdges().length, $ = at);
                     }), b.set(F.id(), U.nodes(":childless")[$].id());
                   }), T.forEach(function(F) {
                     var U = void 0;
@@ -3756,8 +3756,8 @@ function pr() {
                   });
                   var Nt = function(U) {
                     var $ = L.get(U), J = void 0;
-                    v.get(U).forEach(function(k) {
-                      c.getElementById(k).isParent() ? J = b.get(k) : J = k, C[$].push(J), C[L.get(J)].push(U);
+                    v.get(U).forEach(function(Z) {
+                      c.getElementById(Z).isParent() ? J = b.get(Z) : J = Z, C[$].push(J), C[L.get(J)].push(U);
                     });
                   }, vt = !0, rt = !1, gt = void 0;
                   try {
@@ -3783,16 +3783,16 @@ function pr() {
                       O[Dt] = [];
                     for (var Rt = 0; Rt < S; Rt++)
                       n[Rt] = [];
-                    return s.quality == "draft" || s.step == "all" ? (q(R), V(), X(), Et = { nodeIndexes: L, xCoords: G, yCoords: Z }) : (L.forEach(function(F, U) {
-                      G.push(c.getElementById(U).position("x")), Z.push(c.getElementById(U).position("y"));
-                    }), Et = { nodeIndexes: L, xCoords: G, yCoords: Z }), Et;
+                    return s.quality == "draft" || s.step == "all" ? (q(R), V(), X(), Et = { nodeIndexes: L, xCoords: G, yCoords: k }) : (L.forEach(function(F, U) {
+                      G.push(c.getElementById(U).position("x")), k.push(c.getElementById(U).position("y"));
+                    }), Et = { nodeIndexes: L, xCoords: G, yCoords: k }), Et;
                   } else {
                     var Ht = L.keys(), Ut = c.getElementById(Ht.next().value), Pt = Ut.position(), Ft = Ut.outerWidth();
-                    if (G.push(Pt.x), Z.push(Pt.y), m == 2) {
+                    if (G.push(Pt.x), k.push(Pt.y), m == 2) {
                       var Yt = c.getElementById(Ht.next().value), Vt = Yt.outerWidth();
-                      G.push(Pt.x + Ft / 2 + Vt / 2 + s.idealEdgeLength), Z.push(Pt.y);
+                      G.push(Pt.x + Ft / 2 + Vt / 2 + s.idealEdgeLength), k.push(Pt.y);
                     }
-                    return Et = { nodeIndexes: L, xCoords: G, yCoords: Z }, Et;
+                    return Et = { nodeIndexes: L, xCoords: G, yCoords: k }, Et;
                   }
                 };
                 a.exports = { spectralLayout: t };
@@ -3840,7 +3840,7 @@ function pr() {
   }(he)), he.exports;
 }
 var yr = pr();
-const Er = /* @__PURE__ */ ke(yr);
+const Er = /* @__PURE__ */ Ze(yr);
 var xe = {
   L: "left",
   R: "right",
@@ -4193,20 +4193,20 @@ var xe = {
       let { x: b, y: C } = e[0].targetEndpoint();
       const G = P + 4;
       if (g && (Wt(f) ? T += f === "L" ? -G : G : d += f === "T" ? -G : G + 18), c && (Wt(o) ? b += o === "L" ? -G : G : C += o === "T" ? -G : G + 18), !g && A.getNode(r)?.type === "junction" && (Wt(f) ? T += f === "L" ? u : -u : d += f === "T" ? u : -u), !c && A.getNode(t)?.type === "junction" && (Wt(o) ? b += o === "L" ? u : -u : C += o === "T" ? u : -u), e[0]._private.rscratch) {
-        const Z = I.insert("g");
-        if (Z.insert("path").attr("d", `M ${T},${d} L ${v},${L} L${b},${C} `).attr("class", "edge"), i) {
+        const k = I.insert("g");
+        if (k.insert("path").attr("d", `M ${T},${d} L ${v},${L} L${b},${C} `).attr("class", "edge"), i) {
           const Y = Wt(f) ? se[f](T, h) : T - a, K = qt(f) ? se[f](d, h) : d - a;
-          Z.insert("polygon").attr("points", Ie[f](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
+          k.insert("polygon").attr("points", Ie[f](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
         }
         if (s) {
           const Y = Wt(o) ? se[o](b, h) : b - a, K = qt(o) ? se[o](C, h) : C - a;
-          Z.insert("polygon").attr("points", Ie[o](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
+          k.insert("polygon").attr("points", Ie[o](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
         }
         if (l) {
           const Y = Te(f, o) ? "XY" : Wt(f) ? "X" : "Y";
           let K = 0;
           Y === "X" ? K = Math.abs(T - b) : Y === "Y" ? K = Math.abs(d - C) / 1.5 : K = Math.abs(T - b) / 2;
-          const O = Z.append("g");
+          const O = k.append("g");
           if (await me(
             O,
             l,
@@ -4599,13 +4599,13 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
         d = (l - L + (v - c) * (L - C) / (v - b)) / Math.sqrt(1 + Math.pow((L - C) / (v - b), 2)), T = Math.sqrt(Math.pow(l - L, 2) + Math.pow(c - v, 2) - Math.pow(d, 2));
         const G = Math.sqrt(Math.pow(b - v, 2) + Math.pow(C - L, 2));
         T = T / G;
-        let Z = (b - v) * (l - L) - (C - L) * (c - v);
+        let k = (b - v) * (l - L) - (C - L) * (c - v);
         switch (!0) {
-          case Z >= 0:
-            Z = 1;
+          case k >= 0:
+            k = 1;
             break;
-          case Z < 0:
-            Z = -1;
+          case k < 0:
+            k = -1;
             break;
         }
         let Y = (b - v) * (c - v) + (C - L) * (l - L);
@@ -4617,7 +4617,7 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
             Y = -1;
             break;
         }
-        return d = Math.abs(d) * Z, T = T * Y, {
+        return d = Math.abs(d) * k, T = T * Y, {
           distances: d,
           weights: T
         };
@@ -4627,8 +4627,8 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
         if (o.data?.()) {
           const { x: s, y: c } = o.source().position(), { x: l, y: T } = o.target().position();
           if (s !== l && c !== T) {
-            const d = o.sourceEndpoint(), v = o.targetEndpoint(), { sourceDir: L } = be(o), [b, C] = qt(L) ? [d.x, v.y] : [v.x, d.y], { weights: G, distances: Z } = t(d, v, b, C);
-            o.style("segment-distances", Z), o.style("segment-weights", G);
+            const d = o.sourceEndpoint(), v = o.targetEndpoint(), { sourceDir: L } = be(o), [b, C] = qt(L) ? [d.x, v.y] : [v.x, d.y], { weights: G, distances: k } = t(d, v, b, C);
+            o.style("segment-distances", k), o.style("segment-weights", G);
           }
         }
       r.endBatch(), g.run();
@@ -4639,7 +4639,7 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
 }
 dt(Be, "layoutArchitecture");
 var Pr = /* @__PURE__ */ dt(async (I, x, A, P) => {
-  const N = P.db, u = N.getServices(), h = N.getJunctions(), a = N.getGroups(), e = N.getEdges(), r = N.getDataStructures(), f = Ze(x), i = f.append("g");
+  const N = P.db, u = N.getServices(), h = N.getJunctions(), a = N.getGroups(), e = N.getEdges(), r = N.getDataStructures(), f = ke(x), i = f.append("g");
   i.attr("class", "architecture-edges");
   const g = f.append("g");
   g.attr("class", "architecture-services");