@marimo-team/islands 0.14.11-dev2 → 0.14.11-dev21

package/dist/{architectureDiagram-IEHRJDOE-B5UTatfK.js → architectureDiagram-NQ2NVSRB-Ghs-gTjF.js}

@@ -1,37 +1,37 @@
-import { _ as nt, g as qe, s as Je, a as Qe, b as Ke, t as je, q as _e, K as tr, T as er, z as rr, l as Pe, a4 as Le, c as ge, ak as me, d as ir, H as ar, al as nr, am as or } from "./mermaid-DCIbF0Rd.js";
-import { p as sr } from "./chunk-4BMEZGHF-CKIxJWxP.js";
-import { I as lr } from "./chunk-XZIHB7SX-Bwue5JjE.js";
-import { p as hr } from "./radar-MK3ICKWK-BMSp8zaN.js";
+import { _ as nt, g as Je, s as Qe, a as Ke, b as je, t as _e, q as tr, K as er, V as rr, F as ir, G as ar, H as nr, z as or, l as Pe, a5 as Ne, c as Le, an as Ee, d as sr, ao as lr, ap as hr } from "./mermaid-CRRCnedu.js";
+import { p as fr } from "./chunk-353BL4L5-DE1uUKLI.js";
+import { I as cr } from "./chunk-AACKK3MU-DAmuROVD.js";
+import { p as gr } from "./treemap-FKARHQ26-BOli4yXg.js";
 import { c as Ge } from "./cytoscape.esm-CCQ3SVU1.js";
