@leanspec/ui-components 0.2.21 → 0.2.22

package/dist/{architectureDiagram-VXUJARFQ-Bal8NTn4.js → architectureDiagram-VXUJARFQ-B9csKaKv.js}

@@ -1,10 +1,10 @@
-import { aL as Ze, _ as dt, P as ke, ah as qe, l as Se, e as Qe, d as Je, y as Ke, z as je, g as _e, s as tr, D as er, K as rr, L as ir, M as ar, f as Ee, ar as me, aM as pe, m as nr, h as or, C as sr, aN as hr, aO as lr } from "./index-BsdeQX2F.js";
-import { p as fr } from "./chunk-4BX2VUAB-BQgzc1Sm.js";
-import { p as cr } from "./mermaid-parser.core-B7VTdQ1C.js";
-import { c as Fe } from "./cytoscape.esm-CjI2IsL8.js";
+import { aL as Ze, _ as dt, P as ke, ah as qe, l as Se, e as Qe, d as Je, y as Ke, z as je, g as _e, s as tr, D as er, K as rr, L as ir, M as ar, f as Ee, ar as me, aM as pe, m as nr, h as or, C as sr, aN as hr, aO as lr } from "./index-B5zgF_S5.js";
+import { p as fr } from "./chunk-4BX2VUAB-Dkr-Egsj.js";
+import { p as cr } from "./mermaid-parser.core-BbeEQ08m.js";
+import { c as Fe } from "./cytoscape.esm-Cvf3sx9F.js";
 var he = { exports: {} }, le = { exports: {} }, fe = { exports: {} }, gr = fe.exports, we;
 function ur() {
-  return we || (we = 1, (function(I, D) {
+  return we || (we = 1, (function(I, x) {
     (function(P, N) {
       I.exports = N();
     })(gr, function() {
@@ -66,38 +66,38 @@ function ur() {
           /***/
           (function(A, P, N) {
             var u = N(2), h = N(8), a = N(9);
-            function r(f, i, g) {
-              u.call(this, g), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = g, this.bendpoints = [], this.source = f, this.target = i;
+            function e(l, i, g) {
+              u.call(this, g), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = g, this.bendpoints = [], this.source = l, this.target = i;
             }
-            r.prototype = Object.create(u.prototype);
-            for (var e in u)
-              r[e] = u[e];
-            r.prototype.getSource = function() {
+            e.prototype = Object.create(u.prototype);
+            for (var r in u)
+              e[r] = u[r];
+            e.prototype.getSource = function() {
               return this.source;
-            }, r.prototype.getTarget = function() {
+            }, e.prototype.getTarget = function() {
               return this.target;
-            }, r.prototype.isInterGraph = function() {
+            }, e.prototype.isInterGraph = function() {
               return this.isInterGraph;
-            }, r.prototype.getLength = function() {
+            }, e.prototype.getLength = function() {
               return this.length;
-            }, r.prototype.isOverlapingSourceAndTarget = function() {
+            }, e.prototype.isOverlapingSourceAndTarget = function() {
               return this.isOverlapingSourceAndTarget;
-            }, r.prototype.getBendpoints = function() {
+            }, e.prototype.getBendpoints = function() {
               return this.bendpoints;
-            }, r.prototype.getLca = function() {
+            }, e.prototype.getLca = function() {
               return this.lca;
-            }, r.prototype.getSourceInLca = function() {
+            }, e.prototype.getSourceInLca = function() {
               return this.sourceInLca;
-            }, r.prototype.getTargetInLca = function() {
+            }, e.prototype.getTargetInLca = function() {
               return this.targetInLca;
-            }, r.prototype.getOtherEnd = function(f) {
-              if (this.source === f)
+            }, e.prototype.getOtherEnd = function(l) {
+              if (this.source === l)
                 return this.target;
-              if (this.target === f)
+              if (this.target === l)
                 return this.source;
               throw "Node is not incident with this edge";
-            }, r.prototype.getOtherEndInGraph = function(f, i) {
-              for (var g = this.getOtherEnd(f), t = i.getGraphManager().getRoot(); ; ) {
+            }, e.prototype.getOtherEndInGraph = function(l, i) {
+              for (var g = this.getOtherEnd(l), t = i.getGraphManager().getRoot(); ; ) {
                 if (g.getOwner() == i)
                   return g;
                 if (g.getOwner() == t)
@@ -105,12 +105,12 @@ function ur() {
                 g = g.getOwner().getParent();
               }
               return null;
-            }, r.prototype.updateLength = function() {
-              var f = new Array(4);
-              this.isOverlapingSourceAndTarget = h.getIntersection(this.target.getRect(), this.source.getRect(), f), this.isOverlapingSourceAndTarget || (this.lengthX = f[0] - f[2], this.lengthY = f[1] - f[3], Math.abs(this.lengthX) < 1 && (this.lengthX = a.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = a.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY));
-            }, r.prototype.updateLengthSimple = function() {
+            }, e.prototype.updateLength = function() {
+              var l = new Array(4);
+              this.isOverlapingSourceAndTarget = h.getIntersection(this.target.getRect(), this.source.getRect(), l), this.isOverlapingSourceAndTarget || (this.lengthX = l[0] - l[2], this.lengthY = l[1] - l[3], Math.abs(this.lengthX) < 1 && (this.lengthX = a.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = a.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY));
+            }, e.prototype.updateLengthSimple = function() {
               this.lengthX = this.target.getCenterX() - this.source.getCenterX(), this.lengthY = this.target.getCenterY() - this.source.getCenterY(), Math.abs(this.lengthX) < 1 && (this.lengthX = a.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = a.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
-            }, A.exports = r;
+            }, A.exports = e;
           }),
           /* 2 */
           /***/
@@ -123,7 +123,7 @@ function ur() {
           /* 3 */
           /***/
           (function(A, P, N) {
-            var u = N(2), h = N(10), a = N(13), r = N(0), e = N(16), f = N(5);
+            var u = N(2), h = N(10), a = N(13), e = N(0), r = N(16), l = N(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();
             }
@@ -149,9 +149,9 @@ function ur() {
             }, i.prototype.getCenterY = function() {
               return this.rect.y + this.rect.height / 2;
             }, i.prototype.getCenter = function() {
-              return new f(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
+              return new l(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
             }, i.prototype.getLocation = function() {
-              return new f(this.rect.x, this.rect.y);
+              return new l(this.rect.x, this.rect.y);
             }, i.prototype.getRect = function() {
               return this.rect;
             }, i.prototype.getDiagonal = function() {
@@ -194,8 +194,8 @@ function ur() {
             }, i.prototype.withChildren = function() {
               var t = /* @__PURE__ */ new Set(), o, s;
               if (t.add(this), this.child != null)
-                for (var c = this.child.getNodes(), l = 0; l < c.length; l++)
-                  o = c[l], s = o.withChildren(), s.forEach(function(T) {
+                for (var c = this.child.getNodes(), f = 0; f < c.length; f++)
+                  o = c[f], s = o.withChildren(), s.forEach(function(T) {
                     t.add(T);
                   });
               return t;
@@ -214,16 +214,16 @@ function ur() {
             }, i.prototype.calcEstimatedSize = function() {
               return this.child == null ? this.estimatedSize = (this.rect.width + this.rect.height) / 2 : (this.estimatedSize = this.child.calcEstimatedSize(), this.rect.width = this.estimatedSize, this.rect.height = this.estimatedSize, this.estimatedSize);
             }, i.prototype.scatter = function() {
-              var t, o, s = -r.INITIAL_WORLD_BOUNDARY, c = r.INITIAL_WORLD_BOUNDARY;
-              t = r.WORLD_CENTER_X + e.nextDouble() * (c - s) + s;
-              var l = -r.INITIAL_WORLD_BOUNDARY, T = r.INITIAL_WORLD_BOUNDARY;
-              o = r.WORLD_CENTER_Y + e.nextDouble() * (T - l) + l, this.rect.x = t, this.rect.y = o;
+              var t, o, s = -e.INITIAL_WORLD_BOUNDARY, c = e.INITIAL_WORLD_BOUNDARY;
+              t = e.WORLD_CENTER_X + r.nextDouble() * (c - s) + s;
+              var f = -e.INITIAL_WORLD_BOUNDARY, T = e.INITIAL_WORLD_BOUNDARY;
+              o = e.WORLD_CENTER_Y + r.nextDouble() * (T - f) + f, this.rect.x = t, this.rect.y = o;
             }, i.prototype.updateBounds = function() {
               if (this.getChild() == null)
                 throw "assert failed";
               if (this.getChild().getNodes().length != 0) {
                 var t = this.getChild();
-                if (t.updateBounds(!0), this.rect.x = t.getLeft(), this.rect.y = t.getTop(), this.setWidth(t.getRight() - t.getLeft()), this.setHeight(t.getBottom() - t.getTop()), r.NODE_DIMENSIONS_INCLUDE_LABELS) {
+                if (t.updateBounds(!0), this.rect.x = t.getLeft(), this.rect.y = t.getTop(), this.setWidth(t.getRight() - t.getLeft()), this.setHeight(t.getBottom() - t.getTop()), e.NODE_DIMENSIONS_INCLUDE_LABELS) {
                   var o = t.getRight() - t.getLeft(), s = t.getBottom() - t.getTop();
                   this.labelWidth && (this.labelPosHorizontal == "left" ? (this.rect.x -= this.labelWidth, this.setWidth(o + this.labelWidth)) : this.labelPosHorizontal == "center" && this.labelWidth > o ? (this.rect.x -= (this.labelWidth - o) / 2, this.setWidth(this.labelWidth)) : this.labelPosHorizontal == "right" && this.setWidth(o + this.labelWidth)), this.labelHeight && (this.labelPosVertical == "top" ? (this.rect.y -= this.labelHeight, this.setHeight(s + this.labelHeight)) : this.labelPosVertical == "center" && this.labelHeight > s ? (this.rect.y -= (this.labelHeight - s) / 2, this.setHeight(this.labelHeight)) : this.labelPosVertical == "bottom" && this.setHeight(s + this.labelHeight));
                 }
@@ -234,11 +234,11 @@ function ur() {
               return this.inclusionTreeDepth;
             }, i.prototype.transform = function(t) {
               var o = this.rect.x;
-              o > r.WORLD_BOUNDARY ? o = r.WORLD_BOUNDARY : o < -r.WORLD_BOUNDARY && (o = -r.WORLD_BOUNDARY);
+              o > e.WORLD_BOUNDARY ? o = e.WORLD_BOUNDARY : o < -e.WORLD_BOUNDARY && (o = -e.WORLD_BOUNDARY);
               var s = this.rect.y;
-              s > r.WORLD_BOUNDARY ? s = r.WORLD_BOUNDARY : s < -r.WORLD_BOUNDARY && (s = -r.WORLD_BOUNDARY);
-              var c = new f(o, s), l = t.inverseTransformPoint(c);
-              this.setLocation(l.x, l.y);
+              s > e.WORLD_BOUNDARY ? s = e.WORLD_BOUNDARY : s < -e.WORLD_BOUNDARY && (s = -e.WORLD_BOUNDARY);
+              var c = new l(o, s), f = t.inverseTransformPoint(c);
+              this.setLocation(f.x, f.y);
             }, i.prototype.getLeft = function() {
               return this.rect.x;
             }, i.prototype.getRight = function() {
@@ -286,9 +286,9 @@ function ur() {
           /* 6 */
           /***/
           (function(A, P, N) {
-            var u = N(2), h = N(10), a = N(0), r = N(7), e = N(3), f = N(1), i = N(13), g = N(12), t = N(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 = !1, this.parent = c, l != null && l instanceof r ? this.graphManager = l : l != null && l instanceof Layout && (this.graphManager = l.graphManager);
+            var u = N(2), h = N(10), a = N(0), e = N(7), r = N(3), l = N(1), i = N(13), g = N(12), t = N(11);
+            function o(c, f, T) {
+              u.call(this, T), this.estimatedSize = h.MIN_VALUE, this.margin = a.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = c, f != null && f instanceof e ? this.graphManager = f : f != null && f instanceof Layout && (this.graphManager = f.graphManager);
             }
             o.prototype = Object.create(u.prototype);
             for (var s in u)
@@ -311,8 +311,8 @@ function ur() {
               return this.bottom;
             }, o.prototype.isConnected = function() {
               return this.isConnected;
-            }, o.prototype.add = function(c, l, T) {
-              if (l == null && T == null) {
+            }, o.prototype.add = function(c, f, T) {
+              if (f == null && T == null) {
                 var d = c;
                 if (this.graphManager == null)
                   throw "Graph has no graph mgr!";
@@ -321,28 +321,28 @@ function ur() {
                 return d.owner = this, this.getNodes().push(d), d;
               } else {
                 var v = c;
-                if (!(this.getNodes().indexOf(l) > -1 && this.getNodes().indexOf(T) > -1))
+                if (!(this.getNodes().indexOf(f) > -1 && this.getNodes().indexOf(T) > -1))
                   throw "Source or target not in graph!";
-                if (!(l.owner == T.owner && l.owner == this))
+                if (!(f.owner == T.owner && f.owner == this))
                   throw "Both owners must be this graph!";
-                return l.owner != T.owner ? null : (v.source = l, v.target = T, v.isInterGraph = !1, this.getEdges().push(v), l.edges.push(v), T != l && T.edges.push(v), v);
+                return f.owner != T.owner ? null : (v.source = f, v.target = T, v.isInterGraph = !1, this.getEdges().push(v), f.edges.push(v), T != f && T.edges.push(v), v);
               }
             }, o.prototype.remove = function(c) {
-              var l = c;
-              if (c instanceof e) {
-                if (l == null)
+              var f = c;
+              if (c instanceof r) {
+                if (f == null)
                   throw "Node is null!";
-                if (!(l.owner != null && l.owner == this))
+                if (!(f.owner != null && f.owner == this))
                   throw "Owner graph is invalid!";
                 if (this.graphManager == null)
                   throw "Owner graph manager is invalid!";
-                for (var T = l.edges.slice(), d, v = T.length, L = 0; L < v; L++)
+                for (var T = f.edges.slice(), d, v = T.length, L = 0; L < v; L++)
                   d = T[L], d.isInterGraph ? this.graphManager.remove(d) : d.source.owner.remove(d);
-                var S = this.nodes.indexOf(l);
-                if (S == -1)
+                var b = this.nodes.indexOf(f);
+                if (b == -1)
                   throw "Node not in owner node list!";
-                this.nodes.splice(S, 1);
-              } else if (c instanceof f) {
+                this.nodes.splice(b, 1);
+              } else if (c instanceof l) {
                 var d = c;
                 if (d == null)
                   throw "Edge is null!";
@@ -354,30 +354,30 @@ function ur() {
                 if (!(C > -1 && G > -1))
                   throw "Source and/or target doesn't know this edge!";
                 d.source.edges.splice(C, 1), d.target != d.source && d.target.edges.splice(G, 1);
-                var S = d.source.owner.getEdges().indexOf(d);
-                if (S == -1)
+                var b = d.source.owner.getEdges().indexOf(d);
+                if (b == -1)
                   throw "Not in owner's edge list!";
-                d.source.owner.getEdges().splice(S, 1);
+                d.source.owner.getEdges().splice(b, 1);
               }
             }, o.prototype.updateLeftTop = function() {
-              for (var c = h.MAX_VALUE, l = h.MAX_VALUE, T, d, v, L = this.getNodes(), S = L.length, C = 0; C < S; C++) {
+              for (var c = h.MAX_VALUE, f = h.MAX_VALUE, T, d, v, L = this.getNodes(), b = L.length, C = 0; C < b; C++) {
                 var G = L[C];
-                T = G.getTop(), d = G.getLeft(), c > T && (c = T), l > d && (l = d);
+                T = G.getTop(), d = G.getLeft(), c > T && (c = T), f > d && (f = d);
               }
-              return c == h.MAX_VALUE ? null : (L[0].getParent().paddingLeft != null ? v = L[0].getParent().paddingLeft : v = this.margin, this.left = l - v, this.top = c - v, new g(this.left, this.top));
+              return c == h.MAX_VALUE ? null : (L[0].getParent().paddingLeft != null ? v = L[0].getParent().paddingLeft : v = this.margin, this.left = f - v, this.top = c - v, new g(this.left, this.top));
             }, o.prototype.updateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, S, C, G, K, X = this.nodes, Q = X.length, O = 0; O < Q; O++) {
-                var rt = X[O];
-                c && rt.child != null && rt.updateBounds(), L = rt.getLeft(), S = rt.getRight(), C = rt.getTop(), G = rt.getBottom(), l > L && (l = L), T < S && (T = S), d > C && (d = C), v < G && (v = G);
+              for (var f = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, k, Y = this.nodes, K = Y.length, O = 0; O < K; O++) {
+                var it = Y[O];
+                c && it.child != null && it.updateBounds(), L = it.getLeft(), b = it.getRight(), C = it.getTop(), G = it.getBottom(), f > L && (f = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
               }
-              var n = new i(l, d, T - l, v - d);
-              l == h.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), X[0].getParent().paddingLeft != null ? K = X[0].getParent().paddingLeft : K = this.margin, this.left = n.x - K, this.right = n.x + n.width + K, this.top = n.y - K, this.bottom = n.y + n.height + K;
+              var n = new i(f, d, T - f, v - d);
+              f == h.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), Y[0].getParent().paddingLeft != null ? k = Y[0].getParent().paddingLeft : k = this.margin, this.left = n.x - k, this.right = n.x + n.width + k, this.top = n.y - k, this.bottom = n.y + n.height + k;
             }, o.calculateBounds = function(c) {
-              for (var l = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, S, C, G, K = c.length, X = 0; X < K; X++) {
-                var Q = c[X];
-                L = Q.getLeft(), S = Q.getRight(), C = Q.getTop(), G = Q.getBottom(), l > L && (l = L), T < S && (T = S), d > C && (d = C), v < G && (v = G);
+              for (var f = h.MAX_VALUE, T = -h.MAX_VALUE, d = h.MAX_VALUE, v = -h.MAX_VALUE, L, b, C, G, k = c.length, Y = 0; Y < k; Y++) {
+                var K = c[Y];
+                L = K.getLeft(), b = K.getRight(), C = K.getTop(), G = K.getBottom(), f > L && (f = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
               }
-              var O = new i(l, d, T - l, v - d);
+              var O = new i(f, d, T - f, v - d);
               return O;
             }, o.prototype.getInclusionTreeDepth = function() {
               return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
@@ -386,8 +386,8 @@ function ur() {
                 throw "assert failed";
               return this.estimatedSize;
             }, o.prototype.calcEstimatedSize = function() {
-              for (var c = 0, l = this.nodes, T = l.length, d = 0; d < T; d++) {
-                var v = l[d];
+              for (var c = 0, f = this.nodes, T = f.length, d = 0; d < T; d++) {
+                var v = f[d];
                 c += v.calcEstimatedSize();
               }
               return c == 0 ? this.estimatedSize = a.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = c / Math.sqrt(this.nodes.length), this.estimatedSize;
@@ -397,26 +397,26 @@ function ur() {
                 this.isConnected = !0;
                 return;
               }
-              var l = new t(), T = /* @__PURE__ */ new Set(), d = this.nodes[0], v, L, S = d.withChildren();
-              for (S.forEach(function(O) {
-                l.push(O), T.add(O);
-              }); l.length !== 0; ) {
-                d = l.shift(), v = d.getEdges();
+              var f = new t(), T = /* @__PURE__ */ new Set(), d = this.nodes[0], v, L, b = d.withChildren();
+              for (b.forEach(function(O) {
+                f.push(O), T.add(O);
+              }); f.length !== 0; ) {
+                d = f.shift(), v = d.getEdges();
                 for (var C = v.length, G = 0; G < C; G++) {
-                  var K = v[G];
-                  if (L = K.getOtherEndInGraph(d, this), L != null && !T.has(L)) {
-                    var X = L.withChildren();
-                    X.forEach(function(O) {
-                      l.push(O), T.add(O);
+                  var k = v[G];
+                  if (L = k.getOtherEndInGraph(d, this), L != null && !T.has(L)) {
+                    var Y = L.withChildren();
+                    Y.forEach(function(O) {
+                      f.push(O), T.add(O);
                     });
                   }
                 }
               }
               if (this.isConnected = !1, T.size >= this.nodes.length) {
-                var Q = 0;
+                var K = 0;
                 T.forEach(function(O) {
-                  O.owner == c && Q++;
-                }), Q == this.nodes.length && (this.isConnected = !0);
+                  O.owner == c && K++;
+                }), K == this.nodes.length && (this.isConnected = !0);
               }
             }, A.exports = o;
           }),
@@ -424,64 +424,64 @@ function ur() {
           /***/
           (function(A, P, N) {
             var u, h = N(1);
-            function a(r) {
-              u = N(6), this.layout = r, this.graphs = [], this.edges = [];
+            function a(e) {
+              u = N(6), this.layout = e, this.graphs = [], this.edges = [];
             }
             a.prototype.addRoot = function() {
-              var r = this.layout.newGraph(), e = this.layout.newNode(null), f = this.add(r, e);
-              return this.setRootGraph(f), this.rootGraph;
-            }, a.prototype.add = function(r, e, f, i, g) {
-              if (f == null && i == null && g == null) {
-                if (r == null)
-                  throw "Graph is null!";
+              var e = this.layout.newGraph(), r = this.layout.newNode(null), l = this.add(e, r);
+              return this.setRootGraph(l), this.rootGraph;
+            }, a.prototype.add = function(e, r, l, i, g) {
+              if (l == null && i == null && g == null) {
                 if (e == null)
+                  throw "Graph is null!";
+                if (r == null)
                   throw "Parent node is null!";
-                if (this.graphs.indexOf(r) > -1)
+                if (this.graphs.indexOf(e) > -1)
                   throw "Graph already in this graph mgr!";
-                if (this.graphs.push(r), r.parent != null)
+                if (this.graphs.push(e), e.parent != null)
                   throw "Already has a parent!";
-                if (e.child != null)
+                if (r.child != null)
                   throw "Already has a child!";
-                return r.parent = e, e.child = r, r;
+                return e.parent = r, r.child = e, e;
               } else {
-                g = f, i = e, f = r;
+                g = l, i = r, l = e;
                 var t = i.getOwner(), o = g.getOwner();
                 if (!(t != null && t.getGraphManager() == this))
                   throw "Source not in this graph mgr!";
                 if (!(o != null && o.getGraphManager() == this))
                   throw "Target not in this graph mgr!";
                 if (t == o)
-                  return f.isInterGraph = !1, t.add(f, i, g);
-                if (f.isInterGraph = !0, f.source = i, f.target = g, this.edges.indexOf(f) > -1)
+                  return l.isInterGraph = !1, t.add(l, i, g);
+                if (l.isInterGraph = !0, l.source = i, l.target = g, this.edges.indexOf(l) > -1)
                   throw "Edge already in inter-graph edge list!";
-                if (this.edges.push(f), !(f.source != null && f.target != null))
+                if (this.edges.push(l), !(l.source != null && l.target != null))
                   throw "Edge source and/or target is null!";
-                if (!(f.source.edges.indexOf(f) == -1 && f.target.edges.indexOf(f) == -1))
+                if (!(l.source.edges.indexOf(l) == -1 && l.target.edges.indexOf(l) == -1))
                   throw "Edge already in source and/or target incidency list!";
-                return f.source.edges.push(f), f.target.edges.push(f), f;
+                return l.source.edges.push(l), l.target.edges.push(l), l;
               }
-            }, a.prototype.remove = function(r) {
-              if (r instanceof u) {
-                var e = r;
-                if (e.getGraphManager() != this)
+            }, a.prototype.remove = function(e) {
+              if (e instanceof u) {
+                var r = e;
+                if (r.getGraphManager() != this)
                   throw "Graph not in this graph mgr";
-                if (!(e == this.rootGraph || e.parent != null && e.parent.graphManager == this))
+                if (!(r == this.rootGraph || r.parent != null && r.parent.graphManager == this))
                   throw "Invalid parent node!";
-                var f = [];
-                f = f.concat(e.getEdges());
-                for (var i, g = f.length, t = 0; t < g; t++)
-                  i = f[t], e.remove(i);
+                var l = [];
+                l = l.concat(r.getEdges());
+                for (var i, g = l.length, t = 0; t < g; t++)
+                  i = l[t], r.remove(i);
                 var o = [];
-                o = o.concat(e.getNodes());
+                o = o.concat(r.getNodes());
                 var s;
                 g = o.length;
                 for (var t = 0; t < g; t++)
-                  s = o[t], e.remove(s);
-                e == this.rootGraph && this.setRootGraph(null);
-                var c = this.graphs.indexOf(e);
-                this.graphs.splice(c, 1), e.parent = null;
-              } else if (r instanceof h) {
-                if (i = r, i == null)
+                  s = o[t], r.remove(s);
+                r == this.rootGraph && this.setRootGraph(null);
+                var c = this.graphs.indexOf(r);
+                this.graphs.splice(c, 1), r.parent = null;
+              } else if (e instanceof h) {
+                if (i = e, i == null)
                   throw "Edge is null!";
                 if (!i.isInterGraph)
                   throw "Not an inter-graph edge!";
@@ -503,9 +503,9 @@ function ur() {
               return this.graphs;
             }, a.prototype.getAllNodes = function() {
               if (this.allNodes == null) {
-                for (var r = [], e = this.getGraphs(), f = e.length, i = 0; i < f; i++)
-                  r = r.concat(e[i].getNodes());
-                this.allNodes = r;
+                for (var e = [], r = this.getGraphs(), l = r.length, i = 0; i < l; i++)
+                  e = e.concat(r[i].getNodes());
+                this.allNodes = e;
               }
               return this.allNodes;
             }, a.prototype.resetAllNodes = function() {
@@ -516,103 +516,103 @@ function ur() {
               this.allNodesToApplyGravitation = null;
             }, a.prototype.getAllEdges = function() {
               if (this.allEdges == null) {
-                var r = [], e = this.getGraphs();
-                e.length;
-                for (var f = 0; f < e.length; f++)
-                  r = r.concat(e[f].getEdges());
-                r = r.concat(this.edges), this.allEdges = r;
+                var e = [], r = this.getGraphs();
+                r.length;
+                for (var l = 0; l < r.length; l++)
+                  e = e.concat(r[l].getEdges());
+                e = e.concat(this.edges), this.allEdges = e;
               }
               return this.allEdges;
             }, a.prototype.getAllNodesToApplyGravitation = function() {
               return this.allNodesToApplyGravitation;
-            }, a.prototype.setAllNodesToApplyGravitation = function(r) {
+            }, a.prototype.setAllNodesToApplyGravitation = function(e) {
               if (this.allNodesToApplyGravitation != null)
                 throw "assert failed";
-              this.allNodesToApplyGravitation = r;
+              this.allNodesToApplyGravitation = e;
             }, a.prototype.getRoot = function() {
               return this.rootGraph;
-            }, a.prototype.setRootGraph = function(r) {
-              if (r.getGraphManager() != this)
+            }, a.prototype.setRootGraph = function(e) {
+              if (e.getGraphManager() != this)
                 throw "Root not in this graph mgr!";
-              this.rootGraph = r, r.parent == null && (r.parent = this.layout.newNode("Root node"));
+              this.rootGraph = e, e.parent == null && (e.parent = this.layout.newNode("Root node"));
             }, a.prototype.getLayout = function() {
               return this.layout;
-            }, a.prototype.isOneAncestorOfOther = function(r, e) {
-              if (!(r != null && e != null))
+            }, a.prototype.isOneAncestorOfOther = function(e, r) {
+              if (!(e != null && r != null))
                 throw "assert failed";
-              if (r == e)
+              if (e == r)
                 return !0;
-              var f = r.getOwner(), i;
+              var l = e.getOwner(), i;
               do {
-                if (i = f.getParent(), i == null)
+                if (i = l.getParent(), i == null)
                   break;
-                if (i == e)
+                if (i == r)
                   return !0;
-                if (f = i.getOwner(), f == null)
+                if (l = i.getOwner(), l == null)
                   break;
               } while (!0);
-              f = e.getOwner();
+              l = r.getOwner();
               do {
-                if (i = f.getParent(), i == null)
+                if (i = l.getParent(), i == null)
                   break;
-                if (i == r)
+                if (i == e)
                   return !0;
-                if (f = i.getOwner(), f == null)
+                if (l = i.getOwner(), l == null)
                   break;
               } while (!0);
               return !1;
             }, a.prototype.calcLowestCommonAncestors = function() {
-              for (var r, e, f, i, g, t = this.getAllEdges(), o = t.length, s = 0; s < o; s++) {
-                if (r = t[s], e = r.source, f = r.target, r.lca = null, r.sourceInLca = e, r.targetInLca = f, e == f) {
-                  r.lca = e.getOwner();
+              for (var e, r, l, i, g, t = this.getAllEdges(), o = t.length, s = 0; s < o; s++) {
+                if (e = t[s], r = e.source, l = e.target, e.lca = null, e.sourceInLca = r, e.targetInLca = l, r == l) {
+                  e.lca = r.getOwner();
                   continue;
                 }
-                for (i = e.getOwner(); r.lca == null; ) {
-                  for (r.targetInLca = f, g = f.getOwner(); r.lca == null; ) {
+                for (i = r.getOwner(); e.lca == null; ) {
+                  for (e.targetInLca = l, g = l.getOwner(); e.lca == null; ) {
                     if (g == i) {
-                      r.lca = g;
+                      e.lca = g;
                       break;
                     }
                     if (g == this.rootGraph)
                       break;
-                    if (r.lca != null)
+                    if (e.lca != null)
                       throw "assert failed";
-                    r.targetInLca = g.getParent(), g = r.targetInLca.getOwner();
+                    e.targetInLca = g.getParent(), g = e.targetInLca.getOwner();
                   }
                   if (i == this.rootGraph)
                     break;
-                  r.lca == null && (r.sourceInLca = i.getParent(), i = r.sourceInLca.getOwner());
+                  e.lca == null && (e.sourceInLca = i.getParent(), i = e.sourceInLca.getOwner());
                 }
-                if (r.lca == null)
+                if (e.lca == null)
                   throw "assert failed";
               }
-            }, a.prototype.calcLowestCommonAncestor = function(r, e) {
-              if (r == e)
-                return r.getOwner();
-              var f = r.getOwner();
+            }, a.prototype.calcLowestCommonAncestor = function(e, r) {
+              if (e == r)
+                return e.getOwner();
+              var l = e.getOwner();
               do {
-                if (f == null)
+                if (l == null)
                   break;
-                var i = e.getOwner();
+                var i = r.getOwner();
                 do {
                   if (i == null)
                     break;
-                  if (i == f)
+                  if (i == l)
                     return i;
                   i = i.getParent().getOwner();
                 } while (!0);
-                f = f.getParent().getOwner();
+                l = l.getParent().getOwner();
               } while (!0);
-              return f;
-            }, a.prototype.calcInclusionTreeDepths = function(r, e) {
-              r == null && e == null && (r = this.rootGraph, e = 1);
-              for (var f, i = r.getNodes(), g = i.length, t = 0; t < g; t++)
-                f = i[t], f.inclusionTreeDepth = e, f.child != null && this.calcInclusionTreeDepths(f.child, e + 1);
+              return l;
+            }, a.prototype.calcInclusionTreeDepths = function(e, r) {
+              e == null && r == null && (e = this.rootGraph, r = 1);
+              for (var l, i = e.getNodes(), g = i.length, t = 0; t < g; t++)
+                l = i[t], l.inclusionTreeDepth = r, l.child != null && this.calcInclusionTreeDepths(l.child, r + 1);
             }, a.prototype.includesInvalidEdge = function() {
-              for (var r, e = [], f = this.edges.length, i = 0; i < f; i++)
-                r = this.edges[i], this.isOneAncestorOfOther(r.source, r.target) && e.push(r);
-              for (var i = 0; i < e.length; i++)
-                this.remove(e[i]);
+              for (var e, r = [], l = this.edges.length, i = 0; i < l; i++)
+                e = this.edges[i], this.isOneAncestorOfOther(e.source, e.target) && r.push(e);
+              for (var i = 0; i < r.length; i++)
+                this.remove(r[i]);
               return !1;
             }, A.exports = a;
           }),
@@ -622,87 +622,87 @@ function ur() {
             var u = N(12);
             function h() {
             }
-            h.calcSeparationAmount = function(a, r, e, f) {
-              if (!a.intersects(r))
+            h.calcSeparationAmount = function(a, e, r, l) {
+              if (!a.intersects(e))
                 throw "assert failed";
               var i = new Array(2);
-              this.decideDirectionsForOverlappingNodes(a, r, i), e[0] = Math.min(a.getRight(), r.getRight()) - Math.max(a.x, r.x), e[1] = Math.min(a.getBottom(), r.getBottom()) - Math.max(a.y, r.y), a.getX() <= r.getX() && a.getRight() >= r.getRight() ? e[0] += Math.min(r.getX() - a.getX(), a.getRight() - r.getRight()) : r.getX() <= a.getX() && r.getRight() >= a.getRight() && (e[0] += Math.min(a.getX() - r.getX(), r.getRight() - a.getRight())), a.getY() <= r.getY() && a.getBottom() >= r.getBottom() ? e[1] += Math.min(r.getY() - a.getY(), a.getBottom() - r.getBottom()) : r.getY() <= a.getY() && r.getBottom() >= a.getBottom() && (e[1] += Math.min(a.getY() - r.getY(), r.getBottom() - a.getBottom()));
-              var g = Math.abs((r.getCenterY() - a.getCenterY()) / (r.getCenterX() - a.getCenterX()));
-              r.getCenterY() === a.getCenterY() && r.getCenterX() === a.getCenterX() && (g = 1);
-              var t = g * e[0], o = e[1] / g;
-              e[0] < o ? o = e[0] : t = e[1], e[0] = -1 * i[0] * (o / 2 + f), e[1] = -1 * i[1] * (t / 2 + f);
-            }, h.decideDirectionsForOverlappingNodes = function(a, r, e) {
-              a.getCenterX() < r.getCenterX() ? e[0] = -1 : e[0] = 1, a.getCenterY() < r.getCenterY() ? e[1] = -1 : e[1] = 1;
-            }, h.getIntersection2 = function(a, r, e) {
-              var f = a.getCenterX(), i = a.getCenterY(), g = r.getCenterX(), t = r.getCenterY();
-              if (a.intersects(r))
-                return e[0] = f, e[1] = i, e[2] = g, e[3] = t, !0;
-              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), d = a.getRight(), v = a.getWidthHalf(), L = a.getHeightHalf(), S = r.getX(), C = r.getY(), G = r.getRight(), K = r.getX(), X = r.getBottom(), Q = r.getRight(), O = r.getWidthHalf(), rt = r.getHeightHalf(), n = !1, m = !1;
-              if (f === g) {
+              this.decideDirectionsForOverlappingNodes(a, e, i), r[0] = Math.min(a.getRight(), e.getRight()) - Math.max(a.x, e.x), r[1] = Math.min(a.getBottom(), e.getBottom()) - Math.max(a.y, e.y), a.getX() <= e.getX() && a.getRight() >= e.getRight() ? r[0] += Math.min(e.getX() - a.getX(), a.getRight() - e.getRight()) : e.getX() <= a.getX() && e.getRight() >= a.getRight() && (r[0] += Math.min(a.getX() - e.getX(), e.getRight() - a.getRight())), a.getY() <= e.getY() && a.getBottom() >= e.getBottom() ? r[1] += Math.min(e.getY() - a.getY(), a.getBottom() - e.getBottom()) : e.getY() <= a.getY() && e.getBottom() >= a.getBottom() && (r[1] += Math.min(a.getY() - e.getY(), e.getBottom() - a.getBottom()));
+              var g = Math.abs((e.getCenterY() - a.getCenterY()) / (e.getCenterX() - a.getCenterX()));
+              e.getCenterY() === a.getCenterY() && e.getCenterX() === a.getCenterX() && (g = 1);
+              var t = g * r[0], o = r[1] / g;
+              r[0] < o ? o = r[0] : t = r[1], r[0] = -1 * i[0] * (o / 2 + l), r[1] = -1 * i[1] * (t / 2 + l);
+            }, h.decideDirectionsForOverlappingNodes = function(a, e, r) {
+              a.getCenterX() < e.getCenterX() ? r[0] = -1 : r[0] = 1, a.getCenterY() < e.getCenterY() ? r[1] = -1 : r[1] = 1;
+            }, h.getIntersection2 = function(a, e, r) {
+              var l = a.getCenterX(), i = a.getCenterY(), g = e.getCenterX(), t = e.getCenterY();
+              if (a.intersects(e))
+                return r[0] = l, r[1] = i, r[2] = g, r[3] = t, !0;
+              var o = a.getX(), s = a.getY(), c = a.getRight(), f = a.getX(), T = a.getBottom(), d = a.getRight(), v = a.getWidthHalf(), L = a.getHeightHalf(), b = e.getX(), C = e.getY(), G = e.getRight(), k = e.getX(), Y = e.getBottom(), K = e.getRight(), O = e.getWidthHalf(), it = e.getHeightHalf(), n = !1, m = !1;
+              if (l === g) {
                 if (i > t)
-                  return e[0] = f, e[1] = s, e[2] = g, e[3] = X, !1;
+                  return r[0] = l, r[1] = s, r[2] = g, r[3] = Y, !1;
                 if (i < t)
-                  return e[0] = f, e[1] = T, e[2] = g, e[3] = C, !1;
+                  return r[0] = l, r[1] = T, r[2] = g, r[3] = C, !1;
               } else if (i === t) {
-                if (f > g)
-                  return e[0] = o, e[1] = i, e[2] = G, e[3] = t, !1;
-                if (f < g)
-                  return e[0] = c, e[1] = i, e[2] = S, e[3] = t, !1;
+                if (l > g)
+                  return r[0] = o, r[1] = i, r[2] = G, r[3] = t, !1;
+                if (l < g)
+                  return r[0] = c, r[1] = i, r[2] = b, r[3] = t, !1;
               } else {
-                var p = a.height / a.width, E = r.height / r.width, y = (t - i) / (g - f), R = void 0, M = void 0, F = void 0, W = void 0, x = void 0, k = void 0;
-                if (-p === y ? f > g ? (e[0] = l, e[1] = T, n = !0) : (e[0] = c, e[1] = s, n = !0) : p === y && (f > g ? (e[0] = o, e[1] = s, n = !0) : (e[0] = d, e[1] = T, n = !0)), -E === y ? g > f ? (e[2] = K, e[3] = X, m = !0) : (e[2] = G, e[3] = C, m = !0) : E === y && (g > f ? (e[2] = S, e[3] = C, m = !0) : (e[2] = Q, e[3] = X, m = !0)), n && m)
+                var p = a.height / a.width, E = e.height / e.width, y = (t - i) / (g - l), R = void 0, M = void 0, S = void 0, W = void 0, D = void 0, q = void 0;
+                if (-p === y ? l > g ? (r[0] = f, r[1] = T, n = !0) : (r[0] = c, r[1] = s, n = !0) : p === y && (l > g ? (r[0] = o, r[1] = s, n = !0) : (r[0] = d, r[1] = T, n = !0)), -E === y ? g > l ? (r[2] = k, r[3] = Y, m = !0) : (r[2] = G, r[3] = C, m = !0) : E === y && (g > l ? (r[2] = b, r[3] = C, m = !0) : (r[2] = K, r[3] = Y, m = !0)), n && m)
                   return !1;
-                if (f > g ? i > t ? (R = this.getCardinalDirection(p, y, 4), M = this.getCardinalDirection(E, y, 2)) : (R = this.getCardinalDirection(-p, y, 3), M = this.getCardinalDirection(-E, y, 1)) : i > t ? (R = this.getCardinalDirection(-p, y, 1), M = this.getCardinalDirection(-E, y, 3)) : (R = this.getCardinalDirection(p, y, 2), M = this.getCardinalDirection(E, y, 4)), !n)
+                if (l > g ? i > t ? (R = this.getCardinalDirection(p, y, 4), M = this.getCardinalDirection(E, y, 2)) : (R = this.getCardinalDirection(-p, y, 3), M = this.getCardinalDirection(-E, y, 1)) : i > t ? (R = this.getCardinalDirection(-p, y, 1), M = this.getCardinalDirection(-E, y, 3)) : (R = this.getCardinalDirection(p, y, 2), M = this.getCardinalDirection(E, y, 4)), !n)
                   switch (R) {
                     case 1:
-                      W = s, F = f + -L / y, e[0] = F, e[1] = W;
+                      W = s, S = l + -L / y, r[0] = S, r[1] = W;
                       break;
                     case 2:
-                      F = d, W = i + v * y, e[0] = F, e[1] = W;
+                      S = d, W = i + v * y, r[0] = S, r[1] = W;
                       break;
                     case 3:
-                      W = T, F = f + L / y, e[0] = F, e[1] = W;
+                      W = T, S = l + L / y, r[0] = S, r[1] = W;
                       break;
                     case 4:
-                      F = l, W = i + -v * y, e[0] = F, e[1] = W;
+                      S = f, W = i + -v * y, r[0] = S, r[1] = W;
                       break;
                   }
                 if (!m)
                   switch (M) {
                     case 1:
-                      k = C, x = g + -rt / y, e[2] = x, e[3] = k;
+                      q = C, D = g + -it / y, r[2] = D, r[3] = q;
                       break;
                     case 2:
-                      x = Q, k = t + O * y, e[2] = x, e[3] = k;
+                      D = K, q = t + O * y, r[2] = D, r[3] = q;
                       break;
                     case 3:
-                      k = X, x = g + rt / y, e[2] = x, e[3] = k;
+                      q = Y, D = g + it / y, r[2] = D, r[3] = q;
                       break;
                     case 4:
-                      x = K, k = t + -O * y, e[2] = x, e[3] = k;
+                      D = k, q = t + -O * y, r[2] = D, r[3] = q;
                       break;
                   }
               }
               return !1;
-            }, h.getCardinalDirection = function(a, r, e) {
-              return a > r ? e : 1 + e % 4;
-            }, h.getIntersection = function(a, r, e, f) {
-              if (f == null)
-                return this.getIntersection2(a, r, e);
-              var i = a.x, g = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, d = void 0, v = void 0, L = void 0, S = void 0, C = void 0, G = void 0, K = void 0, X = void 0, Q = void 0;
-              return L = o - g, C = i - t, K = t * g - i * o, S = T - c, G = s - l, X = l * c - s * T, Q = L * G - S * C, Q === 0 ? null : (d = (C * X - G * K) / Q, v = (S * K - L * X) / Q, new u(d, v));
-            }, h.angleOfVector = function(a, r, e, f) {
+            }, h.getCardinalDirection = function(a, e, r) {
+              return a > e ? r : 1 + r % 4;
+            }, h.getIntersection = function(a, e, r, l) {
+              if (l == null)
+                return this.getIntersection2(a, e, r);
+              var i = a.x, g = a.y, t = e.x, o = e.y, s = r.x, c = r.y, f = l.x, T = l.y, d = void 0, v = void 0, L = void 0, b = void 0, C = void 0, G = void 0, k = void 0, Y = void 0, K = void 0;
+              return L = o - g, C = i - t, k = t * g - i * o, b = T - c, G = s - f, Y = f * c - s * T, K = L * G - b * C, K === 0 ? null : (d = (C * Y - G * k) / K, v = (b * k - L * Y) / K, new u(d, v));
+            }, h.angleOfVector = function(a, e, r, l) {
               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, g = a.y, t = r.x, o = r.y, s = e.x, c = e.y, l = f.x, T = f.y, d = (t - i) * (T - c) - (l - s) * (o - g);
+              return a !== r ? (i = Math.atan((l - e) / (r - a)), r < a ? i += Math.PI : l < e && (i += this.TWO_PI)) : l < e ? i = this.ONE_AND_HALF_PI : i = this.HALF_PI, i;
+            }, h.doIntersect = function(a, e, r, l) {
+              var i = a.x, g = a.y, t = e.x, o = e.y, s = r.x, c = r.y, f = l.x, T = l.y, d = (t - i) * (T - c) - (f - s) * (o - g);
               if (d === 0)
                 return !1;
-              var v = ((T - c) * (l - i) + (s - l) * (T - g)) / d, L = ((g - o) * (l - i) + (t - i) * (T - g)) / d;
+              var v = ((T - c) * (f - i) + (s - f) * (T - g)) / d, L = ((g - o) * (f - i) + (t - i) * (T - g)) / d;
               return 0 < v && v < 1 && 0 < L && L < 1;
-            }, h.findCircleLineIntersections = function(a, r, e, f, i, g, t) {
-              var o = (e - a) * (e - a) + (f - r) * (f - r), s = 2 * ((a - i) * (e - a) + (r - g) * (f - r)), c = (a - i) * (a - i) + (r - g) * (r - g) - t * t, l = s * s - 4 * o * c;
-              if (l >= 0) {
+            }, h.findCircleLineIntersections = function(a, e, r, l, i, g, t) {
+              var o = (r - a) * (r - a) + (l - e) * (l - e), s = 2 * ((a - i) * (r - a) + (e - g) * (l - e)), c = (a - i) * (a - i) + (e - g) * (e - g) - t * t, f = s * s - 4 * o * c;
+              if (f >= 0) {
                 var T = (-s + Math.sqrt(s * s - 4 * o * c)) / (2 * o), d = (-s - Math.sqrt(s * s - 4 * o * c)) / (2 * o), v = null;
                 return T >= 0 && T <= 1 ? [T] : d >= 0 && d <= 1 ? [d] : v;
               } else return null;
@@ -748,15 +748,15 @@ function ur() {
             }
             var a = function(g) {
               return { value: g, next: null, prev: null };
-            }, r = function(g, t, o, s) {
+            }, e = function(g, t, o, s) {
               return g !== null ? g.next = t : s.head = t, o !== null ? o.prev = t : s.tail = t, t.prev = g, t.next = o, s.length++, t;
-            }, e = function(g, t) {
+            }, r = function(g, t) {
               var o = g.prev, s = g.next;
               return o !== null ? o.next = s : t.head = s, s !== null ? s.prev = o : t.tail = o, g.prev = g.next = null, t.length--, g;
-            }, f = (function() {
+            }, l = (function() {
               function i(g) {
                 var t = this;
-                h(this, i), this.length = 0, this.head = null, this.tail = null, g != null && g.forEach(function(o) {
+                h(this, i), this.length = 0, this.head = null, this.tail = null, g?.forEach(function(o) {
                   return t.push(o);
                 });
               }
@@ -768,57 +768,57 @@ function ur() {
               }, {
                 key: "insertBefore",
                 value: function(t, o) {
-                  return r(o.prev, a(t), o, this);
+                  return e(o.prev, a(t), o, this);
                 }
               }, {
                 key: "insertAfter",
                 value: function(t, o) {
-                  return r(o, a(t), o.next, this);
+                  return e(o, a(t), o.next, this);
                 }
               }, {
                 key: "insertNodeBefore",
                 value: function(t, o) {
-                  return r(o.prev, t, o, this);
+                  return e(o.prev, t, o, this);
                 }
               }, {
                 key: "insertNodeAfter",
                 value: function(t, o) {
-                  return r(o, t, o.next, this);
+                  return e(o, t, o.next, this);
                 }
               }, {
                 key: "push",
                 value: function(t) {
-                  return r(this.tail, a(t), null, this);
+                  return e(this.tail, a(t), null, this);
                 }
               }, {
                 key: "unshift",
                 value: function(t) {
-                  return r(null, a(t), this.head, this);
+                  return e(null, a(t), this.head, this);
                 }
               }, {
                 key: "remove",
                 value: function(t) {
-                  return e(t, this);
+                  return r(t, this);
                 }
               }, {
                 key: "pop",
                 value: function() {
-                  return e(this.tail, this).value;
+                  return r(this.tail, this).value;
                 }
               }, {
                 key: "popNode",
                 value: function() {
-                  return e(this.tail, this);
+                  return r(this.tail, this);
                 }
               }, {
                 key: "shift",
                 value: function() {
-                  return e(this.head, this).value;
+                  return r(this.head, this).value;
                 }
               }, {
                 key: "shiftNode",
                 value: function() {
-                  return e(this.head, this);
+                  return r(this.head, this);
                 }
               }, {
                 key: "get_object_at",
@@ -840,13 +840,13 @@ function ur() {
                 }
               }]), i;
             })();
-            A.exports = f;
+            A.exports = l;
           }),
           /* 12 */
           /***/
           (function(A, P, N) {
-            function u(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);
+            function u(h, a, e) {
+              this.x = null, this.y = null, h == null && a == null && e == null ? (this.x = 0, this.y = 0) : typeof h == "number" && typeof a == "number" && e == null ? (this.x = h, this.y = a) : h.constructor.name == "Point" && a == null && e == null && (e = h, this.x = e.x, this.y = e.y);
             }
             u.prototype.getX = function() {
               return this.x;
@@ -854,8 +854,8 @@ function ur() {
               return this.y;
             }, u.prototype.getLocation = function() {
               return new u(this.x, this.y);
-            }, u.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.setLocation = function(h, a, e) {
+              h.constructor.name == "Point" && a == null && e == null ? (e = h, this.setLocation(e.x, e.y)) : typeof h == "number" && typeof a == "number" && e == 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) {
               this.x = h, this.y = a;
             }, u.prototype.translate = function(h, a) {
@@ -873,8 +873,8 @@ function ur() {
           /* 13 */
           /***/
           (function(A, P, N) {
-            function u(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);
+            function u(h, a, e, r) {
+              this.x = 0, this.y = 0, this.width = 0, this.height = 0, h != null && a != null && e != null && r != null && (this.x = h, this.y = a, this.width = e, this.height = r);
             }
             u.prototype.getX = function() {
               return this.x;
@@ -931,8 +931,8 @@ 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);
-              return a == null || r != "object" && r != "function";
+              var e = typeof a > "u" ? "undefined" : u(a);
+              return a == null || e != "object" && e != "function";
             }, A.exports = h;
           }),
           /* 15 */
@@ -940,13 +940,13 @@ function ur() {
           (function(A, P, N) {
             function u(s) {
               if (Array.isArray(s)) {
-                for (var c = 0, l = Array(s.length); c < s.length; c++)
-                  l[c] = s[c];
-                return l;
+                for (var c = 0, f = Array(s.length); c < s.length; c++)
+                  f[c] = s[c];
+                return f;
               } else
                 return Array.from(s);
             }
-            var h = N(0), a = N(7), r = N(3), e = N(1), f = N(6), i = N(5), g = N(17), t = N(29);
+            var h = N(0), a = N(7), e = N(3), r = N(1), l = N(6), i = N(5), g = N(17), t = N(29);
             function o(s) {
               t.call(this), this.layoutQuality = h.QUALITY, this.createBendsAsNeeded = h.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = h.DEFAULT_INCREMENTAL, this.animationOnLayout = h.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = h.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = h.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = h.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new a(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, s != null && (this.isRemoteUse = s);
             }
@@ -962,11 +962,11 @@ function ur() {
               var s = new a(this);
               return this.graphManager = s, s;
             }, o.prototype.newGraph = function(s) {
-              return new f(null, this.graphManager, s);
+              return new l(null, this.graphManager, s);
             }, o.prototype.newNode = function(s) {
-              return new r(this.graphManager, s);
+              return new e(this.graphManager, s);
             }, o.prototype.newEdge = function(s) {
-              return new e(null, null, s);
+              return new r(null, null, s);
             }, o.prototype.checkLayoutSuccess = function() {
               return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
             }, o.prototype.runLayout = function() {
@@ -979,33 +979,33 @@ function ur() {
               if (this.createBendsAsNeeded && (this.createBendpointsFromDummyNodes(), this.graphManager.resetAllEdges()), !this.isRemoteUse) {
                 for (var s = this.graphManager.getAllEdges(), c = 0; c < s.length; c++)
                   s[c];
-                for (var l = this.graphManager.getRoot().getNodes(), c = 0; c < l.length; c++)
-                  l[c];
+                for (var f = this.graphManager.getRoot().getNodes(), c = 0; c < f.length; c++)
+                  f[c];
                 this.update(this.graphManager.getRoot());
               }
             }, o.prototype.update = function(s) {
               if (s == null)
                 this.update2();
-              else if (s instanceof r) {
+              else if (s instanceof e) {
                 var c = s;
                 if (c.getChild() != null)
-                  for (var l = c.getChild().getNodes(), T = 0; T < l.length; T++)
-                    update(l[T]);
+                  for (var f = c.getChild().getNodes(), T = 0; T < f.length; T++)
+                    update(f[T]);
                 if (c.vGraphObject != null) {
                   var d = c.vGraphObject;
                   d.update(c);
                 }
-              } else if (s instanceof e) {
+              } else if (s instanceof r) {
                 var v = s;
                 if (v.vGraphObject != null) {
                   var L = v.vGraphObject;
                   L.update(v);
                 }
-              } else if (s instanceof f) {
-                var S = s;
-                if (S.vGraphObject != null) {
-                  var C = S.vGraphObject;
-                  C.update(S);
+              } else if (s instanceof l) {
+                var b = s;
+                if (b.vGraphObject != null) {
+                  var C = b.vGraphObject;
+                  C.update(b);
                 }
               }
             }, o.prototype.initParameters = function() {
@@ -1014,9 +1014,9 @@ function ur() {
               if (s == null)
                 this.transform(new i(0, 0));
               else {
-                var c = new g(), l = this.graphManager.getRoot().updateLeftTop();
-                if (l != null) {
-                  c.setWorldOrgX(s.x), c.setWorldOrgY(s.y), c.setDeviceOrgX(l.x), c.setDeviceOrgY(l.y);
+                var c = new g(), f = this.graphManager.getRoot().updateLeftTop();
+                if (f != null) {
+                  c.setWorldOrgX(s.x), c.setWorldOrgY(s.y), c.setDeviceOrgX(f.x), c.setDeviceOrgY(f.y);
                   for (var T = this.getAllNodes(), d, v = 0; v < T.length; v++)
                     d = T[v], d.transform(c);
                 }
@@ -1025,23 +1025,23 @@ function ur() {
               if (s == null)
                 this.positionNodesRandomly(this.getGraphManager().getRoot()), this.getGraphManager().getRoot().updateBounds(!0);
               else
-                for (var c, l, T = s.getNodes(), d = 0; d < T.length; d++)
-                  c = T[d], l = c.getChild(), l == null || l.getNodes().length == 0 ? c.scatter() : (this.positionNodesRandomly(l), c.updateBounds());
+                for (var c, f, T = s.getNodes(), d = 0; d < T.length; d++)
+                  c = T[d], f = c.getChild(), f == null || f.getNodes().length == 0 ? c.scatter() : (this.positionNodesRandomly(f), c.updateBounds());
             }, o.prototype.getFlatForest = function() {
-              for (var s = [], c = !0, l = this.graphManager.getRoot().getNodes(), T = !0, d = 0; d < l.length; d++)
-                l[d].getChild() != null && (T = !1);
+              for (var s = [], c = !0, f = this.graphManager.getRoot().getNodes(), T = !0, d = 0; d < f.length; d++)
+                f[d].getChild() != null && (T = !1);
               if (!T)
                 return s;
-              var v = /* @__PURE__ */ new Set(), L = [], S = /* @__PURE__ */ new Map(), C = [];
-              for (C = C.concat(l); C.length > 0 && c; ) {
+              var v = /* @__PURE__ */ new Set(), L = [], b = /* @__PURE__ */ new Map(), C = [];
+              for (C = C.concat(f); C.length > 0 && c; ) {
                 for (L.push(C[0]); L.length > 0 && c; ) {
                   var G = L[0];
                   L.splice(0, 1), v.add(G);
-                  for (var K = G.getEdges(), d = 0; d < K.length; d++) {
-                    var X = K[d].getOtherEnd(G);
-                    if (S.get(G) != X)
-                      if (!v.has(X))
-                        L.push(X), S.set(X, G);
+                  for (var k = G.getEdges(), d = 0; d < k.length; d++) {
+                    var Y = k[d].getOtherEnd(G);
+                    if (b.get(G) != Y)
+                      if (!v.has(Y))
+                        L.push(Y), b.set(Y, G);
                       else {
                         c = !1;
                         break;
@@ -1051,43 +1051,43 @@ function ur() {
                 if (!c)
                   s = [];
                 else {
-                  var Q = [].concat(u(v));
-                  s.push(Q);
-                  for (var d = 0; d < Q.length; d++) {
-                    var O = Q[d], rt = C.indexOf(O);
-                    rt > -1 && C.splice(rt, 1);
+                  var K = [].concat(u(v));
+                  s.push(K);
+                  for (var d = 0; d < K.length; d++) {
+                    var O = K[d], it = C.indexOf(O);
+                    it > -1 && C.splice(it, 1);
                   }
-                  v = /* @__PURE__ */ new Set(), S = /* @__PURE__ */ new Map();
+                  v = /* @__PURE__ */ new Set(), b = /* @__PURE__ */ new Map();
                 }
               }
               return s;
             }, o.prototype.createDummyNodesForBendpoints = function(s) {
-              for (var c = [], l = s.source, T = this.graphManager.calcLowestCommonAncestor(s.source, s.target), d = 0; d < s.bendpoints.length; d++) {
+              for (var c = [], f = s.source, T = this.graphManager.calcLowestCommonAncestor(s.source, s.target), d = 0; d < s.bendpoints.length; d++) {
                 var v = this.newNode(null);
                 v.setRect(new Point(0, 0), new Dimension(1, 1)), T.add(v);
                 var L = this.newEdge(null);
-                this.graphManager.add(L, l, v), c.add(v), l = v;
+                this.graphManager.add(L, f, v), c.add(v), f = v;
               }
               var L = this.newEdge(null);
-              return this.graphManager.add(L, l, s.target), this.edgeToDummyNodes.set(s, c), s.isInterGraph() ? this.graphManager.remove(s) : T.remove(s), c;
+              return this.graphManager.add(L, f, 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);
               for (var c = 0; c < s.length; c++) {
-                var l = s[c];
-                if (l.bendpoints.length > 0) {
-                  for (var T = this.edgeToDummyNodes.get(l), d = 0; d < T.length; d++) {
-                    var v = T[d], L = new i(v.getCenterX(), v.getCenterY()), S = l.bendpoints.get(d);
-                    S.x = L.x, S.y = L.y, v.getOwner().remove(v);
+                var f = s[c];
+                if (f.bendpoints.length > 0) {
+                  for (var T = this.edgeToDummyNodes.get(f), d = 0; d < T.length; d++) {
+                    var v = T[d], L = new i(v.getCenterX(), v.getCenterY()), b = f.bendpoints.get(d);
+                    b.x = L.x, b.y = L.y, v.getOwner().remove(v);
                   }
-                  this.graphManager.add(l, l.source, l.target);
+                  this.graphManager.add(f, f.source, f.target);
                 }
               }
-            }, o.transform = function(s, c, l, T) {
-              if (l != null && T != null) {
+            }, o.transform = function(s, c, f, T) {
+              if (f != null && T != null) {
                 var d = c;
                 if (s <= 50) {
-                  var v = c / l;
+                  var v = c / f;
                   d -= (c - v) / 50 * (50 - s);
                 } else {
                   var L = c * T;
@@ -1095,34 +1095,34 @@ function ur() {
                 }
                 return d;
               } else {
-                var S, C;
-                return s <= 50 ? (S = 9 * c / 500, C = c / 10) : (S = 9 * c / 50, C = -8 * c), S * s + C;
+                var b, C;
+                return s <= 50 ? (b = 9 * c / 500, C = c / 10) : (b = 9 * c / 50, C = -8 * c), b * s + C;
               }
             }, o.findCenterOfTree = function(s) {
               var c = [];
               c = c.concat(s);
-              var l = [], T = /* @__PURE__ */ new Map(), d = !1, v = null;
+              var f = [], T = /* @__PURE__ */ new Map(), d = !1, v = null;
               (c.length == 1 || c.length == 2) && (d = !0, v = c[0]);
               for (var L = 0; L < c.length; L++) {
-                var S = c[L], C = S.getNeighborsList().size;
-                T.set(S, S.getNeighborsList().size), C == 1 && l.push(S);
+                var b = c[L], C = b.getNeighborsList().size;
+                T.set(b, b.getNeighborsList().size), C == 1 && f.push(b);
               }
               var G = [];
-              for (G = G.concat(l); !d; ) {
-                var K = [];
-                K = K.concat(G), G = [];
+              for (G = G.concat(f); !d; ) {
+                var k = [];
+                k = k.concat(G), G = [];
                 for (var L = 0; L < c.length; L++) {
-                  var S = c[L], X = c.indexOf(S);
-                  X >= 0 && c.splice(X, 1);
-                  var Q = S.getNeighborsList();
-                  Q.forEach(function(n) {
-                    if (l.indexOf(n) < 0) {
+                  var b = c[L], Y = c.indexOf(b);
+                  Y >= 0 && c.splice(Y, 1);
+                  var K = b.getNeighborsList();
+                  K.forEach(function(n) {
+                    if (f.indexOf(n) < 0) {
                       var m = T.get(n), p = m - 1;
                       p == 1 && G.push(n), T.set(n, p);
                     }
                   });
                 }
-                l = l.concat(G), (c.length == 1 || c.length == 2) && (d = !0, v = c[0]);
+                f = f.concat(G), (c.length == 1 || c.length == 2) && (d = !0, v = c[0]);
               }
               return v;
             }, o.prototype.setGraphManager = function(s) {
@@ -1142,7 +1142,7 @@ function ur() {
           /***/
           (function(A, P, N) {
             var u = N(5);
-            function h(a, r) {
+            function h(a, e) {
               this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
             }
             h.prototype.getWorldOrgX = function() {
@@ -1178,20 +1178,20 @@ function ur() {
             }, h.prototype.setDeviceExtY = function(a) {
               this.ldeviceExtY = a;
             }, h.prototype.transformX = function(a) {
-              var r = 0, e = this.lworldExtX;
-              return e != 0 && (r = this.ldeviceOrgX + (a - this.lworldOrgX) * this.ldeviceExtX / e), r;
+              var e = 0, r = this.lworldExtX;
+              return r != 0 && (e = this.ldeviceOrgX + (a - this.lworldOrgX) * this.ldeviceExtX / r), e;
             }, h.prototype.transformY = function(a) {
-              var r = 0, e = this.lworldExtY;
-              return e != 0 && (r = this.ldeviceOrgY + (a - this.lworldOrgY) * this.ldeviceExtY / e), r;
+              var e = 0, r = this.lworldExtY;
+              return r != 0 && (e = this.ldeviceOrgY + (a - this.lworldOrgY) * this.ldeviceExtY / r), e;
             }, h.prototype.inverseTransformX = function(a) {
-              var r = 0, e = this.ldeviceExtX;
-              return e != 0 && (r = this.lworldOrgX + (a - this.ldeviceOrgX) * this.lworldExtX / e), r;
+              var e = 0, r = this.ldeviceExtX;
+              return r != 0 && (e = this.lworldOrgX + (a - this.ldeviceOrgX) * this.lworldExtX / r), e;
             }, h.prototype.inverseTransformY = function(a) {
-              var r = 0, e = this.ldeviceExtY;
-              return e != 0 && (r = this.lworldOrgY + (a - this.ldeviceOrgY) * this.lworldExtY / e), r;
+              var e = 0, r = this.ldeviceExtY;
+              return r != 0 && (e = this.lworldOrgY + (a - this.ldeviceOrgY) * this.lworldExtY / r), e;
             }, h.prototype.inverseTransformPoint = function(a) {
-              var r = new u(this.inverseTransformX(a.x), this.inverseTransformY(a.y));
-              return r;
+              var e = new u(this.inverseTransformX(a.x), this.inverseTransformY(a.y));
+              return e;
             }, A.exports = h;
           }),
           /* 18 */
@@ -1205,7 +1205,7 @@ function ur() {
               } else
                 return Array.from(t);
             }
-            var h = N(15), a = N(4), r = N(0), e = N(8), f = N(9);
+            var h = N(15), a = N(4), e = N(0), r = N(8), l = N(9);
             function i() {
               h.call(this), this.useSmartIdealEdgeLengthCalculation = a.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = a.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = a.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = a.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = a.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.displacementThresholdPerNode = 3 * a.DEFAULT_EDGE_LENGTH / 100, this.coolingFactor = a.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.initialCoolingFactor = a.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.totalDisplacement = 0, this.oldTotalDisplacement = 0, this.maxIterations = a.MAX_ITERATIONS;
             }
@@ -1215,8 +1215,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, d, v = this.getGraphManager().getAllEdges(), L = 0; L < v.length; L++)
-                t = v[L], o = t.idealLength, t.isInterGraph && (c = t.getSource(), l = t.getTarget(), T = t.getSourceInLca().getEstimatedSize(), d = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += T + d - 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, f, T, d, v = this.getGraphManager().getAllEdges(), L = 0; L < v.length; L++)
+                t = v[L], o = t.idealLength, t.isInterGraph && (c = t.getSource(), f = t.getTarget(), T = t.getSourceInLca().getEstimatedSize(), d = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += T + d - 2 * e.SIMPLE_NODE_SIZE), s = t.getLca().getInclusionTreeDepth(), t.idealLength += o * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (c.getInclusionTreeDepth() + f.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();
@@ -1224,14 +1224,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] : !0, o = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, s, c, l, T, d = this.getAllNodes(), v;
+              var t = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, o = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, s, c, f, T, d = this.getAllNodes(), v;
               if (this.useFRGridVariant)
                 for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && t && this.updateGrid(), v = /* @__PURE__ */ new Set(), s = 0; s < d.length; s++)
-                  l = d[s], this.calculateRepulsionForceOfANode(l, v, t, o), v.add(l);
+                  f = d[s], this.calculateRepulsionForceOfANode(f, v, t, o), v.add(f);
               else
                 for (s = 0; s < d.length; s++)
-                  for (l = d[s], c = s + 1; c < d.length; c++)
-                    T = d[c], l.getOwner() == T.getOwner() && this.calcRepulsionForce(l, T);
+                  for (f = d[s], c = s + 1; c < d.length; c++)
+                    T = d[c], f.getOwner() == T.getOwner() && this.calcRepulsionForce(f, T);
             }, i.prototype.calcGravitationalForces = function() {
               for (var t, o = this.getAllNodesToApplyGravitation(), s = 0; s < o.length; s++)
                 t = o[s], this.calcGravitationalForce(t);
@@ -1239,23 +1239,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, d, v;
+              var s = t.getSource(), c = t.getTarget(), f, T, d, v;
               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), d = T * (t.lengthX / l), v = T * (t.lengthY / l), s.springForceX += d, s.springForceY += v, c.springForceX -= d, c.springForceY -= v);
+              f = t.getLength(), f != 0 && (T = t.edgeElasticity * (f - o), d = T * (t.lengthX / f), v = T * (t.lengthY / f), s.springForceX += d, s.springForceY += v, c.springForceX -= d, c.springForceY -= v);
             }, i.prototype.calcRepulsionForce = function(t, o) {
-              var s = t.getRect(), c = o.getRect(), l = new Array(2), T = new Array(4), d, v, L, S, C, G, K;
+              var s = t.getRect(), c = o.getRect(), f = new Array(2), T = new Array(4), d, v, L, b, C, G, k;
               if (s.intersects(c)) {
-                e.calcSeparationAmount(s, c, l, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * l[0], K = 2 * l[1];
-                var X = t.noOfChildren * o.noOfChildren / (t.noOfChildren + o.noOfChildren);
-                t.repulsionForceX -= X * G, t.repulsionForceY -= X * K, o.repulsionForceX += X * G, o.repulsionForceY += X * K;
+                r.calcSeparationAmount(s, c, f, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * f[0], k = 2 * f[1];
+                var Y = t.noOfChildren * o.noOfChildren / (t.noOfChildren + o.noOfChildren);
+                t.repulsionForceX -= Y * G, t.repulsionForceY -= Y * k, o.repulsionForceX += Y * G, o.repulsionForceY += Y * k;
               } else
-                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (d = c.getCenterX() - s.getCenterX(), v = c.getCenterY() - s.getCenterY()) : (e.getIntersection(s, c, T), d = T[2] - T[0], v = T[3] - T[1]), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), Math.abs(v) < a.MIN_REPULSION_DIST && (v = f.sign(v) * a.MIN_REPULSION_DIST), L = d * d + v * v, S = Math.sqrt(L), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / L, G = C * d / S, K = C * v / S, t.repulsionForceX -= G, t.repulsionForceY -= K, o.repulsionForceX += G, o.repulsionForceY += K;
+                this.uniformLeafNodeSizes && t.getChild() == null && o.getChild() == null ? (d = c.getCenterX() - s.getCenterX(), v = c.getCenterY() - s.getCenterY()) : (r.getIntersection(s, c, T), d = T[2] - T[0], v = T[3] - T[1]), Math.abs(d) < a.MIN_REPULSION_DIST && (d = l.sign(d) * a.MIN_REPULSION_DIST), Math.abs(v) < a.MIN_REPULSION_DIST && (v = l.sign(v) * a.MIN_REPULSION_DIST), L = d * d + v * v, b = Math.sqrt(L), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / L, G = C * d / b, k = C * v / b, t.repulsionForceX -= G, t.repulsionForceY -= k, o.repulsionForceX += G, o.repulsionForceY += k;
             }, i.prototype.calcGravitationalForce = function(t) {
-              var o, s, c, l, T, d, v, L;
-              o = t.getOwner(), s = (o.getRight() + o.getLeft()) / 2, c = (o.getTop() + o.getBottom()) / 2, l = t.getCenterX() - s, T = t.getCenterY() - c, d = Math.abs(l) + t.getWidth() / 2, v = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (L = o.getEstimatedSize() * this.gravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * l, t.gravitationForceY = -this.gravityConstant * T)) : (L = o.getEstimatedSize() * this.compoundGravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * l * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
+              var o, s, c, f, T, d, v, L;
+              o = t.getOwner(), s = (o.getRight() + o.getLeft()) / 2, c = (o.getTop() + o.getBottom()) / 2, f = t.getCenterX() - s, T = t.getCenterY() - c, d = Math.abs(f) + t.getWidth() / 2, v = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (L = o.getEstimatedSize() * this.gravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * f, t.gravitationForceY = -this.gravityConstant * T)) : (L = o.getEstimatedSize() * this.compoundGravityRangeFactor, (d > L || v > L) && (t.gravitationForceX = -this.gravityConstant * f * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
             }, i.prototype.isConverged = function() {
               var t, o = !1;
               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;
@@ -1267,36 +1267,36 @@ function ur() {
             }, i.prototype.calcGrid = function(t) {
               var o = 0, s = 0;
               o = parseInt(Math.ceil((t.getRight() - t.getLeft()) / this.repulsionRange)), s = parseInt(Math.ceil((t.getBottom() - t.getTop()) / this.repulsionRange));
-              for (var c = new Array(o), l = 0; l < o; l++)
-                c[l] = new Array(s);
-              for (var l = 0; l < o; l++)
+              for (var c = new Array(o), f = 0; f < o; f++)
+                c[f] = new Array(s);
+              for (var f = 0; f < o; f++)
                 for (var T = 0; T < s; T++)
-                  c[l][T] = new Array();
+                  c[f][T] = new Array();
               return c;
             }, i.prototype.addNodeToGrid = function(t, o, s) {
-              var c = 0, l = 0, T = 0, d = 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)), d = parseInt(Math.floor((t.getRect().height + t.getRect().y - s) / this.repulsionRange));
-              for (var v = c; v <= l; v++)
+              var c = 0, f = 0, T = 0, d = 0;
+              c = parseInt(Math.floor((t.getRect().x - o) / this.repulsionRange)), f = parseInt(Math.floor((t.getRect().width + t.getRect().x - o) / this.repulsionRange)), T = parseInt(Math.floor((t.getRect().y - s) / this.repulsionRange)), d = parseInt(Math.floor((t.getRect().height + t.getRect().y - s) / this.repulsionRange));
+              for (var v = c; v <= f; v++)
                 for (var L = T; L <= d; L++)
-                  this.grid[v][L].push(t), t.setGridCoordinates(c, l, T, d);
+                  this.grid[v][L].push(t), t.setGridCoordinates(c, f, T, d);
             }, i.prototype.updateGrid = function() {
               var t, o, s = this.getAllNodes();
               for (this.grid = this.calcGrid(this.graphManager.getRoot()), t = 0; t < s.length; t++)
                 o = s[t], this.addNodeToGrid(o, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
             }, i.prototype.calculateRepulsionForceOfANode = function(t, o, s, c) {
               if (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && s || c) {
-                var l = /* @__PURE__ */ new Set();
+                var f = /* @__PURE__ */ new Set();
                 t.surrounding = new Array();
                 for (var T, d = this.grid, v = t.startX - 1; v < t.finishX + 2; v++)
                   for (var L = t.startY - 1; L < t.finishY + 2; L++)
                     if (!(v < 0 || L < 0 || v >= d.length || L >= d[0].length)) {
-                      for (var S = 0; S < d[v][L].length; S++)
-                        if (T = d[v][L][S], !(t.getOwner() != T.getOwner() || t == T) && !o.has(T) && !l.has(T)) {
+                      for (var b = 0; b < d[v][L].length; b++)
+                        if (T = d[v][L][b], !(t.getOwner() != T.getOwner() || t == T) && !o.has(T) && !f.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);
+                          C <= this.repulsionRange && G <= this.repulsionRange && f.add(T);
                         }
                     }
-                t.surrounding = [].concat(u(l));
+                t.surrounding = [].concat(u(f));
               }
               for (v = 0; v < t.surrounding.length; v++)
                 this.calcRepulsionForce(t, t.surrounding[v]);
@@ -1308,26 +1308,26 @@ function ur() {
           /***/
           (function(A, P, N) {
             var u = N(1), h = N(4);
-            function a(e, f, i) {
-              u.call(this, e, f, i), this.idealLength = h.DEFAULT_EDGE_LENGTH, this.edgeElasticity = h.DEFAULT_SPRING_STRENGTH;
+            function a(r, l, i) {
+              u.call(this, r, l, 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];
+            for (var e in u)
+              a[e] = u[e];
             A.exports = a;
           }),
           /* 20 */
           /***/
           (function(A, P, N) {
             var u = N(3), h = N(4);
-            function a(e, f, i, g) {
-              u.call(this, e, f, i, g), 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 = [];
+            function a(r, l, i, g) {
+              u.call(this, r, l, i, g), 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.setGridCoordinates = function(e, f, i, g) {
-              this.startX = e, this.finishX = f, this.startY = i, this.finishY = g;
+            for (var e in u)
+              a[e] = u[e];
+            a.prototype.setGridCoordinates = function(r, l, i, g) {
+              this.startX = r, this.finishX = l, this.startY = i, this.finishY = g;
             }, A.exports = a;
           }),
           /* 21 */
@@ -1353,14 +1353,14 @@ function ur() {
             function h() {
               this.map = {}, this.keys = [];
             }
-            h.prototype.put = function(a, r) {
-              var e = u.createID(a);
-              this.contains(e) || (this.map[e] = r, this.keys.push(a));
+            h.prototype.put = function(a, e) {
+              var r = u.createID(a);
+              this.contains(r) || (this.map[r] = e, this.keys.push(a));
             }, h.prototype.contains = function(a) {
               return u.createID(a), this.map[a] != null;
             }, h.prototype.get = function(a) {
-              var r = u.createID(a);
-              return this.map[r];
+              var e = u.createID(a);
+              return this.map[e];
             }, h.prototype.keySet = function() {
               return this.keys;
             }, A.exports = h;
@@ -1373,8 +1373,8 @@ function ur() {
               this.set = {};
             }
             h.prototype.add = function(a) {
-              var r = u.createID(a);
-              this.contains(r) || (this.set[r] = a);
+              var e = u.createID(a);
+              this.contains(e) || (this.set[e] = a);
             }, h.prototype.remove = function(a) {
               delete this.set[u.createID(a)];
             }, h.prototype.clear = function() {
@@ -1386,14 +1386,14 @@ function ur() {
             }, h.prototype.size = function() {
               return Object.keys(this.set).length;
             }, h.prototype.addAllTo = function(a) {
-              for (var r = Object.keys(this.set), e = r.length, f = 0; f < e; f++)
-                a.push(this.set[r[f]]);
+              for (var e = Object.keys(this.set), r = e.length, l = 0; l < r; l++)
+                a.push(this.set[e[l]]);
             }, h.prototype.size = function() {
               return Object.keys(this.set).length;
             }, h.prototype.addAll = function(a) {
-              for (var r = a.length, e = 0; e < r; e++) {
-                var f = a[e];
-                this.add(f);
+              for (var e = a.length, r = 0; r < e; r++) {
+                var l = a[r];
+                this.add(l);
               }
             }, A.exports = h;
           }),
@@ -1403,91 +1403,91 @@ function ur() {
             function u() {
             }
             u.multMat = function(h, a) {
-              for (var r = [], e = 0; e < h.length; e++) {
-                r[e] = [];
-                for (var f = 0; f < a[0].length; f++) {
-                  r[e][f] = 0;
+              for (var e = [], r = 0; r < h.length; r++) {
+                e[r] = [];
+                for (var l = 0; l < a[0].length; l++) {
+                  e[r][l] = 0;
                   for (var i = 0; i < h[0].length; i++)
-                    r[e][f] += h[e][i] * a[i][f];
+                    e[r][l] += h[r][i] * a[i][l];
                 }
               }
-              return r;
+              return e;
             }, u.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];
+              for (var a = [], e = 0; e < h[0].length; e++) {
+                a[e] = [];
+                for (var r = 0; r < h.length; r++)
+                  a[e][r] = h[r][e];
               }
               return a;
             }, u.multCons = function(h, a) {
-              for (var r = [], e = 0; e < h.length; e++)
-                r[e] = h[e] * a;
-              return r;
+              for (var e = [], r = 0; r < h.length; r++)
+                e[r] = h[r] * a;
+              return e;
             }, u.minusOp = function(h, a) {
-              for (var r = [], e = 0; e < h.length; e++)
-                r[e] = h[e] - a[e];
-              return r;
+              for (var e = [], r = 0; r < h.length; r++)
+                e[r] = h[r] - a[r];
+              return e;
             }, u.dotProduct = function(h, a) {
-              for (var r = 0, e = 0; e < h.length; e++)
-                r += h[e] * a[e];
-              return r;
+              for (var e = 0, r = 0; r < h.length; r++)
+                e += h[r] * a[r];
+              return e;
             }, u.mag = function(h) {
               return Math.sqrt(this.dotProduct(h, h));
             }, u.normalize = function(h) {
-              for (var a = [], r = this.mag(h), e = 0; e < h.length; e++)
-                a[e] = h[e] / r;
+              for (var a = [], e = this.mag(h), r = 0; r < h.length; r++)
+                a[r] = h[r] / e;
               return a;
             }, u.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];
+              for (var a = [], e = 0, r = 0; r < h.length; r++)
+                e += h[r];
+              e *= -1 / h.length;
+              for (var l = 0; l < h.length; l++)
+                a[l] = e + h[l];
               return a;
-            }, u.multL = function(h, a, r) {
-              for (var e = [], f = [], i = [], g = 0; g < a[0].length; g++) {
+            }, u.multL = function(h, a, e) {
+              for (var r = [], l = [], i = [], g = 0; g < a[0].length; g++) {
                 for (var t = 0, o = 0; o < a.length; o++)
                   t += -0.5 * a[o][g] * h[o];
-                f[g] = t;
+                l[g] = t;
               }
-              for (var s = 0; s < r.length; s++) {
-                for (var c = 0, l = 0; l < r.length; l++)
-                  c += r[s][l] * f[l];
+              for (var s = 0; s < e.length; s++) {
+                for (var c = 0, f = 0; f < e.length; f++)
+                  c += e[s][f] * l[f];
                 i[s] = c;
               }
               for (var T = 0; T < a.length; T++) {
                 for (var d = 0, v = 0; v < a[0].length; v++)
                   d += a[T][v] * i[v];
-                e[T] = d;
+                r[T] = d;
               }
-              return e;
+              return r;
             }, A.exports = u;
           }),
           /* 25 */
           /***/
           (function(A, P, N) {
             var u = /* @__PURE__ */ (function() {
-              function e(f, i) {
+              function r(l, i) {
                 for (var g = 0; g < i.length; g++) {
                   var t = i[g];
-                  t.enumerable = t.enumerable || !1, t.configurable = !0, "value" in t && (t.writable = !0), Object.defineProperty(f, t.key, t);
+                  t.enumerable = t.enumerable || !1, t.configurable = !0, "value" in t && (t.writable = !0), Object.defineProperty(l, t.key, t);
                 }
               }
-              return function(f, i, g) {
-                return i && e(f.prototype, i), g && e(f, g), f;
+              return function(l, i, g) {
+                return i && r(l.prototype, i), g && r(l, g), l;
               };
             })();
-            function h(e, f) {
-              if (!(e instanceof f))
+            function h(r, l) {
+              if (!(r instanceof l))
                 throw new TypeError("Cannot call a class as a function");
             }
-            var a = N(11), r = (function() {
-              function e(f, i) {
-                h(this, e), (i !== null || i !== void 0) && (this.compareFunction = this._defaultCompareFunction);
+            var a = N(11), e = (function() {
+              function r(l, i) {
+                h(this, r), (i !== null || i !== void 0) && (this.compareFunction = this._defaultCompareFunction);
                 var g = void 0;
-                f instanceof a ? g = f.size() : g = f.length, this._quicksort(f, 0, g - 1);
+                l instanceof a ? g = l.size() : g = l.length, this._quicksort(l, 0, g - 1);
               }
-              return u(e, [{
+              return u(r, [{
                 key: "_quicksort",
                 value: function(i, g, t) {
                   if (g < t) {
@@ -1529,9 +1529,9 @@ function ur() {
                 value: function(i, g) {
                   return g > i;
                 }
-              }]), e;
+              }]), r;
             })();
-            A.exports = r;
+            A.exports = e;
           }),
           /* 26 */
           /***/
@@ -1564,15 +1564,15 @@ function ur() {
                 };
                 return Ct(Tt);
               })([this.n, this.n]);
-              for (var r = (function(Tt) {
+              for (var e = (function(Tt) {
                 for (var Ct = []; Tt-- > 0; )
                   Ct.push(0);
                 return Ct;
-              })(this.n), e = (function(Tt) {
+              })(this.n), r = (function(Tt) {
                 for (var Ct = []; Tt-- > 0; )
                   Ct.push(0);
                 return Ct;
-              })(this.m), f = !0, i = Math.min(this.m - 1, this.n), g = Math.max(0, Math.min(this.n - 2, this.m)), t = 0; t < Math.max(i, g); t++) {
+              })(this.m), l = !0, i = Math.min(this.m - 1, this.n), g = Math.max(0, Math.min(this.n - 2, this.m)), t = 0; t < Math.max(i, g); t++) {
                 if (t < i) {
                   this.s[t] = 0;
                   for (var o = t; o < this.m; o++)
@@ -1589,47 +1589,47 @@ function ur() {
                   if (/* @__PURE__ */ (function(Tt, Ct) {
                     return Tt && Ct;
                   })(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 f = 0, T = t; T < this.m; T++)
+                      f += h[T][t] * h[T][c];
+                    f = -f / h[t][t];
                     for (var d = t; d < this.m; d++)
-                      h[d][c] += l * h[d][t];
+                      h[d][c] += f * h[d][t];
                   }
-                  r[c] = h[t][c];
+                  e[c] = h[t][c];
                 }
                 if (/* @__PURE__ */ (function(Tt, Ct) {
                   return Ct;
-                })(f, t < i))
+                })(l, t < i))
                   for (var v = t; v < this.m; v++)
                     this.U[v][t] = h[v][t];
                 if (t < g) {
-                  r[t] = 0;
+                  e[t] = 0;
                   for (var L = t + 1; L < this.n; L++)
-                    r[t] = u.hypot(r[t], r[L]);
-                  if (r[t] !== 0) {
-                    r[t + 1] < 0 && (r[t] = -r[t]);
-                    for (var S = t + 1; S < this.n; S++)
-                      r[S] /= r[t];
-                    r[t + 1] += 1;
+                    e[t] = u.hypot(e[t], e[L]);
+                  if (e[t] !== 0) {
+                    e[t + 1] < 0 && (e[t] = -e[t]);
+                    for (var b = t + 1; b < this.n; b++)
+                      e[b] /= e[t];
+                    e[t + 1] += 1;
                   }
-                  if (r[t] = -r[t], /* @__PURE__ */ (function(Tt, Ct) {
+                  if (e[t] = -e[t], /* @__PURE__ */ (function(Tt, Ct) {
                     return Tt && Ct;
-                  })(t + 1 < this.m, r[t] !== 0)) {
+                  })(t + 1 < this.m, e[t] !== 0)) {
                     for (var C = t + 1; C < this.m; C++)
-                      e[C] = 0;
+                      r[C] = 0;
                     for (var G = t + 1; G < this.n; G++)
-                      for (var K = t + 1; K < this.m; K++)
-                        e[K] += r[G] * h[K][G];
-                    for (var X = t + 1; X < this.n; X++)
-                      for (var Q = -r[X] / r[t + 1], O = t + 1; O < this.m; O++)
-                        h[O][X] += Q * e[O];
+                      for (var k = t + 1; k < this.m; k++)
+                        r[k] += e[G] * h[k][G];
+                    for (var Y = t + 1; Y < this.n; Y++)
+                      for (var K = -e[Y] / e[t + 1], O = t + 1; O < this.m; O++)
+                        h[O][Y] += K * r[O];
                   }
-                  for (var rt = t + 1; rt < this.n; rt++)
-                    this.V[rt][t] = r[rt];
+                  for (var it = t + 1; it < this.n; it++)
+                    this.V[it][t] = e[it];
                 }
               }
               var n = Math.min(this.n, this.m + 1);
-              i < this.n && (this.s[i] = h[i][i]), this.m < n && (this.s[n - 1] = 0), g + 1 < n && (r[g] = h[g][n - 1]), r[n - 1] = 0;
+              i < this.n && (this.s[i] = h[i][i]), this.m < n && (this.s[n - 1] = 0), g + 1 < n && (e[g] = h[g][n - 1]), e[n - 1] = 0;
               {
                 for (var m = i; m < a; m++) {
                   for (var p = 0; p < this.m; p++)
@@ -1642,63 +1642,63 @@ function ur() {
                       for (var R = 0, M = E; M < this.m; M++)
                         R += this.U[M][E] * this.U[M][y];
                       R = -R / this.U[E][E];
-                      for (var F = E; F < this.m; F++)
-                        this.U[F][y] += R * this.U[F][E];
+                      for (var S = E; S < this.m; S++)
+                        this.U[S][y] += R * this.U[S][E];
                     }
                     for (var W = E; W < this.m; W++)
                       this.U[W][E] = -this.U[W][E];
                     this.U[E][E] = 1 + this.U[E][E];
-                    for (var x = 0; x < E - 1; x++)
-                      this.U[x][E] = 0;
+                    for (var D = 0; D < E - 1; D++)
+                      this.U[D][E] = 0;
                   } else {
-                    for (var k = 0; k < this.m; k++)
-                      this.U[k][E] = 0;
+                    for (var q = 0; q < this.m; q++)
+                      this.U[q][E] = 0;
                     this.U[E][E] = 1;
                   }
               }
               for (var V = this.n - 1; V >= 0; V--) {
                 if (/* @__PURE__ */ (function(Tt, Ct) {
                   return Tt && Ct;
-                })(V < g, r[V] !== 0))
-                  for (var Y = V + 1; Y < a; Y++) {
+                })(V < g, e[V] !== 0))
+                  for (var X = V + 1; X < a; X++) {
                     for (var et = 0, z = V + 1; z < this.n; z++)
-                      et += this.V[z][V] * this.V[z][Y];
+                      et += this.V[z][V] * this.V[z][X];
                     et = -et / this.V[V + 1][V];
                     for (var w = V + 1; w < this.n; w++)
-                      this.V[w][Y] += et * this.V[w][V];
+                      this.V[w][X] += et * this.V[w][V];
                   }
                 for (var H = 0; H < this.n; H++)
                   this.V[H][V] = 0;
                 this.V[V][V] = 1;
               }
               for (var $ = n - 1, _ = Math.pow(2, -52), ht = Math.pow(2, -966); n > 0; ) {
-                var q = void 0, It = void 0;
-                for (q = n - 2; q >= -1 && q !== -1; q--)
-                  if (Math.abs(r[q]) <= ht + _ * (Math.abs(this.s[q]) + Math.abs(this.s[q + 1]))) {
-                    r[q] = 0;
+                var Q = void 0, It = void 0;
+                for (Q = n - 2; Q >= -1 && Q !== -1; Q--)
+                  if (Math.abs(e[Q]) <= ht + _ * (Math.abs(this.s[Q]) + Math.abs(this.s[Q + 1]))) {
+                    e[Q] = 0;
                     break;
                   }
-                if (q === n - 2)
+                if (Q === n - 2)
                   It = 4;
                 else {
                   var Nt = void 0;
-                  for (Nt = n - 1; Nt >= q && Nt !== q; Nt--) {
-                    var vt = (Nt !== n ? Math.abs(r[Nt]) : 0) + (Nt !== q + 1 ? Math.abs(r[Nt - 1]) : 0);
+                  for (Nt = n - 1; Nt >= Q && Nt !== Q; Nt--) {
+                    var vt = (Nt !== n ? Math.abs(e[Nt]) : 0) + (Nt !== Q + 1 ? Math.abs(e[Nt - 1]) : 0);
                     if (Math.abs(this.s[Nt]) <= ht + _ * vt) {
                       this.s[Nt] = 0;
                       break;
                     }
                   }
-                  Nt === q ? It = 3 : Nt === n - 1 ? It = 1 : (It = 2, q = Nt);
+                  Nt === Q ? It = 3 : Nt === n - 1 ? It = 1 : (It = 2, Q = Nt);
                 }
-                switch (q++, It) {
+                switch (Q++, It) {
                   case 1:
                     {
-                      var it = r[n - 2];
-                      r[n - 2] = 0;
-                      for (var gt = n - 2; gt >= q; gt--) {
-                        var mt = u.hypot(this.s[gt], it), At = this.s[gt] / mt, Ot = it / mt;
-                        this.s[gt] = mt, gt !== q && (it = -Ot * r[gt - 1], r[gt - 1] = At * r[gt - 1]);
+                      var rt = e[n - 2];
+                      e[n - 2] = 0;
+                      for (var gt = n - 2; gt >= Q; gt--) {
+                        var mt = u.hypot(this.s[gt], rt), At = this.s[gt] / mt, Ot = rt / mt;
+                        this.s[gt] = mt, gt !== Q && (rt = -Ot * e[gt - 1], e[gt - 1] = At * e[gt - 1]);
                         for (var Et = 0; Et < this.n; Et++)
                           mt = At * this.V[Et][gt] + Ot * this.V[Et][n - 1], this.V[Et][n - 1] = -Ot * this.V[Et][gt] + At * this.V[Et][n - 1], this.V[Et][gt] = mt;
                       }
@@ -1706,50 +1706,50 @@ function ur() {
                     break;
                   case 2:
                     {
-                      var Dt = r[q - 1];
-                      r[q - 1] = 0;
-                      for (var Rt = q; Rt < n; Rt++) {
+                      var Dt = e[Q - 1];
+                      e[Q - 1] = 0;
+                      for (var Rt = Q; Rt < n; Rt++) {
                         var Ht = u.hypot(this.s[Rt], Dt), Ut = this.s[Rt] / Ht, Pt = Dt / Ht;
-                        this.s[Rt] = Ht, Dt = -Pt * r[Rt], r[Rt] = Ut * r[Rt];
+                        this.s[Rt] = Ht, Dt = -Pt * e[Rt], e[Rt] = Ut * e[Rt];
                         for (var Ft = 0; Ft < this.m; Ft++)
-                          Ht = Ut * this.U[Ft][Rt] + Pt * this.U[Ft][q - 1], this.U[Ft][q - 1] = -Pt * this.U[Ft][Rt] + Ut * this.U[Ft][q - 1], this.U[Ft][Rt] = Ht;
+                          Ht = Ut * this.U[Ft][Rt] + Pt * this.U[Ft][Q - 1], this.U[Ft][Q - 1] = -Pt * this.U[Ft][Rt] + Ut * this.U[Ft][Q - 1], this.U[Ft][Rt] = Ht;
                       }
                     }
                     break;
                   case 3:
                     {
-                      var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(r[n - 2])), Math.abs(this.s[q])), Math.abs(r[q])), Vt = this.s[n - 1] / Yt, b = this.s[n - 2] / Yt, U = r[n - 2] / Yt, B = this.s[q] / Yt, J = r[q] / Yt, Z = ((b + Vt) * (b - Vt) + U * U) / 2, at = Vt * U * (Vt * U), ct = 0;
+                      var Yt = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[n - 1]), Math.abs(this.s[n - 2])), Math.abs(e[n - 2])), Math.abs(this.s[Q])), Math.abs(e[Q])), Vt = this.s[n - 1] / Yt, F = this.s[n - 2] / Yt, U = e[n - 2] / Yt, B = this.s[Q] / Yt, J = e[Q] / Yt, Z = ((F + Vt) * (F - Vt) + U * U) / 2, at = Vt * U * (Vt * U), ct = 0;
                       /* @__PURE__ */ (function(Tt, Ct) {
                         return Tt || Ct;
                       })(Z !== 0, at !== 0) && (ct = Math.sqrt(Z * Z + at), Z < 0 && (ct = -ct), ct = at / (Z + ct));
-                      for (var nt = (B + Vt) * (B - Vt) + ct, tt = B * J, j = q; j < n - 1; j++) {
+                      for (var nt = (B + Vt) * (B - Vt) + ct, tt = B * J, j = Q; j < n - 1; j++) {
                         var ut = u.hypot(nt, tt), Mt = nt / ut, pt = tt / ut;
-                        j !== q && (r[j - 1] = ut), nt = Mt * this.s[j] + pt * r[j], r[j] = Mt * r[j] - pt * this.s[j], tt = pt * this.s[j + 1], this.s[j + 1] = Mt * this.s[j + 1];
+                        j !== Q && (e[j - 1] = ut), nt = Mt * this.s[j] + pt * e[j], e[j] = Mt * e[j] - pt * this.s[j], tt = pt * this.s[j + 1], this.s[j + 1] = Mt * this.s[j + 1];
                         for (var xt = 0; xt < this.n; xt++)
                           ut = Mt * this.V[xt][j] + pt * this.V[xt][j + 1], this.V[xt][j + 1] = -pt * this.V[xt][j] + Mt * this.V[xt][j + 1], this.V[xt][j] = ut;
-                        if (ut = u.hypot(nt, tt), Mt = nt / ut, pt = tt / ut, this.s[j] = ut, nt = Mt * r[j] + pt * this.s[j + 1], this.s[j + 1] = -pt * r[j] + Mt * this.s[j + 1], tt = pt * r[j + 1], r[j + 1] = Mt * r[j + 1], j < this.m - 1)
+                        if (ut = u.hypot(nt, tt), Mt = nt / ut, pt = tt / ut, this.s[j] = ut, nt = Mt * e[j] + pt * this.s[j + 1], this.s[j + 1] = -pt * e[j] + Mt * this.s[j + 1], tt = pt * e[j + 1], e[j + 1] = Mt * e[j + 1], j < this.m - 1)
                           for (var lt = 0; lt < this.m; lt++)
                             ut = Mt * this.U[lt][j] + pt * this.U[lt][j + 1], this.U[lt][j + 1] = -pt * this.U[lt][j] + Mt * this.U[lt][j + 1], this.U[lt][j] = ut;
                       }
-                      r[n - 2] = nt;
+                      e[n - 2] = nt;
                     }
                     break;
                   case 4:
                     {
-                      if (this.s[q] <= 0) {
-                        this.s[q] = this.s[q] < 0 ? -this.s[q] : 0;
+                      if (this.s[Q] <= 0) {
+                        this.s[Q] = this.s[Q] < 0 ? -this.s[Q] : 0;
                         for (var ot = 0; ot <= $; ot++)
-                          this.V[ot][q] = -this.V[ot][q];
+                          this.V[ot][Q] = -this.V[ot][Q];
                       }
-                      for (; q < $ && !(this.s[q] >= this.s[q + 1]); ) {
-                        var Lt = this.s[q];
-                        if (this.s[q] = this.s[q + 1], this.s[q + 1] = Lt, q < this.n - 1)
+                      for (; Q < $ && !(this.s[Q] >= this.s[Q + 1]); ) {
+                        var Lt = this.s[Q];
+                        if (this.s[Q] = this.s[Q + 1], this.s[Q + 1] = Lt, Q < this.n - 1)
                           for (var ft = 0; ft < this.n; ft++)
-                            Lt = this.V[ft][q + 1], this.V[ft][q + 1] = this.V[ft][q], this.V[ft][q] = Lt;
-                        if (q < this.m - 1)
+                            Lt = this.V[ft][Q + 1], this.V[ft][Q + 1] = this.V[ft][Q], this.V[ft][Q] = Lt;
+                        if (Q < this.m - 1)
                           for (var st = 0; st < this.m; st++)
-                            Lt = this.U[st][q + 1], this.U[st][q + 1] = this.U[st][q], this.U[st][q] = Lt;
-                        q++;
+                            Lt = this.U[st][Q + 1], this.U[st][Q + 1] = this.U[st][Q], this.U[st][Q] = Lt;
+                        Q++;
                       }
                       n--;
                     }
@@ -1759,32 +1759,32 @@ function ur() {
               var Xt = { U: this.U, V: this.V, S: this.s };
               return Xt;
             }, u.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;
+              var e = void 0;
+              return Math.abs(h) > Math.abs(a) ? (e = a / h, e = Math.abs(h) * Math.sqrt(1 + e * e)) : a != 0 ? (e = h / a, e = Math.abs(a) * Math.sqrt(1 + e * e)) : e = 0, e;
             }, A.exports = u;
           }),
           /* 27 */
           /***/
           (function(A, P, N) {
             var u = /* @__PURE__ */ (function() {
-              function r(e, f) {
-                for (var i = 0; i < f.length; i++) {
-                  var g = f[i];
-                  g.enumerable = g.enumerable || !1, g.configurable = !0, "value" in g && (g.writable = !0), Object.defineProperty(e, g.key, g);
+              function e(r, l) {
+                for (var i = 0; i < l.length; i++) {
+                  var g = l[i];
+                  g.enumerable = g.enumerable || !1, g.configurable = !0, "value" in g && (g.writable = !0), Object.defineProperty(r, g.key, g);
                 }
               }
-              return function(e, f, i) {
-                return f && r(e.prototype, f), i && r(e, i), e;
+              return function(r, l, i) {
+                return l && e(r.prototype, l), i && e(r, i), r;
               };
             })();
-            function h(r, e) {
-              if (!(r instanceof e))
+            function h(e, r) {
+              if (!(e instanceof r))
                 throw new TypeError("Cannot call a class as a function");
             }
             var a = (function() {
-              function r(e, f) {
+              function e(r, l) {
                 var i = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, g = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : -1, t = arguments.length > 4 && arguments[4] !== void 0 ? arguments[4] : -1;
-                h(this, r), this.sequence1 = e, this.sequence2 = f, this.match_score = i, this.mismatch_penalty = g, this.gap_penalty = t, this.iMax = e.length + 1, this.jMax = f.length + 1, this.grid = new Array(this.iMax);
+                h(this, e), this.sequence1 = r, this.sequence2 = l, this.match_score = i, this.mismatch_penalty = g, this.gap_penalty = t, this.iMax = r.length + 1, this.jMax = l.length + 1, this.grid = new Array(this.iMax);
                 for (var o = 0; o < this.iMax; o++) {
                   this.grid[o] = new Array(this.jMax);
                   for (var s = 0; s < this.jMax; s++)
@@ -1793,12 +1793,12 @@ function ur() {
                 this.tracebackGrid = new Array(this.iMax);
                 for (var c = 0; c < this.iMax; c++) {
                   this.tracebackGrid[c] = new Array(this.jMax);
-                  for (var l = 0; l < this.jMax; l++)
-                    this.tracebackGrid[c][l] = [null, null, null];
+                  for (var f = 0; f < this.jMax; f++)
+                    this.tracebackGrid[c][f] = [null, null, null];
                 }
                 this.alignments = [], this.score = -1, this.computeGrids();
               }
-              return u(r, [{
+              return u(e, [{
                 key: "getScore",
                 value: function() {
                   return this.score;
@@ -1812,16 +1812,16 @@ function ur() {
               }, {
                 key: "computeGrids",
                 value: function() {
-                  for (var f = 1; f < this.jMax; f++)
-                    this.grid[0][f] = this.grid[0][f - 1] + this.gap_penalty, this.tracebackGrid[0][f] = [!1, !1, !0];
+                  for (var l = 1; l < this.jMax; l++)
+                    this.grid[0][l] = this.grid[0][l - 1] + this.gap_penalty, this.tracebackGrid[0][l] = [!1, !1, !0];
                   for (var i = 1; i < this.iMax; i++)
                     this.grid[i][0] = this.grid[i - 1][0] + this.gap_penalty, this.tracebackGrid[i][0] = [!1, !0, !1];
                   for (var g = 1; g < this.iMax; g++)
                     for (var t = 1; t < this.jMax; t++) {
                       var o = void 0;
                       this.sequence1[g - 1] === this.sequence2[t - 1] ? o = this.grid[g - 1][t - 1] + this.match_score : o = this.grid[g - 1][t - 1] + this.mismatch_penalty;
-                      var s = this.grid[g - 1][t] + this.gap_penalty, c = this.grid[g][t - 1] + this.gap_penalty, l = [o, s, c], T = this.arrayAllMaxIndexes(l);
-                      this.grid[g][t] = l[T[0]], this.tracebackGrid[g][t] = [T.includes(0), T.includes(1), T.includes(2)];
+                      var s = this.grid[g - 1][t] + this.gap_penalty, c = this.grid[g][t - 1] + this.gap_penalty, f = [o, s, c], T = this.arrayAllMaxIndexes(f);
+                      this.grid[g][t] = f[T[0]], this.tracebackGrid[g][t] = [T.includes(0), T.includes(1), T.includes(2)];
                     }
                   this.score = this.grid[this.iMax - 1][this.jMax - 1];
                 }
@@ -1829,46 +1829,46 @@ function ur() {
               }, {
                 key: "alignmentTraceback",
                 value: function() {
-                  var f = [];
-                  for (f.push({
+                  var l = [];
+                  for (l.push({
                     pos: [this.sequence1.length, this.sequence2.length],
                     seq1: "",
                     seq2: ""
-                  }); f[0]; ) {
-                    var i = f[0], g = this.tracebackGrid[i.pos[0]][i.pos[1]];
-                    g[0] && f.push({
+                  }); l[0]; ) {
+                    var i = l[0], g = this.tracebackGrid[i.pos[0]][i.pos[1]];
+                    g[0] && l.push({
                       pos: [i.pos[0] - 1, i.pos[1] - 1],
                       seq1: this.sequence1[i.pos[0] - 1] + i.seq1,
                       seq2: this.sequence2[i.pos[1] - 1] + i.seq2
-                    }), g[1] && f.push({
+                    }), g[1] && l.push({
                       pos: [i.pos[0] - 1, i.pos[1]],
                       seq1: this.sequence1[i.pos[0] - 1] + i.seq1,
                       seq2: "-" + i.seq2
-                    }), g[2] && f.push({
+                    }), g[2] && l.push({
                       pos: [i.pos[0], i.pos[1] - 1],
                       seq1: "-" + i.seq1,
                       seq2: this.sequence2[i.pos[1] - 1] + i.seq2
                     }), i.pos[0] === 0 && i.pos[1] === 0 && this.alignments.push({
                       sequence1: i.seq1,
                       sequence2: i.seq2
-                    }), f.shift();
+                    }), l.shift();
                   }
                   return this.alignments;
                 }
                 // Helper Functions
               }, {
                 key: "getAllIndexes",
-                value: function(f, i) {
-                  for (var g = [], t = -1; (t = f.indexOf(i, t + 1)) !== -1; )
+                value: function(l, i) {
+                  for (var g = [], t = -1; (t = l.indexOf(i, t + 1)) !== -1; )
                     g.push(t);
                   return g;
                 }
               }, {
                 key: "arrayAllMaxIndexes",
-                value: function(f) {
-                  return this.getAllIndexes(f, Math.max.apply(null, f));
+                value: function(l) {
+                  return this.getAllIndexes(l, Math.max.apply(null, l));
                 }
-              }]), r;
+              }]), e;
             })();
             A.exports = a;
           }),
@@ -1886,20 +1886,20 @@ function ur() {
               this.listeners = [];
             }
             var h = u.prototype;
-            h.addListener = function(a, r) {
+            h.addListener = function(a, e) {
               this.listeners.push({
                 event: a,
-                callback: r
+                callback: e
               });
-            }, h.removeListener = function(a, r) {
-              for (var e = this.listeners.length; e >= 0; e--) {
-                var f = this.listeners[e];
-                f.event === a && f.callback === r && this.listeners.splice(e, 1);
+            }, h.removeListener = function(a, e) {
+              for (var r = this.listeners.length; r >= 0; r--) {
+                var l = this.listeners[r];
+                l.event === a && l.callback === e && this.listeners.splice(r, 1);
               }
-            }, h.emit = function(a, r) {
-              for (var e = 0; e < this.listeners.length; e++) {
-                var f = this.listeners[e];
-                a === f.event && f.callback(r);
+            }, h.emit = function(a, e) {
+              for (var r = 0; r < this.listeners.length; r++) {
+                var l = this.listeners[r];
+                a === l.event && l.callback(e);
               }
             }, A.exports = u;
           })
@@ -1911,7 +1911,7 @@ function ur() {
 }
 var dr = le.exports, Oe;
 function vr() {
-  return Oe || (Oe = 1, (function(I, D) {
+  return Oe || (Oe = 1, (function(I, x) {
     (function(P, N) {
       I.exports = N(ur());
     })(dr, function(A) {
@@ -1922,76 +1922,76 @@ function vr() {
             /***/
             45: (
               /***/
-              ((a, r, e) => {
-                var f = {};
-                f.layoutBase = e(551), f.CoSEConstants = e(806), f.CoSEEdge = e(767), f.CoSEGraph = e(880), f.CoSEGraphManager = e(578), f.CoSELayout = e(765), f.CoSENode = e(991), f.ConstraintHandler = e(902), a.exports = f;
+              ((a, e, r) => {
+                var l = {};
+                l.layoutBase = r(551), l.CoSEConstants = r(806), l.CoSEEdge = r(767), l.CoSEGraph = r(880), l.CoSEGraphManager = r(578), l.CoSELayout = r(765), l.CoSENode = r(991), l.ConstraintHandler = r(902), a.exports = l;
               })
             ),
             /***/
             806: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).FDLayoutConstants;
+              ((a, e, r) => {
+                var l = r(551).FDLayoutConstants;
                 function i() {
                 }
-                for (var g in f)
-                  i[g] = f[g];
-                i.DEFAULT_USE_MULTI_LEVEL_SCALING = !1, i.DEFAULT_RADIAL_SEPARATION = f.DEFAULT_EDGE_LENGTH, i.DEFAULT_COMPONENT_SEPERATION = 60, i.TILE = !0, i.TILING_PADDING_VERTICAL = 10, i.TILING_PADDING_HORIZONTAL = 10, i.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, i.ENFORCE_CONSTRAINTS = !0, i.APPLY_LAYOUT = !0, i.RELAX_MOVEMENT_ON_CONSTRAINTS = !0, i.TREE_REDUCTION_ON_INCREMENTAL = !0, i.PURE_INCREMENTAL = i.DEFAULT_INCREMENTAL, a.exports = i;
+                for (var g in l)
+                  i[g] = l[g];
+                i.DEFAULT_USE_MULTI_LEVEL_SCALING = !1, i.DEFAULT_RADIAL_SEPARATION = l.DEFAULT_EDGE_LENGTH, i.DEFAULT_COMPONENT_SEPERATION = 60, i.TILE = !0, i.TILING_PADDING_VERTICAL = 10, i.TILING_PADDING_HORIZONTAL = 10, i.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, i.ENFORCE_CONSTRAINTS = !0, i.APPLY_LAYOUT = !0, i.RELAX_MOVEMENT_ON_CONSTRAINTS = !0, i.TREE_REDUCTION_ON_INCREMENTAL = !0, i.PURE_INCREMENTAL = i.DEFAULT_INCREMENTAL, a.exports = i;
               })
             ),
             /***/
             767: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).FDLayoutEdge;
+              ((a, e, r) => {
+                var l = r(551).FDLayoutEdge;
                 function i(t, o, s) {
-                  f.call(this, t, o, s);
+                  l.call(this, t, o, s);
                 }
-                i.prototype = Object.create(f.prototype);
-                for (var g in f)
-                  i[g] = f[g];
+                i.prototype = Object.create(l.prototype);
+                for (var g in l)
+                  i[g] = l[g];
                 a.exports = i;
               })
             ),
             /***/
             880: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).LGraph;
+              ((a, e, r) => {
+                var l = r(551).LGraph;
                 function i(t, o, s) {
-                  f.call(this, t, o, s);
+                  l.call(this, t, o, s);
                 }
-                i.prototype = Object.create(f.prototype);
-                for (var g in f)
-                  i[g] = f[g];
+                i.prototype = Object.create(l.prototype);
+                for (var g in l)
+                  i[g] = l[g];
                 a.exports = i;
               })
             ),
             /***/
             578: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).LGraphManager;
+              ((a, e, r) => {
+                var l = r(551).LGraphManager;
                 function i(t) {
-                  f.call(this, t);
+                  l.call(this, t);
                 }
-                i.prototype = Object.create(f.prototype);
-                for (var g in f)
-                  i[g] = f[g];
+                i.prototype = Object.create(l.prototype);
+                for (var g in l)
+                  i[g] = l[g];
                 a.exports = i;
               })
             ),
             /***/
             765: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).FDLayout, i = e(578), g = e(880), t = e(991), o = e(767), s = e(806), c = e(902), l = e(551).FDLayoutConstants, T = e(551).LayoutConstants, d = e(551).Point, v = e(551).PointD, L = e(551).DimensionD, S = e(551).Layout, C = e(551).Integer, G = e(551).IGeometry, K = e(551).LGraph, X = e(551).Transform, Q = e(551).LinkedList;
+              ((a, e, r) => {
+                var l = r(551).FDLayout, i = r(578), g = r(880), t = r(991), o = r(767), s = r(806), c = r(902), f = r(551).FDLayoutConstants, T = r(551).LayoutConstants, d = r(551).Point, v = r(551).PointD, L = r(551).DimensionD, b = r(551).Layout, C = r(551).Integer, G = r(551).IGeometry, k = r(551).LGraph, Y = r(551).Transform, K = r(551).LinkedList;
                 function O() {
-                  f.call(this), this.toBeTiled = {}, this.constraints = {};
+                  l.call(this), this.toBeTiled = {}, this.constraints = {};
                 }
-                O.prototype = Object.create(f.prototype);
-                for (var rt in f)
-                  O[rt] = f[rt];
+                O.prototype = Object.create(l.prototype);
+                for (var it in l)
+                  O[it] = l[it];
                 O.prototype.newGraphManager = function() {
                   var n = new i(this);
                   return this.graphManager = n, n;
@@ -2002,9 +2002,9 @@ function vr() {
                 }, O.prototype.newEdge = function(n) {
                   return new o(null, null, n);
                 }, O.prototype.initParameters = function() {
-                  f.prototype.initParameters.call(this, arguments), this.isSubLayout || (s.DEFAULT_EDGE_LENGTH < 10 ? this.idealEdgeLength = 10 : this.idealEdgeLength = s.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = s.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = l.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = l.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = l.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1);
+                  l.prototype.initParameters.call(this, arguments), this.isSubLayout || (s.DEFAULT_EDGE_LENGTH < 10 ? this.idealEdgeLength = 10 : this.idealEdgeLength = s.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = s.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = f.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = f.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = f.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = f.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.prunedNodesAll = [], this.growTreeIterations = 0, this.afterGrowthIterations = 0, this.isTreeGrowing = !1, this.isGrowthFinished = !1);
                 }, O.prototype.initSpringEmbedder = function() {
-                  f.prototype.initSpringEmbedder.call(this), this.coolingCycle = 0, this.maxCoolingCycle = this.maxIterations / l.CONVERGENCE_CHECK_PERIOD, this.finalTemperature = 0.04, this.coolingAdjuster = 1;
+                  l.prototype.initSpringEmbedder.call(this), this.coolingCycle = 0, this.maxCoolingCycle = this.maxIterations / f.CONVERGENCE_CHECK_PERIOD, this.finalTemperature = 0.04, this.coolingAdjuster = 1;
                 }, O.prototype.layout = function() {
                   var n = T.DEFAULT_CREATE_BENDS_AS_NEEDED;
                   return n && (this.createBendpoints(), this.graphManager.resetAllEdges()), this.level = 0, this.classicLayout();
@@ -2036,7 +2036,7 @@ function vr() {
                       this.isTreeGrowing = !0;
                     else
                       return !0;
-                  if (this.totalIterations % l.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
+                  if (this.totalIterations % f.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
                     if (this.isConverged())
                       if (this.prunedNodesAll.length > 0)
                         this.isTreeGrowing = !0;
@@ -2051,7 +2051,7 @@ function vr() {
                         var n = new Set(this.getAllNodes()), m = this.nodesWithGravity.filter(function(y) {
                           return n.has(y);
                         });
-                        this.graphManager.setAllNodesToApplyGravitation(m), this.graphManager.updateBounds(), this.updateGrid(), s.PURE_INCREMENTAL ? this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 : this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+                        this.graphManager.setAllNodesToApplyGravitation(m), this.graphManager.updateBounds(), this.updateGrid(), s.PURE_INCREMENTAL ? this.coolingFactor = f.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 : this.coolingFactor = f.DEFAULT_COOLING_FACTOR_INCREMENTAL;
                       } else
                         this.isTreeGrowing = !1, this.isGrowthFinished = !0;
                     this.growTreeIterations++;
@@ -2059,7 +2059,7 @@ function vr() {
                   if (this.isGrowthFinished) {
                     if (this.isConverged())
                       return !0;
-                    this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), s.PURE_INCREMENTAL ? this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 * ((100 - this.afterGrowthIterations) / 100) : this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
+                    this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), s.PURE_INCREMENTAL ? this.coolingFactor = f.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 * ((100 - this.afterGrowthIterations) / 100) : this.coolingFactor = f.DEFAULT_COOLING_FACTOR_INCREMENTAL * ((100 - this.afterGrowthIterations) / 100), this.afterGrowthIterations++;
                   }
                   var p = !this.isTreeGrowing && !this.isGrowthFinished, E = this.growTreeIterations % 10 == 1 && this.isTreeGrowing || this.afterGrowthIterations % 10 == 1 && this.isGrowthFinished;
                   return this.totalDisplacement = 0, this.graphManager.updateBounds(), this.calcSpringForces(), this.calcRepulsionForces(p, E), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
@@ -2078,7 +2078,7 @@ function vr() {
                 }, O.prototype.runSpringEmbedder = function() {
                   this.initialAnimationPeriod = 25, this.animationPeriod = this.initialAnimationPeriod;
                   var n = !1;
-                  if (l.ANIMATE === "during")
+                  if (f.ANIMATE === "during")
                     this.emit("layoutstarted");
                   else {
                     for (; !n; )
@@ -2099,8 +2099,8 @@ function vr() {
                     this.idToNodeMap.set(E.id, E);
                   }
                   var y = function w(H) {
-                    for (var $ = H.getChild().getNodes(), _, ht = 0, q = 0; q < $.length; q++)
-                      _ = $[q], _.getChild() == null ? n.fixedNodeSet.has(_.id) && (ht += 100) : ht += w(_);
+                    for (var $ = H.getChild().getNodes(), _, ht = 0, Q = 0; Q < $.length; Q++)
+                      _ = $[Q], _.getChild() == null ? n.fixedNodeSet.has(_.id) && (ht += 100) : ht += w(_);
                     return ht;
                   };
                   if (this.constraints.fixedNodeConstraint) {
@@ -2114,7 +2114,7 @@ function vr() {
                       }
                   }
                   if (this.constraints.relativePlacementConstraint) {
-                    var M = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map();
+                    var M = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map();
                     if (this.dummyToNodeForVerticalAlignment = /* @__PURE__ */ new Map(), this.dummyToNodeForHorizontalAlignment = /* @__PURE__ */ new Map(), this.fixedNodesOnHorizontal = /* @__PURE__ */ new Set(), this.fixedNodesOnVertical = /* @__PURE__ */ new Set(), this.fixedNodeSet.forEach(function(w) {
                       n.fixedNodesOnHorizontal.add(w), n.fixedNodesOnVertical.add(w);
                     }), this.constraints.alignmentConstraint) {
@@ -2124,9 +2124,9 @@ function vr() {
                             M.set(H, "dummy" + p), n.dummyToNodeForVerticalAlignment.get("dummy" + p).push(H), n.fixedNodeSet.has(H) && n.fixedNodesOnHorizontal.add("dummy" + p);
                           });
                       if (this.constraints.alignmentConstraint.horizontal)
-                        for (var x = this.constraints.alignmentConstraint.horizontal, p = 0; p < x.length; p++)
-                          this.dummyToNodeForHorizontalAlignment.set("dummy" + p, []), x[p].forEach(function(H) {
-                            F.set(H, "dummy" + p), n.dummyToNodeForHorizontalAlignment.get("dummy" + p).push(H), n.fixedNodeSet.has(H) && n.fixedNodesOnVertical.add("dummy" + p);
+                        for (var D = this.constraints.alignmentConstraint.horizontal, p = 0; p < D.length; p++)
+                          this.dummyToNodeForHorizontalAlignment.set("dummy" + p, []), D[p].forEach(function(H) {
+                            S.set(H, "dummy" + p), n.dummyToNodeForHorizontalAlignment.get("dummy" + p).push(H), n.fixedNodeSet.has(H) && n.fixedNodesOnVertical.add("dummy" + p);
                           });
                     }
                     if (s.RELAX_MOVEMENT_ON_CONSTRAINTS)
@@ -2140,40 +2140,40 @@ function vr() {
                           var H = M.has(w.left) ? M.get(w.left) : w.left, $ = M.has(w.right) ? M.get(w.right) : w.right;
                           n.nodesInRelativeHorizontal.includes(H) || (n.nodesInRelativeHorizontal.push(H), n.nodeToRelativeConstraintMapHorizontal.set(H, []), n.dummyToNodeForVerticalAlignment.has(H) ? n.nodeToTempPositionMapHorizontal.set(H, n.idToNodeMap.get(n.dummyToNodeForVerticalAlignment.get(H)[0]).getCenterX()) : n.nodeToTempPositionMapHorizontal.set(H, n.idToNodeMap.get(H).getCenterX())), n.nodesInRelativeHorizontal.includes($) || (n.nodesInRelativeHorizontal.push($), n.nodeToRelativeConstraintMapHorizontal.set($, []), n.dummyToNodeForVerticalAlignment.has($) ? n.nodeToTempPositionMapHorizontal.set($, n.idToNodeMap.get(n.dummyToNodeForVerticalAlignment.get($)[0]).getCenterX()) : n.nodeToTempPositionMapHorizontal.set($, n.idToNodeMap.get($).getCenterX())), n.nodeToRelativeConstraintMapHorizontal.get(H).push({ right: $, gap: w.gap }), n.nodeToRelativeConstraintMapHorizontal.get($).push({ left: H, gap: w.gap });
                         } else {
-                          var _ = F.has(w.top) ? F.get(w.top) : w.top, ht = F.has(w.bottom) ? F.get(w.bottom) : w.bottom;
+                          var _ = S.has(w.top) ? S.get(w.top) : w.top, ht = S.has(w.bottom) ? S.get(w.bottom) : w.bottom;
                           n.nodesInRelativeVertical.includes(_) || (n.nodesInRelativeVertical.push(_), n.nodeToRelativeConstraintMapVertical.set(_, []), n.dummyToNodeForHorizontalAlignment.has(_) ? n.nodeToTempPositionMapVertical.set(_, n.idToNodeMap.get(n.dummyToNodeForHorizontalAlignment.get(_)[0]).getCenterY()) : n.nodeToTempPositionMapVertical.set(_, n.idToNodeMap.get(_).getCenterY())), n.nodesInRelativeVertical.includes(ht) || (n.nodesInRelativeVertical.push(ht), n.nodeToRelativeConstraintMapVertical.set(ht, []), n.dummyToNodeForHorizontalAlignment.has(ht) ? n.nodeToTempPositionMapVertical.set(ht, n.idToNodeMap.get(n.dummyToNodeForHorizontalAlignment.get(ht)[0]).getCenterY()) : n.nodeToTempPositionMapVertical.set(ht, n.idToNodeMap.get(ht).getCenterY())), n.nodeToRelativeConstraintMapVertical.get(_).push({ bottom: ht, gap: w.gap }), n.nodeToRelativeConstraintMapVertical.get(ht).push({ top: _, gap: w.gap });
                         }
                       });
                     else {
-                      var k = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map();
+                      var q = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map();
                       this.constraints.relativePlacementConstraint.forEach(function(w) {
                         if (w.left) {
                           var H = M.has(w.left) ? M.get(w.left) : w.left, $ = M.has(w.right) ? M.get(w.right) : w.right;
-                          k.has(H) ? k.get(H).push($) : k.set(H, [$]), k.has($) ? k.get($).push(H) : k.set($, [H]);
+                          q.has(H) ? q.get(H).push($) : q.set(H, [$]), q.has($) ? q.get($).push(H) : q.set($, [H]);
                         } else {
-                          var _ = F.has(w.top) ? F.get(w.top) : w.top, ht = F.has(w.bottom) ? F.get(w.bottom) : w.bottom;
+                          var _ = S.has(w.top) ? S.get(w.top) : w.top, ht = S.has(w.bottom) ? S.get(w.bottom) : w.bottom;
                           V.has(_) ? V.get(_).push(ht) : V.set(_, [ht]), V.has(ht) ? V.get(ht).push(_) : V.set(ht, [_]);
                         }
                       });
-                      var Y = function(H, $) {
-                        var _ = [], ht = [], q = new Q(), It = /* @__PURE__ */ new Set(), Nt = 0;
-                        return H.forEach(function(vt, it) {
-                          if (!It.has(it)) {
+                      var X = function(H, $) {
+                        var _ = [], ht = [], Q = new K(), It = /* @__PURE__ */ new Set(), Nt = 0;
+                        return H.forEach(function(vt, rt) {
+                          if (!It.has(rt)) {
                             _[Nt] = [], ht[Nt] = !1;
-                            var gt = it;
-                            for (q.push(gt), It.add(gt), _[Nt].push(gt); q.length != 0; ) {
-                              gt = q.shift(), $.has(gt) && (ht[Nt] = !0);
+                            var gt = rt;
+                            for (Q.push(gt), It.add(gt), _[Nt].push(gt); Q.length != 0; ) {
+                              gt = Q.shift(), $.has(gt) && (ht[Nt] = !0);
                               var mt = H.get(gt);
                               mt.forEach(function(At) {
-                                It.has(At) || (q.push(At), It.add(At), _[Nt].push(At));
+                                It.has(At) || (Q.push(At), It.add(At), _[Nt].push(At));
                               });
                             }
                             Nt++;
                           }
                         }), { components: _, isFixed: ht };
-                      }, et = Y(k, n.fixedNodesOnHorizontal);
+                      }, et = X(q, n.fixedNodesOnHorizontal);
                       this.componentsOnHorizontal = et.components, this.fixedComponentsOnHorizontal = et.isFixed;
-                      var z = Y(V, n.fixedNodesOnVertical);
+                      var z = X(V, n.fixedNodesOnVertical);
                       this.componentsOnVertical = z.components, this.fixedComponentsOnVertical = z.isFixed;
                     }
                   }
@@ -2197,14 +2197,14 @@ function vr() {
                       }
                     if (this.constraints.alignmentConstraint.horizontal)
                       for (var M = this.constraints.alignmentConstraint.horizontal, p = 0; p < M.length; p++) {
-                        for (var F = 0, y = 0; y < M[p].length; y++) {
+                        for (var S = 0, y = 0; y < M[p].length; y++) {
                           if (this.fixedNodeSet.has(M[p][y])) {
-                            F = 0;
+                            S = 0;
                             break;
                           }
-                          F += this.idToNodeMap.get(M[p][y]).displacementY;
+                          S += this.idToNodeMap.get(M[p][y]).displacementY;
                         }
-                        for (var W = F / M[p].length, y = 0; y < M[p].length; y++)
+                        for (var W = S / M[p].length, y = 0; y < M[p].length; y++)
                           this.idToNodeMap.get(M[p][y]).displacementY = W;
                       }
                   }
@@ -2243,43 +2243,43 @@ function vr() {
                       });
                     else {
                       for (var p = 0; p < this.componentsOnHorizontal.length; p++) {
-                        var x = this.componentsOnHorizontal[p];
+                        var D = this.componentsOnHorizontal[p];
                         if (this.fixedComponentsOnHorizontal[p])
-                          for (var y = 0; y < x.length; y++)
-                            this.dummyToNodeForVerticalAlignment.has(x[y]) ? this.dummyToNodeForVerticalAlignment.get(x[y]).forEach(function(H) {
+                          for (var y = 0; y < D.length; y++)
+                            this.dummyToNodeForVerticalAlignment.has(D[y]) ? this.dummyToNodeForVerticalAlignment.get(D[y]).forEach(function(H) {
                               n.idToNodeMap.get(H).displacementX = 0;
-                            }) : this.idToNodeMap.get(x[y]).displacementX = 0;
+                            }) : this.idToNodeMap.get(D[y]).displacementX = 0;
                         else {
-                          for (var k = 0, V = 0, y = 0; y < x.length; y++)
-                            if (this.dummyToNodeForVerticalAlignment.has(x[y])) {
-                              var Y = this.dummyToNodeForVerticalAlignment.get(x[y]);
-                              k += Y.length * this.idToNodeMap.get(Y[0]).displacementX, V += Y.length;
+                          for (var q = 0, V = 0, y = 0; y < D.length; y++)
+                            if (this.dummyToNodeForVerticalAlignment.has(D[y])) {
+                              var X = this.dummyToNodeForVerticalAlignment.get(D[y]);
+                              q += X.length * this.idToNodeMap.get(X[0]).displacementX, V += X.length;
                             } else
-                              k += this.idToNodeMap.get(x[y]).displacementX, V++;
-                          for (var et = k / V, y = 0; y < x.length; y++)
-                            this.dummyToNodeForVerticalAlignment.has(x[y]) ? this.dummyToNodeForVerticalAlignment.get(x[y]).forEach(function(H) {
+                              q += this.idToNodeMap.get(D[y]).displacementX, V++;
+                          for (var et = q / V, y = 0; y < D.length; y++)
+                            this.dummyToNodeForVerticalAlignment.has(D[y]) ? this.dummyToNodeForVerticalAlignment.get(D[y]).forEach(function(H) {
                               n.idToNodeMap.get(H).displacementX = et;
-                            }) : this.idToNodeMap.get(x[y]).displacementX = et;
+                            }) : this.idToNodeMap.get(D[y]).displacementX = et;
                         }
                       }
                       for (var p = 0; p < this.componentsOnVertical.length; p++) {
-                        var x = this.componentsOnVertical[p];
+                        var D = this.componentsOnVertical[p];
                         if (this.fixedComponentsOnVertical[p])
-                          for (var y = 0; y < x.length; y++)
-                            this.dummyToNodeForHorizontalAlignment.has(x[y]) ? this.dummyToNodeForHorizontalAlignment.get(x[y]).forEach(function($) {
+                          for (var y = 0; y < D.length; y++)
+                            this.dummyToNodeForHorizontalAlignment.has(D[y]) ? this.dummyToNodeForHorizontalAlignment.get(D[y]).forEach(function($) {
                               n.idToNodeMap.get($).displacementY = 0;
-                            }) : this.idToNodeMap.get(x[y]).displacementY = 0;
+                            }) : this.idToNodeMap.get(D[y]).displacementY = 0;
                         else {
-                          for (var k = 0, V = 0, y = 0; y < x.length; y++)
-                            if (this.dummyToNodeForHorizontalAlignment.has(x[y])) {
-                              var Y = this.dummyToNodeForHorizontalAlignment.get(x[y]);
-                              k += Y.length * this.idToNodeMap.get(Y[0]).displacementY, V += Y.length;
+                          for (var q = 0, V = 0, y = 0; y < D.length; y++)
+                            if (this.dummyToNodeForHorizontalAlignment.has(D[y])) {
+                              var X = this.dummyToNodeForHorizontalAlignment.get(D[y]);
+                              q += X.length * this.idToNodeMap.get(X[0]).displacementY, V += X.length;
                             } else
-                              k += this.idToNodeMap.get(x[y]).displacementY, V++;
-                          for (var et = k / V, y = 0; y < x.length; y++)
-                            this.dummyToNodeForHorizontalAlignment.has(x[y]) ? this.dummyToNodeForHorizontalAlignment.get(x[y]).forEach(function(q) {
-                              n.idToNodeMap.get(q).displacementY = et;
-                            }) : this.idToNodeMap.get(x[y]).displacementY = et;
+                              q += this.idToNodeMap.get(D[y]).displacementY, V++;
+                          for (var et = q / V, y = 0; y < D.length; y++)
+                            this.dummyToNodeForHorizontalAlignment.has(D[y]) ? this.dummyToNodeForHorizontalAlignment.get(D[y]).forEach(function(Q) {
+                              n.idToNodeMap.get(Q).displacementY = et;
+                            }) : this.idToNodeMap.get(D[y]).displacementY = et;
                         }
                       }
                     }
@@ -2302,14 +2302,14 @@ function vr() {
                         var M = [];
                         if (M = M.concat(y.getEdgeListToNode(R)), M = M.concat(R.getEdgeListToNode(y)), !m.has(M[0])) {
                           if (M.length > 1) {
-                            var F;
-                            for (F = 0; F < M.length; F++) {
-                              var W = M[F];
+                            var S;
+                            for (S = 0; S < M.length; S++) {
+                              var W = M[S];
                               W.getBendpoints().push(new v()), this.createDummyNodesForBendpoints(W);
                             }
                           }
-                          M.forEach(function(x) {
-                            m.add(x);
+                          M.forEach(function(D) {
+                            m.add(D);
                           });
                         }
                       }
@@ -2318,41 +2318,41 @@ function vr() {
                       break;
                   }
                 }, O.prototype.positionNodesRadially = function(n) {
-                  for (var m = new d(0, 0), p = Math.ceil(Math.sqrt(n.length)), E = 0, y = 0, R = 0, M = new v(0, 0), F = 0; F < n.length; F++) {
-                    F % p == 0 && (R = 0, y = E, F != 0 && (y += s.DEFAULT_COMPONENT_SEPERATION), E = 0);
-                    var W = n[F], x = S.findCenterOfTree(W);
-                    m.x = R, m.y = y, M = O.radialLayout(W, x, m), M.y > E && (E = Math.floor(M.y)), R = Math.floor(M.x + s.DEFAULT_COMPONENT_SEPERATION);
+                  for (var m = new d(0, 0), p = Math.ceil(Math.sqrt(n.length)), E = 0, y = 0, R = 0, M = new v(0, 0), S = 0; S < n.length; S++) {
+                    S % p == 0 && (R = 0, y = E, S != 0 && (y += s.DEFAULT_COMPONENT_SEPERATION), E = 0);
+                    var W = n[S], D = b.findCenterOfTree(W);
+                    m.x = R, m.y = y, M = O.radialLayout(W, D, m), M.y > E && (E = Math.floor(M.y)), R = Math.floor(M.x + s.DEFAULT_COMPONENT_SEPERATION);
                   }
                   this.transform(new v(T.WORLD_CENTER_X - M.x / 2, T.WORLD_CENTER_Y - M.y / 2));
                 }, O.radialLayout = function(n, m, p) {
                   var E = Math.max(this.maxDiagonalInTree(n), s.DEFAULT_RADIAL_SEPARATION);
                   O.branchRadialLayout(m, null, 0, 359, 0, E);
-                  var y = K.calculateBounds(n), R = new X();
+                  var y = k.calculateBounds(n), R = new Y();
                   R.setDeviceOrgX(y.getMinX()), R.setDeviceOrgY(y.getMinY()), R.setWorldOrgX(p.x), R.setWorldOrgY(p.y);
                   for (var M = 0; M < n.length; M++) {
-                    var F = n[M];
-                    F.transform(R);
+                    var S = n[M];
+                    S.transform(R);
                   }
                   var W = new v(y.getMaxX(), y.getMaxY());
                   return R.inverseTransformPoint(W);
                 }, O.branchRadialLayout = function(n, m, p, E, y, R) {
                   var M = (E - p + 1) / 2;
                   M < 0 && (M += 180);
-                  var F = (M + p) % 360, W = F * G.TWO_PI / 360, x = y * Math.cos(W), k = y * Math.sin(W);
-                  n.setCenter(x, k);
+                  var S = (M + p) % 360, W = S * G.TWO_PI / 360, D = y * Math.cos(W), q = y * Math.sin(W);
+                  n.setCenter(D, q);
                   var V = [];
                   V = V.concat(n.getEdges());
-                  var Y = V.length;
-                  m != null && Y--;
+                  var X = V.length;
+                  m != null && X--;
                   for (var et = 0, z = V.length, w, H = n.getEdgesBetween(m); H.length > 1; ) {
                     var $ = H[0];
                     H.splice(0, 1);
                     var _ = V.indexOf($);
-                    _ >= 0 && V.splice(_, 1), z--, Y--;
+                    _ >= 0 && V.splice(_, 1), z--, X--;
                   }
                   m != null ? w = (V.indexOf(H[0]) + 1) % z : w = 0;
-                  for (var ht = Math.abs(E - p) / Y, q = w; et != Y; q = ++q % z) {
-                    var It = V[q].getOtherEnd(n);
+                  for (var ht = Math.abs(E - p) / X, Q = w; et != X; Q = ++Q % z) {
+                    var It = V[Q].getOtherEnd(n);
                     if (It != m) {
                       var Nt = (p + et * ht) % 360, vt = (Nt + ht) % 360;
                       O.branchRadialLayout(It, n, Nt, vt, y + R, R), et++;
@@ -2374,20 +2374,20 @@ function vr() {
                     this.getNodeDegreeWithChildren(R) === 0 && (M.id == null || !this.getToBeTiled(M)) && p.push(R);
                   }
                   for (var y = 0; y < p.length; y++) {
-                    var R = p[y], F = R.getParent().id;
-                    typeof m[F] > "u" && (m[F] = []), m[F] = m[F].concat(R);
+                    var R = p[y], S = R.getParent().id;
+                    typeof m[S] > "u" && (m[S] = []), m[S] = m[S].concat(R);
                   }
                   Object.keys(m).forEach(function(W) {
                     if (m[W].length > 1) {
-                      var x = "DummyCompound_" + W;
-                      n.memberGroups[x] = m[W];
-                      var k = m[W][0].getParent(), V = new t(n.graphManager);
-                      V.id = x, V.paddingLeft = k.paddingLeft || 0, V.paddingRight = k.paddingRight || 0, V.paddingBottom = k.paddingBottom || 0, V.paddingTop = k.paddingTop || 0, n.idToDummyNode[x] = V;
-                      var Y = n.getGraphManager().add(n.newGraph(), V), et = k.getChild();
+                      var D = "DummyCompound_" + W;
+                      n.memberGroups[D] = m[W];
+                      var q = m[W][0].getParent(), V = new t(n.graphManager);
+                      V.id = D, V.paddingLeft = q.paddingLeft || 0, V.paddingRight = q.paddingRight || 0, V.paddingBottom = q.paddingBottom || 0, V.paddingTop = q.paddingTop || 0, n.idToDummyNode[D] = V;
+                      var X = n.getGraphManager().add(n.newGraph(), V), et = q.getChild();
                       et.add(V);
                       for (var z = 0; z < m[W].length; z++) {
                         var w = m[W][z];
-                        et.remove(w), Y.add(w);
+                        et.remove(w), X.add(w);
                       }
                     }
                   });
@@ -2414,8 +2414,8 @@ function vr() {
                 }, O.prototype.repopulateZeroDegreeMembers = function() {
                   var n = this, m = this.tiledZeroDegreePack;
                   Object.keys(m).forEach(function(p) {
-                    var E = n.idToDummyNode[p], y = E.paddingLeft, R = E.paddingTop, M = E.labelMarginLeft, F = E.labelMarginTop;
-                    n.adjustLocations(m[p], E.rect.x, E.rect.y, y, R, M, F);
+                    var E = n.idToDummyNode[p], y = E.paddingLeft, R = E.paddingTop, M = E.labelMarginLeft, S = E.labelMarginTop;
+                    n.adjustLocations(m[p], E.rect.x, E.rect.y, y, R, M, S);
                   });
                 }, O.prototype.getToBeTiled = function(n) {
                   var m = n.id;
@@ -2461,14 +2461,14 @@ function vr() {
                   }
                 }, O.prototype.adjustLocations = function(n, m, p, E, y, R, M) {
                   m += E + R, p += y + M;
-                  for (var F = m, W = 0; W < n.rows.length; W++) {
-                    var x = n.rows[W];
-                    m = F;
-                    for (var k = 0, V = 0; V < x.length; V++) {
-                      var Y = x[V];
-                      Y.rect.x = m, Y.rect.y = p, m += Y.rect.width + n.horizontalPadding, Y.rect.height > k && (k = Y.rect.height);
+                  for (var S = m, W = 0; W < n.rows.length; W++) {
+                    var D = n.rows[W];
+                    m = S;
+                    for (var q = 0, V = 0; V < D.length; V++) {
+                      var X = D[V];
+                      X.rect.x = m, X.rect.y = p, m += X.rect.width + n.horizontalPadding, X.rect.height > q && (q = X.rect.height);
                     }
-                    p += k + n.verticalPadding;
+                    p += q + n.verticalPadding;
                   }
                 }, O.prototype.tileCompoundMembers = function(n, m) {
                   var p = this;
@@ -2486,14 +2486,14 @@ function vr() {
                   var m = n.width, p = n.height, E = m / p;
                   return E < 1 && (E = 1 / E), E;
                 }, O.prototype.calcIdealRowWidth = function(n, m) {
-                  var p = s.TILING_PADDING_VERTICAL, E = s.TILING_PADDING_HORIZONTAL, y = n.length, R = 0, M = 0, F = 0;
+                  var p = s.TILING_PADDING_VERTICAL, E = s.TILING_PADDING_HORIZONTAL, y = n.length, R = 0, M = 0, S = 0;
                   n.forEach(function(z) {
-                    R += z.getWidth(), M += z.getHeight(), z.getWidth() > F && (F = z.getWidth());
+                    R += z.getWidth(), M += z.getHeight(), z.getWidth() > S && (S = z.getWidth());
                   });
-                  var W = R / y, x = M / y, k = Math.pow(p - E, 2) + 4 * (W + E) * (x + p) * y, V = (E - p + Math.sqrt(k)) / (2 * (W + E)), Y;
-                  m ? (Y = Math.ceil(V), Y == V && Y++) : Y = Math.floor(V);
-                  var et = Y * (W + E) - E;
-                  return F > et && (et = F), et += E * 2, et;
+                  var W = R / y, D = M / y, q = Math.pow(p - E, 2) + 4 * (W + E) * (D + 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;
+                  return S > et && (et = S), et += E * 2, et;
                 }, O.prototype.tileNodesByFavoringDim = function(n, m, p) {
                   var E = s.TILING_PADDING_VERTICAL, y = s.TILING_PADDING_HORIZONTAL, R = s.TILING_COMPARE_BY, M = {
                     rows: [],
@@ -2508,29 +2508,29 @@ function vr() {
                     centerY: 0
                   };
                   R && (M.idealRowWidth = this.calcIdealRowWidth(n, p));
-                  var F = function(w) {
+                  var S = function(w) {
                     return w.rect.width * w.rect.height;
                   }, W = function(w, H) {
-                    return F(H) - F(w);
+                    return S(H) - S(w);
                   };
                   n.sort(function(z, w) {
                     var H = W;
                     return M.idealRowWidth ? (H = R, H(z.id, w.id)) : H(z, w);
                   });
-                  for (var x = 0, k = 0, V = 0; V < n.length; V++) {
-                    var Y = n[V];
-                    x += Y.getCenterX(), k += Y.getCenterY();
+                  for (var D = 0, q = 0, V = 0; V < n.length; V++) {
+                    var X = n[V];
+                    D += X.getCenterX(), q += X.getCenterY();
                   }
-                  M.centerX = x / n.length, M.centerY = k / n.length;
+                  M.centerX = D / n.length, M.centerY = q / n.length;
                   for (var V = 0; V < n.length; V++) {
-                    var Y = n[V];
+                    var X = n[V];
                     if (M.rows.length == 0)
-                      this.insertNodeToRow(M, Y, 0, m);
-                    else if (this.canAddHorizontal(M, Y.rect.width, Y.rect.height)) {
+                      this.insertNodeToRow(M, X, 0, m);
+                    else if (this.canAddHorizontal(M, X.rect.width, X.rect.height)) {
                       var et = M.rows.length - 1;
-                      M.idealRowWidth || (et = this.getShortestRowIndex(M)), this.insertNodeToRow(M, Y, et, m);
+                      M.idealRowWidth || (et = this.getShortestRowIndex(M)), this.insertNodeToRow(M, X, et, m);
                     } else
-                      this.insertNodeToRow(M, Y, M.rows.length, m);
+                      this.insertNodeToRow(M, X, M.rows.length, m);
                     this.shiftToLastRow(M);
                   }
                   return M;
@@ -2542,10 +2542,10 @@ function vr() {
                   }
                   var M = n.rowWidth[p] + m.rect.width;
                   n.rows[p].length > 0 && (M += n.horizontalPadding), n.rowWidth[p] = M, n.width < M && (n.width = M);
-                  var F = m.rect.height;
-                  p > 0 && (F += n.verticalPadding);
+                  var S = m.rect.height;
+                  p > 0 && (S += n.verticalPadding);
                   var W = 0;
-                  F > n.rowHeight[p] && (W = n.rowHeight[p], n.rowHeight[p] = F, W = n.rowHeight[p] - W), n.height += W, n.rows[p].push(m);
+                  S > n.rowHeight[p] && (W = n.rowHeight[p], n.rowHeight[p] = S, W = n.rowHeight[p] - W), n.height += W, n.rows[p].push(m);
                 }, O.prototype.getShortestRowIndex = function(n) {
                   for (var m = -1, p = Number.MAX_VALUE, E = 0; E < n.rows.length; E++)
                     n.rowWidth[E] < p && (m = E, p = n.rowWidth[E]);
@@ -2564,23 +2564,23 @@ function vr() {
                     return !0;
                   var M = n.rowWidth[R];
                   if (M + n.horizontalPadding + m <= n.width) return !0;
-                  var F = 0;
-                  n.rowHeight[R] < p && R > 0 && (F = p + n.verticalPadding - n.rowHeight[R]);
+                  var S = 0;
+                  n.rowHeight[R] < p && R > 0 && (S = p + n.verticalPadding - n.rowHeight[R]);
                   var W;
-                  n.width - M >= m + n.horizontalPadding ? W = (n.height + F) / (M + m + n.horizontalPadding) : W = (n.height + F) / n.width, F = p + n.verticalPadding;
-                  var x;
-                  return n.width < m ? x = (n.height + F) / m : x = (n.height + F) / n.width, x < 1 && (x = 1 / x), W < 1 && (W = 1 / W), W < x;
+                  n.width - M >= m + n.horizontalPadding ? W = (n.height + S) / (M + m + n.horizontalPadding) : W = (n.height + S) / n.width, S = p + n.verticalPadding;
+                  var D;
+                  return n.width < m ? D = (n.height + S) / m : D = (n.height + S) / n.width, D < 1 && (D = 1 / D), W < 1 && (W = 1 / W), W < D;
                 }, O.prototype.shiftToLastRow = function(n) {
                   var m = this.getLongestRowIndex(n), p = n.rowWidth.length - 1, E = n.rows[m], y = E[E.length - 1], R = y.width + n.horizontalPadding;
                   if (n.width - n.rowWidth[p] > R && m != p) {
                     E.splice(-1, 1), n.rows[p].push(y), n.rowWidth[m] = n.rowWidth[m] - R, n.rowWidth[p] = n.rowWidth[p] + R, n.width = n.rowWidth[instance.getLongestRowIndex(n)];
-                    for (var M = Number.MIN_VALUE, F = 0; F < E.length; F++)
-                      E[F].height > M && (M = E[F].height);
+                    for (var M = Number.MIN_VALUE, S = 0; S < E.length; S++)
+                      E[S].height > M && (M = E[S].height);
                     m > 0 && (M += n.verticalPadding);
                     var W = n.rowHeight[m] + n.rowHeight[p];
                     n.rowHeight[m] = M, n.rowHeight[p] < y.height + n.verticalPadding && (n.rowHeight[p] = y.height + n.verticalPadding);
-                    var x = n.rowHeight[m] + n.rowHeight[p];
-                    n.height += x - W, this.shiftToLastRow(n);
+                    var D = n.rowHeight[m] + n.rowHeight[p];
+                    n.height += D - W, this.shiftToLastRow(n);
                   }
                 }, O.prototype.tilingPreLayout = function() {
                   s.TILE && (this.groupZeroDegreeMembers(), this.clearCompounds(), this.clearZeroDegreeMembers());
@@ -2593,15 +2593,15 @@ function vr() {
                     for (var R = 0; R < E.length; R++)
                       if (p = E[R], p.getEdges().length == 1 && !p.getEdges()[0].isInterGraph && p.getChild() == null) {
                         if (s.PURE_INCREMENTAL) {
-                          var M = p.getEdges()[0].getOtherEnd(p), F = new L(p.getCenterX() - M.getCenterX(), p.getCenterY() - M.getCenterY());
-                          y.push([p, p.getEdges()[0], p.getOwner(), F]);
+                          var M = p.getEdges()[0].getOtherEnd(p), S = new L(p.getCenterX() - M.getCenterX(), p.getCenterY() - M.getCenterY());
+                          y.push([p, p.getEdges()[0], p.getOwner(), S]);
                         } else
                           y.push([p, p.getEdges()[0], p.getOwner()]);
                         m = !0;
                       }
                     if (m == !0) {
-                      for (var W = [], x = 0; x < y.length; x++)
-                        y[x][0].getEdges().length == 1 && (W.push(y[x]), y[x][0].getOwner().remove(y[x][0]));
+                      for (var W = [], D = 0; D < y.length; D++)
+                        y[D][0].getEdges().length == 1 && (W.push(y[D]), y[D][0].getOwner().remove(y[D][0]));
                       n.push(W), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
                     }
                   }
@@ -2615,32 +2615,32 @@ function vr() {
                   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, R = p.finishX, M = p.startY, F = p.finishY, W = 0, x = 0, k = 0, V = 0, Y = [W, k, x, V];
+                    var y = p.startX, R = p.finishX, M = p.startY, S = p.finishY, W = 0, D = 0, q = 0, V = 0, X = [W, q, D, V];
                     if (M > 0)
                       for (var et = y; et <= R; et++)
-                        Y[0] += this.grid[et][M - 1].length + this.grid[et][M].length - 1;
+                        X[0] += this.grid[et][M - 1].length + this.grid[et][M].length - 1;
                     if (R < this.grid.length - 1)
-                      for (var et = M; et <= F; et++)
-                        Y[1] += this.grid[R + 1][et].length + this.grid[R][et].length - 1;
-                    if (F < this.grid[0].length - 1)
+                      for (var et = M; et <= S; et++)
+                        X[1] += this.grid[R + 1][et].length + this.grid[R][et].length - 1;
+                    if (S < this.grid[0].length - 1)
                       for (var et = y; et <= R; et++)
-                        Y[2] += this.grid[et][F + 1].length + this.grid[et][F].length - 1;
+                        X[2] += this.grid[et][S + 1].length + this.grid[et][S].length - 1;
                     if (y > 0)
-                      for (var et = M; et <= F; et++)
-                        Y[3] += this.grid[y - 1][et].length + this.grid[y][et].length - 1;
-                    for (var z = C.MAX_VALUE, w, H, $ = 0; $ < Y.length; $++)
-                      Y[$] < z ? (z = Y[$], w = 1, H = $) : Y[$] == z && w++;
+                      for (var et = M; et <= S; et++)
+                        X[3] += this.grid[y - 1][et].length + this.grid[y][et].length - 1;
+                    for (var z = C.MAX_VALUE, w, H, $ = 0; $ < X.length; $++)
+                      X[$] < z ? (z = X[$], w = 1, H = $) : X[$] == z && w++;
                     if (w == 3 && z == 0)
-                      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);
+                      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);
                     else if (w == 2 && z == 0) {
                       var _ = Math.floor(Math.random() * 2);
-                      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;
+                      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;
                     } else if (w == 4 && z == 0) {
                       var _ = Math.floor(Math.random() * 4);
                       m = _;
                     } else
                       m = H;
-                    m == 0 ? E.setCenter(p.getCenterX(), p.getCenterY() - p.getHeight() / 2 - l.DEFAULT_EDGE_LENGTH - E.getHeight() / 2) : m == 1 ? E.setCenter(p.getCenterX() + p.getWidth() / 2 + l.DEFAULT_EDGE_LENGTH + E.getWidth() / 2, p.getCenterY()) : m == 2 ? E.setCenter(p.getCenterX(), p.getCenterY() + p.getHeight() / 2 + l.DEFAULT_EDGE_LENGTH + E.getHeight() / 2) : E.setCenter(p.getCenterX() - p.getWidth() / 2 - l.DEFAULT_EDGE_LENGTH - E.getWidth() / 2, p.getCenterY());
+                    m == 0 ? E.setCenter(p.getCenterX(), p.getCenterY() - p.getHeight() / 2 - f.DEFAULT_EDGE_LENGTH - E.getHeight() / 2) : m == 1 ? E.setCenter(p.getCenterX() + p.getWidth() / 2 + f.DEFAULT_EDGE_LENGTH + E.getWidth() / 2, p.getCenterY()) : m == 2 ? E.setCenter(p.getCenterX(), p.getCenterY() + p.getHeight() / 2 + f.DEFAULT_EDGE_LENGTH + E.getHeight() / 2) : E.setCenter(p.getCenterX() - p.getWidth() / 2 - f.DEFAULT_EDGE_LENGTH - E.getWidth() / 2, p.getCenterY());
                   }
                 }, a.exports = O;
               })
@@ -2648,20 +2648,20 @@ function vr() {
             /***/
             991: (
               /***/
-              ((a, r, e) => {
-                var f = e(551).FDLayoutNode, i = e(551).IMath;
-                function g(o, s, c, l) {
-                  f.call(this, o, s, c, l);
+              ((a, e, r) => {
+                var l = r(551).FDLayoutNode, i = r(551).IMath;
+                function g(o, s, c, f) {
+                  l.call(this, o, s, c, f);
                 }
-                g.prototype = Object.create(f.prototype);
-                for (var t in f)
-                  g[t] = f[t];
+                g.prototype = Object.create(l.prototype);
+                for (var t in l)
+                  g[t] = l[t];
                 g.prototype.calculateDisplacement = function() {
                   var o = this.graphManager.getLayout();
                   this.getChild() != null && this.fixedNodeWeight ? (this.displacementX += o.coolingFactor * (this.springForceX + this.repulsionForceX + this.gravitationForceX) / this.fixedNodeWeight, this.displacementY += o.coolingFactor * (this.springForceY + this.repulsionForceY + this.gravitationForceY) / this.fixedNodeWeight) : (this.displacementX += o.coolingFactor * (this.springForceX + this.repulsionForceX + this.gravitationForceX) / this.noOfChildren, this.displacementY += o.coolingFactor * (this.springForceY + this.repulsionForceY + this.gravitationForceY) / this.noOfChildren), Math.abs(this.displacementX) > o.coolingFactor * o.maxNodeDisplacement && (this.displacementX = o.coolingFactor * o.maxNodeDisplacement * i.sign(this.displacementX)), Math.abs(this.displacementY) > o.coolingFactor * o.maxNodeDisplacement && (this.displacementY = o.coolingFactor * o.maxNodeDisplacement * i.sign(this.displacementY)), this.child && this.child.getNodes().length > 0 && this.propogateDisplacementToChildren(this.displacementX, this.displacementY);
                 }, g.prototype.propogateDisplacementToChildren = function(o, s) {
-                  for (var c = this.getChild().getNodes(), l, T = 0; T < c.length; T++)
-                    l = c[T], l.getChild() == null ? (l.displacementX += o, l.displacementY += s) : l.propogateDisplacementToChildren(o, s);
+                  for (var c = this.getChild().getNodes(), f, T = 0; T < c.length; T++)
+                    f = c[T], f.getChild() == null ? (f.displacementX += o, f.displacementY += s) : f.propogateDisplacementToChildren(o, s);
                 }, g.prototype.move = function() {
                   var o = this.graphManager.getLayout();
                   (this.child == null || this.child.getNodes().length == 0) && (this.moveBy(this.displacementX, this.displacementY), o.totalDisplacement += Math.abs(this.displacementX) + Math.abs(this.displacementY)), this.springForceX = 0, this.springForceY = 0, this.repulsionForceX = 0, this.repulsionForceY = 0, this.gravitationForceX = 0, this.gravitationForceY = 0, this.displacementX = 0, this.displacementY = 0;
@@ -2685,31 +2685,31 @@ function vr() {
             /***/
             902: (
               /***/
-              ((a, r, e) => {
-                function f(c) {
+              ((a, e, r) => {
+                function l(c) {
                   if (Array.isArray(c)) {
-                    for (var l = 0, T = Array(c.length); l < c.length; l++)
-                      T[l] = c[l];
+                    for (var f = 0, T = Array(c.length); f < c.length; f++)
+                      T[f] = c[f];
                     return T;
                   } else
                     return Array.from(c);
                 }
-                var i = e(806), g = e(551).LinkedList, t = e(551).Matrix, o = e(551).SVD;
+                var i = r(806), g = r(551).LinkedList, t = r(551).Matrix, o = r(551).SVD;
                 function s() {
                 }
                 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(), d = /* @__PURE__ */ new Map(), v = [], L = [], S = c.getAllNodes(), C = 0, G = 0; G < S.length; G++) {
-                    var K = S[G];
-                    K.getChild() == null && (d.set(K.id, C++), v.push(K.getCenterX()), L.push(K.getCenterY()), T.set(K.id, K));
+                  var f = {};
+                  f.fixedNodeConstraint = c.constraints.fixedNodeConstraint, f.alignmentConstraint = c.constraints.alignmentConstraint, f.relativePlacementConstraint = c.constraints.relativePlacementConstraint;
+                  for (var T = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), v = [], L = [], b = c.getAllNodes(), C = 0, G = 0; G < b.length; G++) {
+                    var k = b[G];
+                    k.getChild() == null && (d.set(k.id, C++), v.push(k.getCenterX()), L.push(k.getCenterY()), T.set(k.id, k));
                   }
-                  l.relativePlacementConstraint && l.relativePlacementConstraint.forEach(function(b) {
-                    !b.gap && b.gap != 0 && (b.left ? b.gap = i.DEFAULT_EDGE_LENGTH + T.get(b.left).getWidth() / 2 + T.get(b.right).getWidth() / 2 : b.gap = i.DEFAULT_EDGE_LENGTH + T.get(b.top).getHeight() / 2 + T.get(b.bottom).getHeight() / 2);
+                  f.relativePlacementConstraint && f.relativePlacementConstraint.forEach(function(F) {
+                    !F.gap && F.gap != 0 && (F.left ? F.gap = i.DEFAULT_EDGE_LENGTH + T.get(F.left).getWidth() / 2 + T.get(F.right).getWidth() / 2 : F.gap = i.DEFAULT_EDGE_LENGTH + T.get(F.top).getHeight() / 2 + T.get(F.bottom).getHeight() / 2);
                   });
-                  var X = function(U, B) {
+                  var Y = function(U, B) {
                     return { x: U.x - B.x, y: U.y - B.y };
-                  }, Q = function(U) {
+                  }, K = function(U) {
                     var B = 0, J = 0;
                     return U.forEach(function(Z) {
                       B += v[d.get(Z)], J += L[d.get(Z)];
@@ -2810,7 +2810,7 @@ function vr() {
                           if (!Lt) {
                             var bt = !1, zt = void 0;
                             xt.forEach(function(St, Zt) {
-                              St.has([].concat(f(lt))[0]) && (bt = !0, zt = Zt);
+                              St.has([].concat(l(lt))[0]) && (bt = !0, zt = Zt);
                             }), bt ? lt.forEach(function(St) {
                               xt[zt].add(St);
                             }) : xt.push(new Set(lt));
@@ -2854,7 +2854,7 @@ function vr() {
                       });
                     }
                     return tt;
-                  }, rt = function(U) {
+                  }, it = function(U) {
                     var B = 0, J = 0, Z = 0, at = 0;
                     if (U.forEach(function(j) {
                       j.left ? v[d.get(j.left)] - v[d.get(j.right)] >= 0 ? B++ : J++ : L[d.get(j.top)] - L[d.get(j.bottom)] >= 0 ? Z++ : at++;
@@ -2901,143 +2901,143 @@ function vr() {
                         B.get(at.id).push({ id: Z, gap: at.gap, direction: at.direction });
                       });
                     }), B;
-                  }, E = [], y = [], R = !1, M = !1, F = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), k = [];
-                  if (l.fixedNodeConstraint && l.fixedNodeConstraint.forEach(function(b) {
-                    F.add(b.nodeId);
-                  }), l.relativePlacementConstraint && (l.relativePlacementConstraint.forEach(function(b) {
-                    b.left ? (W.has(b.left) ? W.get(b.left).push({ id: b.right, gap: b.gap, direction: "horizontal" }) : W.set(b.left, [{ id: b.right, gap: b.gap, direction: "horizontal" }]), W.has(b.right) || W.set(b.right, [])) : (W.has(b.top) ? W.get(b.top).push({ id: b.bottom, gap: b.gap, direction: "vertical" }) : W.set(b.top, [{ id: b.bottom, gap: b.gap, direction: "vertical" }]), W.has(b.bottom) || W.set(b.bottom, []));
-                  }), x = m(W), k = n(x)), i.TRANSFORM_ON_CONSTRAINT_HANDLING) {
-                    if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 1)
-                      l.fixedNodeConstraint.forEach(function(b, U) {
-                        E[U] = [b.position.x, b.position.y], y[U] = [v[d.get(b.nodeId)], L[d.get(b.nodeId)]];
+                  }, E = [], y = [], R = !1, M = !1, S = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), q = [];
+                  if (f.fixedNodeConstraint && f.fixedNodeConstraint.forEach(function(F) {
+                    S.add(F.nodeId);
+                  }), f.relativePlacementConstraint && (f.relativePlacementConstraint.forEach(function(F) {
+                    F.left ? (W.has(F.left) ? W.get(F.left).push({ id: F.right, gap: F.gap, direction: "horizontal" }) : W.set(F.left, [{ id: F.right, gap: F.gap, direction: "horizontal" }]), W.has(F.right) || W.set(F.right, [])) : (W.has(F.top) ? W.get(F.top).push({ id: F.bottom, gap: F.gap, direction: "vertical" }) : W.set(F.top, [{ id: F.bottom, gap: F.gap, direction: "vertical" }]), W.has(F.bottom) || W.set(F.bottom, []));
+                  }), D = m(W), q = n(D)), i.TRANSFORM_ON_CONSTRAINT_HANDLING) {
+                    if (f.fixedNodeConstraint && f.fixedNodeConstraint.length > 1)
+                      f.fixedNodeConstraint.forEach(function(F, U) {
+                        E[U] = [F.position.x, F.position.y], y[U] = [v[d.get(F.nodeId)], L[d.get(F.nodeId)]];
                       }), R = !0;
-                    else if (l.alignmentConstraint)
+                    else if (f.alignmentConstraint)
                       (function() {
-                        var b = 0;
-                        if (l.alignmentConstraint.vertical) {
-                          for (var U = l.alignmentConstraint.vertical, B = function(tt) {
+                        var F = 0;
+                        if (f.alignmentConstraint.vertical) {
+                          for (var U = f.alignmentConstraint.vertical, B = function(tt) {
                             var j = /* @__PURE__ */ new Set();
                             U[tt].forEach(function(pt) {
                               j.add(pt);
                             });
-                            var ut = new Set([].concat(f(j)).filter(function(pt) {
-                              return F.has(pt);
+                            var ut = new Set([].concat(l(j)).filter(function(pt) {
+                              return S.has(pt);
                             })), Mt = void 0;
-                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = Q(j).x, U[tt].forEach(function(pt) {
-                              E[b] = [Mt, L[d.get(pt)]], y[b] = [v[d.get(pt)], L[d.get(pt)]], b++;
+                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = K(j).x, U[tt].forEach(function(pt) {
+                              E[F] = [Mt, L[d.get(pt)]], y[F] = [v[d.get(pt)], L[d.get(pt)]], F++;
                             });
                           }, J = 0; J < U.length; J++)
                             B(J);
                           R = !0;
                         }
-                        if (l.alignmentConstraint.horizontal) {
-                          for (var Z = l.alignmentConstraint.horizontal, at = function(tt) {
+                        if (f.alignmentConstraint.horizontal) {
+                          for (var Z = f.alignmentConstraint.horizontal, at = function(tt) {
                             var j = /* @__PURE__ */ new Set();
                             Z[tt].forEach(function(pt) {
                               j.add(pt);
                             });
-                            var ut = new Set([].concat(f(j)).filter(function(pt) {
-                              return F.has(pt);
+                            var ut = new Set([].concat(l(j)).filter(function(pt) {
+                              return S.has(pt);
                             })), Mt = void 0;
-                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = Q(j).y, Z[tt].forEach(function(pt) {
-                              E[b] = [v[d.get(pt)], Mt], y[b] = [v[d.get(pt)], L[d.get(pt)]], b++;
+                            ut.size > 0 ? Mt = v[d.get(ut.values().next().value)] : Mt = K(j).y, Z[tt].forEach(function(pt) {
+                              E[F] = [v[d.get(pt)], Mt], y[F] = [v[d.get(pt)], L[d.get(pt)]], F++;
                             });
                           }, ct = 0; ct < Z.length; ct++)
                             at(ct);
                           R = !0;
                         }
-                        l.relativePlacementConstraint && (M = !0);
+                        f.relativePlacementConstraint && (M = !0);
                       })();
-                    else if (l.relativePlacementConstraint) {
-                      for (var V = 0, Y = 0, et = 0; et < k.length; et++)
-                        k[et].length > V && (V = k[et].length, Y = et);
-                      if (V < x.size / 2)
-                        rt(l.relativePlacementConstraint), R = !1, M = !1;
+                    else if (f.relativePlacementConstraint) {
+                      for (var V = 0, X = 0, et = 0; et < q.length; et++)
+                        q[et].length > V && (V = q[et].length, X = et);
+                      if (V < D.size / 2)
+                        it(f.relativePlacementConstraint), R = !1, M = !1;
                       else {
                         var z = /* @__PURE__ */ new Map(), w = /* @__PURE__ */ new Map(), H = [];
-                        k[Y].forEach(function(b) {
-                          W.get(b).forEach(function(U) {
-                            U.direction == "horizontal" ? (z.has(b) ? z.get(b).push(U) : z.set(b, [U]), z.has(U.id) || z.set(U.id, []), H.push({ left: b, right: U.id })) : (w.has(b) ? w.get(b).push(U) : w.set(b, [U]), w.has(U.id) || w.set(U.id, []), H.push({ top: b, bottom: U.id }));
+                        q[X].forEach(function(F) {
+                          W.get(F).forEach(function(U) {
+                            U.direction == "horizontal" ? (z.has(F) ? z.get(F).push(U) : z.set(F, [U]), z.has(U.id) || z.set(U.id, []), H.push({ left: F, right: U.id })) : (w.has(F) ? w.get(F).push(U) : w.set(F, [U]), w.has(U.id) || w.set(U.id, []), H.push({ top: F, bottom: U.id }));
                           });
-                        }), rt(H), M = !1;
+                        }), it(H), M = !1;
                         var $ = O(z, "horizontal"), _ = O(w, "vertical");
-                        k[Y].forEach(function(b, U) {
-                          y[U] = [v[d.get(b)], L[d.get(b)]], E[U] = [], $.has(b) ? E[U][0] = $.get(b) : E[U][0] = v[d.get(b)], _.has(b) ? E[U][1] = _.get(b) : E[U][1] = L[d.get(b)];
+                        q[X].forEach(function(F, U) {
+                          y[U] = [v[d.get(F)], L[d.get(F)]], E[U] = [], $.has(F) ? E[U][0] = $.get(F) : E[U][0] = v[d.get(F)], _.has(F) ? E[U][1] = _.get(F) : E[U][1] = L[d.get(F)];
                         }), R = !0;
                       }
                     }
                     if (R) {
-                      for (var ht = void 0, q = t.transpose(E), It = t.transpose(y), Nt = 0; Nt < q.length; Nt++)
-                        q[Nt] = t.multGamma(q[Nt]), It[Nt] = t.multGamma(It[Nt]);
-                      var vt = t.multMat(q, t.transpose(It)), it = o.svd(vt);
-                      ht = t.multMat(it.V, t.transpose(it.U));
+                      for (var ht = void 0, Q = t.transpose(E), It = t.transpose(y), Nt = 0; Nt < Q.length; Nt++)
+                        Q[Nt] = t.multGamma(Q[Nt]), It[Nt] = t.multGamma(It[Nt]);
+                      var vt = t.multMat(Q, t.transpose(It)), rt = o.svd(vt);
+                      ht = t.multMat(rt.V, t.transpose(rt.U));
                       for (var gt = 0; gt < d.size; gt++) {
                         var mt = [v[gt], L[gt]], At = [ht[0][0], ht[1][0]], Ot = [ht[0][1], ht[1][1]];
                         v[gt] = t.dotProduct(mt, At), L[gt] = t.dotProduct(mt, Ot);
                       }
-                      M && rt(l.relativePlacementConstraint);
+                      M && it(f.relativePlacementConstraint);
                     }
                   }
                   if (i.ENFORCE_CONSTRAINTS) {
-                    if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 0) {
+                    if (f.fixedNodeConstraint && f.fixedNodeConstraint.length > 0) {
                       var Et = { x: 0, y: 0 };
-                      l.fixedNodeConstraint.forEach(function(b, U) {
-                        var B = { x: v[d.get(b.nodeId)], y: L[d.get(b.nodeId)] }, J = b.position, Z = X(J, B);
+                      f.fixedNodeConstraint.forEach(function(F, U) {
+                        var B = { x: v[d.get(F.nodeId)], y: L[d.get(F.nodeId)] }, J = F.position, Z = Y(J, B);
                         Et.x += Z.x, Et.y += Z.y;
-                      }), Et.x /= l.fixedNodeConstraint.length, Et.y /= l.fixedNodeConstraint.length, v.forEach(function(b, U) {
+                      }), Et.x /= f.fixedNodeConstraint.length, Et.y /= f.fixedNodeConstraint.length, v.forEach(function(F, U) {
                         v[U] += Et.x;
-                      }), L.forEach(function(b, U) {
+                      }), L.forEach(function(F, U) {
                         L[U] += Et.y;
-                      }), l.fixedNodeConstraint.forEach(function(b) {
-                        v[d.get(b.nodeId)] = b.position.x, L[d.get(b.nodeId)] = b.position.y;
+                      }), f.fixedNodeConstraint.forEach(function(F) {
+                        v[d.get(F.nodeId)] = F.position.x, L[d.get(F.nodeId)] = F.position.y;
                       });
                     }
-                    if (l.alignmentConstraint) {
-                      if (l.alignmentConstraint.vertical)
-                        for (var Dt = l.alignmentConstraint.vertical, Rt = function(U) {
+                    if (f.alignmentConstraint) {
+                      if (f.alignmentConstraint.vertical)
+                        for (var Dt = f.alignmentConstraint.vertical, Rt = function(U) {
                           var B = /* @__PURE__ */ new Set();
                           Dt[U].forEach(function(at) {
                             B.add(at);
                           });
-                          var J = new Set([].concat(f(B)).filter(function(at) {
-                            return F.has(at);
+                          var J = new Set([].concat(l(B)).filter(function(at) {
+                            return S.has(at);
                           })), Z = void 0;
-                          J.size > 0 ? Z = v[d.get(J.values().next().value)] : Z = Q(B).x, B.forEach(function(at) {
-                            F.has(at) || (v[d.get(at)] = Z);
+                          J.size > 0 ? Z = v[d.get(J.values().next().value)] : Z = K(B).x, B.forEach(function(at) {
+                            S.has(at) || (v[d.get(at)] = Z);
                           });
                         }, Ht = 0; Ht < Dt.length; Ht++)
                           Rt(Ht);
-                      if (l.alignmentConstraint.horizontal)
-                        for (var Ut = l.alignmentConstraint.horizontal, Pt = function(U) {
+                      if (f.alignmentConstraint.horizontal)
+                        for (var Ut = f.alignmentConstraint.horizontal, Pt = function(U) {
                           var B = /* @__PURE__ */ new Set();
                           Ut[U].forEach(function(at) {
                             B.add(at);
                           });
-                          var J = new Set([].concat(f(B)).filter(function(at) {
-                            return F.has(at);
+                          var J = new Set([].concat(l(B)).filter(function(at) {
+                            return S.has(at);
                           })), Z = void 0;
-                          J.size > 0 ? Z = L[d.get(J.values().next().value)] : Z = Q(B).y, B.forEach(function(at) {
-                            F.has(at) || (L[d.get(at)] = Z);
+                          J.size > 0 ? Z = L[d.get(J.values().next().value)] : Z = K(B).y, B.forEach(function(at) {
+                            S.has(at) || (L[d.get(at)] = Z);
                           });
                         }, Ft = 0; Ft < Ut.length; Ft++)
                           Pt(Ft);
                     }
-                    l.relativePlacementConstraint && (function() {
-                      var b = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
-                      if (F.forEach(function(Gt) {
+                    f.relativePlacementConstraint && (function() {
+                      var F = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
+                      if (S.forEach(function(Gt) {
                         ct.add(Gt), nt.add(Gt);
-                      }), l.alignmentConstraint) {
-                        if (l.alignmentConstraint.vertical)
-                          for (var tt = l.alignmentConstraint.vertical, j = function(yt) {
+                      }), f.alignmentConstraint) {
+                        if (f.alignmentConstraint.vertical)
+                          for (var tt = f.alignmentConstraint.vertical, j = function(yt) {
                             B.set("dummy" + yt, []), tt[yt].forEach(function(wt) {
-                              b.set(wt, "dummy" + yt), B.get("dummy" + yt).push(wt), F.has(wt) && ct.add("dummy" + yt);
+                              F.set(wt, "dummy" + yt), B.get("dummy" + yt).push(wt), S.has(wt) && ct.add("dummy" + yt);
                             }), Z.set("dummy" + yt, v[d.get(tt[yt][0])]);
                           }, ut = 0; ut < tt.length; ut++)
                             j(ut);
-                        if (l.alignmentConstraint.horizontal)
-                          for (var Mt = l.alignmentConstraint.horizontal, pt = function(yt) {
+                        if (f.alignmentConstraint.horizontal)
+                          for (var Mt = f.alignmentConstraint.horizontal, pt = function(yt) {
                             J.set("dummy" + yt, []), Mt[yt].forEach(function(wt) {
-                              U.set(wt, "dummy" + yt), J.get("dummy" + yt).push(wt), F.has(wt) && nt.add("dummy" + yt);
+                              U.set(wt, "dummy" + yt), J.get("dummy" + yt).push(wt), S.has(wt) && nt.add("dummy" + yt);
                             }), at.set("dummy" + yt, L[d.get(Mt[yt][0])]);
                           }, xt = 0; xt < Mt.length; xt++)
                             pt(xt);
@@ -3045,7 +3045,7 @@ function vr() {
                       var lt = /* @__PURE__ */ new Map(), ot = /* @__PURE__ */ new Map(), Lt = function(yt) {
                         W.get(yt).forEach(function(wt) {
                           var kt = void 0, Bt = void 0;
-                          wt.direction == "horizontal" ? (kt = b.get(yt) ? b.get(yt) : yt, b.get(wt.id) ? Bt = { id: b.get(wt.id), gap: wt.gap, direction: wt.direction } : Bt = wt, lt.has(kt) ? lt.get(kt).push(Bt) : lt.set(kt, [Bt]), lt.has(Bt.id) || lt.set(Bt.id, [])) : (kt = U.get(yt) ? U.get(yt) : yt, U.get(wt.id) ? Bt = { id: U.get(wt.id), gap: wt.gap, direction: wt.direction } : Bt = wt, ot.has(kt) ? ot.get(kt).push(Bt) : ot.set(kt, [Bt]), ot.has(Bt.id) || ot.set(Bt.id, []));
+                          wt.direction == "horizontal" ? (kt = F.get(yt) ? F.get(yt) : yt, F.get(wt.id) ? Bt = { id: F.get(wt.id), gap: wt.gap, direction: wt.direction } : Bt = wt, lt.has(kt) ? lt.get(kt).push(Bt) : lt.set(kt, [Bt]), lt.has(Bt.id) || lt.set(Bt.id, [])) : (kt = U.get(yt) ? U.get(yt) : yt, U.get(wt.id) ? Bt = { id: U.get(wt.id), gap: wt.gap, direction: wt.direction } : Bt = wt, ot.has(kt) ? ot.get(kt).push(Bt) : ot.set(kt, [Bt]), ot.has(Bt.id) || ot.set(Bt.id, []));
                         });
                       }, ft = !0, st = !1, Xt = void 0;
                       try {
@@ -3115,8 +3115,8 @@ function vr() {
                       }
                     })();
                   }
-                  for (var Yt = 0; Yt < S.length; Yt++) {
-                    var Vt = S[Yt];
+                  for (var Yt = 0; Yt < b.length; Yt++) {
+                    var Vt = b[Yt];
                     Vt.getChild() == null && Vt.setCenter(v[d.get(Vt.id)], L[d.get(Vt.id)]);
                   }
                 }, a.exports = s;
@@ -3132,10 +3132,10 @@ function vr() {
             /******/
           }, N = {};
           function u(a) {
-            var r = N[a];
-            if (r !== void 0)
-              return r.exports;
-            var e = N[a] = {
+            var e = N[a];
+            if (e !== void 0)
+              return e.exports;
+            var r = N[a] = {
               /******/
               // no module.id needed
               /******/
@@ -3144,7 +3144,7 @@ function vr() {
               exports: {}
               /******/
             };
-            return P[a](e, e.exports, u), e.exports;
+            return P[a](r, r.exports, u), r.exports;
           }
           var h = u(45);
           return h;
@@ -3155,7 +3155,7 @@ function vr() {
 }
 var pr = he.exports, De;
 function yr() {
-  return De || (De = 1, (function(I, D) {
+  return De || (De = 1, (function(I, x) {
     (function(P, N) {
       I.exports = N(vr());
     })(pr, function(A) {
@@ -3167,32 +3167,32 @@ function yr() {
             658: (
               /***/
               ((a) => {
-                a.exports = Object.assign != null ? Object.assign.bind(Object) : function(r) {
-                  for (var e = arguments.length, f = Array(e > 1 ? e - 1 : 0), i = 1; i < e; i++)
-                    f[i - 1] = arguments[i];
-                  return f.forEach(function(g) {
+                a.exports = Object.assign != null ? Object.assign.bind(Object) : function(e) {
+                  for (var r = arguments.length, l = Array(r > 1 ? r - 1 : 0), i = 1; i < r; i++)
+                    l[i - 1] = arguments[i];
+                  return l.forEach(function(g) {
                     Object.keys(g).forEach(function(t) {
-                      return r[t] = g[t];
+                      return e[t] = g[t];
                     });
-                  }), r;
+                  }), e;
                 };
               })
             ),
             /***/
             548: (
               /***/
-              ((a, r, e) => {
-                var f = /* @__PURE__ */ (function() {
+              ((a, e, r) => {
+                var l = /* @__PURE__ */ (function() {
                   function t(o, s) {
-                    var c = [], l = !0, T = !1, d = void 0;
+                    var c = [], f = !0, T = !1, d = void 0;
                     try {
-                      for (var v = o[Symbol.iterator](), L; !(l = (L = v.next()).done) && (c.push(L.value), !(s && c.length === s)); l = !0)
+                      for (var v = o[Symbol.iterator](), L; !(f = (L = v.next()).done) && (c.push(L.value), !(s && c.length === s)); f = !0)
                         ;
-                    } catch (S) {
-                      T = !0, d = S;
+                    } catch (b) {
+                      T = !0, d = b;
                     } finally {
                       try {
-                        !l && v.return && v.return();
+                        !f && v.return && v.return();
                       } finally {
                         if (T) throw d;
                       }
@@ -3206,13 +3206,13 @@ function yr() {
                       return t(o, s);
                     throw new TypeError("Invalid attempt to destructure non-iterable instance");
                   };
-                })(), i = e(140).layoutBase.LinkedList, g = {};
+                })(), i = r(140).layoutBase.LinkedList, g = {};
                 g.getTopMostNodes = function(t) {
                   for (var o = {}, s = 0; s < t.length; s++)
                     o[t[s].id()] = !0;
-                  var c = t.filter(function(l, T) {
-                    typeof l == "number" && (l = T);
-                    for (var d = l.parent()[0]; d != null; ) {
+                  var c = t.filter(function(f, T) {
+                    typeof f == "number" && (f = T);
+                    for (var d = f.parent()[0]; d != null; ) {
                       if (o[d.id()])
                         return !1;
                       d = d.parent()[0];
@@ -3221,38 +3221,38 @@ function yr() {
                   });
                   return c;
                 }, g.connectComponents = function(t, o, s, c) {
-                  var l = new i(), T = /* @__PURE__ */ new Set(), d = [], v = void 0, L = void 0, S = void 0, C = !1, G = 1, K = [], X = [], Q = function() {
-                    var rt = t.collection();
-                    X.push(rt);
+                  var f = new i(), T = /* @__PURE__ */ new Set(), d = [], v = void 0, L = void 0, b = void 0, C = !1, G = 1, k = [], Y = [], K = function() {
+                    var it = t.collection();
+                    Y.push(it);
                     var n = s[0], m = t.collection();
                     m.merge(n).merge(n.descendants().intersection(o)), d.push(n), m.forEach(function(y) {
-                      l.push(y), T.add(y), rt.merge(y);
+                      f.push(y), T.add(y), it.merge(y);
                     });
                     for (var p = function() {
-                      n = l.shift();
+                      n = f.shift();
                       var R = t.collection();
-                      n.neighborhood().nodes().forEach(function(x) {
-                        o.intersection(n.edgesWith(x)).length > 0 && R.merge(x);
+                      n.neighborhood().nodes().forEach(function(D) {
+                        o.intersection(n.edgesWith(D)).length > 0 && R.merge(D);
                       });
                       for (var M = 0; M < R.length; M++) {
-                        var F = R[M];
-                        if (v = s.intersection(F.union(F.ancestors())), v != null && !T.has(v[0])) {
+                        var S = R[M];
+                        if (v = s.intersection(S.union(S.ancestors())), v != null && !T.has(v[0])) {
                           var W = v.union(v.descendants());
-                          W.forEach(function(x) {
-                            l.push(x), T.add(x), rt.merge(x), s.has(x) && d.push(x);
+                          W.forEach(function(D) {
+                            f.push(D), T.add(D), it.merge(D), s.has(D) && d.push(D);
                           });
                         }
                       }
-                    }; l.length != 0; )
+                    }; f.length != 0; )
                       p();
-                    if (rt.forEach(function(y) {
+                    if (it.forEach(function(y) {
                       o.intersection(y.connectedEdges()).forEach(function(R) {
-                        rt.has(R.source()) && rt.has(R.target()) && rt.merge(R);
+                        it.has(R.source()) && it.has(R.target()) && it.merge(R);
                       });
                     }), d.length == s.length && (C = !0), !C || C && G > 1) {
-                      L = d[0], S = L.connectedEdges().length, d.forEach(function(y) {
-                        y.connectedEdges().length < S && (S = y.connectedEdges().length, L = y);
-                      }), K.push(L.id());
+                      L = d[0], b = L.connectedEdges().length, d.forEach(function(y) {
+                        y.connectedEdges().length < b && (b = y.connectedEdges().length, L = y);
+                      }), k.push(L.id());
                       var E = t.collection();
                       E.merge(d[0]), d.forEach(function(y) {
                         E.merge(y);
@@ -3260,64 +3260,64 @@ function yr() {
                     }
                   };
                   do
-                    Q();
+                    K();
                   while (!C);
-                  return c && K.length > 0 && c.set("dummy" + (c.size + 1), K), X;
+                  return c && k.length > 0 && c.set("dummy" + (c.size + 1), k), Y;
                 }, g.relocateComponent = function(t, o, s) {
                   if (!s.fixedNodeConstraint) {
-                    var c = Number.POSITIVE_INFINITY, l = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, d = Number.NEGATIVE_INFINITY;
+                    var c = Number.POSITIVE_INFINITY, f = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, d = Number.NEGATIVE_INFINITY;
                     if (s.quality == "draft") {
-                      var v = !0, L = !1, S = void 0;
+                      var v = !0, L = !1, b = void 0;
                       try {
                         for (var C = o.nodeIndexes[Symbol.iterator](), G; !(v = (G = C.next()).done); v = !0) {
-                          var K = G.value, X = f(K, 2), Q = X[0], O = X[1], rt = s.cy.getElementById(Q);
-                          if (rt) {
-                            var n = rt.boundingBox(), m = o.xCoords[O] - n.w / 2, p = o.xCoords[O] + n.w / 2, E = o.yCoords[O] - n.h / 2, y = o.yCoords[O] + n.h / 2;
-                            m < c && (c = m), p > l && (l = p), E < T && (T = E), y > d && (d = y);
+                          var k = G.value, Y = l(k, 2), K = Y[0], O = Y[1], it = s.cy.getElementById(K);
+                          if (it) {
+                            var n = it.boundingBox(), m = o.xCoords[O] - n.w / 2, p = o.xCoords[O] + n.w / 2, E = o.yCoords[O] - n.h / 2, y = o.yCoords[O] + n.h / 2;
+                            m < c && (c = m), p > f && (f = p), E < T && (T = E), y > d && (d = y);
                           }
                         }
-                      } catch (x) {
-                        L = !0, S = x;
+                      } catch (D) {
+                        L = !0, b = D;
                       } finally {
                         try {
                           !v && C.return && C.return();
                         } finally {
                           if (L)
-                            throw S;
+                            throw b;
                         }
                       }
-                      var R = t.x - (l + c) / 2, M = t.y - (d + T) / 2;
-                      o.xCoords = o.xCoords.map(function(x) {
-                        return x + R;
-                      }), o.yCoords = o.yCoords.map(function(x) {
-                        return x + M;
+                      var R = t.x - (f + c) / 2, M = t.y - (d + T) / 2;
+                      o.xCoords = o.xCoords.map(function(D) {
+                        return D + R;
+                      }), o.yCoords = o.yCoords.map(function(D) {
+                        return D + M;
                       });
                     } else {
-                      Object.keys(o).forEach(function(x) {
-                        var k = o[x], V = k.getRect().x, Y = k.getRect().x + k.getRect().width, et = k.getRect().y, z = k.getRect().y + k.getRect().height;
-                        V < c && (c = V), Y > l && (l = Y), et < T && (T = et), z > d && (d = z);
+                      Object.keys(o).forEach(function(D) {
+                        var q = o[D], 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 > f && (f = X), et < T && (T = et), z > d && (d = z);
                       });
-                      var F = t.x - (l + c) / 2, W = t.y - (d + T) / 2;
-                      Object.keys(o).forEach(function(x) {
-                        var k = o[x];
-                        k.setCenter(k.getCenterX() + F, k.getCenterY() + W);
+                      var S = t.x - (f + c) / 2, W = t.y - (d + T) / 2;
+                      Object.keys(o).forEach(function(D) {
+                        var q = o[D];
+                        q.setCenter(q.getCenterX() + S, q.getCenterY() + W);
                       });
                     }
                   }
                 }, g.calcBoundingBox = function(t, o, s, c) {
-                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, d = Number.MAX_SAFE_INTEGER, v = Number.MIN_SAFE_INTEGER, L = void 0, S = void 0, C = void 0, G = void 0, K = t.descendants().not(":parent"), X = K.length, Q = 0; Q < X; Q++) {
-                    var O = K[Q];
-                    L = o[c.get(O.id())] - O.width() / 2, S = o[c.get(O.id())] + O.width() / 2, C = s[c.get(O.id())] - O.height() / 2, G = s[c.get(O.id())] + O.height() / 2, l > L && (l = L), T < S && (T = S), d > C && (d = C), v < G && (v = G);
+                  for (var f = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, d = Number.MAX_SAFE_INTEGER, v = Number.MIN_SAFE_INTEGER, L = void 0, b = void 0, C = void 0, G = void 0, k = t.descendants().not(":parent"), Y = k.length, K = 0; K < Y; K++) {
+                    var O = k[K];
+                    L = o[c.get(O.id())] - O.width() / 2, b = o[c.get(O.id())] + O.width() / 2, C = s[c.get(O.id())] - O.height() / 2, G = s[c.get(O.id())] + O.height() / 2, f > L && (f = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
                   }
-                  var rt = {};
-                  return rt.topLeftX = l, rt.topLeftY = d, rt.width = T - l, rt.height = v - d, rt;
+                  var it = {};
+                  return it.topLeftX = f, it.topLeftY = d, it.width = T - f, it.height = v - d, it;
                 }, g.calcParentsWithoutChildren = function(t, o) {
                   var s = t.collection();
                   return o.nodes(":parent").forEach(function(c) {
-                    var l = !1;
+                    var f = !1;
                     c.children().forEach(function(T) {
-                      T.css("display") != "none" && (l = !0);
-                    }), l || s.merge(c);
+                      T.css("display") != "none" && (f = !0);
+                    }), f || s.merge(c);
                   }), s;
                 }, a.exports = g;
               })
@@ -3325,53 +3325,53 @@ function yr() {
             /***/
             816: (
               /***/
-              ((a, r, e) => {
-                var f = e(548), i = e(140).CoSELayout, g = 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(v, L) {
-                  var S = v.cy, C = v.eles, G = C.nodes(), K = C.edges(), X = void 0, Q = void 0, O = void 0, rt = {};
-                  v.randomize && (X = L.nodeIndexes, Q = L.xCoords, O = L.yCoords);
-                  var n = function(x) {
-                    return typeof x == "function";
-                  }, m = function(x, k) {
-                    return n(x) ? x(k) : x;
-                  }, p = f.calcParentsWithoutChildren(S, C), E = function W(x, k, V, Y) {
-                    for (var et = k.length, z = 0; z < et; z++) {
-                      var w = k[z], H = null;
+              ((a, e, r) => {
+                var l = r(548), i = r(140).CoSELayout, g = r(140).CoSENode, t = r(140).layoutBase.PointD, o = r(140).layoutBase.DimensionD, s = r(140).layoutBase.LayoutConstants, c = r(140).layoutBase.FDLayoutConstants, f = r(140).CoSEConstants, T = function(v, L) {
+                  var b = v.cy, C = v.eles, G = C.nodes(), k = C.edges(), Y = void 0, K = void 0, O = void 0, it = {};
+                  v.randomize && (Y = L.nodeIndexes, K = L.xCoords, O = L.yCoords);
+                  var n = function(D) {
+                    return typeof D == "function";
+                  }, m = function(D, q) {
+                    return n(D) ? D(q) : D;
+                  }, p = l.calcParentsWithoutChildren(b, C), E = function W(D, q, V, X) {
+                    for (var et = q.length, z = 0; z < et; z++) {
+                      var w = q[z], H = null;
                       w.intersection(p).length == 0 && (H = w.children());
                       var $ = void 0, _ = w.layoutDimensions({
-                        nodeDimensionsIncludeLabels: Y.nodeDimensionsIncludeLabels
+                        nodeDimensionsIncludeLabels: X.nodeDimensionsIncludeLabels
                       });
                       if (w.outerWidth() != null && w.outerHeight() != null)
-                        if (Y.randomize)
+                        if (X.randomize)
                           if (!w.isParent())
-                            $ = x.add(new g(V.graphManager, new t(Q[X.get(w.id())] - _.w / 2, O[X.get(w.id())] - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
+                            $ = D.add(new g(V.graphManager, new t(K[Y.get(w.id())] - _.w / 2, O[Y.get(w.id())] - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
                           else {
-                            var ht = f.calcBoundingBox(w, Q, O, X);
-                            w.intersection(p).length == 0 ? $ = x.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(ht.width, ht.height))) : $ = x.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(parseFloat(_.w), parseFloat(_.h))));
+                            var ht = l.calcBoundingBox(w, K, O, Y);
+                            w.intersection(p).length == 0 ? $ = D.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(ht.width, ht.height))) : $ = D.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(parseFloat(_.w), parseFloat(_.h))));
                           }
                         else
-                          $ = x.add(new g(V.graphManager, new t(w.position("x") - _.w / 2, w.position("y") - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
+                          $ = D.add(new g(V.graphManager, new t(w.position("x") - _.w / 2, w.position("y") - _.h / 2), new o(parseFloat(_.w), parseFloat(_.h))));
                       else
-                        $ = x.add(new g(this.graphManager));
-                      if ($.id = w.data("id"), $.nodeRepulsion = m(Y.nodeRepulsion, w), $.paddingLeft = parseInt(w.css("padding")), $.paddingTop = parseInt(w.css("padding")), $.paddingRight = parseInt(w.css("padding")), $.paddingBottom = parseInt(w.css("padding")), Y.nodeDimensionsIncludeLabels && ($.labelWidth = w.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).w, $.labelHeight = w.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).h, $.labelPosVertical = w.css("text-valign"), $.labelPosHorizontal = w.css("text-halign")), rt[w.data("id")] = $, isNaN($.rect.x) && ($.rect.x = 0), isNaN($.rect.y) && ($.rect.y = 0), H != null && H.length > 0) {
-                        var q = void 0;
-                        q = V.getGraphManager().add(V.newGraph(), $), W(q, H, V, Y);
+                        $ = D.add(new g(this.graphManager));
+                      if ($.id = w.data("id"), $.nodeRepulsion = m(X.nodeRepulsion, w), $.paddingLeft = parseInt(w.css("padding")), $.paddingTop = parseInt(w.css("padding")), $.paddingRight = parseInt(w.css("padding")), $.paddingBottom = parseInt(w.css("padding")), X.nodeDimensionsIncludeLabels && ($.labelWidth = w.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).w, $.labelHeight = w.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).h, $.labelPosVertical = w.css("text-valign"), $.labelPosHorizontal = w.css("text-halign")), it[w.data("id")] = $, isNaN($.rect.x) && ($.rect.x = 0), isNaN($.rect.y) && ($.rect.y = 0), H != null && H.length > 0) {
+                        var Q = void 0;
+                        Q = V.getGraphManager().add(V.newGraph(), $), W(Q, H, V, X);
                       }
                     }
-                  }, y = function(x, k, V) {
-                    for (var Y = 0, et = 0, z = 0; z < V.length; z++) {
-                      var w = V[z], H = rt[w.data("source")], $ = rt[w.data("target")];
+                  }, y = function(D, q, V) {
+                    for (var X = 0, et = 0, z = 0; z < V.length; z++) {
+                      var w = V[z], H = it[w.data("source")], $ = it[w.data("target")];
                       if (H && $ && H !== $ && H.getEdgesBetween($).length == 0) {
-                        var _ = k.add(x.newEdge(), H, $);
-                        _.id = w.id(), _.idealLength = m(v.idealEdgeLength, w), _.edgeElasticity = m(v.edgeElasticity, w), Y += _.idealLength, et++;
+                        var _ = q.add(D.newEdge(), H, $);
+                        _.id = w.id(), _.idealLength = m(v.idealEdgeLength, w), _.edgeElasticity = m(v.edgeElasticity, w), X += _.idealLength, et++;
                       }
                     }
-                    v.idealEdgeLength != null && (et > 0 ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = Y / et : n(v.idealEdgeLength) ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = v.idealEdgeLength, l.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, l.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
-                  }, R = function(x, k) {
-                    k.fixedNodeConstraint && (x.constraints.fixedNodeConstraint = k.fixedNodeConstraint), k.alignmentConstraint && (x.constraints.alignmentConstraint = k.alignmentConstraint), k.relativePlacementConstraint && (x.constraints.relativePlacementConstraint = k.relativePlacementConstraint);
+                    v.idealEdgeLength != null && (et > 0 ? f.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = X / et : n(v.idealEdgeLength) ? f.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : f.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = v.idealEdgeLength, f.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, f.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
+                  }, R = function(D, q) {
+                    q.fixedNodeConstraint && (D.constraints.fixedNodeConstraint = q.fixedNodeConstraint), q.alignmentConstraint && (D.constraints.alignmentConstraint = q.alignmentConstraint), q.relativePlacementConstraint && (D.constraints.relativePlacementConstraint = q.relativePlacementConstraint);
                   };
-                  v.nestingFactor != null && (l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = v.nestingFactor), v.gravity != null && (l.DEFAULT_GRAVITY_STRENGTH = c.DEFAULT_GRAVITY_STRENGTH = v.gravity), v.numIter != null && (l.MAX_ITERATIONS = c.MAX_ITERATIONS = v.numIter), v.gravityRange != null && (l.DEFAULT_GRAVITY_RANGE_FACTOR = c.DEFAULT_GRAVITY_RANGE_FACTOR = v.gravityRange), v.gravityCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = v.gravityCompound), v.gravityRangeCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = v.gravityRangeCompound), v.initialEnergyOnIncremental != null && (l.DEFAULT_COOLING_FACTOR_INCREMENTAL = c.DEFAULT_COOLING_FACTOR_INCREMENTAL = v.initialEnergyOnIncremental), v.tilingCompareBy != null && (l.TILING_COMPARE_BY = v.tilingCompareBy), v.quality == "proof" ? s.QUALITY = 2 : s.QUALITY = 0, l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = s.NODE_DIMENSIONS_INCLUDE_LABELS = v.nodeDimensionsIncludeLabels, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !v.randomize, l.ANIMATE = c.ANIMATE = s.ANIMATE = v.animate, l.TILE = v.tile, l.TILING_PADDING_VERTICAL = typeof v.tilingPaddingVertical == "function" ? v.tilingPaddingVertical.call() : v.tilingPaddingVertical, l.TILING_PADDING_HORIZONTAL = typeof v.tilingPaddingHorizontal == "function" ? v.tilingPaddingHorizontal.call() : v.tilingPaddingHorizontal, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !0, l.PURE_INCREMENTAL = !v.randomize, s.DEFAULT_UNIFORM_LEAF_NODE_SIZES = v.uniformNodeDimensions, v.step == "transformed" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !1), v.step == "enforced" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !1), v.step == "cose" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !0), v.step == "all" && (v.randomize ? l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !0), v.fixedNodeConstraint || v.alignmentConstraint || v.relativePlacementConstraint ? l.TREE_REDUCTION_ON_INCREMENTAL = !1 : l.TREE_REDUCTION_ON_INCREMENTAL = !0;
-                  var M = new i(), F = M.newGraphManager();
-                  return E(F.addRoot(), f.getTopMostNodes(G), M, v), y(M, F, K), R(M, v), M.runLayout(), rt;
+                  v.nestingFactor != null && (f.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = v.nestingFactor), v.gravity != null && (f.DEFAULT_GRAVITY_STRENGTH = c.DEFAULT_GRAVITY_STRENGTH = v.gravity), v.numIter != null && (f.MAX_ITERATIONS = c.MAX_ITERATIONS = v.numIter), v.gravityRange != null && (f.DEFAULT_GRAVITY_RANGE_FACTOR = c.DEFAULT_GRAVITY_RANGE_FACTOR = v.gravityRange), v.gravityCompound != null && (f.DEFAULT_COMPOUND_GRAVITY_STRENGTH = c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = v.gravityCompound), v.gravityRangeCompound != null && (f.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = v.gravityRangeCompound), v.initialEnergyOnIncremental != null && (f.DEFAULT_COOLING_FACTOR_INCREMENTAL = c.DEFAULT_COOLING_FACTOR_INCREMENTAL = v.initialEnergyOnIncremental), v.tilingCompareBy != null && (f.TILING_COMPARE_BY = v.tilingCompareBy), v.quality == "proof" ? s.QUALITY = 2 : s.QUALITY = 0, f.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = s.NODE_DIMENSIONS_INCLUDE_LABELS = v.nodeDimensionsIncludeLabels, f.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !v.randomize, f.ANIMATE = c.ANIMATE = s.ANIMATE = v.animate, f.TILE = v.tile, f.TILING_PADDING_VERTICAL = typeof v.tilingPaddingVertical == "function" ? v.tilingPaddingVertical.call() : v.tilingPaddingVertical, f.TILING_PADDING_HORIZONTAL = typeof v.tilingPaddingHorizontal == "function" ? v.tilingPaddingHorizontal.call() : v.tilingPaddingHorizontal, f.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = s.DEFAULT_INCREMENTAL = !0, f.PURE_INCREMENTAL = !v.randomize, s.DEFAULT_UNIFORM_LEAF_NODE_SIZES = v.uniformNodeDimensions, v.step == "transformed" && (f.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, f.ENFORCE_CONSTRAINTS = !1, f.APPLY_LAYOUT = !1), v.step == "enforced" && (f.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, f.ENFORCE_CONSTRAINTS = !0, f.APPLY_LAYOUT = !1), v.step == "cose" && (f.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, f.ENFORCE_CONSTRAINTS = !1, f.APPLY_LAYOUT = !0), v.step == "all" && (v.randomize ? f.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : f.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, f.ENFORCE_CONSTRAINTS = !0, f.APPLY_LAYOUT = !0), v.fixedNodeConstraint || v.alignmentConstraint || v.relativePlacementConstraint ? f.TREE_REDUCTION_ON_INCREMENTAL = !1 : f.TREE_REDUCTION_ON_INCREMENTAL = !0;
+                  var M = new i(), S = M.newGraphManager();
+                  return E(S.addRoot(), l.getTopMostNodes(G), M, v), y(M, S, k), R(M, v), M.runLayout(), it;
                 };
                 a.exports = { coseLayout: T };
               })
@@ -3379,23 +3379,23 @@ function yr() {
             /***/
             212: (
               /***/
-              ((a, r, e) => {
-                var f = /* @__PURE__ */ (function() {
-                  function v(L, S) {
-                    for (var C = 0; C < S.length; C++) {
-                      var G = S[C];
+              ((a, e, r) => {
+                var l = /* @__PURE__ */ (function() {
+                  function v(L, b) {
+                    for (var C = 0; C < b.length; C++) {
+                      var G = b[C];
                       G.enumerable = G.enumerable || !1, G.configurable = !0, "value" in G && (G.writable = !0), Object.defineProperty(L, G.key, G);
                     }
                   }
-                  return function(L, S, C) {
-                    return S && v(L.prototype, S), C && v(L, C), L;
+                  return function(L, b, C) {
+                    return b && v(L.prototype, b), C && v(L, C), L;
                   };
                 })();
                 function i(v, L) {
                   if (!(v instanceof L))
                     throw new TypeError("Cannot call a class as a function");
                 }
-                var g = e(658), t = e(548), o = e(657), s = o.spectralLayout, c = e(816), l = c.coseLayout, T = Object.freeze({
+                var g = r(658), t = r(548), o = r(657), s = o.spectralLayout, c = r(816), f = c.coseLayout, T = Object.freeze({
                   // 'draft', 'default' or 'proof' 
                   // - 'draft' only applies spectral layout 
                   // - 'default' improves the quality with subsequent CoSE layout (fast cooling rate)
@@ -3488,101 +3488,101 @@ function yr() {
                   function v(L) {
                     i(this, v), this.options = g({}, T, L);
                   }
-                  return f(v, [{
+                  return l(v, [{
                     key: "run",
                     value: function() {
-                      var S = this, C = this.options, G = C.cy, K = C.eles, X = [], Q = [], O = void 0, rt = [];
+                      var b = this, C = this.options, G = C.cy, k = C.eles, Y = [], K = [], O = void 0, it = [];
                       C.fixedNodeConstraint && (!Array.isArray(C.fixedNodeConstraint) || C.fixedNodeConstraint.length == 0) && (C.fixedNodeConstraint = void 0), C.alignmentConstraint && (C.alignmentConstraint.vertical && (!Array.isArray(C.alignmentConstraint.vertical) || C.alignmentConstraint.vertical.length == 0) && (C.alignmentConstraint.vertical = void 0), C.alignmentConstraint.horizontal && (!Array.isArray(C.alignmentConstraint.horizontal) || C.alignmentConstraint.horizontal.length == 0) && (C.alignmentConstraint.horizontal = void 0)), C.relativePlacementConstraint && (!Array.isArray(C.relativePlacementConstraint) || C.relativePlacementConstraint.length == 0) && (C.relativePlacementConstraint = void 0);
                       var n = C.fixedNodeConstraint || C.alignmentConstraint || C.relativePlacementConstraint;
                       n && (C.tile = !1, C.packComponents = !1);
                       var m = void 0, p = !1;
-                      if (G.layoutUtilities && C.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = !0), K.nodes().length > 0)
+                      if (G.layoutUtilities && C.packComponents && (m = G.layoutUtilities("get"), m || (m = G.layoutUtilities()), p = !0), k.nodes().length > 0)
                         if (p) {
                           var R = t.getTopMostNodes(C.eles.nodes());
                           if (O = t.connectComponents(G, C.eles, R), O.forEach(function(vt) {
-                            var it = vt.boundingBox();
-                            rt.push({ x: it.x1 + it.w / 2, y: it.y1 + it.h / 2 });
+                            var rt = vt.boundingBox();
+                            it.push({ x: rt.x1 + rt.w / 2, y: rt.y1 + rt.h / 2 });
                           }), C.randomize && O.forEach(function(vt) {
-                            C.eles = vt, X.push(s(C));
+                            C.eles = vt, Y.push(s(C));
                           }), C.quality == "default" || C.quality == "proof") {
                             var M = G.collection();
                             if (C.tile) {
-                              var F = /* @__PURE__ */ new Map(), W = [], x = [], k = 0, V = { nodeIndexes: F, xCoords: W, yCoords: x }, Y = [];
-                              if (O.forEach(function(vt, it) {
+                              var S = /* @__PURE__ */ new Map(), W = [], D = [], q = 0, V = { nodeIndexes: S, xCoords: W, yCoords: D }, X = [];
+                              if (O.forEach(function(vt, rt) {
                                 vt.edges().length == 0 && (vt.nodes().forEach(function(gt, mt) {
-                                  M.merge(vt.nodes()[mt]), gt.isParent() || (V.nodeIndexes.set(vt.nodes()[mt].id(), k++), V.xCoords.push(vt.nodes()[0].position().x), V.yCoords.push(vt.nodes()[0].position().y));
-                                }), Y.push(it));
+                                  M.merge(vt.nodes()[mt]), gt.isParent() || (V.nodeIndexes.set(vt.nodes()[mt].id(), q++), V.xCoords.push(vt.nodes()[0].position().x), V.yCoords.push(vt.nodes()[0].position().y));
+                                }), X.push(rt));
                               }), M.length > 1) {
                                 var et = M.boundingBox();
-                                rt.push({ x: et.x1 + et.w / 2, y: et.y1 + et.h / 2 }), O.push(M), X.push(V);
-                                for (var z = Y.length - 1; z >= 0; z--)
-                                  O.splice(Y[z], 1), X.splice(Y[z], 1), rt.splice(Y[z], 1);
+                                it.push({ x: et.x1 + et.w / 2, y: et.y1 + et.h / 2 }), O.push(M), Y.push(V);
+                                for (var z = X.length - 1; z >= 0; z--)
+                                  O.splice(X[z], 1), Y.splice(X[z], 1), it.splice(X[z], 1);
                               }
                             }
-                            O.forEach(function(vt, it) {
-                              C.eles = vt, Q.push(l(C, X[it])), t.relocateComponent(rt[it], Q[it], C);
+                            O.forEach(function(vt, rt) {
+                              C.eles = vt, K.push(f(C, Y[rt])), t.relocateComponent(it[rt], K[rt], C);
                             });
                           } else
-                            O.forEach(function(vt, it) {
-                              t.relocateComponent(rt[it], X[it], C);
+                            O.forEach(function(vt, rt) {
+                              t.relocateComponent(it[rt], Y[rt], C);
                             });
                           var w = /* @__PURE__ */ new Set();
                           if (O.length > 1) {
-                            var H = [], $ = K.filter(function(vt) {
+                            var H = [], $ = k.filter(function(vt) {
                               return vt.css("display") == "none";
                             });
-                            O.forEach(function(vt, it) {
+                            O.forEach(function(vt, rt) {
                               var gt = void 0;
-                              if (C.quality == "draft" && (gt = X[it].nodeIndexes), vt.nodes().not($).length > 0) {
+                              if (C.quality == "draft" && (gt = Y[rt].nodeIndexes), vt.nodes().not($).length > 0) {
                                 var mt = {};
                                 mt.edges = [], mt.nodes = [];
                                 var At = void 0;
                                 vt.nodes().not($).forEach(function(Ot) {
                                   if (C.quality == "draft")
                                     if (!Ot.isParent())
-                                      At = gt.get(Ot.id()), mt.nodes.push({ x: X[it].xCoords[At] - Ot.boundingbox().w / 2, y: X[it].yCoords[At] - Ot.boundingbox().h / 2, width: Ot.boundingbox().w, height: Ot.boundingbox().h });
+                                      At = gt.get(Ot.id()), mt.nodes.push({ x: Y[rt].xCoords[At] - Ot.boundingbox().w / 2, y: Y[rt].yCoords[At] - Ot.boundingbox().h / 2, width: Ot.boundingbox().w, height: Ot.boundingbox().h });
                                     else {
-                                      var Et = t.calcBoundingBox(Ot, X[it].xCoords, X[it].yCoords, gt);
+                                      var Et = t.calcBoundingBox(Ot, Y[rt].xCoords, Y[rt].yCoords, gt);
                                       mt.nodes.push({ x: Et.topLeftX, y: Et.topLeftY, width: Et.width, height: Et.height });
                                     }
                                   else
-                                    Q[it][Ot.id()] && mt.nodes.push({ x: Q[it][Ot.id()].getLeft(), y: Q[it][Ot.id()].getTop(), width: Q[it][Ot.id()].getWidth(), height: Q[it][Ot.id()].getHeight() });
+                                    K[rt][Ot.id()] && mt.nodes.push({ x: K[rt][Ot.id()].getLeft(), y: K[rt][Ot.id()].getTop(), width: K[rt][Ot.id()].getWidth(), height: K[rt][Ot.id()].getHeight() });
                                 }), vt.edges().forEach(function(Ot) {
                                   var Et = Ot.source(), Dt = Ot.target();
                                   if (Et.css("display") != "none" && Dt.css("display") != "none")
                                     if (C.quality == "draft") {
                                       var Rt = gt.get(Et.id()), Ht = gt.get(Dt.id()), Ut = [], Pt = [];
                                       if (Et.isParent()) {
-                                        var Ft = t.calcBoundingBox(Et, X[it].xCoords, X[it].yCoords, gt);
+                                        var Ft = t.calcBoundingBox(Et, Y[rt].xCoords, Y[rt].yCoords, gt);
                                         Ut.push(Ft.topLeftX + Ft.width / 2), Ut.push(Ft.topLeftY + Ft.height / 2);
                                       } else
-                                        Ut.push(X[it].xCoords[Rt]), Ut.push(X[it].yCoords[Rt]);
+                                        Ut.push(Y[rt].xCoords[Rt]), Ut.push(Y[rt].yCoords[Rt]);
                                       if (Dt.isParent()) {
-                                        var Yt = t.calcBoundingBox(Dt, X[it].xCoords, X[it].yCoords, gt);
+                                        var Yt = t.calcBoundingBox(Dt, Y[rt].xCoords, Y[rt].yCoords, gt);
                                         Pt.push(Yt.topLeftX + Yt.width / 2), Pt.push(Yt.topLeftY + Yt.height / 2);
                                       } else
-                                        Pt.push(X[it].xCoords[Ht]), Pt.push(X[it].yCoords[Ht]);
+                                        Pt.push(Y[rt].xCoords[Ht]), Pt.push(Y[rt].yCoords[Ht]);
                                       mt.edges.push({ startX: Ut[0], startY: Ut[1], endX: Pt[0], endY: Pt[1] });
                                     } else
-                                      Q[it][Et.id()] && Q[it][Dt.id()] && mt.edges.push({ startX: Q[it][Et.id()].getCenterX(), startY: Q[it][Et.id()].getCenterY(), endX: Q[it][Dt.id()].getCenterX(), endY: Q[it][Dt.id()].getCenterY() });
-                                }), mt.nodes.length > 0 && (H.push(mt), w.add(it));
+                                      K[rt][Et.id()] && K[rt][Dt.id()] && mt.edges.push({ startX: K[rt][Et.id()].getCenterX(), startY: K[rt][Et.id()].getCenterY(), endX: K[rt][Dt.id()].getCenterX(), endY: K[rt][Dt.id()].getCenterY() });
+                                }), mt.nodes.length > 0 && (H.push(mt), w.add(rt));
                               }
                             });
                             var _ = m.packComponents(H, C.randomize).shifts;
                             if (C.quality == "draft")
-                              X.forEach(function(vt, it) {
+                              Y.forEach(function(vt, rt) {
                                 var gt = vt.xCoords.map(function(At) {
-                                  return At + _[it].dx;
+                                  return At + _[rt].dx;
                                 }), mt = vt.yCoords.map(function(At) {
-                                  return At + _[it].dy;
+                                  return At + _[rt].dy;
                                 });
                                 vt.xCoords = gt, vt.yCoords = mt;
                               });
                             else {
                               var ht = 0;
                               w.forEach(function(vt) {
-                                Object.keys(Q[vt]).forEach(function(it) {
-                                  var gt = Q[vt][it];
+                                Object.keys(K[vt]).forEach(function(rt) {
+                                  var gt = K[vt][rt];
                                   gt.setCenter(gt.getCenterX() + _[ht].dx, gt.getCenterY() + _[ht].dy);
                                 }), ht++;
                               });
@@ -3590,39 +3590,39 @@ function yr() {
                           }
                         } else {
                           var E = C.eles.boundingBox();
-                          if (rt.push({ x: E.x1 + E.w / 2, y: E.y1 + E.h / 2 }), C.randomize) {
+                          if (it.push({ x: E.x1 + E.w / 2, y: E.y1 + E.h / 2 }), C.randomize) {
                             var y = s(C);
-                            X.push(y);
+                            Y.push(y);
                           }
-                          C.quality == "default" || C.quality == "proof" ? (Q.push(l(C, X[0])), t.relocateComponent(rt[0], Q[0], C)) : t.relocateComponent(rt[0], X[0], C);
+                          C.quality == "default" || C.quality == "proof" ? (K.push(f(C, Y[0])), t.relocateComponent(it[0], K[0], C)) : t.relocateComponent(it[0], Y[0], C);
                         }
-                      var q = function(it, gt) {
+                      var Q = function(rt, gt) {
                         if (C.quality == "default" || C.quality == "proof") {
-                          typeof it == "number" && (it = gt);
-                          var mt = void 0, At = void 0, Ot = it.data("id");
-                          return Q.forEach(function(Dt) {
+                          typeof rt == "number" && (rt = gt);
+                          var mt = void 0, At = void 0, Ot = rt.data("id");
+                          return K.forEach(function(Dt) {
                             Ot in Dt && (mt = { x: Dt[Ot].getRect().getCenterX(), y: Dt[Ot].getRect().getCenterY() }, At = Dt[Ot]);
-                          }), C.nodeDimensionsIncludeLabels && (At.labelWidth && (At.labelPosHorizontal == "left" ? mt.x += At.labelWidth / 2 : At.labelPosHorizontal == "right" && (mt.x -= At.labelWidth / 2)), At.labelHeight && (At.labelPosVertical == "top" ? mt.y += At.labelHeight / 2 : At.labelPosVertical == "bottom" && (mt.y -= At.labelHeight / 2))), mt == null && (mt = { x: it.position("x"), y: it.position("y") }), {
+                          }), C.nodeDimensionsIncludeLabels && (At.labelWidth && (At.labelPosHorizontal == "left" ? mt.x += At.labelWidth / 2 : At.labelPosHorizontal == "right" && (mt.x -= At.labelWidth / 2)), At.labelHeight && (At.labelPosVertical == "top" ? mt.y += At.labelHeight / 2 : At.labelPosVertical == "bottom" && (mt.y -= At.labelHeight / 2))), mt == null && (mt = { x: rt.position("x"), y: rt.position("y") }), {
                             x: mt.x,
                             y: mt.y
                           };
                         } else {
                           var Et = void 0;
-                          return X.forEach(function(Dt) {
-                            var Rt = Dt.nodeIndexes.get(it.id());
+                          return Y.forEach(function(Dt) {
+                            var Rt = Dt.nodeIndexes.get(rt.id());
                             Rt != null && (Et = { x: Dt.xCoords[Rt], y: Dt.yCoords[Rt] });
-                          }), Et == null && (Et = { x: it.position("x"), y: it.position("y") }), {
+                          }), Et == null && (Et = { x: rt.position("x"), y: rt.position("y") }), {
                             x: Et.x,
                             y: Et.y
                           };
                         }
                       };
                       if (C.quality == "default" || C.quality == "proof" || C.randomize) {
-                        var It = t.calcParentsWithoutChildren(G, K), Nt = K.filter(function(vt) {
+                        var It = t.calcParentsWithoutChildren(G, k), Nt = k.filter(function(vt) {
                           return vt.css("display") == "none";
                         });
-                        C.eles = K.not(Nt), K.nodes().not(":parent").not(Nt).layoutPositions(S, C, q), It.length > 0 && It.forEach(function(vt) {
-                          vt.position(q(vt));
+                        C.eles = k.not(Nt), k.nodes().not(":parent").not(Nt).layoutPositions(b, C, Q), It.length > 0 && It.forEach(function(vt) {
+                          vt.position(Q(vt));
                         });
                       } else
                         console.log("If randomize option is set to false, then quality option must be 'default' or 'proof'.");
@@ -3635,22 +3635,22 @@ function yr() {
             /***/
             657: (
               /***/
-              ((a, r, e) => {
-                var f = e(548), i = e(140).layoutBase.Matrix, g = e(140).layoutBase.SVD, t = function(s) {
-                  var c = s.cy, l = s.eles, T = l.nodes(), d = l.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), C = [], G = [], K = [], X = [], Q = [], O = [], rt = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, R = s.samplingType, M = s.nodeSeparation, F = void 0, W = function() {
-                    for (var U = 0, B = 0, J = !1; B < F; ) {
+              ((a, e, r) => {
+                var l = r(548), i = r(140).layoutBase.Matrix, g = r(140).layoutBase.SVD, t = function(s) {
+                  var c = s.cy, f = s.eles, T = f.nodes(), d = f.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), C = [], G = [], k = [], Y = [], K = [], O = [], it = [], n = [], m = void 0, p = 1e8, E = 1e-9, y = s.piTol, R = s.samplingType, M = s.nodeSeparation, S = void 0, W = function() {
+                    for (var U = 0, B = 0, J = !1; B < S; ) {
                       U = Math.floor(Math.random() * m), J = !1;
                       for (var Z = 0; Z < B; Z++)
-                        if (X[Z] == U) {
+                        if (Y[Z] == U) {
                           J = !0;
                           break;
                         }
                       if (!J)
-                        X[B] = U, B++;
+                        Y[B] = U, B++;
                       else
                         continue;
                     }
-                  }, x = function(U, B, J) {
+                  }, D = function(U, B, J) {
                     for (var Z = [], at = 0, ct = 0, nt = 0, tt = void 0, j = [], ut = 0, Mt = 1, pt = 0; pt < m; pt++)
                       j[pt] = p;
                     for (Z[ct] = U, j[U] = 0; ct >= at; ) {
@@ -3661,40 +3661,40 @@ function yr() {
                     }
                     if (J) {
                       for (var ot = 0; ot < m; ot++)
-                        O[ot][B] < Q[ot] && (Q[ot] = O[ot][B]);
+                        O[ot][B] < K[ot] && (K[ot] = O[ot][B]);
                       for (var Lt = 0; Lt < m; Lt++)
-                        Q[Lt] > ut && (ut = Q[Lt], Mt = Lt);
+                        K[Lt] > ut && (ut = K[Lt], Mt = Lt);
                     }
                     return Mt;
-                  }, k = function(U) {
+                  }, q = function(U) {
                     var B = void 0;
                     if (U) {
                       B = Math.floor(Math.random() * m);
                       for (var Z = 0; Z < m; Z++)
-                        Q[Z] = p;
-                      for (var at = 0; at < F; at++)
-                        X[at] = B, B = x(B, at, U);
+                        K[Z] = p;
+                      for (var at = 0; at < S; at++)
+                        Y[at] = B, B = D(B, at, U);
                     } else {
                       W();
-                      for (var J = 0; J < F; J++)
-                        x(X[J], J, U);
+                      for (var J = 0; J < S; J++)
+                        D(Y[J], J, U);
                     }
                     for (var ct = 0; ct < m; ct++)
-                      for (var nt = 0; nt < F; nt++)
+                      for (var nt = 0; nt < S; nt++)
                         O[ct][nt] *= O[ct][nt];
-                    for (var tt = 0; tt < F; tt++)
-                      rt[tt] = [];
-                    for (var j = 0; j < F; j++)
-                      for (var ut = 0; ut < F; ut++)
-                        rt[j][ut] = O[X[ut]][j];
+                    for (var tt = 0; tt < S; tt++)
+                      it[tt] = [];
+                    for (var j = 0; j < S; j++)
+                      for (var ut = 0; ut < S; ut++)
+                        it[j][ut] = O[Y[ut]][j];
                   }, V = function() {
-                    for (var U = g.svd(rt), B = U.S, J = U.U, Z = U.V, at = B[0] * B[0] * B[0], ct = [], nt = 0; nt < F; nt++) {
+                    for (var U = g.svd(it), B = U.S, J = U.U, Z = U.V, at = B[0] * B[0] * B[0], ct = [], nt = 0; nt < S; nt++) {
                       ct[nt] = [];
-                      for (var tt = 0; tt < F; tt++)
+                      for (var tt = 0; tt < S; tt++)
                         ct[nt][tt] = 0, nt == tt && (ct[nt][tt] = B[nt] / (B[nt] * B[nt] + at / (B[nt] * B[nt])));
                     }
                     n = i.multMat(i.multMat(Z, ct), i.transpose(J));
-                  }, Y = function() {
+                  }, X = function() {
                     for (var U = void 0, B = void 0, J = [], Z = [], at = [], ct = [], nt = 0; nt < m; nt++)
                       J[nt] = Math.random(), Z[nt] = Math.random();
                     J = i.normalize(J), Z = i.normalize(Z);
@@ -3716,21 +3716,21 @@ function yr() {
                     }
                     for (var lt = 0; lt < m; lt++)
                       ct[lt] = Z[lt];
-                    G = i.multCons(at, Math.sqrt(Math.abs(U))), K = i.multCons(ct, Math.sqrt(Math.abs(B)));
+                    G = i.multCons(at, Math.sqrt(Math.abs(U))), k = i.multCons(ct, Math.sqrt(Math.abs(B)));
                   };
-                  f.connectComponents(c, l, f.getTopMostNodes(T), v), d.forEach(function(b) {
-                    f.connectComponents(c, l, f.getTopMostNodes(b.descendants().intersection(l)), v);
+                  l.connectComponents(c, f, l.getTopMostNodes(T), v), d.forEach(function(F) {
+                    l.connectComponents(c, f, l.getTopMostNodes(F.descendants().intersection(f)), v);
                   });
                   for (var et = 0, z = 0; z < T.length; z++)
                     T[z].isParent() || L.set(T[z].id(), et++);
                   var w = !0, H = !1, $ = void 0;
                   try {
                     for (var _ = v.keys()[Symbol.iterator](), ht; !(w = (ht = _.next()).done); w = !0) {
-                      var q = ht.value;
-                      L.set(q, et++);
+                      var Q = ht.value;
+                      L.set(Q, et++);
                     }
-                  } catch (b) {
-                    H = !0, $ = b;
+                  } catch (F) {
+                    H = !0, $ = F;
                   } finally {
                     try {
                       !w && _.return && _.return();
@@ -3741,58 +3741,58 @@ function yr() {
                   }
                   for (var It = 0; It < L.size; It++)
                     C[It] = [];
-                  d.forEach(function(b) {
-                    for (var U = b.children().intersection(l); U.nodes(":childless").length == 0; )
-                      U = U.nodes()[0].children().intersection(l);
+                  d.forEach(function(F) {
+                    for (var U = F.children().intersection(f); U.nodes(":childless").length == 0; )
+                      U = U.nodes()[0].children().intersection(f);
                     var B = 0, J = U.nodes(":childless")[0].connectedEdges().length;
                     U.nodes(":childless").forEach(function(Z, at) {
                       Z.connectedEdges().length < J && (J = Z.connectedEdges().length, B = at);
-                    }), S.set(b.id(), U.nodes(":childless")[B].id());
-                  }), T.forEach(function(b) {
+                    }), b.set(F.id(), U.nodes(":childless")[B].id());
+                  }), T.forEach(function(F) {
                     var U = void 0;
-                    b.isParent() ? U = L.get(S.get(b.id())) : U = L.get(b.id()), b.neighborhood().nodes().forEach(function(B) {
-                      l.intersection(b.edgesWith(B)).length > 0 && (B.isParent() ? C[U].push(S.get(B.id())) : C[U].push(B.id()));
+                    F.isParent() ? U = L.get(b.get(F.id())) : U = L.get(F.id()), F.neighborhood().nodes().forEach(function(B) {
+                      f.intersection(F.edgesWith(B)).length > 0 && (B.isParent() ? C[U].push(b.get(B.id())) : C[U].push(B.id()));
                     });
                   });
                   var Nt = function(U) {
                     var B = L.get(U), J = void 0;
                     v.get(U).forEach(function(Z) {
-                      c.getElementById(Z).isParent() ? J = S.get(Z) : J = Z, C[B].push(J), C[L.get(J)].push(U);
+                      c.getElementById(Z).isParent() ? J = b.get(Z) : J = Z, C[B].push(J), C[L.get(J)].push(U);
                     });
-                  }, vt = !0, it = !1, gt = void 0;
+                  }, vt = !0, rt = !1, gt = void 0;
                   try {
                     for (var mt = v.keys()[Symbol.iterator](), At; !(vt = (At = mt.next()).done); vt = !0) {
                       var Ot = At.value;
                       Nt(Ot);
                     }
-                  } catch (b) {
-                    it = !0, gt = b;
+                  } catch (F) {
+                    rt = !0, gt = F;
                   } finally {
                     try {
                       !vt && mt.return && mt.return();
                     } finally {
-                      if (it)
+                      if (rt)
                         throw gt;
                     }
                   }
                   m = L.size;
                   var Et = void 0;
                   if (m > 2) {
-                    F = m < s.sampleSize ? m : s.sampleSize;
+                    S = m < s.sampleSize ? m : s.sampleSize;
                     for (var Dt = 0; Dt < m; Dt++)
                       O[Dt] = [];
-                    for (var Rt = 0; Rt < F; Rt++)
+                    for (var Rt = 0; Rt < S; Rt++)
                       n[Rt] = [];
-                    return s.quality == "draft" || s.step == "all" ? (k(R), V(), Y(), Et = { nodeIndexes: L, xCoords: G, yCoords: K }) : (L.forEach(function(b, U) {
-                      G.push(c.getElementById(U).position("x")), K.push(c.getElementById(U).position("y"));
-                    }), Et = { nodeIndexes: L, xCoords: G, yCoords: K }), Et;
+                    return s.quality == "draft" || s.step == "all" ? (q(R), V(), X(), Et = { nodeIndexes: L, xCoords: G, yCoords: k }) : (L.forEach(function(F, U) {
+                      G.push(c.getElementById(U).position("x")), k.push(c.getElementById(U).position("y"));
+                    }), Et = { nodeIndexes: L, xCoords: G, yCoords: k }), Et;
                   } else {
                     var Ht = L.keys(), Ut = c.getElementById(Ht.next().value), Pt = Ut.position(), Ft = Ut.outerWidth();
-                    if (G.push(Pt.x), K.push(Pt.y), m == 2) {
+                    if (G.push(Pt.x), k.push(Pt.y), m == 2) {
                       var Yt = c.getElementById(Ht.next().value), Vt = Yt.outerWidth();
-                      G.push(Pt.x + Ft / 2 + Vt / 2 + s.idealEdgeLength), K.push(Pt.y);
+                      G.push(Pt.x + Ft / 2 + Vt / 2 + s.idealEdgeLength), k.push(Pt.y);
                     }
-                    return Et = { nodeIndexes: L, xCoords: G, yCoords: K }, Et;
+                    return Et = { nodeIndexes: L, xCoords: G, yCoords: k }, Et;
                   }
                 };
                 a.exports = { spectralLayout: t };
@@ -3801,9 +3801,9 @@ function yr() {
             /***/
             579: (
               /***/
-              ((a, r, e) => {
-                var f = e(212), i = function(t) {
-                  t && t("layout", "fcose", f);
+              ((a, e, r) => {
+                var l = r(212), i = function(t) {
+                  t && t("layout", "fcose", l);
                 };
                 typeof cytoscape < "u" && i(cytoscape), a.exports = i;
               })
@@ -3818,10 +3818,10 @@ function yr() {
             /******/
           }, N = {};
           function u(a) {
-            var r = N[a];
-            if (r !== void 0)
-              return r.exports;
-            var e = N[a] = {
+            var e = N[a];
+            if (e !== void 0)
+              return e.exports;
+            var r = N[a] = {
               /******/
               // no module.id needed
               /******/
@@ -3830,7 +3830,7 @@ function yr() {
               exports: {}
               /******/
             };
-            return P[a](e, e.exports, u), e.exports;
+            return P[a](r, r.exports, u), r.exports;
           }
           var h = u(579);
           return h;
@@ -3852,39 +3852,39 @@ var xe = {
   T: /* @__PURE__ */ dt((I) => `0,0 ${I},0 ${I / 2},${I}`, "T"),
   B: /* @__PURE__ */ dt((I) => `${I / 2},0 ${I},${I} 0,${I}`, "B")
 }, se = {
-  L: /* @__PURE__ */ dt((I, D) => I - D + 2, "L"),
-  R: /* @__PURE__ */ dt((I, D) => I - 2, "R"),
-  T: /* @__PURE__ */ dt((I, D) => I - D + 2, "T"),
-  B: /* @__PURE__ */ dt((I, D) => I - 2, "B")
+  L: /* @__PURE__ */ dt((I, x) => I - x + 2, "L"),
+  R: /* @__PURE__ */ dt((I, x) => I - 2, "R"),
+  T: /* @__PURE__ */ dt((I, x) => I - x + 2, "T"),
+  B: /* @__PURE__ */ dt((I, x) => I - 2, "B")
 }, Tr = /* @__PURE__ */ dt(function(I) {
   return Wt(I) ? I === "L" ? "R" : "L" : I === "T" ? "B" : "T";
 }, "getOppositeArchitectureDirection"), Re = /* @__PURE__ */ dt(function(I) {
-  const D = I;
-  return D === "L" || D === "R" || D === "T" || D === "B";
+  const x = I;
+  return x === "L" || x === "R" || x === "T" || x === "B";
 }, "isArchitectureDirection"), Wt = /* @__PURE__ */ dt(function(I) {
-  const D = I;
-  return D === "L" || D === "R";
+  const x = I;
+  return x === "L" || x === "R";
 }, "isArchitectureDirectionX"), qt = /* @__PURE__ */ dt(function(I) {
-  const D = I;
-  return D === "T" || D === "B";
-}, "isArchitectureDirectionY"), Te = /* @__PURE__ */ dt(function(I, D) {
-  const A = Wt(I) && qt(D), P = qt(I) && Wt(D);
+  const x = I;
+  return x === "T" || x === "B";
+}, "isArchitectureDirectionY"), Te = /* @__PURE__ */ dt(function(I, x) {
+  const A = Wt(I) && qt(x), P = qt(I) && Wt(x);
   return A || P;
 }, "isArchitectureDirectionXY"), Nr = /* @__PURE__ */ dt(function(I) {
-  const D = I[0], A = I[1], P = Wt(D) && qt(A), N = qt(D) && Wt(A);
+  const x = I[0], A = I[1], P = Wt(x) && qt(A), N = qt(x) && Wt(A);
   return P || N;
 }, "isArchitecturePairXY"), Lr = /* @__PURE__ */ dt(function(I) {
   return I !== "LL" && I !== "RR" && I !== "TT" && I !== "BB";
-}, "isValidArchitectureDirectionPair"), ye = /* @__PURE__ */ dt(function(I, D) {
-  const A = `${I}${D}`;
+}, "isValidArchitectureDirectionPair"), ye = /* @__PURE__ */ dt(function(I, x) {
+  const A = `${I}${x}`;
   return Lr(A) ? A : void 0;
-}, "getArchitectureDirectionPair"), Cr = /* @__PURE__ */ dt(function([I, D], A) {
+}, "getArchitectureDirectionPair"), Cr = /* @__PURE__ */ dt(function([I, x], A) {
   const P = A[0], N = A[1];
-  return Wt(P) ? qt(N) ? [I + (P === "L" ? -1 : 1), D + (N === "T" ? 1 : -1)] : [I + (P === "L" ? -1 : 1), D] : Wt(N) ? [I + (N === "L" ? 1 : -1), D + (P === "T" ? 1 : -1)] : [I, D + (P === "T" ? 1 : -1)];
+  return Wt(P) ? qt(N) ? [I + (P === "L" ? -1 : 1), x + (N === "T" ? 1 : -1)] : [I + (P === "L" ? -1 : 1), x] : Wt(N) ? [I + (N === "L" ? 1 : -1), x + (P === "T" ? 1 : -1)] : [I, x + (P === "T" ? 1 : -1)];
 }, "shiftPositionByArchitectureDirectionPair"), Ar = /* @__PURE__ */ dt(function(I) {
   return I === "LT" || I === "TL" ? [1, 1] : I === "BL" || I === "LB" ? [1, -1] : I === "BR" || I === "RB" ? [-1, -1] : [-1, 1];
-}, "getArchitectureDirectionXYFactors"), Mr = /* @__PURE__ */ dt(function(I, D) {
-  return Te(I, D) ? "bend" : Wt(I) ? "horizontal" : "vertical";
+}, "getArchitectureDirectionXYFactors"), Mr = /* @__PURE__ */ dt(function(I, x) {
+  return Te(I, x) ? "bend" : Wt(I) ? "horizontal" : "vertical";
 }, "getArchitectureDirectionAlignment"), wr = /* @__PURE__ */ dt(function(I) {
   return I.type === "service";
 }, "isArchitectureService"), Or = /* @__PURE__ */ dt(function(I) {
@@ -3897,28 +3897,28 @@ var xe = {
     this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.dataStructures = void 0, this.elements = {}, er();
   }
   addService({
-    id: D,
+    id: x,
     icon: A,
     in: P,
     title: N,
     iconText: u
   }) {
-    if (this.registeredIds[D] !== void 0)
+    if (this.registeredIds[x] !== void 0)
       throw new Error(
-        `The service id [${D}] is already in use by another ${this.registeredIds[D]}`
+        `The service id [${x}] is already in use by another ${this.registeredIds[x]}`
       );
     if (P !== void 0) {
-      if (D === P)
-        throw new Error(`The service [${D}] cannot be placed within itself`);
+      if (x === P)
+        throw new Error(`The service [${x}] cannot be placed within itself`);
       if (this.registeredIds[P] === void 0)
         throw new Error(
-          `The service [${D}]'s parent does not exist. Please make sure the parent is created before this service`
+          `The service [${x}]'s parent does not exist. Please make sure the parent is created before this service`
         );
       if (this.registeredIds[P] === "node")
-        throw new Error(`The service [${D}]'s parent is not a group`);
+        throw new Error(`The service [${x}]'s parent is not a group`);
     }
-    this.registeredIds[D] = "node", this.nodes[D] = {
-      id: D,
+    this.registeredIds[x] = "node", this.nodes[x] = {
+      id: x,
       type: "service",
       icon: A,
       iconText: u,
@@ -3930,9 +3930,9 @@ var xe = {
   getServices() {
     return Object.values(this.nodes).filter(wr);
   }
-  addJunction({ id: D, in: A }) {
-    this.registeredIds[D] = "node", this.nodes[D] = {
-      id: D,
+  addJunction({ id: x, in: A }) {
+    this.registeredIds[x] = "node", this.nodes[x] = {
+      id: x,
       type: "junction",
       edges: [],
       in: A
@@ -3944,27 +3944,26 @@ var xe = {
   getNodes() {
     return Object.values(this.nodes);
   }
-  getNode(D) {
-    return this.nodes[D] ?? null;
+  getNode(x) {
+    return this.nodes[x] ?? null;
   }
-  addGroup({ id: D, icon: A, in: P, title: N }) {
-    var u, h, a;
-    if (((u = this.registeredIds) == null ? void 0 : u[D]) !== void 0)
+  addGroup({ id: x, icon: A, in: P, title: N }) {
+    if (this.registeredIds?.[x] !== void 0)
       throw new Error(
-        `The group id [${D}] is already in use by another ${this.registeredIds[D]}`
+        `The group id [${x}] is already in use by another ${this.registeredIds[x]}`
       );
     if (P !== void 0) {
-      if (D === P)
-        throw new Error(`The group [${D}] cannot be placed within itself`);
-      if (((h = this.registeredIds) == null ? void 0 : h[P]) === void 0)
+      if (x === P)
+        throw new Error(`The group [${x}] cannot be placed within itself`);
+      if (this.registeredIds?.[P] === void 0)
         throw new Error(
-          `The group [${D}]'s parent does not exist. Please make sure the parent is created before this group`
+          `The group [${x}]'s parent does not exist. Please make sure the parent is created before this group`
         );
-      if (((a = this.registeredIds) == null ? void 0 : a[P]) === "node")
-        throw new Error(`The group [${D}]'s parent is not a group`);
+      if (this.registeredIds?.[P] === "node")
+        throw new Error(`The group [${x}]'s parent is not a group`);
     }
-    this.registeredIds[D] = "group", this.groups[D] = {
-      id: D,
+    this.registeredIds[x] = "group", this.groups[x] = {
+      id: x,
       icon: A,
       title: N,
       in: P
@@ -3974,53 +3973,53 @@ var xe = {
     return Object.values(this.groups);
   }
   addEdge({
-    lhsId: D,
+    lhsId: x,
     rhsId: A,
     lhsDir: P,
     rhsDir: N,
     lhsInto: u,
     rhsInto: h,
     lhsGroup: a,
-    rhsGroup: r,
-    title: e
+    rhsGroup: e,
+    title: r
   }) {
     if (!Re(P))
       throw new Error(
-        `Invalid direction given for left hand side of edge ${D}--${A}. Expected (L,R,T,B) got ${String(P)}`
+        `Invalid direction given for left hand side of edge ${x}--${A}. Expected (L,R,T,B) got ${String(P)}`
       );
     if (!Re(N))
       throw new Error(
-        `Invalid direction given for right hand side of edge ${D}--${A}. Expected (L,R,T,B) got ${String(N)}`
+        `Invalid direction given for right hand side of edge ${x}--${A}. Expected (L,R,T,B) got ${String(N)}`
       );
-    if (this.nodes[D] === void 0 && this.groups[D] === void 0)
+    if (this.nodes[x] === void 0 && this.groups[x] === void 0)
       throw new Error(
-        `The left-hand id [${D}] does not yet exist. Please create the service/group before declaring an edge to it.`
+        `The left-hand id [${x}] does not yet exist. Please create the service/group before declaring an edge to it.`
       );
     if (this.nodes[A] === void 0 && this.groups[A] === void 0)
       throw new Error(
         `The right-hand id [${A}] does not yet exist. Please create the service/group before declaring an edge to it.`
       );
-    const f = this.nodes[D].in, i = this.nodes[A].in;
-    if (a && f && i && f == i)
+    const l = this.nodes[x].in, i = this.nodes[A].in;
+    if (a && l && i && l == i)
       throw new Error(
-        `The left-hand id [${D}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
+        `The left-hand id [${x}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
       );
-    if (r && f && i && f == i)
+    if (e && l && i && l == i)
       throw new Error(
         `The right-hand id [${A}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
       );
     const g = {
-      lhsId: D,
+      lhsId: x,
       lhsDir: P,
       lhsInto: u,
       lhsGroup: a,
       rhsId: A,
       rhsDir: N,
       rhsInto: h,
-      rhsGroup: r,
-      title: e
+      rhsGroup: e,
+      title: r
     };
-    this.edges.push(g), this.nodes[D] && this.nodes[A] && (this.nodes[D].edges.push(this.edges[this.edges.length - 1]), this.nodes[A].edges.push(this.edges[this.edges.length - 1]));
+    this.edges.push(g), this.nodes[x] && this.nodes[A] && (this.nodes[x].edges.push(this.edges[this.edges.length - 1]), this.nodes[A].edges.push(this.edges[this.edges.length - 1]));
   }
   getEdges() {
     return this.edges;
@@ -4032,56 +4031,55 @@ var xe = {
    */
   getDataStructures() {
     if (this.dataStructures === void 0) {
-      const D = {}, A = Object.entries(this.nodes).reduce((r, [e, f]) => (r[e] = f.edges.reduce((i, g) => {
-        var s, c;
-        const t = (s = this.getNode(g.lhsId)) == null ? void 0 : s.in, o = (c = this.getNode(g.rhsId)) == null ? void 0 : c.in;
+      const x = {}, A = Object.entries(this.nodes).reduce((e, [r, l]) => (e[r] = l.edges.reduce((i, g) => {
+        const t = this.getNode(g.lhsId)?.in, o = this.getNode(g.rhsId)?.in;
         if (t && o && t !== o) {
-          const l = Mr(g.lhsDir, g.rhsDir);
-          l !== "bend" && (D[t] ?? (D[t] = {}), D[t][o] = l, D[o] ?? (D[o] = {}), D[o][t] = l);
+          const s = Mr(g.lhsDir, g.rhsDir);
+          s !== "bend" && (x[t] ??= {}, x[t][o] = s, x[o] ??= {}, x[o][t] = s);
         }
-        if (g.lhsId === e) {
-          const l = ye(g.lhsDir, g.rhsDir);
-          l && (i[l] = g.rhsId);
+        if (g.lhsId === r) {
+          const s = ye(g.lhsDir, g.rhsDir);
+          s && (i[s] = g.rhsId);
         } else {
-          const l = ye(g.rhsDir, g.lhsDir);
-          l && (i[l] = g.lhsId);
+          const s = ye(g.rhsDir, g.lhsDir);
+          s && (i[s] = g.lhsId);
         }
         return i;
-      }, {}), r), {}), P = Object.keys(A)[0], N = { [P]: 1 }, u = Object.keys(A).reduce(
-        (r, e) => e === P ? r : { ...r, [e]: 1 },
+      }, {}), e), {}), P = Object.keys(A)[0], N = { [P]: 1 }, u = Object.keys(A).reduce(
+        (e, r) => r === P ? e : { ...e, [r]: 1 },
         {}
-      ), h = /* @__PURE__ */ dt((r) => {
-        const e = { [r]: [0, 0] }, f = [r];
-        for (; f.length > 0; ) {
-          const i = f.shift();
+      ), h = /* @__PURE__ */ dt((e) => {
+        const r = { [e]: [0, 0] }, l = [e];
+        for (; l.length > 0; ) {
+          const i = l.shift();
           if (i) {
             N[i] = 1, delete u[i];
-            const g = A[i], [t, o] = e[i];
+            const g = A[i], [t, o] = r[i];
             Object.entries(g).forEach(([s, c]) => {
-              N[c] || (e[c] = Cr(
+              N[c] || (r[c] = Cr(
                 [t, o],
                 s
-              ), f.push(c));
+              ), l.push(c));
             });
           }
         }
-        return e;
+        return r;
       }, "BFS"), a = [h(P)];
       for (; Object.keys(u).length > 0; )
         a.push(h(Object.keys(u)[0]));
       this.dataStructures = {
         adjList: A,
         spatialMaps: a,
-        groupAlignments: D
+        groupAlignments: x
       };
     }
     return this.dataStructures;
   }
-  setElementForId(D, A) {
-    this.elements[D] = A;
+  setElementForId(x, A) {
+    this.elements[x] = A;
   }
-  getElementById(D) {
-    return this.elements[D];
+  getElementById(x) {
+    return this.elements[x];
   }
   getConfig() {
     return rr({
@@ -4089,26 +4087,25 @@ var xe = {
       ...ir().architecture
     });
   }
-  getConfigField(D) {
-    return this.getConfig()[D];
+  getConfigField(x) {
+    return this.getConfig()[x];
   }
-}, dt(ae, "ArchitectureDB"), ae), xr = /* @__PURE__ */ dt((I, D) => {
-  fr(I, D), I.groups.map((A) => D.addGroup(A)), I.services.map((A) => D.addService({ ...A, type: "service" })), I.junctions.map((A) => D.addJunction({ ...A, type: "junction" })), I.edges.map((A) => D.addEdge(A));
+}, dt(ae, "ArchitectureDB"), ae), xr = /* @__PURE__ */ dt((I, x) => {
+  fr(I, x), I.groups.map((A) => x.addGroup(A)), I.services.map((A) => x.addService({ ...A, type: "service" })), I.junctions.map((A) => x.addJunction({ ...A, type: "junction" })), I.edges.map((A) => x.addEdge(A));
 }, "populateDb"), Ge = {
   parser: {
     // @ts-expect-error - ArchitectureDB is not assignable to DiagramDB
     yy: void 0
   },
   parse: /* @__PURE__ */ dt(async (I) => {
-    var P;
-    const D = await cr("architecture", I);
-    Se.debug(D);
-    const A = (P = Ge.parser) == null ? void 0 : P.yy;
+    const x = await cr("architecture", I);
+    Se.debug(x);
+    const A = Ge.parser?.yy;
     if (!(A instanceof Pe))
       throw new Error(
         "parser.parser?.yy was not a ArchitectureDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues."
       );
-    xr(D, A);
+    xr(x, A);
   }, "parse")
 }, Ir = /* @__PURE__ */ dt((I) => `
   .edge {
@@ -4176,66 +4173,65 @@ var xe = {
       body: re("")
     }
   }
-}, Sr = /* @__PURE__ */ dt(async function(I, D, A) {
+}, Sr = /* @__PURE__ */ dt(async function(I, x, A) {
   const P = A.getConfigField("padding"), N = A.getConfigField("iconSize"), u = N / 2, h = N / 6, a = h / 2;
   await Promise.all(
-    D.edges().map(async (r) => {
-      var K, X;
+    x.edges().map(async (e) => {
       const {
-        source: e,
-        sourceDir: f,
+        source: r,
+        sourceDir: l,
         sourceArrow: i,
         sourceGroup: g,
         target: t,
         targetDir: o,
         targetArrow: s,
         targetGroup: c,
-        label: l
-      } = be(r);
-      let { x: T, y: d } = r[0].sourceEndpoint();
-      const { x: v, y: L } = r[0].midpoint();
-      let { x: S, y: C } = r[0].targetEndpoint();
+        label: f
+      } = be(e);
+      let { x: T, y: d } = e[0].sourceEndpoint();
+      const { x: v, y: L } = e[0].midpoint();
+      let { x: b, y: C } = e[0].targetEndpoint();
       const G = P + 4;
-      if (g && (Wt(f) ? T += f === "L" ? -G : G : d += f === "T" ? -G : G + 18), c && (Wt(o) ? S += o === "L" ? -G : G : C += o === "T" ? -G : G + 18), !g && ((K = A.getNode(e)) == null ? void 0 : K.type) === "junction" && (Wt(f) ? T += f === "L" ? u : -u : d += f === "T" ? u : -u), !c && ((X = A.getNode(t)) == null ? void 0 : X.type) === "junction" && (Wt(o) ? S += o === "L" ? u : -u : C += o === "T" ? u : -u), r[0]._private.rscratch) {
-        const Q = I.insert("g");
-        if (Q.insert("path").attr("d", `M ${T},${d} L ${v},${L} L${S},${C} `).attr("class", "edge").attr("id", sr(e, t, { prefix: "L" })), i) {
-          const O = Wt(f) ? se[f](T, h) : T - a, rt = qt(f) ? se[f](d, h) : d - a;
-          Q.insert("polygon").attr("points", Ie[f](h)).attr("transform", `translate(${O},${rt})`).attr("class", "arrow");
+      if (g && (Wt(l) ? T += l === "L" ? -G : G : d += l === "T" ? -G : G + 18), c && (Wt(o) ? b += o === "L" ? -G : G : C += o === "T" ? -G : G + 18), !g && A.getNode(r)?.type === "junction" && (Wt(l) ? T += l === "L" ? u : -u : d += l === "T" ? u : -u), !c && A.getNode(t)?.type === "junction" && (Wt(o) ? b += o === "L" ? u : -u : C += o === "T" ? u : -u), e[0]._private.rscratch) {
+        const k = I.insert("g");
+        if (k.insert("path").attr("d", `M ${T},${d} L ${v},${L} L${b},${C} `).attr("class", "edge").attr("id", sr(r, t, { prefix: "L" })), i) {
+          const Y = Wt(l) ? se[l](T, h) : T - a, K = qt(l) ? se[l](d, h) : d - a;
+          k.insert("polygon").attr("points", Ie[l](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
         }
         if (s) {
-          const O = Wt(o) ? se[o](S, h) : S - a, rt = qt(o) ? se[o](C, h) : C - a;
-          Q.insert("polygon").attr("points", Ie[o](h)).attr("transform", `translate(${O},${rt})`).attr("class", "arrow");
+          const Y = Wt(o) ? se[o](b, h) : b - a, K = qt(o) ? se[o](C, h) : C - a;
+          k.insert("polygon").attr("points", Ie[o](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
         }
-        if (l) {
-          const O = Te(f, o) ? "XY" : Wt(f) ? "X" : "Y";
-          let rt = 0;
-          O === "X" ? rt = Math.abs(T - S) : O === "Y" ? rt = Math.abs(d - C) / 1.5 : rt = Math.abs(T - S) / 2;
-          const n = Q.append("g");
+        if (f) {
+          const Y = Te(l, o) ? "XY" : Wt(l) ? "X" : "Y";
+          let K = 0;
+          Y === "X" ? K = Math.abs(T - b) : Y === "Y" ? K = Math.abs(d - C) / 1.5 : K = Math.abs(T - b) / 2;
+          const O = k.append("g");
           if (await me(
-            n,
-            l,
+            O,
+            f,
             {
               useHtmlLabels: !1,
-              width: rt,
+              width: K,
               classes: "architecture-service-label"
             },
             Ee()
-          ), n.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), O === "X")
-            n.attr("transform", "translate(" + v + ", " + L + ")");
-          else if (O === "Y")
-            n.attr("transform", "translate(" + v + ", " + L + ") rotate(-90)");
-          else if (O === "XY") {
-            const m = ye(f, o);
-            if (m && Nr(m)) {
-              const p = n.node().getBoundingClientRect(), [E, y] = Ar(m);
-              n.attr("dominant-baseline", "auto").attr("transform", `rotate(${-1 * E * y * 45})`);
-              const R = n.node().getBoundingClientRect();
-              n.attr(
+          ), O.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), Y === "X")
+            O.attr("transform", "translate(" + v + ", " + L + ")");
+          else if (Y === "Y")
+            O.attr("transform", "translate(" + v + ", " + L + ") rotate(-90)");
+          else if (Y === "XY") {
+            const it = ye(l, o);
+            if (it && Nr(it)) {
+              const n = O.node().getBoundingClientRect(), [m, p] = Ar(it);
+              O.attr("dominant-baseline", "auto").attr("transform", `rotate(${-1 * m * p * 45})`);
+              const E = O.node().getBoundingClientRect();
+              O.attr(
                 "transform",
                 `
-                translate(${v}, ${L - p.height / 2})
-                translate(${E * R.width / 2}, ${y * R.height / 2})
-                rotate(${-1 * E * y * 45}, 0, ${p.height / 2})
+                translate(${v}, ${L - n.height / 2})
+                translate(${m * E.width / 2}, ${p * E.height / 2})
+                rotate(${-1 * m * p * 45}, 0, ${n.height / 2})
               `
               );
             }
@@ -4244,30 +4240,30 @@ var xe = {
       }
     })
   );
-}, "drawEdges"), Fr = /* @__PURE__ */ dt(async function(I, D, A) {
+}, "drawEdges"), Fr = /* @__PURE__ */ dt(async function(I, x, A) {
   const N = A.getConfigField("padding") * 0.75, u = A.getConfigField("fontSize"), a = A.getConfigField("iconSize") / 2;
   await Promise.all(
-    D.nodes().map(async (r) => {
-      const e = ie(r);
-      if (e.type === "group") {
-        const { h: f, w: i, x1: g, y1: t } = r.boundingBox(), o = I.append("rect");
-        o.attr("id", `group-${e.id}`).attr("x", g + a).attr("y", t + a).attr("width", i).attr("height", f).attr("class", "node-bkg");
+    x.nodes().map(async (e) => {
+      const r = ie(e);
+      if (r.type === "group") {
+        const { h: l, w: i, x1: g, y1: t } = e.boundingBox(), o = I.append("rect");
+        o.attr("id", `group-${r.id}`).attr("x", g + a).attr("y", t + a).attr("width", i).attr("height", l).attr("class", "node-bkg");
         const s = I.append("g");
-        let c = g, l = t;
-        if (e.icon) {
+        let c = g, f = t;
+        if (r.icon) {
           const T = s.append("g");
           T.html(
-            `<g>${await pe(e.icon, { height: N, width: N, fallbackPrefix: ne.prefix })}</g>`
+            `<g>${await pe(r.icon, { height: N, width: N, fallbackPrefix: ne.prefix })}</g>`
           ), T.attr(
             "transform",
-            "translate(" + (c + a + 1) + ", " + (l + a + 1) + ")"
-          ), c += N, l += u / 2 - 1 - 2;
+            "translate(" + (c + a + 1) + ", " + (f + a + 1) + ")"
+          ), c += N, f += u / 2 - 1 - 2;
         }
-        if (e.label) {
+        if (r.label) {
           const T = s.append("g");
           await me(
             T,
-            e.label,
+            r.label,
             {
               useHtmlLabels: !1,
               width: i,
@@ -4276,21 +4272,21 @@ var xe = {
             Ee()
           ), T.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), T.attr(
             "transform",
-            "translate(" + (c + a + 4) + ", " + (l + a + 2) + ")"
+            "translate(" + (c + a + 4) + ", " + (f + a + 2) + ")"
           );
         }
-        A.setElementForId(e.id, o);
+        A.setElementForId(r.id, o);
       }
     })
   );
-}, "drawGroups"), br = /* @__PURE__ */ dt(async function(I, D, A) {
+}, "drawGroups"), br = /* @__PURE__ */ dt(async function(I, x, A) {
   const P = Ee();
   for (const N of A) {
-    const u = D.append("g"), h = I.getConfigField("iconSize");
+    const u = x.append("g"), h = I.getConfigField("iconSize");
     if (N.title) {
-      const f = u.append("g");
+      const l = u.append("g");
       await me(
-        f,
+        l,
         N.title,
         {
           useHtmlLabels: !1,
@@ -4298,7 +4294,7 @@ var xe = {
           classes: "architecture-service-label"
         },
         P
-      ), f.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), f.attr("transform", "translate(" + h / 2 + ", " + h + ")");
+      ), l.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), l.attr("transform", "translate(" + h / 2 + ", " + h + ")");
     }
     const a = u.append("g");
     if (N.icon)
@@ -4319,16 +4315,16 @@ var xe = {
         `M0 ${h} v${-h} q0,-5 5,-5 h${h} q5,0 5,5 v${h} H0 Z`
       );
     u.attr("id", `service-${N.id}`).attr("class", "architecture-service");
-    const { width: r, height: e } = u.node().getBBox();
-    N.width = r, N.height = e, I.setElementForId(N.id, u);
+    const { width: e, height: r } = u.node().getBBox();
+    N.width = e, N.height = r, I.setElementForId(N.id, u);
   }
   return 0;
-}, "drawServices"), Pr = /* @__PURE__ */ dt(function(I, D, A) {
+}, "drawServices"), Pr = /* @__PURE__ */ dt(function(I, x, A) {
   A.forEach((P) => {
-    const N = D.append("g"), u = I.getConfigField("iconSize");
+    const N = x.append("g"), u = I.getConfigField("iconSize");
     N.append("g").append("rect").attr("id", "node-" + P.id).attr("fill-opacity", "0").attr("width", u).attr("height", u), N.attr("class", "architecture-junction");
-    const { width: a, height: r } = N._groups[0][0].getBBox();
-    N.width = a, N.height = r, I.setElementForId(P.id, N);
+    const { width: a, height: e } = N._groups[0][0].getBBox();
+    N.width = a, N.height = e, I.setElementForId(P.id, N);
   });
 }, "drawJunctions");
 hr([
@@ -4338,9 +4334,9 @@ hr([
   }
 ]);
 Fe.use(mr);
-function Ue(I, D, A) {
+function Ue(I, x, A) {
   I.forEach((P) => {
-    D.add({
+    x.add({
       group: "nodes",
       data: {
         type: "service",
@@ -4356,9 +4352,9 @@ function Ue(I, D, A) {
   });
 }
 dt(Ue, "addServices");
-function Ye(I, D, A) {
+function Ye(I, x, A) {
   I.forEach((P) => {
-    D.add({
+    x.add({
       group: "nodes",
       data: {
         type: "junction",
@@ -4372,8 +4368,8 @@ function Ye(I, D, A) {
   });
 }
 dt(Ye, "addJunctions");
-function Xe(I, D) {
-  D.nodes().map((A) => {
+function Xe(I, x) {
+  x.nodes().map((A) => {
     const P = ie(A);
     if (P.type === "group")
       return;
@@ -4381,9 +4377,9 @@ function Xe(I, D) {
   });
 }
 dt(Xe, "positionNodes");
-function He(I, D) {
+function He(I, x) {
   I.forEach((A) => {
-    D.add({
+    x.add({
       group: "nodes",
       data: {
         type: "group",
@@ -4397,23 +4393,23 @@ function He(I, D) {
   });
 }
 dt(He, "addGroups");
-function We(I, D) {
+function We(I, x) {
   I.forEach((A) => {
-    const { lhsId: P, rhsId: N, lhsInto: u, lhsGroup: h, rhsInto: a, lhsDir: r, rhsDir: e, rhsGroup: f, title: i } = A, g = Te(A.lhsDir, A.rhsDir) ? "segments" : "straight", t = {
+    const { lhsId: P, rhsId: N, lhsInto: u, lhsGroup: h, rhsInto: a, lhsDir: e, rhsDir: r, rhsGroup: l, title: i } = A, g = Te(A.lhsDir, A.rhsDir) ? "segments" : "straight", t = {
       id: `${P}-${N}`,
       label: i,
       source: P,
-      sourceDir: r,
+      sourceDir: e,
       sourceArrow: u,
       sourceGroup: h,
-      sourceEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%",
+      sourceEndpoint: e === "L" ? "0 50%" : e === "R" ? "100% 50%" : e === "T" ? "50% 0" : "50% 100%",
       target: N,
-      targetDir: e,
+      targetDir: r,
       targetArrow: a,
-      targetGroup: f,
-      targetEndpoint: e === "L" ? "0 50%" : e === "R" ? "100% 50%" : e === "T" ? "50% 0" : "50% 100%"
+      targetGroup: l,
+      targetEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%"
     };
-    D.add({
+    x.add({
       group: "edges",
       data: t,
       classes: g
@@ -4421,49 +4417,47 @@ function We(I, D) {
   });
 }
 dt(We, "addEdges");
-function Ve(I, D, A) {
-  const P = /* @__PURE__ */ dt((a, r) => Object.entries(a).reduce(
-    (e, [f, i]) => {
-      var o;
+function Ve(I, x, A) {
+  const P = /* @__PURE__ */ dt((a, e) => Object.entries(a).reduce(
+    (r, [l, i]) => {
       let g = 0;
       const t = Object.entries(i);
       if (t.length === 1)
-        return e[f] = t[0][1], e;
-      for (let s = 0; s < t.length - 1; s++)
-        for (let c = s + 1; c < t.length; c++) {
-          const [l, T] = t[s], [d, v] = t[c];
-          if (((o = A[l]) == null ? void 0 : o[d]) === r)
-            e[f] ?? (e[f] = []), e[f] = [...e[f], ...T, ...v];
-          else if (l === "default" || d === "default")
-            e[f] ?? (e[f] = []), e[f] = [...e[f], ...T, ...v];
+        return r[l] = t[0][1], r;
+      for (let o = 0; o < t.length - 1; o++)
+        for (let s = o + 1; s < t.length; s++) {
+          const [c, f] = t[o], [T, d] = t[s];
+          if (A[c]?.[T] === e)
+            r[l] ??= [], r[l] = [...r[l], ...f, ...d];
+          else if (c === "default" || T === "default")
+            r[l] ??= [], r[l] = [...r[l], ...f, ...d];
           else {
-            const S = `${f}-${g++}`;
-            e[S] = T;
-            const C = `${f}-${g++}`;
-            e[C] = v;
+            const L = `${l}-${g++}`;
+            r[L] = f;
+            const b = `${l}-${g++}`;
+            r[b] = d;
           }
         }
-      return e;
+      return r;
     },
     {}
-  ), "flattenAlignments"), N = D.map((a) => {
-    const r = {}, e = {};
-    return Object.entries(a).forEach(([f, [i, g]]) => {
-      var o, s, c;
-      const t = ((o = I.getNode(f)) == null ? void 0 : o.in) ?? "default";
-      r[g] ?? (r[g] = {}), (s = r[g])[t] ?? (s[t] = []), r[g][t].push(f), e[i] ?? (e[i] = {}), (c = e[i])[t] ?? (c[t] = []), e[i][t].push(f);
+  ), "flattenAlignments"), N = x.map((a) => {
+    const e = {}, r = {};
+    return Object.entries(a).forEach(([l, [i, g]]) => {
+      const t = I.getNode(l)?.in ?? "default";
+      e[g] ??= {}, e[g][t] ??= [], e[g][t].push(l), r[i] ??= {}, r[i][t] ??= [], r[i][t].push(l);
     }), {
-      horiz: Object.values(P(r, "horizontal")).filter(
-        (f) => f.length > 1
+      horiz: Object.values(P(e, "horizontal")).filter(
+        (l) => l.length > 1
       ),
-      vert: Object.values(P(e, "vertical")).filter(
-        (f) => f.length > 1
+      vert: Object.values(P(r, "vertical")).filter(
+        (l) => l.length > 1
       )
     };
   }), [u, h] = N.reduce(
-    ([a, r], { horiz: e, vert: f }) => [
-      [...a, ...e],
-      [...r, ...f]
+    ([a, e], { horiz: r, vert: l }) => [
+      [...a, ...r],
+      [...e, ...l]
     ],
     [[], []]
   );
@@ -4473,30 +4467,30 @@ function Ve(I, D, A) {
   };
 }
 dt(Ve, "getAlignments");
-function ze(I, D) {
+function ze(I, x) {
   const A = [], P = /* @__PURE__ */ dt((u) => `${u[0]},${u[1]}`, "posToStr"), N = /* @__PURE__ */ dt((u) => u.split(",").map((h) => parseInt(h)), "strToPos");
   return I.forEach((u) => {
     const h = Object.fromEntries(
-      Object.entries(u).map(([f, i]) => [P(i), f])
-    ), a = [P([0, 0])], r = {}, e = {
+      Object.entries(u).map(([l, i]) => [P(i), l])
+    ), a = [P([0, 0])], e = {}, r = {
       L: [-1, 0],
       R: [1, 0],
       T: [0, 1],
       B: [0, -1]
     };
     for (; a.length > 0; ) {
-      const f = a.shift();
-      if (f) {
-        r[f] = 1;
-        const i = h[f];
+      const l = a.shift();
+      if (l) {
+        e[l] = 1;
+        const i = h[l];
         if (i) {
-          const g = N(f);
-          Object.entries(e).forEach(([t, o]) => {
+          const g = N(l);
+          Object.entries(r).forEach(([t, o]) => {
             const s = P([g[0] + o[0], g[1] + o[1]]), c = h[s];
-            c && !r[s] && (a.push(s), A.push({
+            c && !e[s] && (a.push(s), A.push({
               [xe[t]]: c,
               [xe[Tr(t)]]: i,
-              gap: 1.5 * D.getConfigField("iconSize")
+              gap: 1.5 * x.getConfigField("iconSize")
             }));
           });
         }
@@ -4505,9 +4499,9 @@ function ze(I, D) {
   }), A;
 }
 dt(ze, "getRelativeConstraints");
-function $e(I, D, A, P, N, { spatialMaps: u, groupAlignments: h }) {
+function $e(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
   return new Promise((a) => {
-    const r = or("body").append("div").attr("id", "cy").attr("style", "display:none"), e = Fe({
+    const e = or("body").append("div").attr("id", "cy").attr("style", "display:none"), r = Fe({
       container: document.getElementById("cy"),
       style: [
         {
@@ -4579,8 +4573,8 @@ function $e(I, D, A, P, N, { spatialMaps: u, groupAlignments: h }) {
         }
       }
     });
-    r.remove(), He(A, e), Ue(I, e, N), Ye(D, e, N), We(P, e);
-    const f = Ve(N, u, h), i = ze(u, N), g = e.layout({
+    e.remove(), He(A, r), Ue(I, r, N), Ye(x, r, N), We(P, r);
+    const l = Ve(N, u, h), i = ze(u, N), g = r.layout({
       name: "fcose",
       quality: "proof",
       styleEnabled: !1,
@@ -4589,72 +4583,71 @@ function $e(I, D, A, P, N, { spatialMaps: u, groupAlignments: h }) {
       // Adjust the edge parameters if it passes through the border of a group
       // Hacky fix for: https://github.com/iVis-at-Bilkent/cytoscape.js-fcose/issues/67
       idealEdgeLength(t) {
-        const [o, s] = t.connectedNodes(), { parent: c } = ie(o), { parent: l } = ie(s);
-        return c === l ? 1.5 * N.getConfigField("iconSize") : 0.5 * N.getConfigField("iconSize");
+        const [o, s] = t.connectedNodes(), { parent: c } = ie(o), { parent: f } = ie(s);
+        return c === f ? 1.5 * N.getConfigField("iconSize") : 0.5 * N.getConfigField("iconSize");
       },
       edgeElasticity(t) {
-        const [o, s] = t.connectedNodes(), { parent: c } = ie(o), { parent: l } = ie(s);
-        return c === l ? 0.45 : 1e-3;
+        const [o, s] = t.connectedNodes(), { parent: c } = ie(o), { parent: f } = ie(s);
+        return c === f ? 0.45 : 1e-3;
       },
-      alignmentConstraint: f,
+      alignmentConstraint: l,
       relativePlacementConstraint: i
     });
     g.one("layoutstop", () => {
-      var o;
-      function t(s, c, l, T) {
-        let d, v;
-        const { x: L, y: S } = s, { x: C, y: G } = c;
-        v = (T - S + (L - l) * (S - G) / (L - C)) / Math.sqrt(1 + Math.pow((S - G) / (L - C), 2)), d = Math.sqrt(Math.pow(T - S, 2) + Math.pow(l - L, 2) - Math.pow(v, 2));
-        const K = Math.sqrt(Math.pow(C - L, 2) + Math.pow(G - S, 2));
-        d = d / K;
-        let X = (C - L) * (T - S) - (G - S) * (l - L);
+      function t(o, s, c, f) {
+        let T, d;
+        const { x: v, y: L } = o, { x: b, y: C } = s;
+        d = (f - L + (v - c) * (L - C) / (v - b)) / Math.sqrt(1 + Math.pow((L - C) / (v - b), 2)), T = Math.sqrt(Math.pow(f - L, 2) + Math.pow(c - v, 2) - Math.pow(d, 2));
+        const G = Math.sqrt(Math.pow(b - v, 2) + Math.pow(C - L, 2));
+        T = T / G;
+        let k = (b - v) * (f - L) - (C - L) * (c - v);
         switch (!0) {
-          case X >= 0:
-            X = 1;
+          case k >= 0:
+            k = 1;
             break;
-          case X < 0:
-            X = -1;
+          case k < 0:
+            k = -1;
             break;
         }
-        let Q = (C - L) * (l - L) + (G - S) * (T - S);
+        let Y = (b - v) * (c - v) + (C - L) * (f - L);
         switch (!0) {
-          case Q >= 0:
-            Q = 1;
+          case Y >= 0:
+            Y = 1;
             break;
-          case Q < 0:
-            Q = -1;
+          case Y < 0:
+            Y = -1;
             break;
         }
-        return v = Math.abs(v) * X, d = d * Q, {
-          distances: v,
-          weights: d
+        return d = Math.abs(d) * k, T = T * Y, {
+          distances: d,
+          weights: T
         };
       }
-      dt(t, "getSegmentWeights"), e.startBatch();
-      for (const s of Object.values(e.edges()))
-        if ((o = s.data) != null && o.call(s)) {
-          const { x: c, y: l } = s.source().position(), { x: T, y: d } = s.target().position();
-          if (c !== T && l !== d) {
-            const v = s.sourceEndpoint(), L = s.targetEndpoint(), { sourceDir: S } = be(s), [C, G] = qt(S) ? [v.x, L.y] : [L.x, v.y], { weights: K, distances: X } = t(v, L, C, G);
-            s.style("segment-distances", X), s.style("segment-weights", K);
+      dt(t, "getSegmentWeights"), r.startBatch();
+      for (const o of Object.values(r.edges()))
+        if (o.data?.()) {
+          const { x: s, y: c } = o.source().position(), { x: f, y: T } = o.target().position();
+          if (s !== f && c !== T) {
+            const d = o.sourceEndpoint(), v = o.targetEndpoint(), { sourceDir: L } = be(o), [b, C] = qt(L) ? [d.x, v.y] : [v.x, d.y], { weights: G, distances: k } = t(d, v, b, C);
+            o.style("segment-distances", k), o.style("segment-weights", G);
           }
         }
-      e.endBatch(), g.run();
-    }), g.run(), e.ready((t) => {
-      Se.info("Ready", t), a(e);
+      r.endBatch(), g.run();
+    }), g.run(), r.ready((t) => {
+      Se.info("Ready", t), a(r);
     });
   });
 }
 dt($e, "layoutArchitecture");
-var Gr = /* @__PURE__ */ dt(async (I, D, A, P) => {
-  const N = P.db, u = N.getServices(), h = N.getJunctions(), a = N.getGroups(), r = N.getEdges(), e = N.getDataStructures(), f = ke(D), i = f.append("g");
+var Gr = /* @__PURE__ */ dt(async (I, x, A, P) => {
+  const N = P.db, u = N.getServices(), h = N.getJunctions(), a = N.getGroups(), e = N.getEdges(), r = N.getDataStructures(), l = ke(x), i = l.append("g");
   i.attr("class", "architecture-edges");
-  const g = f.append("g");
+  const g = l.append("g");
   g.attr("class", "architecture-services");
-  const t = f.append("g");
+  const t = l.append("g");
   t.attr("class", "architecture-groups"), await br(N, g, u), Pr(N, g, h);
-  const o = await $e(u, h, a, r, N, e);
-  await Sr(i, o, N), await Fr(t, o, N), Xe(N, o), qe(void 0, f, N.getConfigField("padding"), N.getConfigField("useMaxWidth"));
+  const o = await $e(u, h, a, e, N, r);
+  await Sr(i, o, N), await Fr(t, o, N), Xe(N, o), qe(void 0, l, N.getConfigField("padding"), N.getConfigField("useMaxWidth"));
 }, "draw"), Ur = { draw: Gr }, Vr = {
   parser: Ge,
   get db() {