-import { S as fr } from "./main-DLuap1gp.js";
-var he = { exports: {} }, fe = { exports: {} }, ce = { exports: {} }, cr = ce.exports, xe;
-function ur() {
-  return xe || (xe = 1, function(A, Y) {
+import { T as ur } from "./main-D9-48wlP.js";
+var he = { exports: {} }, fe = { exports: {} }, ce = { exports: {} }, dr = ce.exports, xe;
+function vr() {
+  return xe || (xe = 1, function(C, X) {
     (function(P, L) {
-      A.exports = L();
-    })(cr, function() {
+      C.exports = L();
+    })(dr, function() {
       return (
         /******/
         function(M) {
           var P = {};
-          function L(u) {
-            if (P[u])
-              return P[u].exports;
-            var h = P[u] = {
+          function L(g) {
+            if (P[g])
+              return P[g].exports;
+            var h = P[g] = {
               /******/
-              i: u,
+              i: g,
               /******/
               l: false,
               /******/
               exports: {}
               /******/
             };
-            return M[u].call(h.exports, h, h.exports, L), h.l = true, h.exports;
+            return M[g].call(h.exports, h, h.exports, L), h.l = true, h.exports;
           }
-          return L.m = M, L.c = P, L.i = function(u) {
-            return u;
-          }, L.d = function(u, h, a) {
-            L.o(u, h) || Object.defineProperty(u, h, {
+          return L.m = M, L.c = P, L.i = function(g) {
+            return g;
+          }, L.d = function(g, h, a) {
+            L.o(g, h) || Object.defineProperty(g, h, {
               /******/
               configurable: false,
               /******/
@@ -40,40 +40,40 @@ function ur() {
               get: a
               /******/
             });
-          }, L.n = function(u) {
-            var h = u && u.__esModule ? (
+          }, L.n = function(g) {
+            var h = g && g.__esModule ? (
               /******/
               function() {
-                return u.default;
+                return g.default;
               }
             ) : (
               /******/
               function() {
-                return u;
+                return g;
               }
             );
             return L.d(h, "a", h), h;
-          }, L.o = function(u, h) {
-            return Object.prototype.hasOwnProperty.call(u, h);
+          }, L.o = function(g, h) {
+            return Object.prototype.hasOwnProperty.call(g, h);
           }, L.p = "", L(L.s = 28);
         }([
           /* 0 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.QUALITY = 1, u.DEFAULT_CREATE_BENDS_AS_NEEDED = false, u.DEFAULT_INCREMENTAL = false, u.DEFAULT_ANIMATION_ON_LAYOUT = true, u.DEFAULT_ANIMATION_DURING_LAYOUT = false, u.DEFAULT_ANIMATION_PERIOD = 50, u.DEFAULT_UNIFORM_LEAF_NODE_SIZES = false, u.DEFAULT_GRAPH_MARGIN = 15, u.NODE_DIMENSIONS_INCLUDE_LABELS = false, u.SIMPLE_NODE_SIZE = 40, u.SIMPLE_NODE_HALF_SIZE = u.SIMPLE_NODE_SIZE / 2, u.EMPTY_COMPOUND_NODE_SIZE = 40, u.MIN_EDGE_LENGTH = 1, u.WORLD_BOUNDARY = 1e6, u.INITIAL_WORLD_BOUNDARY = u.WORLD_BOUNDARY / 1e3, u.WORLD_CENTER_X = 1200, u.WORLD_CENTER_Y = 900, M.exports = u;
+            g.QUALITY = 1, g.DEFAULT_CREATE_BENDS_AS_NEEDED = false, g.DEFAULT_INCREMENTAL = false, g.DEFAULT_ANIMATION_ON_LAYOUT = true, g.DEFAULT_ANIMATION_DURING_LAYOUT = false, g.DEFAULT_ANIMATION_PERIOD = 50, g.DEFAULT_UNIFORM_LEAF_NODE_SIZES = false, g.DEFAULT_GRAPH_MARGIN = 15, g.NODE_DIMENSIONS_INCLUDE_LABELS = false, g.SIMPLE_NODE_SIZE = 40, g.SIMPLE_NODE_HALF_SIZE = g.SIMPLE_NODE_SIZE / 2, g.EMPTY_COMPOUND_NODE_SIZE = 40, g.MIN_EDGE_LENGTH = 1, g.WORLD_BOUNDARY = 1e6, g.INITIAL_WORLD_BOUNDARY = g.WORLD_BOUNDARY / 1e3, g.WORLD_CENTER_X = 1200, g.WORLD_CENTER_Y = 900, M.exports = g;
           },
           /* 1 */
           /***/
           function(M, P, L) {
-            var u = L(2), h = L(8), a = L(9);
+            var g = L(2), h = L(8), a = L(9);
             function r(f, i, v) {
-              u.call(this, v), this.isOverlapingSourceAndTarget = false, this.vGraphObject = v, this.bendpoints = [], this.source = f, this.target = i;
+              g.call(this, v), this.isOverlapingSourceAndTarget = false, this.vGraphObject = v, this.bendpoints = [], this.source = f, this.target = i;
             }
-            r.prototype = Object.create(u.prototype);
-            for (var e in u)
-              r[e] = u[e];
+            r.prototype = Object.create(g.prototype);
+            for (var e in g)
+              r[e] = g[e];
             r.prototype.getSource = function() {
               return this.source;
             }, r.prototype.getTarget = function() {
@@ -117,21 +117,21 @@ function ur() {
           /* 2 */
           /***/
           function(M, P, L) {
-            function u(h) {
+            function g(h) {
               this.vGraphObject = h;
             }
-            M.exports = u;
+            M.exports = g;
           },
           /* 3 */
           /***/
           function(M, P, L) {
-            var u = L(2), h = L(10), a = L(13), r = L(0), e = L(16), f = L(5);
+            var g = L(2), h = L(10), a = L(13), r = L(0), e = L(16), f = L(5);
             function i(t, o, s, c) {
-              s == null && c == null && (c = o), u.call(this, c), t.graphManager != null && (t = t.graphManager), this.estimatedSize = h.MIN_VALUE, this.inclusionTreeDepth = h.MAX_VALUE, this.vGraphObject = c, this.edges = [], this.graphManager = t, s != null && o != null ? this.rect = new a(o.x, o.y, s.width, s.height) : this.rect = new a();
+              s == null && c == null && (c = o), g.call(this, c), t.graphManager != null && (t = t.graphManager), this.estimatedSize = h.MIN_VALUE, this.inclusionTreeDepth = h.MAX_VALUE, this.vGraphObject = c, this.edges = [], this.graphManager = t, s != null && o != null ? this.rect = new a(o.x, o.y, s.width, s.height) : this.rect = new a();
             }
-            i.prototype = Object.create(u.prototype);
-            for (var v in u)
-              i[v] = u[v];
+            i.prototype = Object.create(g.prototype);
+            for (var v in g)
+              i[v] = g[v];
             i.prototype.getEdges = function() {
               return this.edges;
             }, i.prototype.getChild = function() {
@@ -256,45 +256,45 @@ function ur() {
           /* 4 */
           /***/
           function(M, P, L) {
-            var u = L(0);
+            var g = L(0);
             function h() {
             }
-            for (var a in u)
-              h[a] = u[a];
+            for (var a in g)
+              h[a] = g[a];
             h.MAX_ITERATIONS = 2500, h.DEFAULT_EDGE_LENGTH = 50, h.DEFAULT_SPRING_STRENGTH = 0.45, h.DEFAULT_REPULSION_STRENGTH = 4500, h.DEFAULT_GRAVITY_STRENGTH = 0.4, h.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1, h.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8, h.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5, h.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = true, h.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = true, h.DEFAULT_COOLING_FACTOR_INCREMENTAL = 0.3, h.COOLING_ADAPTATION_FACTOR = 0.33, h.ADAPTATION_LOWER_NODE_LIMIT = 1e3, h.ADAPTATION_UPPER_NODE_LIMIT = 5e3, h.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100, h.MAX_NODE_DISPLACEMENT = h.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3, h.MIN_REPULSION_DIST = h.DEFAULT_EDGE_LENGTH / 10, h.CONVERGENCE_CHECK_PERIOD = 100, h.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = 0.1, h.MIN_EDGE_LENGTH = 1, h.GRID_CALCULATION_CHECK_PERIOD = 10, M.exports = h;
           },
           /* 5 */
           /***/
           function(M, P, L) {
-            function u(h, a) {
+            function g(h, a) {
               h == null && a == null ? (this.x = 0, this.y = 0) : (this.x = h, this.y = a);
             }
-            u.prototype.getX = function() {
+            g.prototype.getX = function() {
               return this.x;
-            }, u.prototype.getY = function() {
+            }, g.prototype.getY = function() {
               return this.y;
-            }, u.prototype.setX = function(h) {
+            }, g.prototype.setX = function(h) {
               this.x = h;
-            }, u.prototype.setY = function(h) {
+            }, g.prototype.setY = function(h) {
               this.y = h;
-            }, u.prototype.getDifference = function(h) {
+            }, g.prototype.getDifference = function(h) {
               return new DimensionD(this.x - h.x, this.y - h.y);
-            }, u.prototype.getCopy = function() {
-              return new u(this.x, this.y);
-            }, u.prototype.translate = function(h) {
+            }, g.prototype.getCopy = function() {
+              return new g(this.x, this.y);
+            }, g.prototype.translate = function(h) {
               return this.x += h.width, this.y += h.height, this;
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 6 */
           /***/
           function(M, P, L) {
-            var u = L(2), h = L(10), a = L(0), r = L(7), e = L(3), f = L(1), i = L(13), v = L(12), t = L(11);
+            var g = L(2), h = L(10), a = L(0), r = L(7), e = L(3), f = L(1), i = L(13), v = L(12), t = L(11);
             function o(c, l, T) {
-              u.call(this, T), this.estimatedSize = h.MIN_VALUE, this.margin = a.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = false, this.parent = c, l != null && l instanceof r ? this.graphManager = l : l != null && l instanceof Layout && (this.graphManager = l.graphManager);
+              g.call(this, T), this.estimatedSize = h.MIN_VALUE, this.margin = a.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = false, this.parent = c, l != null && l instanceof r ? this.graphManager = l : l != null && l instanceof Layout && (this.graphManager = l.graphManager);
             }
-            o.prototype = Object.create(u.prototype);
-            for (var s in u)
-              o[s] = u[s];
+            o.prototype = Object.create(g.prototype);
+            for (var s in g)
+              o[s] = g[s];
             o.prototype.getNodes = function() {
               return this.nodes;
             }, o.prototype.getEdges = function() {
@@ -315,12 +315,12 @@ function ur() {
               return this.isConnected;
             }, o.prototype.add = function(c, l, T) {
               if (l == null && T == null) {
-                var g = c;
+                var u = c;
                 if (this.graphManager == null)
                   throw "Graph has no graph mgr!";
-                if (this.getNodes().indexOf(g) > -1)
+                if (this.getNodes().indexOf(u) > -1)
                   throw "Node already in graph!";
-                return g.owner = this, this.getNodes().push(g), g;
+                return u.owner = this, this.getNodes().push(u), u;
               } else {
                 var d = c;
                 if (!(this.getNodes().indexOf(l) > -1 && this.getNodes().indexOf(T) > -1))
@@ -338,48 +338,48 @@ function ur() {
                   throw "Owner graph is invalid!";
                 if (this.graphManager == null)
                   throw "Owner graph manager is invalid!";
-                for (var T = l.edges.slice(), g, d = T.length, N = 0; N < d; N++)
-                  g = T[N], g.isInterGraph ? this.graphManager.remove(g) : g.source.owner.remove(g);
+                for (var T = l.edges.slice(), u, d = T.length, N = 0; N < d; N++)
+                  u = T[N], u.isInterGraph ? this.graphManager.remove(u) : u.source.owner.remove(u);
                 var F = this.nodes.indexOf(l);
                 if (F == -1)
                   throw "Node not in owner node list!";
                 this.nodes.splice(F, 1);
               } else if (c instanceof f) {
-                var g = c;
-                if (g == null)
+                var u = c;
+                if (u == null)
                   throw "Edge is null!";
-                if (!(g.source != null && g.target != null))
+                if (!(u.source != null && u.target != null))
                   throw "Source and/or target is null!";
-                if (!(g.source.owner != null && g.target.owner != null && g.source.owner == this && g.target.owner == this))
+                if (!(u.source.owner != null && u.target.owner != null && u.source.owner == this && u.target.owner == this))
                   throw "Source and/or target owner is invalid!";
-                var C = g.source.edges.indexOf(g), G = g.target.edges.indexOf(g);
-                if (!(C > -1 && G > -1))
+                var A = u.source.edges.indexOf(u), G = u.target.edges.indexOf(u);
+                if (!(A > -1 && G > -1))
                   throw "Source and/or target doesn't know this edge!";
-                g.source.edges.splice(C, 1), g.target != g.source && g.target.edges.splice(G, 1);
-                var F = g.source.owner.getEdges().indexOf(g);
+                u.source.edges.splice(A, 1), u.target != u.source && u.target.edges.splice(G, 1);
+                var F = u.source.owner.getEdges().indexOf(u);
                 if (F == -1)
                   throw "Not in owner's edge list!";
-                g.source.owner.getEdges().splice(F, 1);
+                u.source.owner.getEdges().splice(F, 1);
               }
             }, o.prototype.updateLeftTop = function() {
-              for (var c = h.MAX_VALUE, l = h.MAX_VALUE, T, g, d, N = this.getNodes(), F = N.length, C = 0; C < F; C++) {
-                var G = N[C];
-                T = G.getTop(), g = G.getLeft(), c > T && (c = T), l > g && (l = g);
+              for (var c = h.MAX_VALUE, l = h.MAX_VALUE, T, u, d, N = this.getNodes(), F = N.length, A = 0; A < F; A++) {
+                var G = N[A];
+                T = G.getTop(), u = G.getLeft(), c > T && (c = T), l > u && (l = u);
               }
               return c == h.MAX_VALUE ? null : (N[0].getParent().paddingLeft != null ? d = N[0].getParent().paddingLeft : d = this.margin, this.left = l - d, this.top = c - d, new v(this.left, this.top));
             }, o.prototype.updateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, g = h.MAX_VALUE, d = -h.MAX_VALUE, N, F, C, G, B, U = this.nodes, K = U.length, D = 0; D < K; D++) {
+              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, u = h.MAX_VALUE, d = -h.MAX_VALUE, N, F, A, G, B, U = this.nodes, K = U.length, D = 0; D < K; D++) {
                 var at = U[D];
-                c && at.child != null && at.updateBounds(), N = at.getLeft(), F = at.getRight(), C = at.getTop(), G = at.getBottom(), l > N && (l = N), T < F && (T = F), g > C && (g = C), d < G && (d = G);
+                c && at.child != null && at.updateBounds(), N = at.getLeft(), F = at.getRight(), A = at.getTop(), G = at.getBottom(), l > N && (l = N), T < F && (T = F), u > A && (u = A), d < G && (d = G);
               }
-              var n = new i(l, g, T - l, d - g);
+              var n = new i(l, u, T - l, d - u);
               l == h.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), U[0].getParent().paddingLeft != null ? B = U[0].getParent().paddingLeft : B = this.margin, this.left = n.x - B, this.right = n.x + n.width + B, this.top = n.y - B, this.bottom = n.y + n.height + B;
             }, o.calculateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, g = h.MAX_VALUE, d = -h.MAX_VALUE, N, F, C, G, B = c.length, U = 0; U < B; U++) {
+              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, u = h.MAX_VALUE, d = -h.MAX_VALUE, N, F, A, G, B = c.length, U = 0; U < B; U++) {
                 var K = c[U];
-                N = K.getLeft(), F = K.getRight(), C = K.getTop(), G = K.getBottom(), l > N && (l = N), T < F && (T = F), g > C && (g = C), d < G && (d = G);
+                N = K.getLeft(), F = K.getRight(), A = K.getTop(), G = K.getBottom(), l > N && (l = N), T < F && (T = F), u > A && (u = A), d < G && (d = G);
               }
-              var D = new i(l, g, T - l, d - g);
+              var D = new i(l, u, T - l, d - u);
               return D;
             }, o.prototype.getInclusionTreeDepth = function() {
               return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
@@ -388,8 +388,8 @@ function ur() {
                 throw "assert failed";
               return this.estimatedSize;
             }, o.prototype.calcEstimatedSize = function() {
-              for (var c = 0, l = this.nodes, T = l.length, g = 0; g < T; g++) {
-                var d = l[g];
+              for (var c = 0, l = this.nodes, T = l.length, u = 0; u < T; u++) {
+                var d = l[u];
                 c += d.calcEstimatedSize();
               }
               return c == 0 ? this.estimatedSize = a.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = c / Math.sqrt(this.nodes.length), this.estimatedSize;
@@ -399,14 +399,14 @@ function ur() {
                 this.isConnected = true;
                 return;
               }
-              var l = new t(), T = /* @__PURE__ */ new Set(), g = this.nodes[0], d, N, F = g.withChildren();
+              var l = new t(), T = /* @__PURE__ */ new Set(), u = this.nodes[0], d, N, F = u.withChildren();
               for (F.forEach(function(D) {
                 l.push(D), T.add(D);
               }); l.length !== 0; ) {
-                g = l.shift(), d = g.getEdges();
-                for (var C = d.length, G = 0; G < C; G++) {
+                u = l.shift(), d = u.getEdges();
+                for (var A = d.length, G = 0; G < A; G++) {
                   var B = d[G];
-                  if (N = B.getOtherEndInGraph(g, this), N != null && !T.has(N)) {
+                  if (N = B.getOtherEndInGraph(u, this), N != null && !T.has(N)) {
                     var U = N.withChildren();
                     U.forEach(function(D) {
                       l.push(D), T.add(D);
@@ -425,9 +425,9 @@ function ur() {
           /* 7 */
           /***/
           function(M, P, L) {
-            var u, h = L(1);
+            var g, h = L(1);
             function a(r) {
-              u = L(6), this.layout = r, this.graphs = [], this.edges = [];
+              g = L(6), this.layout = r, this.graphs = [], this.edges = [];
             }
             a.prototype.addRoot = function() {
               var r = this.layout.newGraph(), e = this.layout.newNode(null), f = this.add(r, e);
@@ -463,7 +463,7 @@ function ur() {
                 return f.source.edges.push(f), f.target.edges.push(f), f;
               }
             }, a.prototype.remove = function(r) {
-              if (r instanceof u) {
+              if (r instanceof g) {
                 var e = r;
                 if (e.getGraphManager() != this)
                   throw "Graph not in this graph mgr";
@@ -621,7 +621,7 @@ function ur() {
           /* 8 */
           /***/
           function(M, P, L) {
-            var u = L(12);
+            var g = L(12);
             function h() {
             }
             h.calcSeparationAmount = function(a, r, e, f) {
@@ -639,12 +639,12 @@ function ur() {
               var f = a.getCenterX(), i = a.getCenterY(), v = r.getCenterX(), t = r.getCenterY();
               if (a.intersects(r))
                 return e[0] = f, e[1] = i, e[2] = v, e[3] = t, true;
-              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), g = a.getRight(), d = a.getWidthHalf(), N = a.getHeightHalf(), F = r.getX(), C = r.getY(), G = r.getRight(), B = r.getX(), U = r.getBottom(), K = r.getRight(), D = r.getWidthHalf(), at = r.getHeightHalf(), n = false, m = false;
+              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), u = a.getRight(), d = a.getWidthHalf(), N = a.getHeightHalf(), F = r.getX(), A = r.getY(), G = r.getRight(), B = r.getX(), U = r.getBottom(), K = r.getRight(), D = r.getWidthHalf(), at = r.getHeightHalf(), n = false, m = false;
               if (f === v) {
                 if (i > t)
                   return e[0] = f, e[1] = s, e[2] = v, e[3] = U, false;
                 if (i < t)
-                  return e[0] = f, e[1] = T, e[2] = v, e[3] = C, false;
+                  return e[0] = f, e[1] = T, e[2] = v, e[3] = A, false;
               } else if (i === t) {
                 if (f > v)
                   return e[0] = o, e[1] = i, e[2] = G, e[3] = t, false;
@@ -652,7 +652,7 @@ function ur() {
                   return e[0] = c, e[1] = i, e[2] = F, e[3] = t, false;
               } else {
                 var p = a.height / a.width, E = r.height / r.width, y = (t - i) / (v - f), I = void 0, w = void 0, R = void 0, W = void 0, x = void 0, q = void 0;
-                if (-p === y ? f > v ? (e[0] = l, e[1] = T, n = true) : (e[0] = c, e[1] = s, n = true) : p === y && (f > v ? (e[0] = o, e[1] = s, n = true) : (e[0] = g, e[1] = T, n = true)), -E === y ? v > f ? (e[2] = B, e[3] = U, m = true) : (e[2] = G, e[3] = C, m = true) : E === y && (v > f ? (e[2] = F, e[3] = C, m = true) : (e[2] = K, e[3] = U, m = true)), n && m)
+                if (-p === y ? f > v ? (e[0] = l, e[1] = T, n = true) : (e[0] = c, e[1] = s, n = true) : p === y && (f > v ? (e[0] = o, e[1] = s, n = true) : (e[0] = u, e[1] = T, n = true)), -E === y ? v > f ? (e[2] = B, e[3] = U, m = true) : (e[2] = G, e[3] = A, m = true) : E === y && (v > f ? (e[2] = F, e[3] = A, m = true) : (e[2] = K, e[3] = U, m = true)), n && m)
                   return false;
                 if (f > v ? i > t ? (I = this.getCardinalDirection(p, y, 4), w = this.getCardinalDirection(E, y, 2)) : (I = this.getCardinalDirection(-p, y, 3), w = this.getCardinalDirection(-E, y, 1)) : i > t ? (I = this.getCardinalDirection(-p, y, 1), w = this.getCardinalDirection(-E, y, 3)) : (I = this.getCardinalDirection(p, y, 2), w = this.getCardinalDirection(E, y, 4)), !n)
                   switch (I) {
@@ -660,7 +660,7 @@ function ur() {
                       W = s, R = f + -N / y, e[0] = R, e[1] = W;
                       break;
                     case 2:
-                      R = g, W = i + d * y, e[0] = R, e[1] = W;
+                      R = u, W = i + d * y, e[0] = R, e[1] = W;
                       break;
                     case 3:
                       W = T, R = f + N / y, e[0] = R, e[1] = W;
@@ -672,7 +672,7 @@ function ur() {
                 if (!m)
                   switch (w) {
                     case 1:
-                      q = C, x = v + -at / y, e[2] = x, e[3] = q;
+                      q = A, x = v + -at / y, e[2] = x, e[3] = q;
                       break;
                     case 2:
                       x = K, q = t + D * y, e[2] = x, e[3] = q;
@@ -691,49 +691,49 @@ function ur() {
             }, h.getIntersection = function(a, r, e, f) {
               if (f == null)
                 return this.getIntersection2(a, r, e);
-              var i = a.x, v = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, g = void 0, d = void 0, N = void 0, F = void 0, C = void 0, G = void 0, B = void 0, U = void 0, K = void 0;
-              return N = o - v, C = i - t, B = t * v - i * o, F = T - c, G = s - l, U = l * c - s * T, K = N * G - F * C, K === 0 ? null : (g = (C * U - G * B) / K, d = (F * B - N * U) / K, new u(g, d));
+              var i = a.x, v = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, u = void 0, d = void 0, N = void 0, F = void 0, A = void 0, G = void 0, B = void 0, U = void 0, K = void 0;
+              return N = o - v, A = i - t, B = t * v - i * o, F = T - c, G = s - l, U = l * c - s * T, K = N * G - F * A, K === 0 ? null : (u = (A * U - G * B) / K, d = (F * B - N * U) / K, new g(u, d));
             }, h.angleOfVector = function(a, r, e, f) {
               var i = void 0;
               return a !== e ? (i = Math.atan((f - r) / (e - a)), e < a ? i += Math.PI : f < r && (i += this.TWO_PI)) : f < r ? i = this.ONE_AND_HALF_PI : i = this.HALF_PI, i;
             }, h.doIntersect = function(a, r, e, f) {
-              var i = a.x, v = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, g = (t - i) * (T - c) - (l - s) * (o - v);
-              if (g === 0)
+              var i = a.x, v = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, u = (t - i) * (T - c) - (l - s) * (o - v);
+              if (u === 0)
                 return false;
-              var d = ((T - c) * (l - i) + (s - l) * (T - v)) / g, N = ((v - o) * (l - i) + (t - i) * (T - v)) / g;
+              var d = ((T - c) * (l - i) + (s - l) * (T - v)) / u, N = ((v - o) * (l - i) + (t - i) * (T - v)) / u;
               return 0 < d && d < 1 && 0 < N && N < 1;
             }, h.findCircleLineIntersections = function(a, r, e, f, i, v, t) {
               var o = (e - a) * (e - a) + (f - r) * (f - r), s = 2 * ((a - i) * (e - a) + (r - v) * (f - r)), c = (a - i) * (a - i) + (r - v) * (r - v) - t * t, l = s * s - 4 * o * c;
               if (l >= 0) {
-                var T = (-s + Math.sqrt(s * s - 4 * o * c)) / (2 * o), g = (-s - Math.sqrt(s * s - 4 * o * c)) / (2 * o), d = null;
-                return T >= 0 && T <= 1 ? [T] : g >= 0 && g <= 1 ? [g] : d;
+                var T = (-s + Math.sqrt(s * s - 4 * o * c)) / (2 * o), u = (-s - Math.sqrt(s * s - 4 * o * c)) / (2 * o), d = null;
+                return T >= 0 && T <= 1 ? [T] : u >= 0 && u <= 1 ? [u] : d;
               } else return null;
             }, h.HALF_PI = 0.5 * Math.PI, h.ONE_AND_HALF_PI = 1.5 * Math.PI, h.TWO_PI = 2 * Math.PI, h.THREE_PI = 3 * Math.PI, M.exports = h;
           },
           /* 9 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.sign = function(h) {
+            g.sign = function(h) {
               return h > 0 ? 1 : h < 0 ? -1 : 0;
-            }, u.floor = function(h) {
+            }, g.floor = function(h) {
               return h < 0 ? Math.ceil(h) : Math.floor(h);
-            }, u.ceil = function(h) {
+            }, g.ceil = function(h) {
               return h < 0 ? Math.floor(h) : Math.ceil(h);
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 10 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.MAX_VALUE = 2147483647, u.MIN_VALUE = -2147483648, M.exports = u;
+            g.MAX_VALUE = 2147483647, g.MIN_VALUE = -2147483648, M.exports = g;
           },
           /* 11 */
           /***/
           function(M, P, L) {
-            var u = /* @__PURE__ */ function() {
+            var g = /* @__PURE__ */ function() {
               function i(v, t) {
                 for (var o = 0; o < t.length; o++) {
                   var s = t[o];
@@ -762,7 +762,7 @@ function ur() {
                   return t.push(o);
                 });
               }
-              return u(i, [{
+              return g(i, [{
                 key: "size",
                 value: function() {
                   return this.length;
@@ -847,81 +847,81 @@ function ur() {
           /* 12 */
           /***/
           function(M, P, L) {
-            function u(h, a, r) {
+            function g(h, a, r) {
               this.x = null, this.y = null, h == null && a == null && r == null ? (this.x = 0, this.y = 0) : typeof h == "number" && typeof a == "number" && r == null ? (this.x = h, this.y = a) : h.constructor.name == "Point" && a == null && r == null && (r = h, this.x = r.x, this.y = r.y);
             }
-            u.prototype.getX = function() {
+            g.prototype.getX = function() {
               return this.x;
-            }, u.prototype.getY = function() {
+            }, g.prototype.getY = function() {
               return this.y;
-            }, u.prototype.getLocation = function() {
-              return new u(this.x, this.y);
-            }, u.prototype.setLocation = function(h, a, r) {
+            }, g.prototype.getLocation = function() {
+              return new g(this.x, this.y);
+            }, g.prototype.setLocation = function(h, a, r) {
               h.constructor.name == "Point" && a == null && r == null ? (r = h, this.setLocation(r.x, r.y)) : typeof h == "number" && typeof a == "number" && r == null && (parseInt(h) == h && parseInt(a) == a ? this.move(h, a) : (this.x = Math.floor(h + 0.5), this.y = Math.floor(a + 0.5)));
-            }, u.prototype.move = function(h, a) {
+            }, g.prototype.move = function(h, a) {
               this.x = h, this.y = a;
-            }, u.prototype.translate = function(h, a) {
+            }, g.prototype.translate = function(h, a) {
               this.x += h, this.y += a;
-            }, u.prototype.equals = function(h) {
+            }, g.prototype.equals = function(h) {
               if (h.constructor.name == "Point") {
                 var a = h;
                 return this.x == a.x && this.y == a.y;
               }
               return this == h;
-            }, u.prototype.toString = function() {
-              return new u().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
-            }, M.exports = u;
+            }, g.prototype.toString = function() {
+              return new g().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
+            }, M.exports = g;
           },
           /* 13 */
           /***/
           function(M, P, L) {
-            function u(h, a, r, e) {
+            function g(h, a, r, e) {
               this.x = 0, this.y = 0, this.width = 0, this.height = 0, h != null && a != null && r != null && e != null && (this.x = h, this.y = a, this.width = r, this.height = e);
             }
-            u.prototype.getX = function() {
+            g.prototype.getX = function() {
               return this.x;
-            }, u.prototype.setX = function(h) {
+            }, g.prototype.setX = function(h) {
               this.x = h;
-            }, u.prototype.getY = function() {
+            }, g.prototype.getY = function() {
               return this.y;
-            }, u.prototype.setY = function(h) {
+            }, g.prototype.setY = function(h) {
               this.y = h;
-            }, u.prototype.getWidth = function() {
+            }, g.prototype.getWidth = function() {
               return this.width;
-            }, u.prototype.setWidth = function(h) {
+            }, g.prototype.setWidth = function(h) {
               this.width = h;
-            }, u.prototype.getHeight = function() {
+            }, g.prototype.getHeight = function() {
               return this.height;
-            }, u.prototype.setHeight = function(h) {
+            }, g.prototype.setHeight = function(h) {
               this.height = h;
-            }, u.prototype.getRight = function() {
+            }, g.prototype.getRight = function() {
               return this.x + this.width;
-            }, u.prototype.getBottom = function() {
+            }, g.prototype.getBottom = function() {
               return this.y + this.height;
-            }, u.prototype.intersects = function(h) {
+            }, g.prototype.intersects = function(h) {
               return !(this.getRight() < h.x || this.getBottom() < h.y || h.getRight() < this.x || h.getBottom() < this.y);
-            }, u.prototype.getCenterX = function() {
+            }, g.prototype.getCenterX = function() {
               return this.x + this.width / 2;
-            }, u.prototype.getMinX = function() {
+            }, g.prototype.getMinX = function() {
               return this.getX();
-            }, u.prototype.getMaxX = function() {
+            }, g.prototype.getMaxX = function() {
               return this.getX() + this.width;
-            }, u.prototype.getCenterY = function() {
+            }, g.prototype.getCenterY = function() {
               return this.y + this.height / 2;
-            }, u.prototype.getMinY = function() {
+            }, g.prototype.getMinY = function() {
               return this.getY();
-            }, u.prototype.getMaxY = function() {
+            }, g.prototype.getMaxY = function() {
               return this.getY() + this.height;
-            }, u.prototype.getWidthHalf = function() {
+            }, g.prototype.getWidthHalf = function() {
               return this.width / 2;
-            }, u.prototype.getHeightHalf = function() {
+            }, g.prototype.getHeightHalf = function() {
               return this.height / 2;
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 14 */
           /***/
           function(M, P, L) {
-            var u = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(a) {
+            var g = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(a) {
               return typeof a;
             } : function(a) {
               return a && typeof Symbol == "function" && a.constructor === Symbol && a !== Symbol.prototype ? "symbol" : typeof a;
@@ -933,14 +933,14 @@ function ur() {
             }, h.getString = function(a) {
               return a == null && (a = h.lastID), "Object#" + a;
             }, h.isPrimitive = function(a) {
-              var r = typeof a > "u" ? "undefined" : u(a);
+              var r = typeof a > "u" ? "undefined" : g(a);
               return a == null || r != "object" && r != "function";
             }, M.exports = h;
           },
           /* 15 */
           /***/
           function(M, P, L) {
-            function u(s) {
+            function g(s) {
               if (Array.isArray(s)) {
                 for (var c = 0, l = Array(s.length); c < s.length; c++)
                   l[c] = s[c];
@@ -994,8 +994,8 @@ function ur() {
                   for (var l = c.getChild().getNodes(), T = 0; T < l.length; T++)
                     update(l[T]);
                 if (c.vGraphObject != null) {
-                  var g = c.vGraphObject;
-                  g.update(c);
+                  var u = c.vGraphObject;
+                  u.update(c);
                 }
               } else if (s instanceof e) {
                 var d = s;
@@ -1006,8 +1006,8 @@ function ur() {
               } else if (s instanceof f) {
                 var F = s;
                 if (F.vGraphObject != null) {
-                  var C = F.vGraphObject;
-                  C.update(F);
+                  var A = F.vGraphObject;
+                  A.update(F);
                 }
               }
             }, o.prototype.initParameters = function() {
@@ -1019,28 +1019,28 @@ function ur() {
                 var c = new v(), l = this.graphManager.getRoot().updateLeftTop();
                 if (l != null) {
                   c.setWorldOrgX(s.x), c.setWorldOrgY(s.y), c.setDeviceOrgX(l.x), c.setDeviceOrgY(l.y);
-                  for (var T = this.getAllNodes(), g, d = 0; d < T.length; d++)
-                    g = T[d], g.transform(c);
+                  for (var T = this.getAllNodes(), u, d = 0; d < T.length; d++)
+                    u = T[d], u.transform(c);
                 }
               }
             }, o.prototype.positionNodesRandomly = function(s) {
               if (s == null)
                 this.positionNodesRandomly(this.getGraphManager().getRoot()), this.getGraphManager().getRoot().updateBounds(true);
               else
-                for (var c, l, T = s.getNodes(), g = 0; g < T.length; g++)
-                  c = T[g], l = c.getChild(), l == null || l.getNodes().length == 0 ? c.scatter() : (this.positionNodesRandomly(l), c.updateBounds());
+                for (var c, l, T = s.getNodes(), u = 0; u < T.length; u++)
+                  c = T[u], l = c.getChild(), l == null || l.getNodes().length == 0 ? c.scatter() : (this.positionNodesRandomly(l), c.updateBounds());
             }, o.prototype.getFlatForest = function() {
-              for (var s = [], c = true, l = this.graphManager.getRoot().getNodes(), T = true, g = 0; g < l.length; g++)
-                l[g].getChild() != null && (T = false);
+              for (var s = [], c = true, l = this.graphManager.getRoot().getNodes(), T = true, u = 0; u < l.length; u++)
+                l[u].getChild() != null && (T = false);
               if (!T)
                 return s;
-              var d = /* @__PURE__ */ new Set(), N = [], F = /* @__PURE__ */ new Map(), C = [];
-              for (C = C.concat(l); C.length > 0 && c; ) {
-                for (N.push(C[0]); N.length > 0 && c; ) {
+              var d = /* @__PURE__ */ new Set(), N = [], F = /* @__PURE__ */ new Map(), A = [];
+              for (A = A.concat(l); A.length > 0 && c; ) {
+                for (N.push(A[0]); N.length > 0 && c; ) {
                   var G = N[0];
                   N.splice(0, 1), d.add(G);
-                  for (var B = G.getEdges(), g = 0; g < B.length; g++) {
-                    var U = B[g].getOtherEnd(G);
+                  for (var B = G.getEdges(), u = 0; u < B.length; u++) {
+                    var U = B[u].getOtherEnd(G);
                     if (F.get(G) != U)
                       if (!d.has(U))
                         N.push(U), F.set(U, G);
@@ -1053,18 +1053,18 @@ function ur() {
                 if (!c)
                   s = [];
                 else {
-                  var K = [].concat(u(d));
+                  var K = [].concat(g(d));
                   s.push(K);
-                  for (var g = 0; g < K.length; g++) {
-                    var D = K[g], at = C.indexOf(D);
-                    at > -1 && C.splice(at, 1);
+                  for (var u = 0; u < K.length; u++) {
+                    var D = K[u], at = A.indexOf(D);
+                    at > -1 && A.splice(at, 1);
                   }
                   d = /* @__PURE__ */ new Set(), F = /* @__PURE__ */ new Map();
                 }
               }
               return s;
             }, o.prototype.createDummyNodesForBendpoints = function(s) {
-              for (var c = [], l = s.source, T = this.graphManager.calcLowestCommonAncestor(s.source, s.target), g = 0; g < s.bendpoints.length; g++) {
+              for (var c = [], l = s.source, T = this.graphManager.calcLowestCommonAncestor(s.source, s.target), u = 0; u < s.bendpoints.length; u++) {
                 var d = this.newNode(null);
                 d.setRect(new Point(0, 0), new Dimension(1, 1)), T.add(d);
                 var N = this.newEdge(null);
@@ -1074,12 +1074,12 @@ function ur() {
               return this.graphManager.add(N, l, s.target), this.edgeToDummyNodes.set(s, c), s.isInterGraph() ? this.graphManager.remove(s) : T.remove(s), c;
             }, o.prototype.createBendpointsFromDummyNodes = function() {
               var s = [];
-              s = s.concat(this.graphManager.getAllEdges()), s = [].concat(u(this.edgeToDummyNodes.keys())).concat(s);
+              s = s.concat(this.graphManager.getAllEdges()), s = [].concat(g(this.edgeToDummyNodes.keys())).concat(s);
               for (var c = 0; c < s.length; c++) {
                 var l = s[c];
                 if (l.bendpoints.length > 0) {
-                  for (var T = this.edgeToDummyNodes.get(l), g = 0; g < T.length; g++) {
-                    var d = T[g], N = new i(d.getCenterX(), d.getCenterY()), F = l.bendpoints.get(g);
+                  for (var T = this.edgeToDummyNodes.get(l), u = 0; u < T.length; u++) {
+                    var d = T[u], N = new i(d.getCenterX(), d.getCenterY()), F = l.bendpoints.get(u);
                     F.x = N.x, F.y = N.y, d.getOwner().remove(d);
                   }
                   this.graphManager.add(l, l.source, l.target);
@@ -1087,30 +1087,30 @@ function ur() {
               }
             }, o.transform = function(s, c, l, T) {
               if (l != null && T != null) {
-                var g = c;
+                var u = c;
                 if (s <= 50) {
                   var d = c / l;
-                  g -= (c - d) / 50 * (50 - s);
+                  u -= (c - d) / 50 * (50 - s);
                 } else {
                   var N = c * T;
-                  g += (N - c) / 50 * (s - 50);
+                  u += (N - c) / 50 * (s - 50);
                 }
-                return g;
+                return u;
               } else {
-                var F, C;
-                return s <= 50 ? (F = 9 * c / 500, C = c / 10) : (F = 9 * c / 50, C = -8 * c), F * s + C;
+                var F, A;
+                return s <= 50 ? (F = 9 * c / 500, A = c / 10) : (F = 9 * c / 50, A = -8 * c), F * s + A;
               }
             }, o.findCenterOfTree = function(s) {
               var c = [];
               c = c.concat(s);
-              var l = [], T = /* @__PURE__ */ new Map(), g = false, d = null;
-              (c.length == 1 || c.length == 2) && (g = true, d = c[0]);
+              var l = [], T = /* @__PURE__ */ new Map(), u = false, d = null;
+              (c.length == 1 || c.length == 2) && (u = true, d = c[0]);
               for (var N = 0; N < c.length; N++) {
-                var F = c[N], C = F.getNeighborsList().size;
-                T.set(F, F.getNeighborsList().size), C == 1 && l.push(F);
+                var F = c[N], A = F.getNeighborsList().size;
+                T.set(F, F.getNeighborsList().size), A == 1 && l.push(F);
               }
               var G = [];
-              for (G = G.concat(l); !g; ) {
+              for (G = G.concat(l); !u; ) {
                 var B = [];
                 B = B.concat(G), G = [];
                 for (var N = 0; N < c.length; N++) {
@@ -1124,7 +1124,7 @@ function ur() {
                     }
                   });
                 }
-                l = l.concat(G), (c.length == 1 || c.length == 2) && (g = true, d = c[0]);
+                l = l.concat(G), (c.length == 1 || c.length == 2) && (u = true, d = c[0]);
               }
               return d;
             }, o.prototype.setGraphManager = function(s) {
@@ -1134,16 +1134,16 @@ function ur() {
           /* 16 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.seed = 1, u.x = 0, u.nextDouble = function() {
-              return u.x = Math.sin(u.seed++) * 1e4, u.x - Math.floor(u.x);
-            }, M.exports = u;
+            g.seed = 1, g.x = 0, g.nextDouble = function() {
+              return g.x = Math.sin(g.seed++) * 1e4, g.x - Math.floor(g.x);
+            }, M.exports = g;
           },
           /* 17 */
           /***/
           function(M, P, L) {
-            var u = L(5);
+            var g = L(5);
             function h(a, r) {
               this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
             }
@@ -1192,14 +1192,14 @@ function ur() {
               var r = 0, e = this.ldeviceExtY;
               return e != 0 && (r = this.lworldOrgY + (a - this.ldeviceOrgY) * this.lworldExtY / e), r;
             }, h.prototype.inverseTransformPoint = function(a) {
-              var r = new u(this.inverseTransformX(a.x), this.inverseTransformY(a.y));
+              var r = new g(this.inverseTransformX(a.x), this.inverseTransformY(a.y));
               return r;
             }, M.exports = h;
           },
           /* 18 */
           /***/
           function(M, P, L) {
-            function u(t) {
+            function g(t) {
               if (Array.isArray(t)) {
                 for (var o = 0, s = Array(t.length); o < t.length; o++)
                   s[o] = t[o];
@@ -1217,8 +1217,8 @@ function ur() {
             i.prototype.initParameters = function() {
               h.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = a.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
             }, i.prototype.calcIdealEdgeLengths = function() {
-              for (var t, o, s, c, l, T, g, d = this.getGraphManager().getAllEdges(), N = 0; N < d.length; N++)
-                t = d[N], o = t.idealLength, t.isInterGraph && (c = t.getSource(), l = t.getTarget(), T = t.getSourceInLca().getEstimatedSize(), g = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += T + g - 2 * r.SIMPLE_NODE_SIZE), s = t.getLca().getInclusionTreeDepth(), t.idealLength += o * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (c.getInclusionTreeDepth() + l.getInclusionTreeDepth() - 2 * s));
+              for (var t, o, s, c, l, T, u, d = this.getGraphManager().getAllEdges(), N = 0; N < d.length; N++)
+                t = d[N], o = t.idealLength, t.isInterGraph && (c = t.getSource(), l = t.getTarget(), T = t.getSourceInLca().getEstimatedSize(), u = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += T + u - 2 * r.SIMPLE_NODE_SIZE), s = t.getLca().getInclusionTreeDepth(), t.idealLength += o * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (c.getInclusionTreeDepth() + l.getInclusionTreeDepth() - 2 * s));
             }, i.prototype.initSpringEmbedder = function() {
               var t = this.getAllNodes().length;
               this.incremental ? (t > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (t - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - a.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (t > a.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (t - a.ADAPTATION_LOWER_NODE_LIMIT) / (a.ADAPTATION_UPPER_NODE_LIMIT - a.ADAPTATION_LOWER_NODE_LIMIT) * (1 - a.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = a.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.displacementThresholdPerNode = 3 * a.DEFAULT_EDGE_LENGTH / 100, this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
@@ -1226,14 +1226,14 @@ function ur() {
               for (var t = this.getAllEdges(), o, s = 0; s < t.length; s++)
                 o = t[s], this.calcSpringForce(o, o.idealLength);
             }, i.prototype.calcRepulsionForces = function() {
-              var t = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : true, o = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false, s, c, l, T, g = this.getAllNodes(), d;
+              var t = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : true, o = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false, s, c, l, T, u = this.getAllNodes(), d;
               if (this.useFRGridVariant)
-                for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && t && this.updateGrid(), d = /* @__PURE__ */ new Set(), s = 0; s < g.length; s++)
-                  l = g[s], this.calculateRepulsionForceOfANode(l, d, t, o), d.add(l);
+                for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && t && this.updateGrid(), d = /* @__PURE__ */ new Set(), s = 0; s < u.length; s++)
+                  l = u[s], this.calculateRepulsionForceOfANode(l, d, t, o), d.add(l);
               else
-                for (s = 0; s < g.length; s++)
-                  for (l = g[s], c = s + 1; c < g.length; c++)
-                    T = g[c], l.getOwner() == T.getOwner() && this.calcRepulsionForce(l, T);
+                for (s = 0; s < u.length; s++)
+                  for (l = u[s], c = s + 1; c < u.length; c++)
+                    T = u[c], l.getOwner() == T.getOwner() && this.calcRepulsionForce(l, T);
             }, i.prototype.calcGravitationalForces = function() {
               for (var t, o = this.getAllNodesToApplyGravitation(), s = 0; s < o.length; s++)
                 t = o[s], this.calcGravitationalForce(t);
@@ -1241,23 +1241,23 @@ function ur() {
               for (var t = this.getAllNodes(), o, s = 0; s < t.length; s++)
                 o = t[s], o.move();
             }, i.prototype.calcSpringForce = function(t, o) {
-              var s = t.getSource(), c = t.getTarget(), l, T, g, d;
+              var s = t.getSource(), c = t.getTarget(), l, T, u, d;
               if (this.uniformLeafNodeSizes && s.getChild() == null && c.getChild() == null)
                 t.updateLengthSimple();
               else if (t.updateLength(), t.isOverlapingSourceAndTarget)
                 return;
-              l = t.getLength(), l != 0 && (T = t.edgeElasticity * (l - o), g = T * (t.lengthX / l), d = T * (t.lengthY / l), s.springForceX += g, s.springForceY += d, c.springForceX -= g, c.springForceY -= d);
+              l = t.getLength(), l != 0 && (T = t.edgeElasticity * (l - o), u = T * (t.lengthX / l), d = T * (t.lengthY / l), s.springForceX += u, s.springForceY += d, c.springForceX -= u, c.springForceY -= d);
             }, i.prototype.calcRepulsionForce = function(t, o) {
-              var s = t.getRect(), c = o.getRect(), l = new Array(2), T = new Array(4), g, d, N, F, C, G, B;
+              var s = t.getRect(), c = o.getRect(), l = new Array(2), T = new Array(4), u, d, N, F, A, G, B;
               if (s.intersects(c)) {
                 e.calcSeparationAmount(s, c, l, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * l[0], B = 2 * l[1];
                 var U = t.noOfChildren * o.noOfChildren / (t.noOfChildren + o.noOfChildren);
                 t.repulsionForceX -= U * G, t.repulsionForceY -= U * B, o.repulsionForceX += U * G, o.repulsionForceY += U * B;
               } else
-                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (g = c.getCenterX() - s.getCenterX(), d = c.getCenterY() - s.getCenterY()) : (e.getIntersection(s, c, T), g = T[2] - T[0], d = T[3] - T[1]), Math.abs(g) < a.MIN_REPULSION_DIST && (g = f.sign(g) * a.MIN_REPULSION_DIST), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), N = g * g + d * d, F = Math.sqrt(N), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / N, G = C * g / F, B = C * d / F, t.repulsionForceX -= G, t.repulsionForceY -= B, o.repulsionForceX += G, o.repulsionForceY += B;
+                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (u = c.getCenterX() - s.getCenterX(), d = c.getCenterY() - s.getCenterY()) : (e.getIntersection(s, c, T), u = T[2] - T[0], d = T[3] - T[1]), Math.abs(u) < a.MIN_REPULSION_DIST && (u = f.sign(u) * a.MIN_REPULSION_DIST), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), N = u * u + d * d, F = Math.sqrt(N), A = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / N, G = A * u / F, B = A * d / F, t.repulsionForceX -= G, t.repulsionForceY -= B, o.repulsionForceX += G, o.repulsionForceY += B;
             }, i.prototype.calcGravitationalForce = function(t) {
-              var o, s, c, l, T, g, d, N;
-              o = t.getOwner(), s = (o.getRight() + o.getLeft()) / 2, c = (o.getTop() + o.getBottom()) / 2, l = t.getCenterX() - s, T = t.getCenterY() - c, g = Math.abs(l) + t.getWidth() / 2, d = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (N = o.getEstimatedSize() * this.gravityRangeFactor, (g > N || d > N) && (t.gravitationForceX = -this.gravityConstant * l, t.gravitationForceY = -this.gravityConstant * T)) : (N = o.getEstimatedSize() * this.compoundGravityRangeFactor, (g > N || d > N) && (t.gravitationForceX = -this.gravityConstant * l * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
+              var o, s, c, l, T, u, d, N;
+              o = t.getOwner(), s = (o.getRight() + o.getLeft()) / 2, c = (o.getTop() + o.getBottom()) / 2, l = t.getCenterX() - s, T = t.getCenterY() - c, u = Math.abs(l) + t.getWidth() / 2, d = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (N = o.getEstimatedSize() * this.gravityRangeFactor, (u > N || d > N) && (t.gravitationForceX = -this.gravityConstant * l, t.gravitationForceY = -this.gravityConstant * T)) : (N = o.getEstimatedSize() * this.compoundGravityRangeFactor, (u > N || d > N) && (t.gravitationForceX = -this.gravityConstant * l * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
             }, i.prototype.isConverged = function() {
               var t, o = false;
               return this.totalIterations > this.maxIterations / 3 && (o = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2), t = this.totalDisplacement < this.totalDisplacementThreshold, this.oldTotalDisplacement = this.totalDisplacement, t || o;
@@ -1276,11 +1276,11 @@ function ur() {
                   c[l][T] = new Array();
               return c;
             }, i.prototype.addNodeToGrid = function(t, o, s) {
-              var c = 0, l = 0, T = 0, g = 0;
-              c = parseInt(Math.floor((t.getRect().x - o) / this.repulsionRange)), l = parseInt(Math.floor((t.getRect().width + t.getRect().x - o) / this.repulsionRange)), T = parseInt(Math.floor((t.getRect().y - s) / this.repulsionRange)), g = parseInt(Math.floor((t.getRect().height + t.getRect().y - s) / this.repulsionRange));
+              var c = 0, l = 0, T = 0, u = 0;
+              c = parseInt(Math.floor((t.getRect().x - o) / this.repulsionRange)), l = parseInt(Math.floor((t.getRect().width + t.getRect().x - o) / this.repulsionRange)), T = parseInt(Math.floor((t.getRect().y - s) / this.repulsionRange)), u = parseInt(Math.floor((t.getRect().height + t.getRect().y - s) / this.repulsionRange));
               for (var d = c; d <= l; d++)
-                for (var N = T; N <= g; N++)
-                  this.grid[d][N].push(t), t.setGridCoordinates(c, l, T, g);
+                for (var N = T; N <= u; N++)
+                  this.grid[d][N].push(t), t.setGridCoordinates(c, l, T, u);
             }, i.prototype.updateGrid = function() {
               var t, o, s = this.getAllNodes();
               for (this.grid = this.calcGrid(this.graphManager.getRoot()), t = 0; t < s.length; t++)
@@ -1289,16 +1289,16 @@ function ur() {
               if (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && s || c) {
                 var l = /* @__PURE__ */ new Set();
                 t.surrounding = new Array();
-                for (var T, g = this.grid, d = t.startX - 1; d < t.finishX + 2; d++)
+                for (var T, u = this.grid, d = t.startX - 1; d < t.finishX + 2; d++)
                   for (var N = t.startY - 1; N < t.finishY + 2; N++)
-                    if (!(d < 0 || N < 0 || d >= g.length || N >= g[0].length)) {
-                      for (var F = 0; F < g[d][N].length; F++)
-                        if (T = g[d][N][F], !(t.getOwner() != T.getOwner() || t == T) && !o.has(T) && !l.has(T)) {
-                          var C = Math.abs(t.getCenterX() - T.getCenterX()) - (t.getWidth() / 2 + T.getWidth() / 2), G = Math.abs(t.getCenterY() - T.getCenterY()) - (t.getHeight() / 2 + T.getHeight() / 2);
-                          C <= this.repulsionRange && G <= this.repulsionRange && l.add(T);
+                    if (!(d < 0 || N < 0 || d >= u.length || N >= u[0].length)) {
+                      for (var F = 0; F < u[d][N].length; F++)
+                        if (T = u[d][N][F], !(t.getOwner() != T.getOwner() || t == T) && !o.has(T) && !l.has(T)) {
+                          var A = Math.abs(t.getCenterX() - T.getCenterX()) - (t.getWidth() / 2 + T.getWidth() / 2), G = Math.abs(t.getCenterY() - T.getCenterY()) - (t.getHeight() / 2 + T.getHeight() / 2);
+                          A <= this.repulsionRange && G <= this.repulsionRange && l.add(T);
                         }
                     }
-                t.surrounding = [].concat(u(l));
+                t.surrounding = [].concat(g(l));
               }
               for (d = 0; d < t.surrounding.length; d++)
                 this.calcRepulsionForce(t, t.surrounding[d]);
@@ -1309,25 +1309,25 @@ function ur() {
           /* 19 */
           /***/
           function(M, P, L) {
-            var u = L(1), h = L(4);
+            var g = L(1), h = L(4);
             function a(e, f, i) {
-              u.call(this, e, f, i), this.idealLength = h.DEFAULT_EDGE_LENGTH, this.edgeElasticity = h.DEFAULT_SPRING_STRENGTH;
+              g.call(this, e, f, i), this.idealLength = h.DEFAULT_EDGE_LENGTH, this.edgeElasticity = h.DEFAULT_SPRING_STRENGTH;
             }
-            a.prototype = Object.create(u.prototype);
-            for (var r in u)
-              a[r] = u[r];
+            a.prototype = Object.create(g.prototype);
+            for (var r in g)
+              a[r] = g[r];
             M.exports = a;
           },
           /* 20 */
           /***/
           function(M, P, L) {
-            var u = L(3), h = L(4);
+            var g = L(3), h = L(4);
             function a(e, f, i, v) {
-              u.call(this, e, f, i, v), this.nodeRepulsion = h.DEFAULT_REPULSION_STRENGTH, this.springForceX = 0, this.springForceY = 0, this.repulsionForceX = 0, this.repulsionForceY = 0, this.gravitationForceX = 0, this.gravitationForceY = 0, this.displacementX = 0, this.displacementY = 0, this.startX = 0, this.finishX = 0, this.startY = 0, this.finishY = 0, this.surrounding = [];
+              g.call(this, e, f, i, v), this.nodeRepulsion = h.DEFAULT_REPULSION_STRENGTH, this.springForceX = 0, this.springForceY = 0, this.repulsionForceX = 0, this.repulsionForceY = 0, this.gravitationForceX = 0, this.gravitationForceY = 0, this.displacementX = 0, this.displacementY = 0, this.startX = 0, this.finishX = 0, this.startY = 0, this.finishY = 0, this.surrounding = [];
             }
-            a.prototype = Object.create(u.prototype);
-            for (var r in u)
-              a[r] = u[r];
+            a.prototype = Object.create(g.prototype);
+            for (var r in g)
+              a[r] = g[r];
             a.prototype.setGridCoordinates = function(e, f, i, v) {
               this.startX = e, this.finishX = f, this.startY = i, this.finishY = v;
             }, M.exports = a;
@@ -1335,33 +1335,33 @@ function ur() {
           /* 21 */
           /***/
           function(M, P, L) {
-            function u(h, a) {
+            function g(h, a) {
               this.width = 0, this.height = 0, h !== null && a !== null && (this.height = a, this.width = h);
             }
-            u.prototype.getWidth = function() {
+            g.prototype.getWidth = function() {
               return this.width;
-            }, u.prototype.setWidth = function(h) {
+            }, g.prototype.setWidth = function(h) {
               this.width = h;
-            }, u.prototype.getHeight = function() {
+            }, g.prototype.getHeight = function() {
               return this.height;
-            }, u.prototype.setHeight = function(h) {
+            }, g.prototype.setHeight = function(h) {
               this.height = h;
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 22 */
           /***/
           function(M, P, L) {
-            var u = L(14);
+            var g = L(14);
             function h() {
               this.map = {}, this.keys = [];
             }
             h.prototype.put = function(a, r) {
-              var e = u.createID(a);
+              var e = g.createID(a);
               this.contains(e) || (this.map[e] = r, this.keys.push(a));
             }, h.prototype.contains = function(a) {
-              return u.createID(a), this.map[a] != null;
+              return g.createID(a), this.map[a] != null;
             }, h.prototype.get = function(a) {
-              var r = u.createID(a);
+              var r = g.createID(a);
               return this.map[r];
             }, h.prototype.keySet = function() {
               return this.keys;
@@ -1370,19 +1370,19 @@ function ur() {
           /* 23 */
           /***/
           function(M, P, L) {
-            var u = L(14);
+            var g = L(14);
             function h() {
               this.set = {};
             }
             h.prototype.add = function(a) {
-              var r = u.createID(a);
+              var r = g.createID(a);
               this.contains(r) || (this.set[r] = a);
             }, h.prototype.remove = function(a) {
-              delete this.set[u.createID(a)];
+              delete this.set[g.createID(a)];
             }, h.prototype.clear = function() {
               this.set = {};
             }, h.prototype.contains = function(a) {
-              return this.set[u.createID(a)] == a;
+              return this.set[g.createID(a)] == a;
             }, h.prototype.isEmpty = function() {
               return this.size() === 0;
             }, h.prototype.size = function() {
@@ -1402,9 +1402,9 @@ function ur() {
           /* 24 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.multMat = function(h, a) {
+            g.multMat = function(h, a) {
               for (var r = [], e = 0; e < h.length; e++) {
                 r[e] = [];
                 for (var f = 0; f < a[0].length; f++) {
@@ -1414,39 +1414,39 @@ function ur() {
                 }
               }
               return r;
-            }, u.transpose = function(h) {
+            }, g.transpose = function(h) {
               for (var a = [], r = 0; r < h[0].length; r++) {
                 a[r] = [];
                 for (var e = 0; e < h.length; e++)
                   a[r][e] = h[e][r];
               }
               return a;
-            }, u.multCons = function(h, a) {
+            }, g.multCons = function(h, a) {
               for (var r = [], e = 0; e < h.length; e++)
                 r[e] = h[e] * a;
               return r;
-            }, u.minusOp = function(h, a) {
+            }, g.minusOp = function(h, a) {
               for (var r = [], e = 0; e < h.length; e++)
                 r[e] = h[e] - a[e];
               return r;
-            }, u.dotProduct = function(h, a) {
+            }, g.dotProduct = function(h, a) {
               for (var r = 0, e = 0; e < h.length; e++)
                 r += h[e] * a[e];
               return r;
-            }, u.mag = function(h) {
+            }, g.mag = function(h) {
               return Math.sqrt(this.dotProduct(h, h));
-            }, u.normalize = function(h) {
+            }, g.normalize = function(h) {
               for (var a = [], r = this.mag(h), e = 0; e < h.length; e++)
                 a[e] = h[e] / r;
               return a;
-            }, u.multGamma = function(h) {
+            }, g.multGamma = function(h) {
               for (var a = [], r = 0, e = 0; e < h.length; e++)
                 r += h[e];
               r *= -1 / h.length;
               for (var f = 0; f < h.length; f++)
                 a[f] = r + h[f];
               return a;
-            }, u.multL = function(h, a, r) {
+            }, g.multL = function(h, a, r) {
               for (var e = [], f = [], i = [], v = 0; v < a[0].length; v++) {
                 for (var t = 0, o = 0; o < a.length; o++)
                   t += -0.5 * a[o][v] * h[o];
@@ -1458,17 +1458,17 @@ function ur() {
                 i[s] = c;
               }
               for (var T = 0; T < a.length; T++) {
-                for (var g = 0, d = 0; d < a[0].length; d++)
-                  g += a[T][d] * i[d];
-                e[T] = g;
+                for (var u = 0, d = 0; d < a[0].length; d++)
+                  u += a[T][d] * i[d];
+                e[T] = u;
               }
               return e;
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 25 */
           /***/
           function(M, P, L) {
-            var u = /* @__PURE__ */ function() {
+            var g = /* @__PURE__ */ function() {
               function e(f, i) {
                 for (var v = 0; v < i.length; v++) {
                   var t = i[v];
@@ -1489,7 +1489,7 @@ function ur() {
                 var v = void 0;
                 f instanceof a ? v = f.size() : v = f.length, this._quicksort(f, 0, v - 1);
               }
-              return u(e, [{
+              return g(e, [{
                 key: "_quicksort",
                 value: function(i, v, t) {
                   if (v < t) {
@@ -1538,47 +1538,47 @@ function ur() {
           /* 26 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
             }
-            u.svd = function(h) {
+            g.svd = function(h) {
               this.U = null, this.V = null, this.s = null, this.m = 0, this.n = 0, this.m = h.length, this.n = h[0].length;
               var a = Math.min(this.m, this.n);
               this.s = function(Nt) {
-                for (var Ct = []; Nt-- > 0; )
-                  Ct.push(0);
-                return Ct;
+                for (var At = []; Nt-- > 0; )
+                  At.push(0);
+                return At;
               }(Math.min(this.m + 1, this.n)), this.U = function(Nt) {
-                var Ct = function kt(Gt) {
+                var At = function Zt(Gt) {
                   if (Gt.length == 0)
                     return 0;
                   for (var $t = [], Ft = 0; Ft < Gt[0]; Ft++)
-                    $t.push(kt(Gt.slice(1)));
+                    $t.push(Zt(Gt.slice(1)));
                   return $t;
                 };
-                return Ct(Nt);
+                return At(Nt);
               }([this.m, a]), this.V = function(Nt) {
-                var Ct = function kt(Gt) {
+                var At = function Zt(Gt) {
                   if (Gt.length == 0)
                     return 0;
                   for (var $t = [], Ft = 0; Ft < Gt[0]; Ft++)
-                    $t.push(kt(Gt.slice(1)));
+                    $t.push(Zt(Gt.slice(1)));
                   return $t;
                 };
-                return Ct(Nt);
+                return At(Nt);
               }([this.n, this.n]);
               for (var r = function(Nt) {
-                for (var Ct = []; Nt-- > 0; )
-                  Ct.push(0);
-                return Ct;
+                for (var At = []; Nt-- > 0; )
+                  At.push(0);
+                return At;
               }(this.n), e = function(Nt) {
-                for (var Ct = []; Nt-- > 0; )
-                  Ct.push(0);
-                return Ct;
+                for (var At = []; Nt-- > 0; )
+                  At.push(0);
+                return At;
               }(this.m), f = true, i = Math.min(this.m - 1, this.n), v = Math.max(0, Math.min(this.n - 2, this.m)), t = 0; t < Math.max(i, v); t++) {
                 if (t < i) {
                   this.s[t] = 0;
                   for (var o = t; o < this.m; o++)
-                    this.s[t] = u.hypot(this.s[t], h[o][t]);
+                    this.s[t] = g.hypot(this.s[t], h[o][t]);
                   if (this.s[t] !== 0) {
                     h[t][t] < 0 && (this.s[t] = -this.s[t]);
                     for (var s = t; s < this.m; s++)
@@ -1588,37 +1588,37 @@ function ur() {
                   this.s[t] = -this.s[t];
                 }
                 for (var c = t + 1; c < this.n; c++) {
-                  if (/* @__PURE__ */ function(Nt, Ct) {
-                    return Nt && Ct;
+                  if (/* @__PURE__ */ function(Nt, At) {
+                    return Nt && At;
                   }(t < i, this.s[t] !== 0)) {
                     for (var l = 0, T = t; T < this.m; T++)
                       l += h[T][t] * h[T][c];
                     l = -l / h[t][t];
-                    for (var g = t; g < this.m; g++)
-                      h[g][c] += l * h[g][t];
+                    for (var u = t; u < this.m; u++)
+                      h[u][c] += l * h[u][t];
                   }
                   r[c] = h[t][c];
                 }
-                if (/* @__PURE__ */ function(Nt, Ct) {
-                  return Ct;
+                if (/* @__PURE__ */ function(Nt, At) {
+                  return At;
                 }(f, t < i))
                   for (var d = t; d < this.m; d++)
                     this.U[d][t] = h[d][t];
                 if (t < v) {
                   r[t] = 0;
                   for (var N = t + 1; N < this.n; N++)
-                    r[t] = u.hypot(r[t], r[N]);
+                    r[t] = g.hypot(r[t], r[N]);
                   if (r[t] !== 0) {
                     r[t + 1] < 0 && (r[t] = -r[t]);
                     for (var F = t + 1; F < this.n; F++)
                       r[F] /= r[t];
                     r[t + 1] += 1;
                   }
-                  if (r[t] = -r[t], /* @__PURE__ */ function(Nt, Ct) {
-                    return Nt && Ct;
+                  if (r[t] = -r[t], /* @__PURE__ */ function(Nt, At) {
+                    return Nt && At;
                   }(t + 1 < this.m, r[t] !== 0)) {
-                    for (var C = t + 1; C < this.m; C++)
-                      e[C] = 0;
+                    for (var A = t + 1; A < this.m; A++)
+                      e[A] = 0;
                     for (var G = t + 1; G < this.n; G++)
                       for (var B = t + 1; B < this.m; B++)
                         e[B] += r[G] * h[B][G];
@@ -1659,15 +1659,15 @@ function ur() {
                   }
               }
               for (var V = this.n - 1; V >= 0; V--) {
-                if (/* @__PURE__ */ function(Nt, Ct) {
-                  return Nt && Ct;
+                if (/* @__PURE__ */ function(Nt, At) {
+                  return Nt && At;
                 }(V < v, r[V] !== 0))
-                  for (var X = V + 1; X < a; X++) {
+                  for (var Y = V + 1; Y < a; Y++) {
                     for (var et = 0, z = V + 1; z < this.n; z++)
-                      et += this.V[z][V] * this.V[z][X];
+                      et += this.V[z][V] * this.V[z][Y];
                     et = -et / this.V[V + 1][V];
                     for (var O = V + 1; O < this.n; O++)
-                      this.V[O][X] += et * this.V[O][V];
+                      this.V[O][Y] += et * this.V[O][V];
                   }
                 for (var H = 0; H < this.n; H++)
                   this.V[H][V] = 0;
@@ -1698,11 +1698,11 @@ function ur() {
                     {
                       var rt = r[n - 2];
                       r[n - 2] = 0;
-                      for (var gt = n - 2; gt >= J; gt--) {
-                        var Tt = u.hypot(this.s[gt], rt), Mt = this.s[gt] / Tt, Dt = rt / Tt;
-                        this.s[gt] = Tt, gt !== J && (rt = -Dt * r[gt - 1], r[gt - 1] = Mt * r[gt - 1]);
+                      for (var ut = n - 2; ut >= J; ut--) {
+                        var Tt = g.hypot(this.s[ut], rt), Mt = this.s[ut] / Tt, Dt = rt / Tt;
+                        this.s[ut] = Tt, ut !== J && (rt = -Dt * r[ut - 1], r[ut - 1] = Mt * r[ut - 1]);
                         for (var mt = 0; mt < this.n; mt++)
-                          Tt = Mt * this.V[mt][gt] + Dt * this.V[mt][n - 1], this.V[mt][n - 1] = -Dt * this.V[mt][gt] + Mt * this.V[mt][n - 1], this.V[mt][gt] = Tt;
+                          Tt = Mt * this.V[mt][ut] + Dt * this.V[mt][n - 1], this.V[mt][n - 1] = -Dt * this.V[mt][ut] + Mt * this.V[mt][n - 1], this.V[mt][ut] = Tt;
                       }
                     }
                     break;
@@ -1711,7 +1711,7 @@ function ur() {
                       var xt = r[J - 1];
                       r[J - 1] = 0;
                       for (var St = J; St < n; St++) {
-                        var Vt = u.hypot(this.s[St], xt), Xt = this.s[St] / Vt, Ut = xt / Vt;
+                        var Vt = g.hypot(this.s[St], xt), Xt = this.s[St] / Vt, Ut = xt / Vt;
                         this.s[St] = Vt, xt = -Ut * r[St], r[St] = Xt * r[St];
                         for (var bt = 0; bt < this.m; bt++)
                           Vt = Xt * this.U[bt][St] + Ut * this.U[bt][J - 1], this.U[bt][J - 1] = -Ut * this.U[bt][St] + Xt * this.U[bt][J - 1], this.U[bt][St] = Vt;
@@ -1720,16 +1720,16 @@ function ur() {
                     break;
                   case 3:
                     {
-                      var Ht = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[J])), Math.abs(r[J])), Bt = this.s[n - 1] / Ht, S = this.s[n - 2] / Ht, b = r[n - 2] / Ht, k = this.s[J] / Ht, Q = r[J] / Ht, Z = ((S + Bt) * (S - Bt) + b * b) / 2, it = Bt * b * (Bt * b), ut = 0;
-                      /* @__PURE__ */ (function(Nt, Ct) {
-                        return Nt || Ct;
-                      })(Z !== 0, it !== 0) && (ut = Math.sqrt(Z * Z + it), Z < 0 && (ut = -ut), ut = it / (Z + ut));
-                      for (var ot = (k + Bt) * (k - Bt) + ut, tt = k * Q, j = J; j < n - 1; j++) {
-                        var dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt;
+                      var Ht = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[J])), Math.abs(r[J])), Bt = this.s[n - 1] / Ht, S = this.s[n - 2] / Ht, b = r[n - 2] / Ht, Z = this.s[J] / Ht, Q = r[J] / Ht, k = ((S + Bt) * (S - Bt) + b * b) / 2, it = Bt * b * (Bt * b), gt = 0;
+                      /* @__PURE__ */ (function(Nt, At) {
+                        return Nt || At;
+                      })(k !== 0, it !== 0) && (gt = Math.sqrt(k * k + it), k < 0 && (gt = -gt), gt = it / (k + gt));
+                      for (var ot = (Z + Bt) * (Z - Bt) + gt, tt = Z * Q, j = J; j < n - 1; j++) {
+                        var dt = g.hypot(ot, tt), wt = ot / dt, yt = tt / dt;
                         j !== J && (r[j - 1] = dt), ot = wt * this.s[j] + yt * r[j], r[j] = wt * r[j] - yt * this.s[j], tt = yt * this.s[j + 1], this.s[j + 1] = wt * this.s[j + 1];
                         for (var It = 0; It < this.n; It++)
                           dt = wt * this.V[It][j] + yt * this.V[It][j + 1], this.V[It][j + 1] = -yt * this.V[It][j] + wt * this.V[It][j + 1], this.V[It][j] = dt;
-                        if (dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt, this.s[j] = dt, ot = wt * r[j] + yt * this.s[j + 1], this.s[j + 1] = -yt * r[j] + wt * this.s[j + 1], tt = yt * r[j + 1], r[j + 1] = wt * r[j + 1], j < this.m - 1)
+                        if (dt = g.hypot(ot, tt), wt = ot / dt, yt = tt / dt, this.s[j] = dt, ot = wt * r[j] + yt * this.s[j + 1], this.s[j + 1] = -yt * r[j] + wt * this.s[j + 1], tt = yt * r[j + 1], r[j + 1] = wt * r[j + 1], j < this.m - 1)
                           for (var ft = 0; ft < this.m; ft++)
                             dt = wt * this.U[ft][j] + yt * this.U[ft][j + 1], this.U[ft][j + 1] = -yt * this.U[ft][j] + wt * this.U[ft][j + 1], this.U[ft][j] = dt;
                       }
@@ -1744,13 +1744,13 @@ function ur() {
                           this.V[st][J] = -this.V[st][J];
                       }
                       for (; J < $ && !(this.s[J] >= this.s[J + 1]); ) {
-                        var At = this.s[J];
-                        if (this.s[J] = this.s[J + 1], this.s[J + 1] = At, J < this.n - 1)
+                        var Ct = this.s[J];
+                        if (this.s[J] = this.s[J + 1], this.s[J + 1] = Ct, J < this.n - 1)
                           for (var ct = 0; ct < this.n; ct++)
-                            At = this.V[ct][J + 1], this.V[ct][J + 1] = this.V[ct][J], this.V[ct][J] = At;
+                            Ct = this.V[ct][J + 1], this.V[ct][J + 1] = this.V[ct][J], this.V[ct][J] = Ct;
                         if (J < this.m - 1)
                           for (var lt = 0; lt < this.m; lt++)
-                            At = this.U[lt][J + 1], this.U[lt][J + 1] = this.U[lt][J], this.U[lt][J] = At;
+                            Ct = this.U[lt][J + 1], this.U[lt][J + 1] = this.U[lt][J], this.U[lt][J] = Ct;
                         J++;
                       }
                       n--;
@@ -1760,15 +1760,15 @@ function ur() {
               }
               var Wt = { U: this.U, V: this.V, S: this.s };
               return Wt;
-            }, u.hypot = function(h, a) {
+            }, g.hypot = function(h, a) {
               var r = void 0;
               return Math.abs(h) > Math.abs(a) ? (r = a / h, r = Math.abs(h) * Math.sqrt(1 + r * r)) : a != 0 ? (r = h / a, r = Math.abs(a) * Math.sqrt(1 + r * r)) : r = 0, r;
-            }, M.exports = u;
+            }, M.exports = g;
           },
           /* 27 */
           /***/
           function(M, P, L) {
-            var u = /* @__PURE__ */ function() {
+            var g = /* @__PURE__ */ function() {
               function r(e, f) {
                 for (var i = 0; i < f.length; i++) {
                   var v = f[i];
@@ -1800,7 +1800,7 @@ function ur() {
                 }
                 this.alignments = [], this.score = -1, this.computeGrids();
               }
-              return u(r, [{
+              return g(r, [{
                 key: "getScore",
                 value: function() {
                   return this.score;
@@ -1877,17 +1877,17 @@ function ur() {
           /* 28 */
           /***/
           function(M, P, L) {
-            var u = function() {
+            var g = function() {
             };
-            u.FDLayout = L(18), u.FDLayoutConstants = L(4), u.FDLayoutEdge = L(19), u.FDLayoutNode = L(20), u.DimensionD = L(21), u.HashMap = L(22), u.HashSet = L(23), u.IGeometry = L(8), u.IMath = L(9), u.Integer = L(10), u.Point = L(12), u.PointD = L(5), u.RandomSeed = L(16), u.RectangleD = L(13), u.Transform = L(17), u.UniqueIDGeneretor = L(14), u.Quicksort = L(25), u.LinkedList = L(11), u.LGraphObject = L(2), u.LGraph = L(6), u.LEdge = L(1), u.LGraphManager = L(7), u.LNode = L(3), u.Layout = L(15), u.LayoutConstants = L(0), u.NeedlemanWunsch = L(27), u.Matrix = L(24), u.SVD = L(26), M.exports = u;
+            g.FDLayout = L(18), g.FDLayoutConstants = L(4), g.FDLayoutEdge = L(19), g.FDLayoutNode = L(20), g.DimensionD = L(21), g.HashMap = L(22), g.HashSet = L(23), g.IGeometry = L(8), g.IMath = L(9), g.Integer = L(10), g.Point = L(12), g.PointD = L(5), g.RandomSeed = L(16), g.RectangleD = L(13), g.Transform = L(17), g.UniqueIDGeneretor = L(14), g.Quicksort = L(25), g.LinkedList = L(11), g.LGraphObject = L(2), g.LGraph = L(6), g.LEdge = L(1), g.LGraphManager = L(7), g.LNode = L(3), g.Layout = L(15), g.LayoutConstants = L(0), g.NeedlemanWunsch = L(27), g.Matrix = L(24), g.SVD = L(26), M.exports = g;
           },
           /* 29 */
           /***/
           function(M, P, L) {
-            function u() {
+            function g() {
               this.listeners = [];
             }
-            var h = u.prototype;
+            var h = g.prototype;
             h.addListener = function(a, r) {
               this.listeners.push({
                 event: a,
@@ -1903,7 +1903,7 @@ function ur() {
                 var f = this.listeners[e];
                 a === f.event && f.callback(r);
               }
-            }, M.exports = u;
+            }, M.exports = g;
           }
           /******/
         ])
@@ -1911,12 +1911,12 @@ function ur() {
     });
   }(ce)), ce.exports;
 }
-var gr = fe.exports, Ie;
-function dr() {
-  return Ie || (Ie = 1, function(A, Y) {
+var pr = fe.exports, Ie;
+function yr() {
+  return Ie || (Ie = 1, function(C, X) {
     (function(P, L) {
-      A.exports = L(ur());
-    })(gr, function(M) {
+      C.exports = L(vr());
+    })(pr, function(M) {
       return (
         /******/
         (() => {
@@ -1987,7 +1987,7 @@ function dr() {
             765: (
               /***/
               (a, r, e) => {
-                var f = e(551).FDLayout, i = e(578), v = e(880), t = e(991), o = e(767), s = e(806), c = e(902), l = e(551).FDLayoutConstants, T = e(551).LayoutConstants, g = e(551).Point, d = e(551).PointD, N = e(551).DimensionD, F = e(551).Layout, C = e(551).Integer, G = e(551).IGeometry, B = e(551).LGraph, U = e(551).Transform, K = e(551).LinkedList;
+                var f = e(551).FDLayout, i = e(578), v = e(880), t = e(991), o = e(767), s = e(806), c = e(902), l = e(551).FDLayoutConstants, T = e(551).LayoutConstants, u = e(551).Point, d = e(551).PointD, N = e(551).DimensionD, F = e(551).Layout, A = e(551).Integer, G = e(551).IGeometry, B = e(551).LGraph, U = e(551).Transform, K = e(551).LinkedList;
                 function D() {
                   f.call(this), this.toBeTiled = {}, this.constraints = {};
                 }
@@ -2157,15 +2157,15 @@ function dr() {
                           V.has(_) ? V.get(_).push(ht) : V.set(_, [ht]), V.has(ht) ? V.get(ht).push(_) : V.set(ht, [_]);
                         }
                       });
-                      var X = function(H, $) {
+                      var Y = function(H, $) {
                         var _ = [], ht = [], J = new K(), Rt = /* @__PURE__ */ new Set(), Lt = 0;
                         return H.forEach(function(vt, rt) {
                           if (!Rt.has(rt)) {
                             _[Lt] = [], ht[Lt] = false;
-                            var gt = rt;
-                            for (J.push(gt), Rt.add(gt), _[Lt].push(gt); J.length != 0; ) {
-                              gt = J.shift(), $.has(gt) && (ht[Lt] = true);
-                              var Tt = H.get(gt);
+                            var ut = rt;
+                            for (J.push(ut), Rt.add(ut), _[Lt].push(ut); J.length != 0; ) {
+                              ut = J.shift(), $.has(ut) && (ht[Lt] = true);
+                              var Tt = H.get(ut);
                               Tt.forEach(function(Mt) {
                                 Rt.has(Mt) || (J.push(Mt), Rt.add(Mt), _[Lt].push(Mt));
                               });
@@ -2173,9 +2173,9 @@ function dr() {
                             Lt++;
                           }
                         }), { components: _, isFixed: ht };
-                      }, et = X(q, n.fixedNodesOnHorizontal);
+                      }, et = Y(q, n.fixedNodesOnHorizontal);
                       this.componentsOnHorizontal = et.components, this.fixedComponentsOnHorizontal = et.isFixed;
-                      var z = X(V, n.fixedNodesOnVertical);
+                      var z = Y(V, n.fixedNodesOnVertical);
                       this.componentsOnVertical = z.components, this.fixedComponentsOnVertical = z.isFixed;
                     }
                   }
@@ -2254,8 +2254,8 @@ function dr() {
                         else {
                           for (var q = 0, V = 0, y = 0; y < x.length; y++)
                             if (this.dummyToNodeForVerticalAlignment.has(x[y])) {
-                              var X = this.dummyToNodeForVerticalAlignment.get(x[y]);
-                              q += X.length * this.idToNodeMap.get(X[0]).displacementX, V += X.length;
+                              var Y = this.dummyToNodeForVerticalAlignment.get(x[y]);
+                              q += Y.length * this.idToNodeMap.get(Y[0]).displacementX, V += Y.length;
                             } else
                               q += this.idToNodeMap.get(x[y]).displacementX, V++;
                           for (var et = q / V, y = 0; y < x.length; y++)
@@ -2274,8 +2274,8 @@ function dr() {
                         else {
                           for (var q = 0, V = 0, y = 0; y < x.length; y++)
                             if (this.dummyToNodeForHorizontalAlignment.has(x[y])) {
-                              var X = this.dummyToNodeForHorizontalAlignment.get(x[y]);
-                              q += X.length * this.idToNodeMap.get(X[0]).displacementY, V += X.length;
+                              var Y = this.dummyToNodeForHorizontalAlignment.get(x[y]);
+                              q += Y.length * this.idToNodeMap.get(Y[0]).displacementY, V += Y.length;
                             } else
                               q += this.idToNodeMap.get(x[y]).displacementY, V++;
                           for (var et = q / V, y = 0; y < x.length; y++)
@@ -2320,7 +2320,7 @@ function dr() {
                       break;
                   }
                 }, D.prototype.positionNodesRadially = function(n) {
-                  for (var m = new g(0, 0), p = Math.ceil(Math.sqrt(n.length)), E = 0, y = 0, I = 0, w = new d(0, 0), R = 0; R < n.length; R++) {
+                  for (var m = new u(0, 0), p = Math.ceil(Math.sqrt(n.length)), E = 0, y = 0, I = 0, w = new d(0, 0), R = 0; R < n.length; R++) {
                     R % p == 0 && (I = 0, y = E, R != 0 && (y += s.DEFAULT_COMPONENT_SEPERATION), E = 0);
                     var W = n[R], x = F.findCenterOfTree(W);
                     m.x = I, m.y = y, w = D.radialLayout(W, x, m), w.y > E && (E = Math.floor(w.y)), I = Math.floor(w.x + s.DEFAULT_COMPONENT_SEPERATION);
@@ -2344,16 +2344,16 @@ function dr() {
                   n.setCenter(x, q);
                   var V = [];
                   V = V.concat(n.getEdges());
-                  var X = V.length;
-                  m != null && X--;
+                  var Y = V.length;
+                  m != null && Y--;
                   for (var et = 0, z = V.length, O, H = n.getEdgesBetween(m); H.length > 1; ) {
                     var $ = H[0];
                     H.splice(0, 1);
                     var _ = V.indexOf($);
-                    _ >= 0 && V.splice(_, 1), z--, X--;
+                    _ >= 0 && V.splice(_, 1), z--, Y--;
                   }
                   m != null ? O = (V.indexOf(H[0]) + 1) % z : O = 0;
-                  for (var ht = Math.abs(E - p) / X, J = O; et != X; J = ++J % z) {
+                  for (var ht = Math.abs(E - p) / Y, J = O; et != Y; J = ++J % z) {
                     var Rt = V[J].getOtherEnd(n);
                     if (Rt != m) {
                       var Lt = (p + et * ht) % 360, vt = (Lt + ht) % 360;
@@ -2361,7 +2361,7 @@ function dr() {
                     }
                   }
                 }, D.maxDiagonalInTree = function(n) {
-                  for (var m = C.MIN_VALUE, p = 0; p < n.length; p++) {
+                  for (var m = A.MIN_VALUE, p = 0; p < n.length; p++) {
                     var E = n[p], y = E.getDiagonal();
                     y > m && (m = y);
                   }
@@ -2385,11 +2385,11 @@ function dr() {
                       n.memberGroups[x] = m[W];
                       var q = m[W][0].getParent(), V = new t(n.graphManager);
                       V.id = x, V.paddingLeft = q.paddingLeft || 0, V.paddingRight = q.paddingRight || 0, V.paddingBottom = q.paddingBottom || 0, V.paddingTop = q.paddingTop || 0, n.idToDummyNode[x] = V;
-                      var X = n.getGraphManager().add(n.newGraph(), V), et = q.getChild();
+                      var Y = n.getGraphManager().add(n.newGraph(), V), et = q.getChild();
                       et.add(V);
                       for (var z = 0; z < m[W].length; z++) {
                         var O = m[W][z];
-                        et.remove(O), X.add(O);
+                        et.remove(O), Y.add(O);
                       }
                     }
                   });
@@ -2467,8 +2467,8 @@ function dr() {
                     var x = n.rows[W];
                     m = R;
                     for (var q = 0, V = 0; V < x.length; V++) {
-                      var X = x[V];
-                      X.rect.x = m, X.rect.y = p, m += X.rect.width + n.horizontalPadding, X.rect.height > q && (q = X.rect.height);
+                      var Y = x[V];
+                      Y.rect.x = m, Y.rect.y = p, m += Y.rect.width + n.horizontalPadding, Y.rect.height > q && (q = Y.rect.height);
                     }
                     p += q + n.verticalPadding;
                   }
@@ -2492,9 +2492,9 @@ function dr() {
                   n.forEach(function(z) {
                     I += z.getWidth(), w += z.getHeight(), z.getWidth() > R && (R = z.getWidth());
                   });
-                  var W = I / y, x = w / y, q = Math.pow(p - E, 2) + 4 * (W + E) * (x + p) * y, V = (E - p + Math.sqrt(q)) / (2 * (W + E)), X;
-                  m ? (X = Math.ceil(V), X == V && X++) : X = Math.floor(V);
-                  var et = X * (W + E) - E;
+                  var W = I / y, x = w / y, q = Math.pow(p - E, 2) + 4 * (W + E) * (x + p) * y, V = (E - p + Math.sqrt(q)) / (2 * (W + E)), Y;
+                  m ? (Y = Math.ceil(V), Y == V && Y++) : Y = Math.floor(V);
+                  var et = Y * (W + E) - E;
                   return R > et && (et = R), et += E * 2, et;
                 }, D.prototype.tileNodesByFavoringDim = function(n, m, p) {
                   var E = s.TILING_PADDING_VERTICAL, y = s.TILING_PADDING_HORIZONTAL, I = s.TILING_COMPARE_BY, w = {
@@ -2520,19 +2520,19 @@ function dr() {
                     return w.idealRowWidth ? (H = I, H(z.id, O.id)) : H(z, O);
                   });
                   for (var x = 0, q = 0, V = 0; V < n.length; V++) {
-                    var X = n[V];
-                    x += X.getCenterX(), q += X.getCenterY();
+                    var Y = n[V];
+                    x += Y.getCenterX(), q += Y.getCenterY();
                   }
                   w.centerX = x / n.length, w.centerY = q / n.length;
                   for (var V = 0; V < n.length; V++) {
-                    var X = n[V];
+                    var Y = n[V];
                     if (w.rows.length == 0)
-                      this.insertNodeToRow(w, X, 0, m);
-                    else if (this.canAddHorizontal(w, X.rect.width, X.rect.height)) {
+                      this.insertNodeToRow(w, Y, 0, m);
+                    else if (this.canAddHorizontal(w, Y.rect.width, Y.rect.height)) {
                       var et = w.rows.length - 1;
-                      w.idealRowWidth || (et = this.getShortestRowIndex(w)), this.insertNodeToRow(w, X, et, m);
+                      w.idealRowWidth || (et = this.getShortestRowIndex(w)), this.insertNodeToRow(w, Y, et, m);
                     } else
-                      this.insertNodeToRow(w, X, w.rows.length, m);
+                      this.insertNodeToRow(w, Y, w.rows.length, m);
                     this.shiftToLastRow(w);
                   }
                   return w;
@@ -2617,26 +2617,26 @@ function dr() {
                   if (E == n[1].source ? p = n[1].target : p = n[1].source, s.PURE_INCREMENTAL)
                     E.setCenter(p.getCenterX() + n[3].getWidth(), p.getCenterY() + n[3].getHeight());
                   else {
-                    var y = p.startX, I = p.finishX, w = p.startY, R = p.finishY, W = 0, x = 0, q = 0, V = 0, X = [W, q, x, V];
+                    var y = p.startX, I = p.finishX, w = p.startY, R = p.finishY, W = 0, x = 0, q = 0, V = 0, Y = [W, q, x, V];
                     if (w > 0)
                       for (var et = y; et <= I; et++)
-                        X[0] += this.grid[et][w - 1].length + this.grid[et][w].length - 1;
+                        Y[0] += this.grid[et][w - 1].length + this.grid[et][w].length - 1;
                     if (I < this.grid.length - 1)
                       for (var et = w; et <= R; et++)
-                        X[1] += this.grid[I + 1][et].length + this.grid[I][et].length - 1;
+                        Y[1] += this.grid[I + 1][et].length + this.grid[I][et].length - 1;
                     if (R < this.grid[0].length - 1)
                       for (var et = y; et <= I; et++)
-                        X[2] += this.grid[et][R + 1].length + this.grid[et][R].length - 1;
+                        Y[2] += this.grid[et][R + 1].length + this.grid[et][R].length - 1;
                     if (y > 0)
                       for (var et = w; et <= R; et++)
-                        X[3] += this.grid[y - 1][et].length + this.grid[y][et].length - 1;
-                    for (var z = C.MAX_VALUE, O, H, $ = 0; $ < X.length; $++)
-                      X[$] < z ? (z = X[$], O = 1, H = $) : X[$] == z && O++;
+                        Y[3] += this.grid[y - 1][et].length + this.grid[y][et].length - 1;
+                    for (var z = A.MAX_VALUE, O, H, $ = 0; $ < Y.length; $++)
+                      Y[$] < z ? (z = Y[$], O = 1, H = $) : Y[$] == z && O++;
                     if (O == 3 && z == 0)
-                      X[0] == 0 && X[1] == 0 && X[2] == 0 ? m = 1 : X[0] == 0 && X[1] == 0 && X[3] == 0 ? m = 0 : X[0] == 0 && X[2] == 0 && X[3] == 0 ? m = 3 : X[1] == 0 && X[2] == 0 && X[3] == 0 && (m = 2);
+                      Y[0] == 0 && Y[1] == 0 && Y[2] == 0 ? m = 1 : Y[0] == 0 && Y[1] == 0 && Y[3] == 0 ? m = 0 : Y[0] == 0 && Y[2] == 0 && Y[3] == 0 ? m = 3 : Y[1] == 0 && Y[2] == 0 && Y[3] == 0 && (m = 2);
                     else if (O == 2 && z == 0) {
                       var _ = Math.floor(Math.random() * 2);
-                      X[0] == 0 && X[1] == 0 ? _ == 0 ? m = 0 : m = 1 : X[0] == 0 && X[2] == 0 ? _ == 0 ? m = 0 : m = 2 : X[0] == 0 && X[3] == 0 ? _ == 0 ? m = 0 : m = 3 : X[1] == 0 && X[2] == 0 ? _ == 0 ? m = 1 : m = 2 : X[1] == 0 && X[3] == 0 ? _ == 0 ? m = 1 : m = 3 : _ == 0 ? m = 2 : m = 3;
+                      Y[0] == 0 && Y[1] == 0 ? _ == 0 ? m = 0 : m = 1 : Y[0] == 0 && Y[2] == 0 ? _ == 0 ? m = 0 : m = 2 : Y[0] == 0 && Y[3] == 0 ? _ == 0 ? m = 0 : m = 3 : Y[1] == 0 && Y[2] == 0 ? _ == 0 ? m = 1 : m = 2 : Y[1] == 0 && Y[3] == 0 ? _ == 0 ? m = 1 : m = 3 : _ == 0 ? m = 2 : m = 3;
                     } else if (O == 4 && z == 0) {
                       var _ = Math.floor(Math.random() * 4);
                       m = _;
@@ -2702,27 +2702,27 @@ function dr() {
                 s.handleConstraints = function(c) {
                   var l = {};
                   l.fixedNodeConstraint = c.constraints.fixedNodeConstraint, l.alignmentConstraint = c.constraints.alignmentConstraint, l.relativePlacementConstraint = c.constraints.relativePlacementConstraint;
-                  for (var T = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Map(), d = [], N = [], F = c.getAllNodes(), C = 0, G = 0; G < F.length; G++) {
+                  for (var T = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map(), d = [], N = [], F = c.getAllNodes(), A = 0, G = 0; G < F.length; G++) {
                     var B = F[G];
-                    B.getChild() == null && (g.set(B.id, C++), d.push(B.getCenterX()), N.push(B.getCenterY()), T.set(B.id, B));
+                    B.getChild() == null && (u.set(B.id, A++), d.push(B.getCenterX()), N.push(B.getCenterY()), T.set(B.id, B));
                   }
                   l.relativePlacementConstraint && l.relativePlacementConstraint.forEach(function(S) {
                     !S.gap && S.gap != 0 && (S.left ? S.gap = i.DEFAULT_EDGE_LENGTH + T.get(S.left).getWidth() / 2 + T.get(S.right).getWidth() / 2 : S.gap = i.DEFAULT_EDGE_LENGTH + T.get(S.top).getHeight() / 2 + T.get(S.bottom).getHeight() / 2);
                   });
-                  var U = function(b, k) {
-                    return { x: b.x - k.x, y: b.y - k.y };
+                  var U = function(b, Z) {
+                    return { x: b.x - Z.x, y: b.y - Z.y };
                   }, K = function(b) {
-                    var k = 0, Q = 0;
-                    return b.forEach(function(Z) {
-                      k += d[g.get(Z)], Q += N[g.get(Z)];
-                    }), { x: k / b.size, y: Q / b.size };
-                  }, D = function(b, k, Q, Z, it) {
-                    function ut(ft, st) {
-                      var At = new Set(ft), ct = true, lt = false, Wt = void 0;
+                    var Z = 0, Q = 0;
+                    return b.forEach(function(k) {
+                      Z += d[u.get(k)], Q += N[u.get(k)];
+                    }), { x: Z / b.size, y: Q / b.size };
+                  }, D = function(b, Z, Q, k, it) {
+                    function gt(ft, st) {
+                      var Ct = new Set(ft), ct = true, lt = false, Wt = void 0;
                       try {
-                        for (var Nt = st[Symbol.iterator](), Ct; !(ct = (Ct = Nt.next()).done); ct = true) {
-                          var kt = Ct.value;
-                          At.add(kt);
+                        for (var Nt = st[Symbol.iterator](), At; !(ct = (At = Nt.next()).done); ct = true) {
+                          var Zt = At.value;
+                          Ct.add(Zt);
                         }
                       } catch (Gt) {
                         lt = true, Wt = Gt;
@@ -2734,46 +2734,46 @@ function dr() {
                             throw Wt;
                         }
                       }
-                      return At;
+                      return Ct;
                     }
                     var ot = /* @__PURE__ */ new Map();
                     b.forEach(function(ft, st) {
                       ot.set(st, 0);
                     }), b.forEach(function(ft, st) {
-                      ft.forEach(function(At) {
-                        ot.set(At.id, ot.get(At.id) + 1);
+                      ft.forEach(function(Ct) {
+                        ot.set(Ct.id, ot.get(Ct.id) + 1);
                       });
                     });
                     var tt = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), dt = new v();
                     ot.forEach(function(ft, st) {
-                      ft == 0 ? (dt.push(st), Q || (k == "horizontal" ? tt.set(st, g.has(st) ? d[g.get(st)] : Z.get(st)) : tt.set(st, g.has(st) ? N[g.get(st)] : Z.get(st)))) : tt.set(st, Number.NEGATIVE_INFINITY), Q && j.set(st, /* @__PURE__ */ new Set([st]));
+                      ft == 0 ? (dt.push(st), Q || (Z == "horizontal" ? tt.set(st, u.has(st) ? d[u.get(st)] : k.get(st)) : tt.set(st, u.has(st) ? N[u.get(st)] : k.get(st)))) : tt.set(st, Number.NEGATIVE_INFINITY), Q && j.set(st, /* @__PURE__ */ new Set([st]));
                     }), Q && it.forEach(function(ft) {
                       var st = [];
                       if (ft.forEach(function(lt) {
                         Q.has(lt) && st.push(lt);
                       }), st.length > 0) {
-                        var At = 0;
+                        var Ct = 0;
                         st.forEach(function(lt) {
-                          k == "horizontal" ? (tt.set(lt, g.has(lt) ? d[g.get(lt)] : Z.get(lt)), At += tt.get(lt)) : (tt.set(lt, g.has(lt) ? N[g.get(lt)] : Z.get(lt)), At += tt.get(lt));
-                        }), At = At / st.length, ft.forEach(function(lt) {
-                          Q.has(lt) || tt.set(lt, At);
+                          Z == "horizontal" ? (tt.set(lt, u.has(lt) ? d[u.get(lt)] : k.get(lt)), Ct += tt.get(lt)) : (tt.set(lt, u.has(lt) ? N[u.get(lt)] : k.get(lt)), Ct += tt.get(lt));
+                        }), Ct = Ct / st.length, ft.forEach(function(lt) {
+                          Q.has(lt) || tt.set(lt, Ct);
                         });
                       } else {
                         var ct = 0;
                         ft.forEach(function(lt) {
-                          k == "horizontal" ? ct += g.has(lt) ? d[g.get(lt)] : Z.get(lt) : ct += g.has(lt) ? N[g.get(lt)] : Z.get(lt);
+                          Z == "horizontal" ? ct += u.has(lt) ? d[u.get(lt)] : k.get(lt) : ct += u.has(lt) ? N[u.get(lt)] : k.get(lt);
                         }), ct = ct / ft.length, ft.forEach(function(lt) {
                           tt.set(lt, ct);
                         });
                       }
                     });
                     for (var wt = function() {
-                      var st = dt.shift(), At = b.get(st);
-                      At.forEach(function(ct) {
+                      var st = dt.shift(), Ct = b.get(st);
+                      Ct.forEach(function(ct) {
                         if (tt.get(ct.id) < tt.get(st) + ct.gap)
                           if (Q && Q.has(ct.id)) {
                             var lt = void 0;
-                            if (k == "horizontal" ? lt = g.has(ct.id) ? d[g.get(ct.id)] : Z.get(ct.id) : lt = g.has(ct.id) ? N[g.get(ct.id)] : Z.get(ct.id), tt.set(ct.id, lt), lt < tt.get(st) + ct.gap) {
+                            if (Z == "horizontal" ? lt = u.has(ct.id) ? d[u.get(ct.id)] : k.get(ct.id) : lt = u.has(ct.id) ? N[u.get(ct.id)] : k.get(ct.id), tt.set(ct.id, lt), lt < tt.get(st) + ct.gap) {
                               var Wt = tt.get(st) + ct.gap - lt;
                               j.get(st).forEach(function(Nt) {
                                 tt.set(Nt, tt.get(Nt) - Wt);
@@ -2781,7 +2781,7 @@ function dr() {
                             }
                           } else
                             tt.set(ct.id, tt.get(st) + ct.gap);
-                        ot.set(ct.id, ot.get(ct.id) - 1), ot.get(ct.id) == 0 && dt.push(ct.id), Q && j.set(ct.id, ut(j.get(st), j.get(ct.id)));
+                        ot.set(ct.id, ot.get(ct.id) - 1), ot.get(ct.id) == 0 && dt.push(ct.id), Q && j.set(ct.id, gt(j.get(st), j.get(ct.id)));
                       });
                     }; dt.length != 0; )
                       wt();
@@ -2793,11 +2793,11 @@ function dr() {
                       var It = [];
                       j.forEach(function(ft, st) {
                         if (yt.has(st)) {
-                          var At = false, ct = true, lt = false, Wt = void 0;
+                          var Ct = false, ct = true, lt = false, Wt = void 0;
                           try {
-                            for (var Nt = ft[Symbol.iterator](), Ct; !(ct = (Ct = Nt.next()).done); ct = true) {
-                              var kt = Ct.value;
-                              Q.has(kt) && (At = true);
+                            for (var Nt = ft[Symbol.iterator](), At; !(ct = (At = Nt.next()).done); ct = true) {
+                              var Zt = At.value;
+                              Q.has(Zt) && (Ct = true);
                             }
                           } catch (Ft) {
                             lt = true, Wt = Ft;
@@ -2809,7 +2809,7 @@ function dr() {
                                 throw Wt;
                             }
                           }
-                          if (!At) {
+                          if (!Ct) {
                             var Gt = false, $t = void 0;
                             It.forEach(function(Ft, qt) {
                               Ft.has([].concat(f(ft))[0]) && (Gt = true, $t = qt);
@@ -2819,29 +2819,29 @@ function dr() {
                           }
                         }
                       }), It.forEach(function(ft, st) {
-                        var At = Number.POSITIVE_INFINITY, ct = Number.POSITIVE_INFINITY, lt = Number.NEGATIVE_INFINITY, Wt = Number.NEGATIVE_INFINITY, Nt = true, Ct = false, kt = void 0;
+                        var Ct = Number.POSITIVE_INFINITY, ct = Number.POSITIVE_INFINITY, lt = Number.NEGATIVE_INFINITY, Wt = Number.NEGATIVE_INFINITY, Nt = true, At = false, Zt = void 0;
                         try {
                           for (var Gt = ft[Symbol.iterator](), $t; !(Nt = ($t = Gt.next()).done); Nt = true) {
                             var Ft = $t.value, qt = void 0;
-                            k == "horizontal" ? qt = g.has(Ft) ? d[g.get(Ft)] : Z.get(Ft) : qt = g.has(Ft) ? N[g.get(Ft)] : Z.get(Ft);
+                            Z == "horizontal" ? qt = u.has(Ft) ? d[u.get(Ft)] : k.get(Ft) : qt = u.has(Ft) ? N[u.get(Ft)] : k.get(Ft);
                             var _t = tt.get(Ft);
-                            qt < At && (At = qt), qt > lt && (lt = qt), _t < ct && (ct = _t), _t > Wt && (Wt = _t);
+                            qt < Ct && (Ct = qt), qt > lt && (lt = qt), _t < ct && (ct = _t), _t > Wt && (Wt = _t);
                           }
                         } catch (ie) {
-                          Ct = true, kt = ie;
+                          At = true, Zt = ie;
                         } finally {
                           try {
                             !Nt && Gt.return && Gt.return();
                           } finally {
-                            if (Ct)
-                              throw kt;
+                            if (At)
+                              throw Zt;
                           }
                         }
-                        var de = (At + lt) / 2 - (ct + Wt) / 2, Kt = true, te = false, ee = void 0;
+                        var ue = (Ct + lt) / 2 - (ct + Wt) / 2, Kt = true, te = false, ee = void 0;
                         try {
                           for (var jt = ft[Symbol.iterator](), se; !(Kt = (se = jt.next()).done); Kt = true) {
                             var re = se.value;
-                            tt.set(re, tt.get(re) + de);
+                            tt.set(re, tt.get(re) + ue);
                           }
                         } catch (ie) {
                           te = true, ee = ie;
@@ -2857,52 +2857,52 @@ function dr() {
                     }
                     return tt;
                   }, at = function(b) {
-                    var k = 0, Q = 0, Z = 0, it = 0;
+                    var Z = 0, Q = 0, k = 0, it = 0;
                     if (b.forEach(function(j) {
-                      j.left ? d[g.get(j.left)] - d[g.get(j.right)] >= 0 ? k++ : Q++ : N[g.get(j.top)] - N[g.get(j.bottom)] >= 0 ? Z++ : it++;
-                    }), k > Q && Z > it)
-                      for (var ut = 0; ut < g.size; ut++)
-                        d[ut] = -1 * d[ut], N[ut] = -1 * N[ut];
-                    else if (k > Q)
-                      for (var ot = 0; ot < g.size; ot++)
+                      j.left ? d[u.get(j.left)] - d[u.get(j.right)] >= 0 ? Z++ : Q++ : N[u.get(j.top)] - N[u.get(j.bottom)] >= 0 ? k++ : it++;
+                    }), Z > Q && k > it)
+                      for (var gt = 0; gt < u.size; gt++)
+                        d[gt] = -1 * d[gt], N[gt] = -1 * N[gt];
+                    else if (Z > Q)
+                      for (var ot = 0; ot < u.size; ot++)
                         d[ot] = -1 * d[ot];
-                    else if (Z > it)
-                      for (var tt = 0; tt < g.size; tt++)
+                    else if (k > it)
+                      for (var tt = 0; tt < u.size; tt++)
                         N[tt] = -1 * N[tt];
                   }, n = function(b) {
-                    var k = [], Q = new v(), Z = /* @__PURE__ */ new Set(), it = 0;
-                    return b.forEach(function(ut, ot) {
-                      if (!Z.has(ot)) {
-                        k[it] = [];
+                    var Z = [], Q = new v(), k = /* @__PURE__ */ new Set(), it = 0;
+                    return b.forEach(function(gt, ot) {
+                      if (!k.has(ot)) {
+                        Z[it] = [];
                         var tt = ot;
-                        for (Q.push(tt), Z.add(tt), k[it].push(tt); Q.length != 0; ) {
+                        for (Q.push(tt), k.add(tt), Z[it].push(tt); Q.length != 0; ) {
                           tt = Q.shift();
                           var j = b.get(tt);
                           j.forEach(function(dt) {
-                            Z.has(dt.id) || (Q.push(dt.id), Z.add(dt.id), k[it].push(dt.id));
+                            k.has(dt.id) || (Q.push(dt.id), k.add(dt.id), Z[it].push(dt.id));
                           });
                         }
                         it++;
                       }
-                    }), k;
+                    }), Z;
                   }, m = function(b) {
-                    var k = /* @__PURE__ */ new Map();
-                    return b.forEach(function(Q, Z) {
-                      k.set(Z, []);
-                    }), b.forEach(function(Q, Z) {
+                    var Z = /* @__PURE__ */ new Map();
+                    return b.forEach(function(Q, k) {
+                      Z.set(k, []);
+                    }), b.forEach(function(Q, k) {
                       Q.forEach(function(it) {
-                        k.get(Z).push(it), k.get(it.id).push({ id: Z, gap: it.gap, direction: it.direction });
+                        Z.get(k).push(it), Z.get(it.id).push({ id: k, gap: it.gap, direction: it.direction });
                       });
-                    }), k;
+                    }), Z;
                   }, p = function(b) {
-                    var k = /* @__PURE__ */ new Map();
-                    return b.forEach(function(Q, Z) {
-                      k.set(Z, []);
-                    }), b.forEach(function(Q, Z) {
+                    var Z = /* @__PURE__ */ new Map();
+                    return b.forEach(function(Q, k) {
+                      Z.set(k, []);
+                    }), b.forEach(function(Q, k) {
                       Q.forEach(function(it) {
-                        k.get(it.id).push({ id: Z, gap: it.gap, direction: it.direction });
+                        Z.get(it.id).push({ id: k, gap: it.gap, direction: it.direction });
                       });
-                    }), k;
+                    }), Z;
                   }, E = [], y = [], I = false, w = false, R = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), q = [];
                   if (l.fixedNodeConstraint && l.fixedNodeConstraint.forEach(function(S) {
                     R.add(S.nodeId);
@@ -2911,13 +2911,13 @@ function dr() {
                   }), x = m(W), q = n(x)), i.TRANSFORM_ON_CONSTRAINT_HANDLING) {
                     if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 1)
                       l.fixedNodeConstraint.forEach(function(S, b) {
-                        E[b] = [S.position.x, S.position.y], y[b] = [d[g.get(S.nodeId)], N[g.get(S.nodeId)]];
+                        E[b] = [S.position.x, S.position.y], y[b] = [d[u.get(S.nodeId)], N[u.get(S.nodeId)]];
                       }), I = true;
                     else if (l.alignmentConstraint)
                       (function() {
                         var S = 0;
                         if (l.alignmentConstraint.vertical) {
-                          for (var b = l.alignmentConstraint.vertical, k = function(tt) {
+                          for (var b = l.alignmentConstraint.vertical, Z = function(tt) {
                             var j = /* @__PURE__ */ new Set();
                             b[tt].forEach(function(yt) {
                               j.add(yt);
@@ -2925,46 +2925,46 @@ function dr() {
                             var dt = new Set([].concat(f(j)).filter(function(yt) {
                               return R.has(yt);
                             })), wt = void 0;
-                            dt.size > 0 ? wt = d[g.get(dt.values().next().value)] : wt = K(j).x, b[tt].forEach(function(yt) {
-                              E[S] = [wt, N[g.get(yt)]], y[S] = [d[g.get(yt)], N[g.get(yt)]], S++;
+                            dt.size > 0 ? wt = d[u.get(dt.values().next().value)] : wt = K(j).x, b[tt].forEach(function(yt) {
+                              E[S] = [wt, N[u.get(yt)]], y[S] = [d[u.get(yt)], N[u.get(yt)]], S++;
                             });
                           }, Q = 0; Q < b.length; Q++)
-                            k(Q);
+                            Z(Q);
                           I = true;
                         }
                         if (l.alignmentConstraint.horizontal) {
-                          for (var Z = l.alignmentConstraint.horizontal, it = function(tt) {
+                          for (var k = l.alignmentConstraint.horizontal, it = function(tt) {
                             var j = /* @__PURE__ */ new Set();
-                            Z[tt].forEach(function(yt) {
+                            k[tt].forEach(function(yt) {
                               j.add(yt);
                             });
                             var dt = new Set([].concat(f(j)).filter(function(yt) {
                               return R.has(yt);
                             })), wt = void 0;
-                            dt.size > 0 ? wt = d[g.get(dt.values().next().value)] : wt = K(j).y, Z[tt].forEach(function(yt) {
-                              E[S] = [d[g.get(yt)], wt], y[S] = [d[g.get(yt)], N[g.get(yt)]], S++;
+                            dt.size > 0 ? wt = d[u.get(dt.values().next().value)] : wt = K(j).y, k[tt].forEach(function(yt) {
+                              E[S] = [d[u.get(yt)], wt], y[S] = [d[u.get(yt)], N[u.get(yt)]], S++;
                             });
-                          }, ut = 0; ut < Z.length; ut++)
-                            it(ut);
+                          }, gt = 0; gt < k.length; gt++)
+                            it(gt);
                           I = true;
                         }
                         l.relativePlacementConstraint && (w = true);
                       })();
                     else if (l.relativePlacementConstraint) {
-                      for (var V = 0, X = 0, et = 0; et < q.length; et++)
-                        q[et].length > V && (V = q[et].length, X = et);
+                      for (var V = 0, Y = 0, et = 0; et < q.length; et++)
+                        q[et].length > V && (V = q[et].length, Y = et);
                       if (V < x.size / 2)
                         at(l.relativePlacementConstraint), I = false, w = false;
                       else {
                         var z = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map(), H = [];
-                        q[X].forEach(function(S) {
+                        q[Y].forEach(function(S) {
                           W.get(S).forEach(function(b) {
                             b.direction == "horizontal" ? (z.has(S) ? z.get(S).push(b) : z.set(S, [b]), z.has(b.id) || z.set(b.id, []), H.push({ left: S, right: b.id })) : (O.has(S) ? O.get(S).push(b) : O.set(S, [b]), O.has(b.id) || O.set(b.id, []), H.push({ top: S, bottom: b.id }));
                           });
                         }), at(H), w = false;
                         var $ = D(z, "horizontal"), _ = D(O, "vertical");
-                        q[X].forEach(function(S, b) {
-                          y[b] = [d[g.get(S)], N[g.get(S)]], E[b] = [], $.has(S) ? E[b][0] = $.get(S) : E[b][0] = d[g.get(S)], _.has(S) ? E[b][1] = _.get(S) : E[b][1] = N[g.get(S)];
+                        q[Y].forEach(function(S, b) {
+                          y[b] = [d[u.get(S)], N[u.get(S)]], E[b] = [], $.has(S) ? E[b][0] = $.get(S) : E[b][0] = d[u.get(S)], _.has(S) ? E[b][1] = _.get(S) : E[b][1] = N[u.get(S)];
                         }), I = true;
                       }
                     }
@@ -2973,9 +2973,9 @@ function dr() {
                         J[Lt] = t.multGamma(J[Lt]), Rt[Lt] = t.multGamma(Rt[Lt]);
                       var vt = t.multMat(J, t.transpose(Rt)), rt = o.svd(vt);
                       ht = t.multMat(rt.V, t.transpose(rt.U));
-                      for (var gt = 0; gt < g.size; gt++) {
-                        var Tt = [d[gt], N[gt]], Mt = [ht[0][0], ht[1][0]], Dt = [ht[0][1], ht[1][1]];
-                        d[gt] = t.dotProduct(Tt, Mt), N[gt] = t.dotProduct(Tt, Dt);
+                      for (var ut = 0; ut < u.size; ut++) {
+                        var Tt = [d[ut], N[ut]], Mt = [ht[0][0], ht[1][0]], Dt = [ht[0][1], ht[1][1]];
+                        d[ut] = t.dotProduct(Tt, Mt), N[ut] = t.dotProduct(Tt, Dt);
                       }
                       w && at(l.relativePlacementConstraint);
                     }
@@ -2984,76 +2984,76 @@ function dr() {
                     if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 0) {
                       var mt = { x: 0, y: 0 };
                       l.fixedNodeConstraint.forEach(function(S, b) {
-                        var k = { x: d[g.get(S.nodeId)], y: N[g.get(S.nodeId)] }, Q = S.position, Z = U(Q, k);
-                        mt.x += Z.x, mt.y += Z.y;
+                        var Z = { x: d[u.get(S.nodeId)], y: N[u.get(S.nodeId)] }, Q = S.position, k = U(Q, Z);
+                        mt.x += k.x, mt.y += k.y;
                       }), mt.x /= l.fixedNodeConstraint.length, mt.y /= l.fixedNodeConstraint.length, d.forEach(function(S, b) {
                         d[b] += mt.x;
                       }), N.forEach(function(S, b) {
                         N[b] += mt.y;
                       }), l.fixedNodeConstraint.forEach(function(S) {
-                        d[g.get(S.nodeId)] = S.position.x, N[g.get(S.nodeId)] = S.position.y;
+                        d[u.get(S.nodeId)] = S.position.x, N[u.get(S.nodeId)] = S.position.y;
                       });
                     }
                     if (l.alignmentConstraint) {
                       if (l.alignmentConstraint.vertical)
                         for (var xt = l.alignmentConstraint.vertical, St = function(b) {
-                          var k = /* @__PURE__ */ new Set();
+                          var Z = /* @__PURE__ */ new Set();
                           xt[b].forEach(function(it) {
-                            k.add(it);
+                            Z.add(it);
                           });
-                          var Q = new Set([].concat(f(k)).filter(function(it) {
+                          var Q = new Set([].concat(f(Z)).filter(function(it) {
                             return R.has(it);
-                          })), Z = void 0;
-                          Q.size > 0 ? Z = d[g.get(Q.values().next().value)] : Z = K(k).x, k.forEach(function(it) {
-                            R.has(it) || (d[g.get(it)] = Z);
+                          })), k = void 0;
+                          Q.size > 0 ? k = d[u.get(Q.values().next().value)] : k = K(Z).x, Z.forEach(function(it) {
+                            R.has(it) || (d[u.get(it)] = k);
                           });
                         }, Vt = 0; Vt < xt.length; Vt++)
                           St(Vt);
                       if (l.alignmentConstraint.horizontal)
                         for (var Xt = l.alignmentConstraint.horizontal, Ut = function(b) {
-                          var k = /* @__PURE__ */ new Set();
+                          var Z = /* @__PURE__ */ new Set();
                           Xt[b].forEach(function(it) {
-                            k.add(it);
+                            Z.add(it);
                           });
-                          var Q = new Set([].concat(f(k)).filter(function(it) {
+                          var Q = new Set([].concat(f(Z)).filter(function(it) {
                             return R.has(it);
-                          })), Z = void 0;
-                          Q.size > 0 ? Z = N[g.get(Q.values().next().value)] : Z = K(k).y, k.forEach(function(it) {
-                            R.has(it) || (N[g.get(it)] = Z);
+                          })), k = void 0;
+                          Q.size > 0 ? k = N[u.get(Q.values().next().value)] : k = K(Z).y, Z.forEach(function(it) {
+                            R.has(it) || (N[u.get(it)] = k);
                           });
                         }, bt = 0; bt < Xt.length; bt++)
                           Ut(bt);
                     }
                     l.relativePlacementConstraint && function() {
-                      var S = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), Q = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), it = /* @__PURE__ */ new Map(), ut = /* @__PURE__ */ new Set(), ot = /* @__PURE__ */ new Set();
+                      var S = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), Q = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), it = /* @__PURE__ */ new Map(), gt = /* @__PURE__ */ new Set(), ot = /* @__PURE__ */ new Set();
                       if (R.forEach(function(Yt) {
-                        ut.add(Yt), ot.add(Yt);
+                        gt.add(Yt), ot.add(Yt);
                       }), l.alignmentConstraint) {
                         if (l.alignmentConstraint.vertical)
                           for (var tt = l.alignmentConstraint.vertical, j = function(Et) {
-                            k.set("dummy" + Et, []), tt[Et].forEach(function(Ot) {
-                              S.set(Ot, "dummy" + Et), k.get("dummy" + Et).push(Ot), R.has(Ot) && ut.add("dummy" + Et);
-                            }), Z.set("dummy" + Et, d[g.get(tt[Et][0])]);
+                            Z.set("dummy" + Et, []), tt[Et].forEach(function(Ot) {
+                              S.set(Ot, "dummy" + Et), Z.get("dummy" + Et).push(Ot), R.has(Ot) && gt.add("dummy" + Et);
+                            }), k.set("dummy" + Et, d[u.get(tt[Et][0])]);
                           }, dt = 0; dt < tt.length; dt++)
                             j(dt);
                         if (l.alignmentConstraint.horizontal)
                           for (var wt = l.alignmentConstraint.horizontal, yt = function(Et) {
                             Q.set("dummy" + Et, []), wt[Et].forEach(function(Ot) {
                               b.set(Ot, "dummy" + Et), Q.get("dummy" + Et).push(Ot), R.has(Ot) && ot.add("dummy" + Et);
-                            }), it.set("dummy" + Et, N[g.get(wt[Et][0])]);
+                            }), it.set("dummy" + Et, N[u.get(wt[Et][0])]);
                           }, It = 0; It < wt.length; It++)
                             yt(It);
                       }
-                      var ft = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), At = function(Et) {
+                      var ft = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), Ct = function(Et) {
                         W.get(Et).forEach(function(Ot) {
-                          var Jt = void 0, Zt = void 0;
-                          Ot.direction == "horizontal" ? (Jt = S.get(Et) ? S.get(Et) : Et, S.get(Ot.id) ? Zt = { id: S.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : Zt = Ot, ft.has(Jt) ? ft.get(Jt).push(Zt) : ft.set(Jt, [Zt]), ft.has(Zt.id) || ft.set(Zt.id, [])) : (Jt = b.get(Et) ? b.get(Et) : Et, b.get(Ot.id) ? Zt = { id: b.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : Zt = Ot, st.has(Jt) ? st.get(Jt).push(Zt) : st.set(Jt, [Zt]), st.has(Zt.id) || st.set(Zt.id, []));
+                          var Jt = void 0, kt = void 0;
+                          Ot.direction == "horizontal" ? (Jt = S.get(Et) ? S.get(Et) : Et, S.get(Ot.id) ? kt = { id: S.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, ft.has(Jt) ? ft.get(Jt).push(kt) : ft.set(Jt, [kt]), ft.has(kt.id) || ft.set(kt.id, [])) : (Jt = b.get(Et) ? b.get(Et) : Et, b.get(Ot.id) ? kt = { id: b.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, st.has(Jt) ? st.get(Jt).push(kt) : st.set(Jt, [kt]), st.has(kt.id) || st.set(kt.id, []));
                         });
                       }, ct = true, lt = false, Wt = void 0;
                       try {
-                        for (var Nt = W.keys()[Symbol.iterator](), Ct; !(ct = (Ct = Nt.next()).done); ct = true) {
-                          var kt = Ct.value;
-                          At(kt);
+                        for (var Nt = W.keys()[Symbol.iterator](), At; !(ct = (At = Nt.next()).done); ct = true) {
+                          var Zt = At.value;
+                          Ct(Zt);
                         }
                       } catch (Yt) {
                         lt = true, Wt = Yt;
@@ -3065,51 +3065,51 @@ function dr() {
                             throw Wt;
                         }
                       }
-                      var Gt = m(ft), $t = m(st), Ft = n(Gt), qt = n($t), _t = p(ft), de = p(st), Kt = [], te = [];
+                      var Gt = m(ft), $t = m(st), Ft = n(Gt), qt = n($t), _t = p(ft), ue = p(st), Kt = [], te = [];
                       Ft.forEach(function(Yt, Et) {
                         Kt[Et] = [], Yt.forEach(function(Ot) {
                           _t.get(Ot).length == 0 && Kt[Et].push(Ot);
                         });
                       }), qt.forEach(function(Yt, Et) {
                         te[Et] = [], Yt.forEach(function(Ot) {
-                          de.get(Ot).length == 0 && te[Et].push(Ot);
+                          ue.get(Ot).length == 0 && te[Et].push(Ot);
                         });
                       });
-                      var ee = D(ft, "horizontal", ut, Z, Kt), jt = D(st, "vertical", ot, it, te), se = function(Et) {
-                        k.get(Et) ? k.get(Et).forEach(function(Ot) {
-                          d[g.get(Ot)] = ee.get(Et);
-                        }) : d[g.get(Et)] = ee.get(Et);
-                      }, re = true, ie = false, Ce = void 0;
+                      var ee = D(ft, "horizontal", gt, k, Kt), jt = D(st, "vertical", ot, it, te), se = function(Et) {
+                        Z.get(Et) ? Z.get(Et).forEach(function(Ot) {
+                          d[u.get(Ot)] = ee.get(Et);
+                        }) : d[u.get(Et)] = ee.get(Et);
+                      }, re = true, ie = false, Ae = void 0;
                       try {
-                        for (var ve = ee.keys()[Symbol.iterator](), Me; !(re = (Me = ve.next()).done); re = true) {
-                          var pe = Me.value;
-                          se(pe);
+                        for (var de = ee.keys()[Symbol.iterator](), Me; !(re = (Me = de.next()).done); re = true) {
+                          var ve = Me.value;
+                          se(ve);
                         }
                       } catch (Yt) {
-                        ie = true, Ce = Yt;
+                        ie = true, Ae = Yt;
                       } finally {
                         try {
-                          !re && ve.return && ve.return();
+                          !re && de.return && de.return();
                         } finally {
                           if (ie)
-                            throw Ce;
+                            throw Ae;
                         }
                       }
-                      var Ze = function(Et) {
+                      var qe = function(Et) {
                         Q.get(Et) ? Q.get(Et).forEach(function(Ot) {
-                          N[g.get(Ot)] = jt.get(Et);
-                        }) : N[g.get(Et)] = jt.get(Et);
-                      }, ye = true, we = false, Oe = void 0;
+                          N[u.get(Ot)] = jt.get(Et);
+                        }) : N[u.get(Et)] = jt.get(Et);
+                      }, pe = true, we = false, Oe = void 0;
                       try {
-                        for (var Ee = jt.keys()[Symbol.iterator](), De; !(ye = (De = Ee.next()).done); ye = true) {
-                          var pe = De.value;
-                          Ze(pe);
+                        for (var ye = jt.keys()[Symbol.iterator](), De; !(pe = (De = ye.next()).done); pe = true) {
+                          var ve = De.value;
+                          qe(ve);
                         }
                       } catch (Yt) {
                         we = true, Oe = Yt;
                       } finally {
                         try {
-                          !ye && Ee.return && Ee.return();
+                          !pe && ye.return && ye.return();
                         } finally {
                           if (we)
                             throw Oe;
@@ -3119,7 +3119,7 @@ function dr() {
                   }
                   for (var Ht = 0; Ht < F.length; Ht++) {
                     var Bt = F[Ht];
-                    Bt.getChild() == null && Bt.setCenter(d[g.get(Bt.id)], N[g.get(Bt.id)]);
+                    Bt.getChild() == null && Bt.setCenter(d[u.get(Bt.id)], N[u.get(Bt.id)]);
                   }
                 }, a.exports = s;
               }
@@ -3133,7 +3133,7 @@ function dr() {
             )
             /******/
           }, L = {};
-          function u(a) {
+          function g(a) {
             var r = L[a];
             if (r !== void 0)
               return r.exports;
@@ -3146,21 +3146,21 @@ function dr() {
               exports: {}
               /******/
             };
-            return P[a](e, e.exports, u), e.exports;
+            return P[a](e, e.exports, g), e.exports;
           }
-          var h = u(45);
+          var h = g(45);
           return h;
         })()
       );
     });
   }(fe)), fe.exports;
 }
-var vr = he.exports, Re;
-function pr() {
-  return Re || (Re = 1, function(A, Y) {
+var Er = he.exports, Re;
+function mr() {
+  return Re || (Re = 1, function(C, X) {
     (function(P, L) {
-      A.exports = L(dr());
-    })(vr, function(M) {
+      C.exports = L(yr());
+    })(Er, function(M) {
       return (
         /******/
         (() => {
@@ -3186,17 +3186,17 @@ function pr() {
               (a, r, e) => {
                 var f = /* @__PURE__ */ function() {
                   function t(o, s) {
-                    var c = [], l = true, T = false, g = void 0;
+                    var c = [], l = true, T = false, u = void 0;
                     try {
                       for (var d = o[Symbol.iterator](), N; !(l = (N = d.next()).done) && (c.push(N.value), !(s && c.length === s)); l = true)
                         ;
                     } catch (F) {
-                      T = true, g = F;
+                      T = true, u = F;
                     } finally {
                       try {
                         !l && d.return && d.return();
                       } finally {
-                        if (T) throw g;
+                        if (T) throw u;
                       }
                     }
                     return c;
@@ -3214,20 +3214,20 @@ function pr() {
                     o[t[s].id()] = true;
                   var c = t.filter(function(l, T) {
                     typeof l == "number" && (l = T);
-                    for (var g = l.parent()[0]; g != null; ) {
-                      if (o[g.id()])
+                    for (var u = l.parent()[0]; u != null; ) {
+                      if (o[u.id()])
                         return false;
-                      g = g.parent()[0];
+                      u = u.parent()[0];
                     }
                     return true;
                   });
                   return c;
                 }, v.connectComponents = function(t, o, s, c) {
-                  var l = new i(), T = /* @__PURE__ */ new Set(), g = [], d = void 0, N = void 0, F = void 0, C = false, G = 1, B = [], U = [], K = function() {
+                  var l = new i(), T = /* @__PURE__ */ new Set(), u = [], d = void 0, N = void 0, F = void 0, A = false, G = 1, B = [], U = [], K = function() {
                     var at = t.collection();
                     U.push(at);
                     var n = s[0], m = t.collection();
-                    m.merge(n).merge(n.descendants().intersection(o)), g.push(n), m.forEach(function(y) {
+                    m.merge(n).merge(n.descendants().intersection(o)), u.push(n), m.forEach(function(y) {
                       l.push(y), T.add(y), at.merge(y);
                     });
                     for (var p = function() {
@@ -3241,7 +3241,7 @@ function pr() {
                         if (d = s.intersection(R.union(R.ancestors())), d != null && !T.has(d[0])) {
                           var W = d.union(d.descendants());
                           W.forEach(function(x) {
-                            l.push(x), T.add(x), at.merge(x), s.has(x) && g.push(x);
+                            l.push(x), T.add(x), at.merge(x), s.has(x) && u.push(x);
                           });
                         }
                       }
@@ -3251,44 +3251,44 @@ function pr() {
                       o.intersection(y.connectedEdges()).forEach(function(I) {
                         at.has(I.source()) && at.has(I.target()) && at.merge(I);
                       });
-                    }), g.length == s.length && (C = true), !C || C && G > 1) {
-                      N = g[0], F = N.connectedEdges().length, g.forEach(function(y) {
+                    }), u.length == s.length && (A = true), !A || A && G > 1) {
+                      N = u[0], F = N.connectedEdges().length, u.forEach(function(y) {
                         y.connectedEdges().length < F && (F = y.connectedEdges().length, N = y);
                       }), B.push(N.id());
                       var E = t.collection();
-                      E.merge(g[0]), g.forEach(function(y) {
+                      E.merge(u[0]), u.forEach(function(y) {
                         E.merge(y);
-                      }), g = [], s = s.difference(E), G++;
+                      }), u = [], s = s.difference(E), G++;
                     }
                   };
                   do
                     K();
-                  while (!C);
+                  while (!A);
                   return c && B.length > 0 && c.set("dummy" + (c.size + 1), B), U;
                 }, v.relocateComponent = function(t, o, s) {
                   if (!s.fixedNodeConstraint) {
-                    var c = Number.POSITIVE_INFINITY, l = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, g = Number.NEGATIVE_INFINITY;
+                    var c = Number.POSITIVE_INFINITY, l = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, u = Number.NEGATIVE_INFINITY;
                     if (s.quality == "draft") {
                       var d = true, N = false, F = void 0;
                       try {
-                        for (var C = o.nodeIndexes[Symbol.iterator](), G; !(d = (G = C.next()).done); d = true) {
+                        for (var A = o.nodeIndexes[Symbol.iterator](), G; !(d = (G = A.next()).done); d = true) {
                           var B = G.value, U = f(B, 2), K = U[0], D = U[1], at = s.cy.getElementById(K);
                           if (at) {
                             var n = at.boundingBox(), m = o.xCoords[D] - n.w / 2, p = o.xCoords[D] + n.w / 2, E = o.yCoords[D] - n.h / 2, y = o.yCoords[D] + n.h / 2;
-                            m < c && (c = m), p > l && (l = p), E < T && (T = E), y > g && (g = y);
+                            m < c && (c = m), p > l && (l = p), E < T && (T = E), y > u && (u = y);
                           }
                         }
                       } catch (x) {
                         N = true, F = x;
                       } finally {
                         try {
-                          !d && C.return && C.return();
+                          !d && A.return && A.return();
                         } finally {
                           if (N)
                             throw F;
                         }
                       }
-                      var I = t.x - (l + c) / 2, w = t.y - (g + T) / 2;
+                      var I = t.x - (l + c) / 2, w = t.y - (u + T) / 2;
                       o.xCoords = o.xCoords.map(function(x) {
                         return x + I;
                       }), o.yCoords = o.yCoords.map(function(x) {
@@ -3296,10 +3296,10 @@ function pr() {
                       });
                     } else {
                       Object.keys(o).forEach(function(x) {
-                        var q = o[x], V = q.getRect().x, X = q.getRect().x + q.getRect().width, et = q.getRect().y, z = q.getRect().y + q.getRect().height;
-                        V < c && (c = V), X > l && (l = X), et < T && (T = et), z > g && (g = z);
+                        var q = o[x], V = q.getRect().x, Y = q.getRect().x + q.getRect().width, et = q.getRect().y, z = q.getRect().y + q.getRect().height;
+                        V < c && (c = V), Y > l && (l = Y), et < T && (T = et), z > u && (u = z);
                       });
-                      var R = t.x - (l + c) / 2, W = t.y - (g + T) / 2;
+                      var R = t.x - (l + c) / 2, W = t.y - (u + T) / 2;
                       Object.keys(o).forEach(function(x) {
                         var q = o[x];
                         q.setCenter(q.getCenterX() + R, q.getCenterY() + W);
@@ -3307,12 +3307,12 @@ function pr() {
                     }
                   }
                 }, v.calcBoundingBox = function(t, o, s, c) {
-                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, g = Number.MAX_SAFE_INTEGER, d = Number.MIN_SAFE_INTEGER, N = void 0, F = void 0, C = void 0, G = void 0, B = t.descendants().not(":parent"), U = B.length, K = 0; K < U; K++) {
+                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, u = Number.MAX_SAFE_INTEGER, d = Number.MIN_SAFE_INTEGER, N = void 0, F = void 0, A = void 0, G = void 0, B = t.descendants().not(":parent"), U = B.length, K = 0; K < U; K++) {
                     var D = B[K];
-                    N = o[c.get(D.id())] - D.width() / 2, F = o[c.get(D.id())] + D.width() / 2, C = s[c.get(D.id())] - D.height() / 2, G = s[c.get(D.id())] + D.height() / 2, l > N && (l = N), T < F && (T = F), g > C && (g = C), d < G && (d = G);
+                    N = o[c.get(D.id())] - D.width() / 2, F = o[c.get(D.id())] + D.width() / 2, A = s[c.get(D.id())] - D.height() / 2, G = s[c.get(D.id())] + D.height() / 2, l > N && (l = N), T < F && (T = F), u > A && (u = A), d < G && (d = G);
                   }
                   var at = {};
-                  return at.topLeftX = l, at.topLeftY = g, at.width = T - l, at.height = d - g, at;
+                  return at.topLeftX = l, at.topLeftY = u, at.width = T - l, at.height = d - u, at;
                 }, v.calcParentsWithoutChildren = function(t, o) {
                   var s = t.collection();
                   return o.nodes(":parent").forEach(function(c) {
@@ -3329,21 +3329,21 @@ function pr() {
               /***/
               (a, r, e) => {
                 var f = e(548), i = e(140).CoSELayout, v = e(140).CoSENode, t = e(140).layoutBase.PointD, o = e(140).layoutBase.DimensionD, s = e(140).layoutBase.LayoutConstants, c = e(140).layoutBase.FDLayoutConstants, l = e(140).CoSEConstants, T = function(d, N) {
-                  var F = d.cy, C = d.eles, G = C.nodes(), B = C.edges(), U = void 0, K = void 0, D = void 0, at = {};
+                  var F = d.cy, A = d.eles, G = A.nodes(), B = A.edges(), U = void 0, K = void 0, D = void 0, at = {};
                   d.randomize && (U = N.nodeIndexes, K = N.xCoords, D = N.yCoords);
                   var n = function(x) {
                     return typeof x == "function";
                   }, m = function(x, q) {
                     return n(x) ? x(q) : x;
-                  }, p = f.calcParentsWithoutChildren(F, C), E = function W(x, q, V, X) {
+                  }, p = f.calcParentsWithoutChildren(F, A), E = function W(x, q, V, Y) {
                     for (var et = q.length, z = 0; z < et; z++) {
                       var O = q[z], H = null;
                       O.intersection(p).length == 0 && (H = O.children());
                       var $ = void 0, _ = O.layoutDimensions({
-                        nodeDimensionsIncludeLabels: X.nodeDimensionsIncludeLabels
+                        nodeDimensionsIncludeLabels: Y.nodeDimensionsIncludeLabels
                       });
                       if (O.outerWidth() != null && O.outerHeight() != null)
-                        if (X.randomize)
+                        if (Y.randomize)
                           if (!O.isParent())
                             $ = x.add(new v(V.graphManager, new t(K[U.get(O.id())] - _.w / 2, D[U.get(O.id())] - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
                           else {
@@ -3354,20 +3354,20 @@ function pr() {
                           $ = x.add(new v(V.graphManager, new t(O.position("x") - _.w / 2, O.position("y") - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
                       else
                         $ = x.add(new v(this.graphManager));
-                      if ($.id = O.data("id"), $.nodeRepulsion = m(X.nodeRepulsion, O), $.paddingLeft = parseInt(O.css("padding")), $.paddingTop = parseInt(O.css("padding")), $.paddingRight = parseInt(O.css("padding")), $.paddingBottom = parseInt(O.css("padding")), X.nodeDimensionsIncludeLabels && ($.labelWidth = O.boundingBox({ includeLabels: true, includeNodes: false, includeOverlays: false }).w, $.labelHeight = O.boundingBox({ includeLabels: true, includeNodes: false, includeOverlays: false }).h, $.labelPosVertical = O.css("text-valign"), $.labelPosHorizontal = O.css("text-halign")), at[O.data("id")] = $, isNaN($.rect.x) && ($.rect.x = 0), isNaN($.rect.y) && ($.rect.y = 0), H != null && H.length > 0) {
+                      if ($.id = O.data("id"), $.nodeRepulsion = m(Y.nodeRepulsion, O), $.paddingLeft = parseInt(O.css("padding")), $.paddingTop = parseInt(O.css("padding")), $.paddingRight = parseInt(O.css("padding")), $.paddingBottom = parseInt(O.css("padding")), Y.nodeDimensionsIncludeLabels && ($.labelWidth = O.boundingBox({ includeLabels: true, includeNodes: false, includeOverlays: false }).w, $.labelHeight = O.boundingBox({ includeLabels: true, includeNodes: false, includeOverlays: false }).h, $.labelPosVertical = O.css("text-valign"), $.labelPosHorizontal = O.css("text-halign")), at[O.data("id")] = $, isNaN($.rect.x) && ($.rect.x = 0), isNaN($.rect.y) && ($.rect.y = 0), H != null && H.length > 0) {
                         var J = void 0;
-                        J = V.getGraphManager().add(V.newGraph(), $), W(J, H, V, X);
+                        J = V.getGraphManager().add(V.newGraph(), $), W(J, H, V, Y);
                       }
                     }
                   }, y = function(x, q, V) {
-                    for (var X = 0, et = 0, z = 0; z < V.length; z++) {
+                    for (var Y = 0, et = 0, z = 0; z < V.length; z++) {
                       var O = V[z], H = at[O.data("source")], $ = at[O.data("target")];
                       if (H && $ && H !== $ && H.getEdgesBetween($).length == 0) {
                         var _ = q.add(x.newEdge(), H, $);
-                        _.id = O.id(), _.idealLength = m(d.idealEdgeLength, O), _.edgeElasticity = m(d.edgeElasticity, O), X += _.idealLength, et++;
+                        _.id = O.id(), _.idealLength = m(d.idealEdgeLength, O), _.edgeElasticity = m(d.edgeElasticity, O), Y += _.idealLength, et++;
                       }
                     }
-                    d.idealEdgeLength != null && (et > 0 ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = X / et : n(d.idealEdgeLength) ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = d.idealEdgeLength, l.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, l.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
+                    d.idealEdgeLength != null && (et > 0 ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = Y / et : n(d.idealEdgeLength) ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = d.idealEdgeLength, l.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, l.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
                   }, I = function(x, q) {
                     q.fixedNodeConstraint && (x.constraints.fixedNodeConstraint = q.fixedNodeConstraint), q.alignmentConstraint && (x.constraints.alignmentConstraint = q.alignmentConstraint), q.relativePlacementConstraint && (x.constraints.relativePlacementConstraint = q.relativePlacementConstraint);
                   };
@@ -3384,13 +3384,13 @@ function pr() {
               (a, r, e) => {
                 var f = /* @__PURE__ */ function() {
                   function d(N, F) {
-                    for (var C = 0; C < F.length; C++) {
-                      var G = F[C];
+                    for (var A = 0; A < F.length; A++) {
+                      var G = F[A];
                       G.enumerable = G.enumerable || false, G.configurable = true, "value" in G && (G.writable = true), Object.defineProperty(N, G.key, G);
                     }
                   }
-                  return function(N, F, C) {
-                    return F && d(N.prototype, F), C && d(N, C), N;
+                  return function(N, F, A) {
+                    return F && d(N.prototype, F), A && d(N, A), N;
                   };
                 }();
                 function i(d, N) {
@@ -3486,47 +3486,47 @@ function pr() {
                   stop: function() {
                   }
                   // on layoutstop
-                }), g = function() {
+                }), u = function() {
                   function d(N) {
                     i(this, d), this.options = v({}, T, N);
                   }
                   return f(d, [{
                     key: "run",
                     value: function() {
-                      var F = this, C = this.options, G = C.cy, B = C.eles, U = [], K = [], D = void 0, at = [];
-                      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 = false, C.packComponents = false);
+                      var F = this, A = this.options, G = A.cy, B = A.eles, U = [], K = [], D = void 0, at = [];
+                      A.fixedNodeConstraint && (!Array.isArray(A.fixedNodeConstraint) || A.fixedNodeConstraint.length == 0) && (A.fixedNodeConstraint = void 0), A.alignmentConstraint && (A.alignmentConstraint.vertical && (!Array.isArray(A.alignmentConstraint.vertical) || A.alignmentConstraint.vertical.length == 0) && (A.alignmentConstraint.vertical = void 0), A.alignmentConstraint.horizontal && (!Array.isArray(A.alignmentConstraint.horizontal) || A.alignmentConstraint.horizontal.length == 0) && (A.alignmentConstraint.horizontal = void 0)), A.relativePlacementConstraint && (!Array.isArray(A.relativePlacementConstraint) || A.relativePlacementConstraint.length == 0) && (A.relativePlacementConstraint = void 0);
+                      var n = A.fixedNodeConstraint || A.alignmentConstraint || A.relativePlacementConstraint;
+                      n && (A.tile = false, A.packComponents = false);
                       var m = void 0, p = false;
-                      if (G.layoutUtilities && C.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = true), B.nodes().length > 0)
+                      if (G.layoutUtilities && A.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = true), B.nodes().length > 0)
                         if (p) {
-                          var I = t.getTopMostNodes(C.eles.nodes());
-                          if (D = t.connectComponents(G, C.eles, I), D.forEach(function(vt) {
+                          var I = t.getTopMostNodes(A.eles.nodes());
+                          if (D = t.connectComponents(G, A.eles, I), D.forEach(function(vt) {
                             var rt = vt.boundingBox();
                             at.push({ x: rt.x1 + rt.w / 2, y: rt.y1 + rt.h / 2 });
-                          }), C.randomize && D.forEach(function(vt) {
-                            C.eles = vt, U.push(s(C));
-                          }), C.quality == "default" || C.quality == "proof") {
+                          }), A.randomize && D.forEach(function(vt) {
+                            A.eles = vt, U.push(s(A));
+                          }), A.quality == "default" || A.quality == "proof") {
                             var w = G.collection();
-                            if (C.tile) {
-                              var R = /* @__PURE__ */ new Map(), W = [], x = [], q = 0, V = { nodeIndexes: R, xCoords: W, yCoords: x }, X = [];
+                            if (A.tile) {
+                              var R = /* @__PURE__ */ new Map(), W = [], x = [], q = 0, V = { nodeIndexes: R, xCoords: W, yCoords: x }, Y = [];
                               if (D.forEach(function(vt, rt) {
-                                vt.edges().length == 0 && (vt.nodes().forEach(function(gt, Tt) {
-                                  w.merge(vt.nodes()[Tt]), gt.isParent() || (V.nodeIndexes.set(vt.nodes()[Tt].id(), q++), V.xCoords.push(vt.nodes()[0].position().x), V.yCoords.push(vt.nodes()[0].position().y));
-                                }), X.push(rt));
+                                vt.edges().length == 0 && (vt.nodes().forEach(function(ut, Tt) {
+                                  w.merge(vt.nodes()[Tt]), ut.isParent() || (V.nodeIndexes.set(vt.nodes()[Tt].id(), q++), V.xCoords.push(vt.nodes()[0].position().x), V.yCoords.push(vt.nodes()[0].position().y));
+                                }), Y.push(rt));
                               }), w.length > 1) {
                                 var et = w.boundingBox();
                                 at.push({ x: et.x1 + et.w / 2, y: et.y1 + et.h / 2 }), D.push(w), U.push(V);
-                                for (var z = X.length - 1; z >= 0; z--)
-                                  D.splice(X[z], 1), U.splice(X[z], 1), at.splice(X[z], 1);
+                                for (var z = Y.length - 1; z >= 0; z--)
+                                  D.splice(Y[z], 1), U.splice(Y[z], 1), at.splice(Y[z], 1);
                               }
                             }
                             D.forEach(function(vt, rt) {
-                              C.eles = vt, K.push(l(C, U[rt])), t.relocateComponent(at[rt], K[rt], C);
+                              A.eles = vt, K.push(l(A, U[rt])), t.relocateComponent(at[rt], K[rt], A);
                             });
                           } else
                             D.forEach(function(vt, rt) {
-                              t.relocateComponent(at[rt], U[rt], C);
+                              t.relocateComponent(at[rt], U[rt], A);
                             });
                           var O = /* @__PURE__ */ new Set();
                           if (D.length > 1) {
@@ -3534,17 +3534,17 @@ function pr() {
                               return vt.css("display") == "none";
                             });
                             D.forEach(function(vt, rt) {
-                              var gt = void 0;
-                              if (C.quality == "draft" && (gt = U[rt].nodeIndexes), vt.nodes().not($).length > 0) {
+                              var ut = void 0;
+                              if (A.quality == "draft" && (ut = U[rt].nodeIndexes), vt.nodes().not($).length > 0) {
                                 var Tt = {};
                                 Tt.edges = [], Tt.nodes = [];
                                 var Mt = void 0;
                                 vt.nodes().not($).forEach(function(Dt) {
-                                  if (C.quality == "draft")
+                                  if (A.quality == "draft")
                                     if (!Dt.isParent())
-                                      Mt = gt.get(Dt.id()), Tt.nodes.push({ x: U[rt].xCoords[Mt] - Dt.boundingbox().w / 2, y: U[rt].yCoords[Mt] - Dt.boundingbox().h / 2, width: Dt.boundingbox().w, height: Dt.boundingbox().h });
+                                      Mt = ut.get(Dt.id()), Tt.nodes.push({ x: U[rt].xCoords[Mt] - Dt.boundingbox().w / 2, y: U[rt].yCoords[Mt] - Dt.boundingbox().h / 2, width: Dt.boundingbox().w, height: Dt.boundingbox().h });
                                     else {
-                                      var mt = t.calcBoundingBox(Dt, U[rt].xCoords, U[rt].yCoords, gt);
+                                      var mt = t.calcBoundingBox(Dt, U[rt].xCoords, U[rt].yCoords, ut);
                                       Tt.nodes.push({ x: mt.topLeftX, y: mt.topLeftY, width: mt.width, height: mt.height });
                                     }
                                   else
@@ -3552,15 +3552,15 @@ function pr() {
                                 }), vt.edges().forEach(function(Dt) {
                                   var mt = Dt.source(), xt = Dt.target();
                                   if (mt.css("display") != "none" && xt.css("display") != "none")
-                                    if (C.quality == "draft") {
-                                      var St = gt.get(mt.id()), Vt = gt.get(xt.id()), Xt = [], Ut = [];
+                                    if (A.quality == "draft") {
+                                      var St = ut.get(mt.id()), Vt = ut.get(xt.id()), Xt = [], Ut = [];
                                       if (mt.isParent()) {
-                                        var bt = t.calcBoundingBox(mt, U[rt].xCoords, U[rt].yCoords, gt);
+                                        var bt = t.calcBoundingBox(mt, U[rt].xCoords, U[rt].yCoords, ut);
                                         Xt.push(bt.topLeftX + bt.width / 2), Xt.push(bt.topLeftY + bt.height / 2);
                                       } else
                                         Xt.push(U[rt].xCoords[St]), Xt.push(U[rt].yCoords[St]);
                                       if (xt.isParent()) {
-                                        var Ht = t.calcBoundingBox(xt, U[rt].xCoords, U[rt].yCoords, gt);
+                                        var Ht = t.calcBoundingBox(xt, U[rt].xCoords, U[rt].yCoords, ut);
                                         Ut.push(Ht.topLeftX + Ht.width / 2), Ut.push(Ht.topLeftY + Ht.height / 2);
                                       } else
                                         Ut.push(U[rt].xCoords[Vt]), Ut.push(U[rt].yCoords[Vt]);
@@ -3570,41 +3570,41 @@ function pr() {
                                 }), Tt.nodes.length > 0 && (H.push(Tt), O.add(rt));
                               }
                             });
-                            var _ = m.packComponents(H, C.randomize).shifts;
-                            if (C.quality == "draft")
+                            var _ = m.packComponents(H, A.randomize).shifts;
+                            if (A.quality == "draft")
                               U.forEach(function(vt, rt) {
-                                var gt = vt.xCoords.map(function(Mt) {
+                                var ut = vt.xCoords.map(function(Mt) {
                                   return Mt + _[rt].dx;
                                 }), Tt = vt.yCoords.map(function(Mt) {
                                   return Mt + _[rt].dy;
                                 });
-                                vt.xCoords = gt, vt.yCoords = Tt;
+                                vt.xCoords = ut, vt.yCoords = Tt;
                               });
                             else {
                               var ht = 0;
                               O.forEach(function(vt) {
                                 Object.keys(K[vt]).forEach(function(rt) {
-                                  var gt = K[vt][rt];
-                                  gt.setCenter(gt.getCenterX() + _[ht].dx, gt.getCenterY() + _[ht].dy);
+                                  var ut = K[vt][rt];
+                                  ut.setCenter(ut.getCenterX() + _[ht].dx, ut.getCenterY() + _[ht].dy);
                                 }), ht++;
                               });
                             }
                           }
                         } else {
-                          var E = C.eles.boundingBox();
-                          if (at.push({ x: E.x1 + E.w / 2, y: E.y1 + E.h / 2 }), C.randomize) {
-                            var y = s(C);
+                          var E = A.eles.boundingBox();
+                          if (at.push({ x: E.x1 + E.w / 2, y: E.y1 + E.h / 2 }), A.randomize) {
+                            var y = s(A);
                             U.push(y);
                           }
-                          C.quality == "default" || C.quality == "proof" ? (K.push(l(C, U[0])), t.relocateComponent(at[0], K[0], C)) : t.relocateComponent(at[0], U[0], C);
+                          A.quality == "default" || A.quality == "proof" ? (K.push(l(A, U[0])), t.relocateComponent(at[0], K[0], A)) : t.relocateComponent(at[0], U[0], A);
                         }
-                      var J = function(rt, gt) {
-                        if (C.quality == "default" || C.quality == "proof") {
-                          typeof rt == "number" && (rt = gt);
+                      var J = function(rt, ut) {
+                        if (A.quality == "default" || A.quality == "proof") {
+                          typeof rt == "number" && (rt = ut);
                           var Tt = void 0, Mt = void 0, Dt = rt.data("id");
                           return K.forEach(function(xt) {
                             Dt in xt && (Tt = { x: xt[Dt].getRect().getCenterX(), y: xt[Dt].getRect().getCenterY() }, Mt = xt[Dt]);
-                          }), C.nodeDimensionsIncludeLabels && (Mt.labelWidth && (Mt.labelPosHorizontal == "left" ? Tt.x += Mt.labelWidth / 2 : Mt.labelPosHorizontal == "right" && (Tt.x -= Mt.labelWidth / 2)), Mt.labelHeight && (Mt.labelPosVertical == "top" ? Tt.y += Mt.labelHeight / 2 : Mt.labelPosVertical == "bottom" && (Tt.y -= Mt.labelHeight / 2))), Tt == null && (Tt = { x: rt.position("x"), y: rt.position("y") }), {
+                          }), A.nodeDimensionsIncludeLabels && (Mt.labelWidth && (Mt.labelPosHorizontal == "left" ? Tt.x += Mt.labelWidth / 2 : Mt.labelPosHorizontal == "right" && (Tt.x -= Mt.labelWidth / 2)), Mt.labelHeight && (Mt.labelPosVertical == "top" ? Tt.y += Mt.labelHeight / 2 : Mt.labelPosVertical == "bottom" && (Tt.y -= Mt.labelHeight / 2))), Tt == null && (Tt = { x: rt.position("x"), y: rt.position("y") }), {
                             x: Tt.x,
                             y: Tt.y
                           };
@@ -3619,11 +3619,11 @@ function pr() {
                           };
                         }
                       };
-                      if (C.quality == "default" || C.quality == "proof" || C.randomize) {
+                      if (A.quality == "default" || A.quality == "proof" || A.randomize) {
                         var Rt = t.calcParentsWithoutChildren(G, B), Lt = B.filter(function(vt) {
                           return vt.css("display") == "none";
                         });
-                        C.eles = B.not(Lt), B.nodes().not(":parent").not(Lt).layoutPositions(F, C, J), Rt.length > 0 && Rt.forEach(function(vt) {
+                        A.eles = B.not(Lt), B.nodes().not(":parent").not(Lt).layoutPositions(F, A, J), Rt.length > 0 && Rt.forEach(function(vt) {
                           vt.position(J(vt));
                         });
                       } else
@@ -3631,7 +3631,7 @@ function pr() {
                     }
                   }]), d;
                 }();
-                a.exports = g;
+                a.exports = u;
               }
             ),
             /***/
@@ -3639,67 +3639,67 @@ function pr() {
               /***/
               (a, r, e) => {
                 var f = e(548), i = e(140).layoutBase.Matrix, v = e(140).layoutBase.SVD, t = function(s) {
-                  var c = s.cy, l = s.eles, T = l.nodes(), g = l.nodes(":parent"), d = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), C = [], G = [], B = [], U = [], K = [], D = [], at = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, I = s.samplingType, w = s.nodeSeparation, R = void 0, W = function() {
-                    for (var b = 0, k = 0, Q = false; k < R; ) {
+                  var c = s.cy, l = s.eles, T = l.nodes(), u = l.nodes(":parent"), d = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), A = [], G = [], B = [], U = [], K = [], D = [], at = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, I = s.samplingType, w = s.nodeSeparation, R = void 0, W = function() {
+                    for (var b = 0, Z = 0, Q = false; Z < R; ) {
                       b = Math.floor(Math.random() * m), Q = false;
-                      for (var Z = 0; Z < k; Z++)
-                        if (U[Z] == b) {
+                      for (var k = 0; k < Z; k++)
+                        if (U[k] == b) {
                           Q = true;
                           break;
                         }
                       if (!Q)
-                        U[k] = b, k++;
+                        U[Z] = b, Z++;
                       else
                         continue;
                     }
-                  }, x = function(b, k, Q) {
-                    for (var Z = [], it = 0, ut = 0, ot = 0, tt = void 0, j = [], dt = 0, wt = 1, yt = 0; yt < m; yt++)
+                  }, x = function(b, Z, Q) {
+                    for (var k = [], it = 0, gt = 0, ot = 0, tt = void 0, j = [], dt = 0, wt = 1, yt = 0; yt < m; yt++)
                       j[yt] = p;
-                    for (Z[ut] = b, j[b] = 0; ut >= it; ) {
-                      ot = Z[it++];
-                      for (var It = C[ot], ft = 0; ft < It.length; ft++)
-                        tt = N.get(It[ft]), j[tt] == p && (j[tt] = j[ot] + 1, Z[++ut] = tt);
-                      D[ot][k] = j[ot] * w;
+                    for (k[gt] = b, j[b] = 0; gt >= it; ) {
+                      ot = k[it++];
+                      for (var It = A[ot], ft = 0; ft < It.length; ft++)
+                        tt = N.get(It[ft]), j[tt] == p && (j[tt] = j[ot] + 1, k[++gt] = tt);
+                      D[ot][Z] = j[ot] * w;
                     }
                     if (Q) {
                       for (var st = 0; st < m; st++)
-                        D[st][k] < K[st] && (K[st] = D[st][k]);
-                      for (var At = 0; At < m; At++)
-                        K[At] > dt && (dt = K[At], wt = At);
+                        D[st][Z] < K[st] && (K[st] = D[st][Z]);
+                      for (var Ct = 0; Ct < m; Ct++)
+                        K[Ct] > dt && (dt = K[Ct], wt = Ct);
                     }
                     return wt;
                   }, q = function(b) {
-                    var k = void 0;
+                    var Z = void 0;
                     if (b) {
-                      k = Math.floor(Math.random() * m);
-                      for (var Z = 0; Z < m; Z++)
-                        K[Z] = p;
+                      Z = Math.floor(Math.random() * m);
+                      for (var k = 0; k < m; k++)
+                        K[k] = p;
                       for (var it = 0; it < R; it++)
-                        U[it] = k, k = x(k, it, b);
+                        U[it] = Z, Z = x(Z, it, b);
                     } else {
                       W();
                       for (var Q = 0; Q < R; Q++)
                         x(U[Q], Q, b);
                     }
-                    for (var ut = 0; ut < m; ut++)
+                    for (var gt = 0; gt < m; gt++)
                       for (var ot = 0; ot < R; ot++)
-                        D[ut][ot] *= D[ut][ot];
+                        D[gt][ot] *= D[gt][ot];
                     for (var tt = 0; tt < R; tt++)
                       at[tt] = [];
                     for (var j = 0; j < R; j++)
                       for (var dt = 0; dt < R; dt++)
                         at[j][dt] = D[U[dt]][j];
                   }, V = function() {
-                    for (var b = v.svd(at), k = b.S, Q = b.U, Z = b.V, it = k[0] * k[0] * k[0], ut = [], ot = 0; ot < R; ot++) {
-                      ut[ot] = [];
+                    for (var b = v.svd(at), Z = b.S, Q = b.U, k = b.V, it = Z[0] * Z[0] * Z[0], gt = [], ot = 0; ot < R; ot++) {
+                      gt[ot] = [];
                       for (var tt = 0; tt < R; tt++)
-                        ut[ot][tt] = 0, ot == tt && (ut[ot][tt] = k[ot] / (k[ot] * k[ot] + it / (k[ot] * k[ot])));
+                        gt[ot][tt] = 0, ot == tt && (gt[ot][tt] = Z[ot] / (Z[ot] * Z[ot] + it / (Z[ot] * Z[ot])));
                     }
-                    n = i.multMat(i.multMat(Z, ut), i.transpose(Q));
-                  }, X = function() {
-                    for (var b = void 0, k = void 0, Q = [], Z = [], it = [], ut = [], ot = 0; ot < m; ot++)
-                      Q[ot] = Math.random(), Z[ot] = Math.random();
-                    Q = i.normalize(Q), Z = i.normalize(Z);
+                    n = i.multMat(i.multMat(k, gt), i.transpose(Q));
+                  }, Y = function() {
+                    for (var b = void 0, Z = void 0, Q = [], k = [], it = [], gt = [], ot = 0; ot < m; ot++)
+                      Q[ot] = Math.random(), k[ot] = Math.random();
+                    Q = i.normalize(Q), k = i.normalize(k);
                     for (var tt = E, j = E, dt = void 0; ; ) {
                       for (var wt = 0; wt < m; wt++)
                         it[wt] = Q[wt];
@@ -3711,16 +3711,16 @@ function pr() {
                       it[yt] = Q[yt];
                     for (j = E; ; ) {
                       for (var It = 0; It < m; It++)
-                        ut[It] = Z[It];
-                      if (ut = i.minusOp(ut, i.multCons(it, i.dotProduct(it, ut))), Z = i.multGamma(i.multL(i.multGamma(ut), D, n)), k = i.dotProduct(ut, Z), Z = i.normalize(Z), tt = i.dotProduct(ut, Z), dt = Math.abs(tt / j), dt <= 1 + y && dt >= 1)
+                        gt[It] = k[It];
+                      if (gt = i.minusOp(gt, i.multCons(it, i.dotProduct(it, gt))), k = i.multGamma(i.multL(i.multGamma(gt), D, n)), Z = i.dotProduct(gt, k), k = i.normalize(k), tt = i.dotProduct(gt, k), dt = Math.abs(tt / j), dt <= 1 + y && dt >= 1)
                         break;
                       j = tt;
                     }
                     for (var ft = 0; ft < m; ft++)
-                      ut[ft] = Z[ft];
-                    G = i.multCons(it, Math.sqrt(Math.abs(b))), B = i.multCons(ut, Math.sqrt(Math.abs(k)));
+                      gt[ft] = k[ft];
+                    G = i.multCons(it, Math.sqrt(Math.abs(b))), B = i.multCons(gt, Math.sqrt(Math.abs(Z)));
                   };
-                  f.connectComponents(c, l, f.getTopMostNodes(T), d), g.forEach(function(S) {
+                  f.connectComponents(c, l, f.getTopMostNodes(T), d), u.forEach(function(S) {
                     f.connectComponents(c, l, f.getTopMostNodes(S.descendants().intersection(l)), d);
                   });
                   for (var et = 0, z = 0; z < T.length; z++)
@@ -3742,39 +3742,39 @@ function pr() {
                     }
                   }
                   for (var Rt = 0; Rt < N.size; Rt++)
-                    C[Rt] = [];
-                  g.forEach(function(S) {
+                    A[Rt] = [];
+                  u.forEach(function(S) {
                     for (var b = S.children().intersection(l); b.nodes(":childless").length == 0; )
                       b = b.nodes()[0].children().intersection(l);
-                    var k = 0, Q = b.nodes(":childless")[0].connectedEdges().length;
-                    b.nodes(":childless").forEach(function(Z, it) {
-                      Z.connectedEdges().length < Q && (Q = Z.connectedEdges().length, k = it);
-                    }), F.set(S.id(), b.nodes(":childless")[k].id());
+                    var Z = 0, Q = b.nodes(":childless")[0].connectedEdges().length;
+                    b.nodes(":childless").forEach(function(k, it) {
+                      k.connectedEdges().length < Q && (Q = k.connectedEdges().length, Z = it);
+                    }), F.set(S.id(), b.nodes(":childless")[Z].id());
                   }), T.forEach(function(S) {
                     var b = void 0;
-                    S.isParent() ? b = N.get(F.get(S.id())) : b = N.get(S.id()), S.neighborhood().nodes().forEach(function(k) {
-                      l.intersection(S.edgesWith(k)).length > 0 && (k.isParent() ? C[b].push(F.get(k.id())) : C[b].push(k.id()));
+                    S.isParent() ? b = N.get(F.get(S.id())) : b = N.get(S.id()), S.neighborhood().nodes().forEach(function(Z) {
+                      l.intersection(S.edgesWith(Z)).length > 0 && (Z.isParent() ? A[b].push(F.get(Z.id())) : A[b].push(Z.id()));
                     });
                   });
                   var Lt = function(b) {
-                    var k = N.get(b), Q = void 0;
-                    d.get(b).forEach(function(Z) {
-                      c.getElementById(Z).isParent() ? Q = F.get(Z) : Q = Z, C[k].push(Q), C[N.get(Q)].push(b);
+                    var Z = N.get(b), Q = void 0;
+                    d.get(b).forEach(function(k) {
+                      c.getElementById(k).isParent() ? Q = F.get(k) : Q = k, A[Z].push(Q), A[N.get(Q)].push(b);
                     });
-                  }, vt = true, rt = false, gt = void 0;
+                  }, vt = true, rt = false, ut = void 0;
                   try {
                     for (var Tt = d.keys()[Symbol.iterator](), Mt; !(vt = (Mt = Tt.next()).done); vt = true) {
                       var Dt = Mt.value;
                       Lt(Dt);
                     }
                   } catch (S) {
-                    rt = true, gt = S;
+                    rt = true, ut = S;
                   } finally {
                     try {
                       !vt && Tt.return && Tt.return();
                     } finally {
                       if (rt)
-                        throw gt;
+                        throw ut;
                     }
                   }
                   m = N.size;
@@ -3785,7 +3785,7 @@ function pr() {
                       D[xt] = [];
                     for (var St = 0; St < R; St++)
                       n[St] = [];
-                    return s.quality == "draft" || s.step == "all" ? (q(I), V(), X(), mt = { nodeIndexes: N, xCoords: G, yCoords: B }) : (N.forEach(function(S, b) {
+                    return s.quality == "draft" || s.step == "all" ? (q(I), V(), Y(), mt = { nodeIndexes: N, xCoords: G, yCoords: B }) : (N.forEach(function(S, b) {
                       G.push(c.getElementById(b).position("x")), B.push(c.getElementById(b).position("y"));
                     }), mt = { nodeIndexes: N, xCoords: G, yCoords: B }), mt;
                   } else {
@@ -3819,7 +3819,7 @@ function pr() {
             )
             /******/
           }, L = {};
-          function u(a) {
+          function g(a) {
             var r = L[a];
             if (r !== void 0)
               return r.exports;
@@ -3832,66 +3832,66 @@ function pr() {
               exports: {}
               /******/
             };
-            return P[a](e, e.exports, u), e.exports;
+            return P[a](e, e.exports, g), e.exports;
           }
-          var h = u(579);
+          var h = g(579);
           return h;
         })()
       );
     });
   }(he)), he.exports;
 }
-var yr = pr();
-const Er = /* @__PURE__ */ fr(yr);
+var Tr = mr();
+const Nr = /* @__PURE__ */ ur(Tr);
 var Se = {
   L: "left",
   R: "right",
   T: "top",
   B: "bottom"
 }, Fe = {
-  L: /* @__PURE__ */ nt((A) => `${A},${A / 2} 0,${A} 0,0`, "L"),
-  R: /* @__PURE__ */ nt((A) => `0,${A / 2} ${A},0 ${A},${A}`, "R"),
-  T: /* @__PURE__ */ nt((A) => `0,0 ${A},0 ${A / 2},${A}`, "T"),
-  B: /* @__PURE__ */ nt((A) => `${A / 2},0 ${A},${A} 0,${A}`, "B")
+  L: /* @__PURE__ */ nt((C) => `${C},${C / 2} 0,${C} 0,0`, "L"),
+  R: /* @__PURE__ */ nt((C) => `0,${C / 2} ${C},0 ${C},${C}`, "R"),
+  T: /* @__PURE__ */ nt((C) => `0,0 ${C},0 ${C / 2},${C}`, "T"),
+  B: /* @__PURE__ */ nt((C) => `${C / 2},0 ${C},${C} 0,${C}`, "B")
 }, le = {
-  L: /* @__PURE__ */ nt((A, Y) => A - Y + 2, "L"),
-  R: /* @__PURE__ */ nt((A, Y) => A - 2, "R"),
-  T: /* @__PURE__ */ nt((A, Y) => A - Y + 2, "T"),
-  B: /* @__PURE__ */ nt((A, Y) => A - 2, "B")
-}, mr = /* @__PURE__ */ nt(function(A) {
-  return zt(A) ? A === "L" ? "R" : "L" : A === "T" ? "B" : "T";
-}, "getOppositeArchitectureDirection"), be = /* @__PURE__ */ nt(function(A) {
-  const Y = A;
-  return Y === "L" || Y === "R" || Y === "T" || Y === "B";
-}, "isArchitectureDirection"), zt = /* @__PURE__ */ nt(function(A) {
-  const Y = A;
-  return Y === "L" || Y === "R";
-}, "isArchitectureDirectionX"), Qt = /* @__PURE__ */ nt(function(A) {
-  const Y = A;
-  return Y === "T" || Y === "B";
-}, "isArchitectureDirectionY"), Ae = /* @__PURE__ */ nt(function(A, Y) {
-  const M = zt(A) && Qt(Y), P = Qt(A) && zt(Y);
+  L: /* @__PURE__ */ nt((C, X) => C - X + 2, "L"),
+  R: /* @__PURE__ */ nt((C, X) => C - 2, "R"),
+  T: /* @__PURE__ */ nt((C, X) => C - X + 2, "T"),
+  B: /* @__PURE__ */ nt((C, X) => C - 2, "B")
+}, Lr = /* @__PURE__ */ nt(function(C) {
+  return zt(C) ? C === "L" ? "R" : "L" : C === "T" ? "B" : "T";
+}, "getOppositeArchitectureDirection"), be = /* @__PURE__ */ nt(function(C) {
+  const X = C;
+  return X === "L" || X === "R" || X === "T" || X === "B";
+}, "isArchitectureDirection"), zt = /* @__PURE__ */ nt(function(C) {
+  const X = C;
+  return X === "L" || X === "R";
+}, "isArchitectureDirectionX"), Qt = /* @__PURE__ */ nt(function(C) {
+  const X = C;
+  return X === "T" || X === "B";
+}, "isArchitectureDirectionY"), Ce = /* @__PURE__ */ nt(function(C, X) {
+  const M = zt(C) && Qt(X), P = Qt(C) && zt(X);
   return M || P;
-}, "isArchitectureDirectionXY"), Tr = /* @__PURE__ */ nt(function(A) {
-  const Y = A[0], M = A[1], P = zt(Y) && Qt(M), L = Qt(Y) && zt(M);
+}, "isArchitectureDirectionXY"), Cr = /* @__PURE__ */ nt(function(C) {
+  const X = C[0], M = C[1], P = zt(X) && Qt(M), L = Qt(X) && zt(M);
   return P || L;
-}, "isArchitecturePairXY"), Nr = /* @__PURE__ */ nt(function(A) {
-  return A !== "LL" && A !== "RR" && A !== "TT" && A !== "BB";
-}, "isValidArchitectureDirectionPair"), Te = /* @__PURE__ */ nt(function(A, Y) {
-  const M = `${A}${Y}`;
-  return Nr(M) ? M : void 0;
-}, "getArchitectureDirectionPair"), Lr = /* @__PURE__ */ nt(function([A, Y], M) {
+}, "isArchitecturePairXY"), Ar = /* @__PURE__ */ nt(function(C) {
+  return C !== "LL" && C !== "RR" && C !== "TT" && C !== "BB";
+}, "isValidArchitectureDirectionPair"), me = /* @__PURE__ */ nt(function(C, X) {
+  const M = `${C}${X}`;
+  return Ar(M) ? M : void 0;
+}, "getArchitectureDirectionPair"), Mr = /* @__PURE__ */ nt(function([C, X], M) {
   const P = M[0], L = M[1];
-  return zt(P) ? Qt(L) ? [A + (P === "L" ? -1 : 1), Y + (L === "T" ? 1 : -1)] : [A + (P === "L" ? -1 : 1), Y] : zt(L) ? [A + (L === "L" ? 1 : -1), Y + (P === "T" ? 1 : -1)] : [A, Y + (P === "T" ? 1 : -1)];
-}, "shiftPositionByArchitectureDirectionPair"), Ar = /* @__PURE__ */ nt(function(A) {
-  return A === "LT" || A === "TL" ? [1, 1] : A === "BL" || A === "LB" ? [1, -1] : A === "BR" || A === "RB" ? [-1, -1] : [-1, 1];
-}, "getArchitectureDirectionXYFactors"), Cr = /* @__PURE__ */ nt(function(A, Y) {
-  return Ae(A, Y) ? "bend" : zt(A) ? "horizontal" : "vertical";
-}, "getArchitectureDirectionAlignment"), Mr = /* @__PURE__ */ nt(function(A) {
-  return A.type === "service";
-}, "isArchitectureService"), wr = /* @__PURE__ */ nt(function(A) {
-  return A.type === "junction";
-}, "isArchitectureJunction"), Ue = /* @__PURE__ */ nt((A) => A.data(), "edgeData"), ne = /* @__PURE__ */ nt((A) => A.data(), "nodeData"), Ye = ar.architecture, pt = new lr(() => ({
+  return zt(P) ? Qt(L) ? [C + (P === "L" ? -1 : 1), X + (L === "T" ? 1 : -1)] : [C + (P === "L" ? -1 : 1), X] : zt(L) ? [C + (L === "L" ? 1 : -1), X + (P === "T" ? 1 : -1)] : [C, X + (P === "T" ? 1 : -1)];
+}, "shiftPositionByArchitectureDirectionPair"), wr = /* @__PURE__ */ nt(function(C) {
+  return C === "LT" || C === "TL" ? [1, 1] : C === "BL" || C === "LB" ? [1, -1] : C === "BR" || C === "RB" ? [-1, -1] : [-1, 1];
+}, "getArchitectureDirectionXYFactors"), Or = /* @__PURE__ */ nt(function(C, X) {
+  return Ce(C, X) ? "bend" : zt(C) ? "horizontal" : "vertical";
+}, "getArchitectureDirectionAlignment"), Dr = /* @__PURE__ */ nt(function(C) {
+  return C.type === "service";
+}, "isArchitectureService"), xr = /* @__PURE__ */ nt(function(C) {
+  return C.type === "junction";
+}, "isArchitectureJunction"), Ue = /* @__PURE__ */ nt((C) => C.data(), "edgeData"), ne = /* @__PURE__ */ nt((C) => C.data(), "nodeData"), Ye = nr.architecture, pt = new cr(() => ({
   nodes: {},
   groups: {},
   edges: [],
@@ -3899,143 +3899,143 @@ var Se = {
   config: Ye,
   dataStructures: void 0,
   elements: {}
-})), Or = /* @__PURE__ */ nt(() => {
-  pt.reset(), rr();
-}, "clear"), Dr = /* @__PURE__ */ nt(function({
-  id: A,
-  icon: Y,
+})), Ir = /* @__PURE__ */ nt(() => {
+  pt.reset(), or();
+}, "clear"), Rr = /* @__PURE__ */ nt(function({
+  id: C,
+  icon: X,
   in: M,
   title: P,
   iconText: L
 }) {
-  if (pt.records.registeredIds[A] !== void 0)
+  if (pt.records.registeredIds[C] !== void 0)
     throw new Error(
-      `The service id [${A}] is already in use by another ${pt.records.registeredIds[A]}`
+      `The service id [${C}] is already in use by another ${pt.records.registeredIds[C]}`
     );
   if (M !== void 0) {
-    if (A === M)
-      throw new Error(`The service [${A}] cannot be placed within itself`);
+    if (C === M)
+      throw new Error(`The service [${C}] cannot be placed within itself`);
     if (pt.records.registeredIds[M] === void 0)
       throw new Error(
-        `The service [${A}]'s parent does not exist. Please make sure the parent is created before this service`
+        `The service [${C}]'s parent does not exist. Please make sure the parent is created before this service`
       );
     if (pt.records.registeredIds[M] === "node")
-      throw new Error(`The service [${A}]'s parent is not a group`);
+      throw new Error(`The service [${C}]'s parent is not a group`);
   }
-  pt.records.registeredIds[A] = "node", pt.records.nodes[A] = {
-    id: A,
+  pt.records.registeredIds[C] = "node", pt.records.nodes[C] = {
+    id: C,
     type: "service",
-    icon: Y,
+    icon: X,
     iconText: L,
     title: P,
     edges: [],
     in: M
   };
-}, "addService"), xr = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes).filter(Mr), "getServices"), Ir = /* @__PURE__ */ nt(function({ id: A, in: Y }) {
-  pt.records.registeredIds[A] = "node", pt.records.nodes[A] = {
-    id: A,
+}, "addService"), Sr = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes).filter(Dr), "getServices"), Fr = /* @__PURE__ */ nt(function({ id: C, in: X }) {
+  pt.records.registeredIds[C] = "node", pt.records.nodes[C] = {
+    id: C,
     type: "junction",
     edges: [],
-    in: Y
+    in: X
   };
-}, "addJunction"), Rr = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes).filter(wr), "getJunctions"), Sr = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes), "getNodes"), Ne = /* @__PURE__ */ nt((A) => pt.records.nodes[A], "getNode"), Fr = /* @__PURE__ */ nt(function({ id: A, icon: Y, in: M, title: P }) {
-  if (pt.records.registeredIds[A] !== void 0)
+}, "addJunction"), br = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes).filter(xr), "getJunctions"), Pr = /* @__PURE__ */ nt(() => Object.values(pt.records.nodes), "getNodes"), Te = /* @__PURE__ */ nt((C) => pt.records.nodes[C], "getNode"), Gr = /* @__PURE__ */ nt(function({ id: C, icon: X, in: M, title: P }) {
+  if (pt.records.registeredIds[C] !== void 0)
     throw new Error(
-      `The group id [${A}] is already in use by another ${pt.records.registeredIds[A]}`
+      `The group id [${C}] is already in use by another ${pt.records.registeredIds[C]}`
     );
   if (M !== void 0) {
-    if (A === M)
-      throw new Error(`The group [${A}] cannot be placed within itself`);
+    if (C === M)
+      throw new Error(`The group [${C}] cannot be placed within itself`);
     if (pt.records.registeredIds[M] === void 0)
       throw new Error(
-        `The group [${A}]'s parent does not exist. Please make sure the parent is created before this group`
+        `The group [${C}]'s parent does not exist. Please make sure the parent is created before this group`
       );
     if (pt.records.registeredIds[M] === "node")
-      throw new Error(`The group [${A}]'s parent is not a group`);
+      throw new Error(`The group [${C}]'s parent is not a group`);
   }
-  pt.records.registeredIds[A] = "group", pt.records.groups[A] = {
-    id: A,
-    icon: Y,
+  pt.records.registeredIds[C] = "group", pt.records.groups[C] = {
+    id: C,
+    icon: X,
     title: P,
     in: M
   };
-}, "addGroup"), br = /* @__PURE__ */ nt(() => Object.values(pt.records.groups), "getGroups"), Pr = /* @__PURE__ */ nt(function({
-  lhsId: A,
-  rhsId: Y,
+}, "addGroup"), Ur = /* @__PURE__ */ nt(() => Object.values(pt.records.groups), "getGroups"), Yr = /* @__PURE__ */ nt(function({
+  lhsId: C,
+  rhsId: X,
   lhsDir: M,
   rhsDir: P,
   lhsInto: L,
-  rhsInto: u,
+  rhsInto: g,
   lhsGroup: h,
   rhsGroup: a,
   title: r
 }) {
   if (!be(M))
     throw new Error(
-      `Invalid direction given for left hand side of edge ${A}--${Y}. Expected (L,R,T,B) got ${M}`
+      `Invalid direction given for left hand side of edge ${C}--${X}. Expected (L,R,T,B) got ${M}`
     );
   if (!be(P))
     throw new Error(
-      `Invalid direction given for right hand side of edge ${A}--${Y}. Expected (L,R,T,B) got ${P}`
+      `Invalid direction given for right hand side of edge ${C}--${X}. Expected (L,R,T,B) got ${P}`
     );
-  if (pt.records.nodes[A] === void 0 && pt.records.groups[A] === void 0)
+  if (pt.records.nodes[C] === void 0 && pt.records.groups[C] === void 0)
     throw new Error(
-      `The left-hand id [${A}] does not yet exist. Please create the service/group before declaring an edge to it.`
+      `The left-hand id [${C}] does not yet exist. Please create the service/group before declaring an edge to it.`
     );
-  if (pt.records.nodes[Y] === void 0 && pt.records.groups[A] === void 0)
+  if (pt.records.nodes[X] === void 0 && pt.records.groups[C] === void 0)
     throw new Error(
-      `The right-hand id [${Y}] does not yet exist. Please create the service/group before declaring an edge to it.`
+      `The right-hand id [${X}] does not yet exist. Please create the service/group before declaring an edge to it.`
     );
-  const e = pt.records.nodes[A].in, f = pt.records.nodes[Y].in;
+  const e = pt.records.nodes[C].in, f = pt.records.nodes[X].in;
   if (h && e && f && e == f)
     throw new Error(
-      `The left-hand id [${A}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
+      `The left-hand id [${C}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
     );
   if (a && e && f && e == f)
     throw new Error(
-      `The right-hand id [${Y}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
+      `The right-hand id [${X}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
     );
   const i = {
-    lhsId: A,
+    lhsId: C,
     lhsDir: M,
     lhsInto: L,
     lhsGroup: h,
-    rhsId: Y,
+    rhsId: X,
     rhsDir: P,
-    rhsInto: u,
+    rhsInto: g,
     rhsGroup: a,
     title: r
   };
-  pt.records.edges.push(i), pt.records.nodes[A] && pt.records.nodes[Y] && (pt.records.nodes[A].edges.push(pt.records.edges[pt.records.edges.length - 1]), pt.records.nodes[Y].edges.push(pt.records.edges[pt.records.edges.length - 1]));
-}, "addEdge"), Gr = /* @__PURE__ */ nt(() => pt.records.edges, "getEdges"), Ur = /* @__PURE__ */ nt(() => {
+  pt.records.edges.push(i), pt.records.nodes[C] && pt.records.nodes[X] && (pt.records.nodes[C].edges.push(pt.records.edges[pt.records.edges.length - 1]), pt.records.nodes[X].edges.push(pt.records.edges[pt.records.edges.length - 1]));
+}, "addEdge"), Xr = /* @__PURE__ */ nt(() => pt.records.edges, "getEdges"), Hr = /* @__PURE__ */ nt(() => {
   if (pt.records.dataStructures === void 0) {
-    const A = {}, Y = Object.entries(pt.records.nodes).reduce((a, [r, e]) => (a[r] = e.edges.reduce((f, i) => {
+    const C = {}, X = Object.entries(pt.records.nodes).reduce((a, [r, e]) => (a[r] = e.edges.reduce((f, i) => {
       var _a, _b;
-      const v = (_a = Ne(i.lhsId)) == null ? void 0 : _a.in, t = (_b = Ne(i.rhsId)) == null ? void 0 : _b.in;
+      const v = (_a = Te(i.lhsId)) == null ? void 0 : _a.in, t = (_b = Te(i.rhsId)) == null ? void 0 : _b.in;
       if (v && t && v !== t) {
-        const o = Cr(i.lhsDir, i.rhsDir);
-        o !== "bend" && (A[v] ?? (A[v] = {}), A[v][t] = o, A[t] ?? (A[t] = {}), A[t][v] = o);
+        const o = Or(i.lhsDir, i.rhsDir);
+        o !== "bend" && (C[v] ?? (C[v] = {}), C[v][t] = o, C[t] ?? (C[t] = {}), C[t][v] = o);
       }
       if (i.lhsId === r) {
-        const o = Te(i.lhsDir, i.rhsDir);
+        const o = me(i.lhsDir, i.rhsDir);
         o && (f[o] = i.rhsId);
       } else {
-        const o = Te(i.rhsDir, i.lhsDir);
+        const o = me(i.rhsDir, i.lhsDir);
         o && (f[o] = i.lhsId);
       }
       return f;
-    }, {}), a), {}), M = Object.keys(Y)[0], P = { [M]: 1 }, L = Object.keys(Y).reduce(
+    }, {}), a), {}), M = Object.keys(X)[0], P = { [M]: 1 }, L = Object.keys(X).reduce(
       (a, r) => r === M ? a : { ...a, [r]: 1 },
       {}
-    ), u = /* @__PURE__ */ nt((a) => {
+    ), g = /* @__PURE__ */ nt((a) => {
       const r = { [a]: [0, 0] }, e = [a];
       for (; e.length > 0; ) {
         const f = e.shift();
         if (f) {
           P[f] = 1, delete L[f];
-          const i = Y[f], [v, t] = r[f];
+          const i = X[f], [v, t] = r[f];
           Object.entries(i).forEach(([o, s]) => {
-            P[s] || (r[s] = Lr(
+            P[s] || (r[s] = Mr(
               [v, t],
               o
             ), e.push(s));
@@ -4043,67 +4043,70 @@ var Se = {
         }
       }
       return r;
-    }, "BFS"), h = [u(M)];
+    }, "BFS"), h = [g(M)];
     for (; Object.keys(L).length > 0; )
-      h.push(u(Object.keys(L)[0]));
+      h.push(g(Object.keys(L)[0]));
     pt.records.dataStructures = {
-      adjList: Y,
+      adjList: X,
       spatialMaps: h,
-      groupAlignments: A
+      groupAlignments: C
     };
   }
   return pt.records.dataStructures;
-}, "getDataStructures"), Yr = /* @__PURE__ */ nt((A, Y) => {
-  pt.records.elements[A] = Y;
-}, "setElementForId"), Xr = /* @__PURE__ */ nt((A) => pt.records.elements[A], "getElementById"), ue = {
-  clear: Or,
-  setDiagramTitle: _e,
-  getDiagramTitle: je,
-  setAccTitle: Ke,
-  getAccTitle: Qe,
-  setAccDescription: Je,
-  getAccDescription: qe,
-  addService: Dr,
-  getServices: xr,
-  addJunction: Ir,
-  getJunctions: Rr,
-  getNodes: Sr,
-  getNode: Ne,
-  addGroup: Fr,
-  getGroups: br,
-  addEdge: Pr,
-  getEdges: Gr,
-  setElementForId: Yr,
-  getElementById: Xr,
-  getDataStructures: Ur
+}, "getDataStructures"), Wr = /* @__PURE__ */ nt((C, X) => {
+  pt.records.elements[C] = X;
+}, "setElementForId"), Vr = /* @__PURE__ */ nt((C) => pt.records.elements[C], "getElementById"), Xe = /* @__PURE__ */ nt(() => ir({
+  ...Ye,
+  ...ar().architecture
+}), "getConfig"), ge = {
+  clear: Ir,
+  setDiagramTitle: tr,
+  getDiagramTitle: _e,
+  setAccTitle: je,
+  getAccTitle: Ke,
+  setAccDescription: Qe,
+  getAccDescription: Je,
+  getConfig: Xe,
+  addService: Rr,
+  getServices: Sr,
+  addJunction: Fr,
+  getJunctions: br,
+  getNodes: Pr,
+  getNode: Te,
+  addGroup: Gr,
+  getGroups: Ur,
+  addEdge: Yr,
+  getEdges: Xr,
+  setElementForId: Wr,
+  getElementById: Vr,
+  getDataStructures: Hr
 };
-function Pt(A) {
-  const Y = ge().architecture;
-  return (Y == null ? void 0 : Y[A]) ? Y[A] : Ye[A];
+function Pt(C) {
+  return Xe()[C];
 }
 nt(Pt, "getConfigField");
-var Hr = /* @__PURE__ */ nt((A, Y) => {
-  sr(A, Y), A.groups.map(Y.addGroup), A.services.map((M) => Y.addService({ ...M, type: "service" })), A.junctions.map((M) => Y.addJunction({ ...M, type: "junction" })), A.edges.map(Y.addEdge);
-}, "populateDb"), Wr = {
-  parse: /* @__PURE__ */ nt(async (A) => {
-    const Y = await hr("architecture", A);
-    Pe.debug(Y), Hr(Y, ue);
+var zr = /* @__PURE__ */ nt((C, X) => {
+  fr(C, X), C.groups.map(X.addGroup), C.services.map((M) => X.addService({ ...M, type: "service" })), C.junctions.map((M) => X.addJunction({ ...M, type: "junction" })), C.edges.map(X.addEdge);
+}, "populateDb"), Br = {
+  parse: /* @__PURE__ */ nt(async (C) => {
+    const X = await gr("architecture", C);
+    Pe.debug(X), zr(X, ge);
   }, "parse")
-}, Vr = /* @__PURE__ */ nt((A) => `
+}, $r = /* @__PURE__ */ nt((C) => `
   .edge {
-    stroke-width: ${A.archEdgeWidth};
-    stroke: ${A.archEdgeColor};
+    stroke-width: ${C.archEdgeWidth};
+    stroke: ${C.archEdgeColor};
     fill: none;
   }
 
   .arrow {
-    fill: ${A.archEdgeArrowColor};
+    fill: ${C.archEdgeArrowColor};
   }
 
   .node-bkg {
     fill: none;
-    stroke: ${A.archGroupBorderColor};
-    stroke-width: ${A.archGroupBorderWidth};
+    stroke: ${C.archGroupBorderColor};
+    stroke-width: ${C.archGroupBorderWidth};
     stroke-dasharray: 8;
   }
   .node-icon-text {
@@ -4120,7 +4123,7 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
     display: -webkit-box;
     -webkit-box-orient: vertical;
   }
-`, "getStyles"), zr = Vr, ae = /* @__PURE__ */ nt((A) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${A}</g>`, "wrapIcon"), oe = {
+`, "getStyles"), Zr = $r, ae = /* @__PURE__ */ nt((C) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${C}</g>`, "wrapIcon"), oe = {
   prefix: "mermaid-architecture",
   height: 80,
   width: 80,
@@ -4150,15 +4153,15 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
         '<path d="m65,47.5c0,2.76-2.24,5-5,5H20c-2.76,0-5-2.24-5-5,0-1.87,1.03-3.51,2.56-4.36-.04-.21-.06-.42-.06-.64,0-2.6,2.48-4.74,5.65-4.97,1.65-4.51,6.34-7.76,11.85-7.76.86,0,1.69.08,2.5.23,2.09-1.57,4.69-2.5,7.5-2.5,6.1,0,11.19,4.38,12.28,10.17,2.14.56,3.72,2.51,3.72,4.83,0,.03,0,.07-.01.1,2.29.46,4.01,2.48,4.01,4.9Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
       )
     },
-    unknown: or,
+    unknown: hr,
     blank: {
       body: ae("")
     }
   }
-}, Br = /* @__PURE__ */ nt(async function(A, Y) {
-  const M = Pt("padding"), P = Pt("iconSize"), L = P / 2, u = P / 6, h = u / 2;
+}, kr = /* @__PURE__ */ nt(async function(C, X) {
+  const M = Pt("padding"), P = Pt("iconSize"), L = P / 2, g = P / 6, h = g / 2;
   await Promise.all(
-    Y.edges().map(async (a) => {
+    X.edges().map(async (a) => {
       var _a, _b;
       const {
         source: r,
@@ -4172,25 +4175,25 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
         label: c
       } = Ue(a);
       let { x: l, y: T } = a[0].sourceEndpoint();
-      const { x: g, y: d } = a[0].midpoint();
+      const { x: u, y: d } = a[0].midpoint();
       let { x: N, y: F } = a[0].targetEndpoint();
-      const C = M + 4;
-      if (i && (zt(e) ? l += e === "L" ? -C : C : T += e === "T" ? -C : C + 18), s && (zt(t) ? N += t === "L" ? -C : C : F += t === "T" ? -C : C + 18), !i && ((_a = ue.getNode(r)) == null ? void 0 : _a.type) === "junction" && (zt(e) ? l += e === "L" ? L : -L : T += e === "T" ? L : -L), !s && ((_b = ue.getNode(v)) == null ? void 0 : _b.type) === "junction" && (zt(t) ? N += t === "L" ? L : -L : F += t === "T" ? L : -L), a[0]._private.rscratch) {
-        const G = A.insert("g");
-        if (G.insert("path").attr("d", `M ${l},${T} L ${g},${d} L${N},${F} `).attr("class", "edge"), f) {
-          const B = zt(e) ? le[e](l, u) : l - h, U = Qt(e) ? le[e](T, u) : T - h;
-          G.insert("polygon").attr("points", Fe[e](u)).attr("transform", `translate(${B},${U})`).attr("class", "arrow");
+      const A = M + 4;
+      if (i && (zt(e) ? l += e === "L" ? -A : A : T += e === "T" ? -A : A + 18), s && (zt(t) ? N += t === "L" ? -A : A : F += t === "T" ? -A : A + 18), !i && ((_a = ge.getNode(r)) == null ? void 0 : _a.type) === "junction" && (zt(e) ? l += e === "L" ? L : -L : T += e === "T" ? L : -L), !s && ((_b = ge.getNode(v)) == null ? void 0 : _b.type) === "junction" && (zt(t) ? N += t === "L" ? L : -L : F += t === "T" ? L : -L), a[0]._private.rscratch) {
+        const G = C.insert("g");
+        if (G.insert("path").attr("d", `M ${l},${T} L ${u},${d} L${N},${F} `).attr("class", "edge"), f) {
+          const B = zt(e) ? le[e](l, g) : l - h, U = Qt(e) ? le[e](T, g) : T - h;
+          G.insert("polygon").attr("points", Fe[e](g)).attr("transform", `translate(${B},${U})`).attr("class", "arrow");
         }
         if (o) {
-          const B = zt(t) ? le[t](N, u) : N - h, U = Qt(t) ? le[t](F, u) : F - h;
-          G.insert("polygon").attr("points", Fe[t](u)).attr("transform", `translate(${B},${U})`).attr("class", "arrow");
+          const B = zt(t) ? le[t](N, g) : N - h, U = Qt(t) ? le[t](F, g) : F - h;
+          G.insert("polygon").attr("points", Fe[t](g)).attr("transform", `translate(${B},${U})`).attr("class", "arrow");
         }
         if (c) {
-          const B = Ae(e, t) ? "XY" : zt(e) ? "X" : "Y";
+          const B = Ce(e, t) ? "XY" : zt(e) ? "X" : "Y";
           let U = 0;
           B === "X" ? U = Math.abs(l - N) : B === "Y" ? U = Math.abs(T - F) / 1.5 : U = Math.abs(l - N) / 2;
           const K = G.append("g");
-          if (await Le(
+          if (await Ne(
             K,
             c,
             {
@@ -4198,21 +4201,21 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
               width: U,
               classes: "architecture-service-label"
             },
-            ge()
+            Le()
           ), K.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), B === "X")
-            K.attr("transform", "translate(" + g + ", " + d + ")");
+            K.attr("transform", "translate(" + u + ", " + d + ")");
           else if (B === "Y")
-            K.attr("transform", "translate(" + g + ", " + d + ") rotate(-90)");
+            K.attr("transform", "translate(" + u + ", " + d + ") rotate(-90)");
           else if (B === "XY") {
-            const D = Te(e, t);
-            if (D && Tr(D)) {
-              const at = K.node().getBoundingClientRect(), [n, m] = Ar(D);
+            const D = me(e, t);
+            if (D && Cr(D)) {
+              const at = K.node().getBoundingClientRect(), [n, m] = wr(D);
               K.attr("dominant-baseline", "auto").attr("transform", `rotate(${-1 * n * m * 45})`);
               const p = K.node().getBoundingClientRect();
               K.attr(
                 "transform",
                 `
-                translate(${g}, ${d - at.height / 2})
+                translate(${u}, ${d - at.height / 2})
                 translate(${n * p.width / 2}, ${m * p.height / 2})
                 rotate(${-1 * n * m * 45}, 0, ${at.height / 2})
               `
@@ -4223,20 +4226,20 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
       }
     })
   );
-}, "drawEdges"), $r = /* @__PURE__ */ nt(async function(A, Y) {
+}, "drawEdges"), qr = /* @__PURE__ */ nt(async function(C, X) {
   const P = Pt("padding") * 0.75, L = Pt("fontSize"), h = Pt("iconSize") / 2;
   await Promise.all(
-    Y.nodes().map(async (a) => {
+    X.nodes().map(async (a) => {
       const r = ne(a);
       if (r.type === "group") {
         const { h: e, w: f, x1: i, y1: v } = a.boundingBox();
-        A.append("rect").attr("x", i + h).attr("y", v + h).attr("width", f).attr("height", e).attr("class", "node-bkg");
-        const t = A.append("g");
+        C.append("rect").attr("x", i + h).attr("y", v + h).attr("width", f).attr("height", e).attr("class", "node-bkg");
+        const t = C.append("g");
         let o = i, s = v;
         if (r.icon) {
           const c = t.append("g");
           c.html(
-            `<g>${await me(r.icon, { height: P, width: P, fallbackPrefix: oe.prefix })}</g>`
+            `<g>${await Ee(r.icon, { height: P, width: P, fallbackPrefix: oe.prefix })}</g>`
           ), c.attr(
             "transform",
             "translate(" + (o + h + 1) + ", " + (s + h + 1) + ")"
@@ -4244,7 +4247,7 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
         }
         if (r.label) {
           const c = t.append("g");
-          await Le(
+          await Ne(
             c,
             r.label,
             {
@@ -4252,7 +4255,7 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
               width: f,
               classes: "architecture-service-label"
             },
-            ge()
+            Le()
           ), c.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), c.attr(
             "transform",
             "translate(" + (o + h + 4) + ", " + (s + h + 2) + ")"
@@ -4261,63 +4264,63 @@ var Hr = /* @__PURE__ */ nt((A, Y) => {
       }
     })
   );
-}, "drawGroups"), kr = /* @__PURE__ */ nt(async function(A, Y, M) {
+}, "drawGroups"), Jr = /* @__PURE__ */ nt(async function(C, X, M) {
   for (const P of M) {
-    const L = Y.append("g"), u = Pt("iconSize");
+    const L = X.append("g"), g = Pt("iconSize");
     if (P.title) {
       const e = L.append("g");
-      await Le(
+      await Ne(
         e,
         P.title,
         {
           useHtmlLabels: false,
-          width: u * 1.5,
+          width: g * 1.5,
           classes: "architecture-service-label"
         },
-        ge()
-      ), e.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), e.attr("transform", "translate(" + u / 2 + ", " + u + ")");
+        Le()
+      ), e.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), e.attr("transform", "translate(" + g / 2 + ", " + g + ")");
     }
     const h = L.append("g");
     if (P.icon)
       h.html(
-        `<g>${await me(P.icon, { height: u, width: u, fallbackPrefix: oe.prefix })}</g>`
+        `<g>${await Ee(P.icon, { height: g, width: g, fallbackPrefix: oe.prefix })}</g>`
       );
     else if (P.iconText) {
       h.html(
-        `<g>${await me("blank", { height: u, width: u, fallbackPrefix: oe.prefix })}</g>`
+        `<g>${await Ee("blank", { height: g, width: g, fallbackPrefix: oe.prefix })}</g>`
       );
-      const i = h.append("g").append("foreignObject").attr("width", u).attr("height", u).append("div").attr("class", "node-icon-text").attr("style", `height: ${u}px;`).append("div").html(P.iconText), v = parseInt(
+      const i = h.append("g").append("foreignObject").attr("width", g).attr("height", g).append("div").attr("class", "node-icon-text").attr("style", `height: ${g}px;`).append("div").html(P.iconText), v = parseInt(
         window.getComputedStyle(i.node(), null).getPropertyValue("font-size").replace(/\D/g, "")
       ) ?? 16;
-      i.attr("style", `-webkit-line-clamp: ${Math.floor((u - 2) / v)};`);
+      i.attr("style", `-webkit-line-clamp: ${Math.floor((g - 2) / v)};`);
     } else
       h.append("path").attr("class", "node-bkg").attr("id", "node-" + P.id).attr(
         "d",
-        `M0 ${u} v${-u} q0,-5 5,-5 h${u} q5,0 5,5 v${u} H0 Z`
+        `M0 ${g} v${-g} q0,-5 5,-5 h${g} q5,0 5,5 v${g} H0 Z`
       );
     L.attr("class", "architecture-service");
     const { width: a, height: r } = L._groups[0][0].getBBox();
-    P.width = a, P.height = r, A.setElementForId(P.id, L);
+    P.width = a, P.height = r, C.setElementForId(P.id, L);
   }
   return 0;
-}, "drawServices"), Zr = /* @__PURE__ */ nt(function(A, Y, M) {
+}, "drawServices"), Qr = /* @__PURE__ */ nt(function(C, X, M) {
   M.forEach((P) => {
-    const L = Y.append("g"), u = Pt("iconSize");
-    L.append("g").append("rect").attr("id", "node-" + P.id).attr("fill-opacity", "0").attr("width", u).attr("height", u), L.attr("class", "architecture-junction");
+    const L = X.append("g"), g = Pt("iconSize");
+    L.append("g").append("rect").attr("id", "node-" + P.id).attr("fill-opacity", "0").attr("width", g).attr("height", g), L.attr("class", "architecture-junction");
     const { width: a, height: r } = L._groups[0][0].getBBox();
-    L.width = a, L.height = r, A.setElementForId(P.id, L);
+    L.width = a, L.height = r, C.setElementForId(P.id, L);
   });
 }, "drawJunctions");
-nr([
+lr([
   {
     name: oe.prefix,
     icons: oe
   }
 ]);
-Ge.use(Er);
-function Xe(A, Y) {
-  A.forEach((M) => {
-    Y.add({
+Ge.use(Nr);
+function He(C, X) {
+  C.forEach((M) => {
+    X.add({
       group: "nodes",
       data: {
         type: "service",
@@ -4332,10 +4335,10 @@ function Xe(A, Y) {
     });
   });
 }
-nt(Xe, "addServices");
-function He(A, Y) {
-  A.forEach((M) => {
-    Y.add({
+nt(He, "addServices");
+function We(C, X) {
+  C.forEach((M) => {
+    X.add({
       group: "nodes",
       data: {
         type: "junction",
@@ -4348,19 +4351,19 @@ function He(A, Y) {
     });
   });
 }
-nt(He, "addJunctions");
-function We(A, Y) {
-  Y.nodes().map((M) => {
+nt(We, "addJunctions");
+function Ve(C, X) {
+  X.nodes().map((M) => {
     const P = ne(M);
     if (P.type === "group")
       return;
-    P.x = M.position().x, P.y = M.position().y, A.getElementById(P.id).attr("transform", "translate(" + (P.x || 0) + "," + (P.y || 0) + ")");
+    P.x = M.position().x, P.y = M.position().y, C.getElementById(P.id).attr("transform", "translate(" + (P.x || 0) + "," + (P.y || 0) + ")");
   });
 }
-nt(We, "positionNodes");
-function Ve(A, Y) {
-  A.forEach((M) => {
-    Y.add({
+nt(Ve, "positionNodes");
+function ze(C, X) {
+  C.forEach((M) => {
+    X.add({
       group: "nodes",
       data: {
         type: "group",
@@ -4373,15 +4376,15 @@ function Ve(A, Y) {
     });
   });
 }
-nt(Ve, "addGroups");
-function ze(A, Y) {
-  A.forEach((M) => {
-    const { lhsId: P, rhsId: L, lhsInto: u, lhsGroup: h, rhsInto: a, lhsDir: r, rhsDir: e, rhsGroup: f, title: i } = M, v = Ae(M.lhsDir, M.rhsDir) ? "segments" : "straight", t = {
+nt(ze, "addGroups");
+function Be(C, X) {
+  C.forEach((M) => {
+    const { lhsId: P, rhsId: L, lhsInto: g, lhsGroup: h, rhsInto: a, lhsDir: r, rhsDir: e, rhsGroup: f, title: i } = M, v = Ce(M.lhsDir, M.rhsDir) ? "segments" : "straight", t = {
       id: `${P}-${L}`,
       label: i,
       source: P,
       sourceDir: r,
-      sourceArrow: u,
+      sourceArrow: g,
       sourceGroup: h,
       sourceEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%",
       target: L,
@@ -4390,15 +4393,15 @@ function ze(A, Y) {
       targetGroup: f,
       targetEndpoint: e === "L" ? "0 50%" : e === "R" ? "100% 50%" : e === "T" ? "50% 0" : "50% 100%"
     };
-    Y.add({
+    X.add({
       group: "edges",
       data: t,
       classes: v
     });
   });
 }
-nt(ze, "addEdges");
-function Be(A, Y, M) {
+nt(Be, "addEdges");
+function $e(C, X, M) {
   const P = /* @__PURE__ */ nt((a, r) => Object.entries(a).reduce(
     (e, [f, i]) => {
       var _a;
@@ -4408,26 +4411,26 @@ function Be(A, Y, M) {
         return e[f] = t[0][1], e;
       for (let o = 0; o < t.length - 1; o++)
         for (let s = o + 1; s < t.length; s++) {
-          const [c, l] = t[o], [T, g] = t[s];
+          const [c, l] = t[o], [T, u] = t[s];
           if (((_a = M[c]) == null ? void 0 : _a[T]) === r)
-            e[f] ?? (e[f] = []), e[f] = [...e[f], ...l, ...g];
+            e[f] ?? (e[f] = []), e[f] = [...e[f], ...l, ...u];
           else if (c === "default" || T === "default")
-            e[f] ?? (e[f] = []), e[f] = [...e[f], ...l, ...g];
+            e[f] ?? (e[f] = []), e[f] = [...e[f], ...l, ...u];
           else {
             const N = `${f}-${v++}`;
             e[N] = l;
             const F = `${f}-${v++}`;
-            e[F] = g;
+            e[F] = u;
           }
         }
       return e;
     },
     {}
-  ), "flattenAlignments"), L = Y.map((a) => {
+  ), "flattenAlignments"), L = X.map((a) => {
     const r = {}, e = {};
     return Object.entries(a).forEach(([f, [i, v]]) => {
       var _a, _b, _c;
-      const t = ((_a = A.getNode(f)) == null ? void 0 : _a.in) ?? "default";
+      const t = ((_a = C.getNode(f)) == null ? void 0 : _a.in) ?? "default";
       r[v] ?? (r[v] = {}), (_b = r[v])[t] ?? (_b[t] = []), r[v][t].push(f), e[i] ?? (e[i] = {}), (_c = e[i])[t] ?? (_c[t] = []), e[i][t].push(f);
     }), {
       horiz: Object.values(P(r, "horizontal")).filter(
@@ -4437,7 +4440,7 @@ function Be(A, Y, M) {
         (f) => f.length > 1
       )
     };
-  }), [u, h] = L.reduce(
+  }), [g, h] = L.reduce(
     ([a, r], { horiz: e, vert: f }) => [
       [...a, ...e],
       [...r, ...f]
@@ -4445,15 +4448,15 @@ function Be(A, Y, M) {
     [[], []]
   );
   return {
-    horizontal: u,
+    horizontal: g,
     vertical: h
   };
 }
-nt(Be, "getAlignments");
-function $e(A) {
-  const Y = [], M = /* @__PURE__ */ nt((L) => `${L[0]},${L[1]}`, "posToStr"), P = /* @__PURE__ */ nt((L) => L.split(",").map((u) => parseInt(u)), "strToPos");
-  return A.forEach((L) => {
-    const u = Object.fromEntries(
+nt($e, "getAlignments");
+function Ze(C) {
+  const X = [], M = /* @__PURE__ */ nt((L) => `${L[0]},${L[1]}`, "posToStr"), P = /* @__PURE__ */ nt((L) => L.split(",").map((g) => parseInt(g)), "strToPos");
+  return C.forEach((L) => {
+    const g = Object.fromEntries(
       Object.entries(L).map(([e, f]) => [M(f), e])
     ), h = [M([0, 0])], a = {}, r = {
       L: [-1, 0],
@@ -4465,26 +4468,26 @@ function $e(A) {
       const e = h.shift();
       if (e) {
         a[e] = 1;
-        const f = u[e];
+        const f = g[e];
         if (f) {
           const i = P(e);
           Object.entries(r).forEach(([v, t]) => {
-            const o = M([i[0] + t[0], i[1] + t[1]]), s = u[o];
-            s && !a[o] && (h.push(o), Y.push({
+            const o = M([i[0] + t[0], i[1] + t[1]]), s = g[o];
+            s && !a[o] && (h.push(o), X.push({
               [Se[v]]: s,
-              [Se[mr(v)]]: f,
+              [Se[Lr(v)]]: f,
               gap: 1.5 * Pt("iconSize")
             }));
           });
         }
       }
     }
-  }), Y;
+  }), X;
 }
-nt($e, "getRelativeConstraints");
-function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
+nt(Ze, "getRelativeConstraints");
+function ke(C, X, M, P, L, { spatialMaps: g, groupAlignments: h }) {
   return new Promise((a) => {
-    const r = ir("body").append("div").attr("id", "cy").attr("style", "display:none"), e = Ge({
+    const r = sr("body").append("div").attr("id", "cy").attr("style", "display:none"), e = Ge({
       container: document.getElementById("cy"),
       style: [
         {
@@ -4547,8 +4550,8 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
         }
       ]
     });
-    r.remove(), Ve(M, e), Xe(A, e), He(Y, e), ze(P, e);
-    const f = Be(L, u, h), i = $e(u), v = e.layout({
+    r.remove(), ze(M, e), He(C, e), We(X, e), Be(P, e);
+    const f = $e(L, g, h), i = Ze(g), v = e.layout({
       name: "fcose",
       quality: "proof",
       styleEnabled: false,
@@ -4570,12 +4573,12 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
     v.one("layoutstop", () => {
       var _a;
       function t(o, s, c, l) {
-        let T, g;
-        const { x: d, y: N } = o, { x: F, y: C } = s;
-        g = (l - N + (d - c) * (N - C) / (d - F)) / Math.sqrt(1 + Math.pow((N - C) / (d - F), 2)), T = Math.sqrt(Math.pow(l - N, 2) + Math.pow(c - d, 2) - Math.pow(g, 2));
-        const G = Math.sqrt(Math.pow(F - d, 2) + Math.pow(C - N, 2));
+        let T, u;
+        const { x: d, y: N } = o, { x: F, y: A } = s;
+        u = (l - N + (d - c) * (N - A) / (d - F)) / Math.sqrt(1 + Math.pow((N - A) / (d - F), 2)), T = Math.sqrt(Math.pow(l - N, 2) + Math.pow(c - d, 2) - Math.pow(u, 2));
+        const G = Math.sqrt(Math.pow(F - d, 2) + Math.pow(A - N, 2));
         T = T / G;
-        let B = (F - d) * (l - N) - (C - N) * (c - d);
+        let B = (F - d) * (l - N) - (A - N) * (c - d);
         switch (true) {
           case B >= 0:
             B = 1;
@@ -4584,7 +4587,7 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
             B = -1;
             break;
         }
-        let U = (F - d) * (c - d) + (C - N) * (l - N);
+        let U = (F - d) * (c - d) + (A - N) * (l - N);
         switch (true) {
           case U >= 0:
             U = 1;
@@ -4593,8 +4596,8 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
             U = -1;
             break;
         }
-        return g = Math.abs(g) * B, T = T * U, {
-          distances: g,
+        return u = Math.abs(u) * B, T = T * U, {
+          distances: u,
           weights: T
         };
       }
@@ -4603,7 +4606,7 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
         if ((_a = o.data) == null ? void 0 : _a.call(o)) {
           const { x: s, y: c } = o.source().position(), { x: l, y: T } = o.target().position();
           if (s !== l && c !== T) {
-            const g = o.sourceEndpoint(), d = o.targetEndpoint(), { sourceDir: N } = Ue(o), [F, C] = Qt(N) ? [g.x, d.y] : [d.x, g.y], { weights: G, distances: B } = t(g, d, F, C);
+            const u = o.sourceEndpoint(), d = o.targetEndpoint(), { sourceDir: N } = Ue(o), [F, A] = Qt(N) ? [u.x, d.y] : [d.x, u.y], { weights: G, distances: B } = t(u, d, F, A);
             o.style("segment-distances", B), o.style("segment-weights", G);
           }
         }
@@ -4614,21 +4617,21 @@ function ke(A, Y, M, P, L, { spatialMaps: u, groupAlignments: h }) {
   });
 }
 nt(ke, "layoutArchitecture");
-var qr = /* @__PURE__ */ nt(async (A, Y, M, P) => {
-  const L = P.db, u = L.getServices(), h = L.getJunctions(), a = L.getGroups(), r = L.getEdges(), e = L.getDataStructures(), f = tr(Y), i = f.append("g");
+var Kr = /* @__PURE__ */ nt(async (C, X, M, P) => {
+  const L = P.db, g = L.getServices(), h = L.getJunctions(), a = L.getGroups(), r = L.getEdges(), e = L.getDataStructures(), f = er(X), i = f.append("g");
   i.attr("class", "architecture-edges");
   const v = f.append("g");
   v.attr("class", "architecture-services");
   const t = f.append("g");
-  t.attr("class", "architecture-groups"), await kr(L, v, u), Zr(L, v, h);
-  const o = await ke(u, h, a, r, L, e);
-  await Br(i, o), await $r(t, o), We(L, o), er(void 0, f, Pt("padding"), Pt("useMaxWidth"));
-}, "draw"), Jr = { draw: qr }, ri = {
-  parser: Wr,
-  db: ue,
-  renderer: Jr,
-  styles: zr
+  t.attr("class", "architecture-groups"), await Jr(L, v, g), Qr(L, v, h);
+  const o = await ke(g, h, a, r, L, e);
+  await kr(i, o), await qr(t, o), Ve(L, o), rr(void 0, f, Pt("padding"), Pt("useMaxWidth"));
+}, "draw"), jr = { draw: Kr }, ni = {
+  parser: Br,
+  db: ge,
+  renderer: jr,
+  styles: Zr
 };
 export {
-  ri as diagram
+  ni as diagram
 };