@sme.up/ketchup2 2.0.0-SNAPSHOT-20250924134246 → 2.0.0-SNAPSHOT-20250925132231

package/dist/{architectureDiagram-W76B3OCA-DUxIrce2.js → architectureDiagram-VXUJARFQ-DWhBSBGC.js}

@@ -1,13 +1,13 @@
-import { aJ as Ze, _ as dt, H as ke, V as qe, l as Se, b as Qe, a as Je, p as Ke, q as je, g as _e, s as tr, y as er, D as rr, E as ir, F as ar, c as Ee, am as me, aK as pe, i as nr, d as or, aL as sr, aM as hr } from "./index-Bc5H4y6-.js";
-import { p as lr } from "./chunk-4BX2VUAB-B9ksHSov.js";
-import { p as fr } from "./mermaid-parser.core-Dty-ueuF.js";
+import { aJ as Ze, _ as dt, H as ke, V as qe, l as Se, b as Qe, a as Je, p as Ke, q as je, g as _e, s as tr, y as er, D as rr, E as ir, F as ar, c as Ee, am as me, aK as pe, i as nr, d as or, x as sr, aL as hr, aM as lr } from "./index-CLesa_SQ.js";
+import { p as fr } from "./chunk-4BX2VUAB-CzqEt7TW.js";
+import { p as cr } from "./mermaid-parser.core-B0Cu2wmR.js";
 import { c as Fe } from "./cytoscape.esm-CamnA8MN.js";
-var he = { exports: {} }, le = { exports: {} }, fe = { exports: {} }, cr = fe.exports, we;
-function gr() {
+var he = { exports: {} }, le = { exports: {} }, fe = { exports: {} }, gr = fe.exports, we;
+function ur() {
   return we || (we = 1, function(I, x) {
     (function(P, N) {
       I.exports = N();
-    })(cr, function() {
+    })(gr, function() {
       return (
         /******/
         function(A) {
@@ -66,8 +66,8 @@ function gr() {
           /***/
           function(A, P, N) {
             var u = N(2), h = N(8), a = N(9);
-            function e(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;
             }
             e.prototype = Object.create(u.prototype);
             for (var r in u)
@@ -90,14 +90,14 @@ function gr() {
               return this.sourceInLca;
             }, e.prototype.getTargetInLca = function() {
               return this.targetInLca;
-            }, e.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";
-            }, e.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)
@@ -106,8 +106,8 @@ function gr() {
               }
               return null;
             }, e.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));
+              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 = e;
@@ -123,7 +123,7 @@ function gr() {
           /* 3 */
           /***/
           function(A, P, N) {
-            var u = N(2), h = N(10), a = N(13), e = N(0), r = 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 gr() {
             }, 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 gr() {
             }, 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;
@@ -216,8 +216,8 @@ function gr() {
             }, i.prototype.scatter = function() {
               var t, o, s = -e.INITIAL_WORLD_BOUNDARY, c = e.INITIAL_WORLD_BOUNDARY;
               t = e.WORLD_CENTER_X + r.nextDouble() * (c - s) + s;
-              var l = -e.INITIAL_WORLD_BOUNDARY, T = e.INITIAL_WORLD_BOUNDARY;
-              o = e.WORLD_CENTER_Y + r.nextDouble() * (T - l) + l, this.rect.x = t, this.rect.y = o;
+              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";
@@ -237,8 +237,8 @@ function gr() {
               o > e.WORLD_BOUNDARY ? o = e.WORLD_BOUNDARY : o < -e.WORLD_BOUNDARY && (o = -e.WORLD_BOUNDARY);
               var s = this.rect.y;
               s > e.WORLD_BOUNDARY ? s = e.WORLD_BOUNDARY : s < -e.WORLD_BOUNDARY && (s = -e.WORLD_BOUNDARY);
-              var c = new f(o, s), l = t.inverseTransformPoint(c);
-              this.setLocation(l.x, l.y);
+              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 gr() {
           /* 6 */
           /***/
           function(A, P, N) {
-            var u = N(2), h = N(10), a = N(0), e = N(7), r = 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 e ? 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 gr() {
               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 gr() {
                 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;
+              var f = c;
               if (c instanceof r) {
-                if (l == null)
+                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 b = this.nodes.indexOf(l);
+                var b = this.nodes.indexOf(f);
                 if (b == -1)
                   throw "Node not in owner node list!";
                 this.nodes.splice(b, 1);
-              } else if (c instanceof f) {
+              } else if (c instanceof l) {
                 var d = c;
                 if (d == null)
                   throw "Edge is null!";
@@ -360,24 +360,24 @@ function gr() {
                 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(), b = L.length, C = 0; C < b; 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, b, C, G, k, Y = this.nodes, K = Y.length, O = 0; O < K; O++) {
+              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(), l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
+                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()), 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;
+              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, b, C, G, k = c.length, Y = 0; Y < k; Y++) {
+              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(), l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
+                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 gr() {
                 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,17 +397,17 @@ function gr() {
                 this.isConnected = !0;
                 return;
               }
-              var l = new t(), T = /* @__PURE__ */ new Set(), d = this.nodes[0], v, L, b = d.withChildren();
+              var f = new t(), T = /* @__PURE__ */ new Set(), d = this.nodes[0], v, L, b = d.withChildren();
               for (b.forEach(function(O) {
-                l.push(O), T.add(O);
-              }); l.length !== 0; ) {
-                d = l.shift(), v = d.getEdges();
+                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 Y = L.withChildren();
                     Y.forEach(function(O) {
-                      l.push(O), T.add(O);
+                      f.push(O), T.add(O);
                     });
                   }
                 }
@@ -428,10 +428,10 @@ function gr() {
               u = N(6), this.layout = e, this.graphs = [], this.edges = [];
             }
             a.prototype.addRoot = function() {
-              var e = this.layout.newGraph(), r = this.layout.newNode(null), f = this.add(e, r);
-              return this.setRootGraph(f), this.rootGraph;
-            }, a.prototype.add = function(e, r, f, i, g) {
-              if (f == null && i == null && g == 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)
@@ -444,21 +444,21 @@ function gr() {
                   throw "Already has a child!";
                 return e.parent = r, r.child = e, e;
               } else {
-                g = f, i = r, f = e;
+                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(e) {
               if (e instanceof u) {
@@ -467,10 +467,10 @@ function gr() {
                   throw "Graph not in this graph mgr";
                 if (!(r == this.rootGraph || r.parent != null && r.parent.graphManager == this))
                   throw "Invalid parent node!";
-                var f = [];
-                f = f.concat(r.getEdges());
-                for (var i, g = f.length, t = 0; t < g; t++)
-                  i = f[t], r.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(r.getNodes());
                 var s;
@@ -503,7 +503,7 @@ function gr() {
               return this.graphs;
             }, a.prototype.getAllNodes = function() {
               if (this.allNodes == null) {
-                for (var e = [], r = this.getGraphs(), f = r.length, i = 0; i < f; i++)
+                for (var e = [], r = this.getGraphs(), l = r.length, i = 0; i < l; i++)
                   e = e.concat(r[i].getNodes());
                 this.allNodes = e;
               }
@@ -518,8 +518,8 @@ function gr() {
               if (this.allEdges == null) {
                 var e = [], r = this.getGraphs();
                 r.length;
-                for (var f = 0; f < r.length; f++)
-                  e = e.concat(r[f].getEdges());
+                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;
@@ -542,33 +542,33 @@ function gr() {
                 throw "assert failed";
               if (e == r)
                 return !0;
-              var f = e.getOwner(), i;
+              var l = e.getOwner(), i;
               do {
-                if (i = f.getParent(), i == null)
+                if (i = l.getParent(), i == null)
                   break;
                 if (i == r)
                   return !0;
-                if (f = i.getOwner(), f == null)
+                if (l = i.getOwner(), l == null)
                   break;
               } while (!0);
-              f = r.getOwner();
+              l = r.getOwner();
               do {
-                if (i = f.getParent(), i == null)
+                if (i = l.getParent(), i == null)
                   break;
                 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 e, r, f, i, g, t = this.getAllEdges(), o = t.length, s = 0; s < o; s++) {
-                if (e = t[s], r = e.source, f = e.target, e.lca = null, e.sourceInLca = r, e.targetInLca = f, r == f) {
+              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 = r.getOwner(); e.lca == null; ) {
-                  for (e.targetInLca = f, g = f.getOwner(); e.lca == null; ) {
+                  for (e.targetInLca = l, g = l.getOwner(); e.lca == null; ) {
                     if (g == i) {
                       e.lca = g;
                       break;
@@ -589,27 +589,27 @@ function gr() {
             }, a.prototype.calcLowestCommonAncestor = function(e, r) {
               if (e == r)
                 return e.getOwner();
-              var f = e.getOwner();
+              var l = e.getOwner();
               do {
-                if (f == null)
+                if (l == null)
                   break;
                 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;
+              return l;
             }, a.prototype.calcInclusionTreeDepths = function(e, r) {
               e == null && r == null && (e = this.rootGraph, r = 1);
-              for (var f, i = e.getNodes(), g = i.length, t = 0; t < g; t++)
-                f = i[t], f.inclusionTreeDepth = r, f.child != null && this.calcInclusionTreeDepths(f.child, 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 e, r = [], f = this.edges.length, i = 0; i < f; 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]);
@@ -622,7 +622,7 @@ function gr() {
             var u = N(12);
             function h() {
             }
-            h.calcSeparationAmount = function(a, e, r, f) {
+            h.calcSeparationAmount = function(a, e, r, l) {
               if (!a.intersects(e))
                 throw "assert failed";
               var i = new Array(2);
@@ -630,41 +630,41 @@ function gr() {
               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 + f), r[1] = -1 * i[1] * (t / 2 + f);
+              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 f = a.getCenterX(), i = a.getCenterY(), g = e.getCenterX(), t = e.getCenterY();
+              var l = a.getCenterX(), i = a.getCenterY(), g = e.getCenterX(), t = e.getCenterY();
               if (a.intersects(e))
-                return r[0] = f, r[1] = i, r[2] = g, r[3] = t, !0;
-              var o = a.getX(), s = a.getY(), c = a.getRight(), l = a.getX(), T = a.getBottom(), d = a.getRight(), v = a.getWidthHalf(), L = a.getHeightHalf(), b = e.getX(), C = e.getY(), G = e.getRight(), k = e.getX(), Y = e.getBottom(), K = e.getRight(), O = e.getWidthHalf(), it = e.getHeightHalf(), n = !1, m = !1;
-              if (f === g) {
+                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 r[0] = f, r[1] = s, r[2] = g, r[3] = Y, !1;
+                  return r[0] = l, r[1] = s, r[2] = g, r[3] = Y, !1;
                 if (i < t)
-                  return r[0] = f, r[1] = T, r[2] = g, r[3] = C, !1;
+                  return r[0] = l, r[1] = T, r[2] = g, r[3] = C, !1;
               } else if (i === t) {
-                if (f > g)
+                if (l > g)
                   return r[0] = o, r[1] = i, r[2] = G, r[3] = t, !1;
-                if (f < g)
+                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 = e.height / e.width, y = (t - i) / (g - f), R = void 0, M = void 0, S = void 0, W = void 0, D = void 0, q = void 0;
-                if (-p === y ? f > g ? (r[0] = l, r[1] = T, n = !0) : (r[0] = c, r[1] = s, n = !0) : p === y && (f > g ? (r[0] = o, r[1] = s, n = !0) : (r[0] = d, r[1] = T, n = !0)), -E === y ? g > f ? (r[2] = k, r[3] = Y, m = !0) : (r[2] = G, r[3] = C, m = !0) : E === y && (g > f ? (r[2] = b, r[3] = C, m = !0) : (r[2] = K, r[3] = Y, m = !0)), n && m)
+                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, S = f + -L / y, r[0] = S, r[1] = W;
+                      W = s, S = l + -L / y, r[0] = S, r[1] = W;
                       break;
                     case 2:
                       S = d, W = i + v * y, r[0] = S, r[1] = W;
                       break;
                     case 3:
-                      W = T, S = f + L / y, r[0] = S, r[1] = W;
+                      W = T, S = l + L / y, r[0] = S, r[1] = W;
                       break;
                     case 4:
-                      S = l, W = i + -v * y, r[0] = S, r[1] = W;
+                      S = f, W = i + -v * y, r[0] = S, r[1] = W;
                       break;
                   }
                 if (!m)
@@ -686,23 +686,23 @@ function gr() {
               return !1;
             }, h.getCardinalDirection = function(a, e, r) {
               return a > e ? r : 1 + r % 4;
-            }, h.getIntersection = function(a, e, r, f) {
-              if (f == null)
+            }, 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, l = f.x, T = f.y, d = void 0, v = void 0, L = void 0, b = void 0, C = void 0, G = void 0, k = void 0, Y = void 0, K = void 0;
-              return L = o - g, C = i - t, k = t * g - i * o, b = T - c, G = s - l, Y = l * c - s * T, K = L * G - b * C, K === 0 ? null : (d = (C * Y - G * k) / K, v = (b * k - L * Y) / K, new u(d, v));
-            }, h.angleOfVector = function(a, e, r, f) {
+              var i = 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 !== r ? (i = Math.atan((f - e) / (r - a)), r < a ? i += Math.PI : f < e && (i += this.TWO_PI)) : f < e ? i = this.ONE_AND_HALF_PI : i = this.HALF_PI, i;
-            }, h.doIntersect = function(a, e, r, f) {
-              var i = a.x, g = a.y, t = e.x, o = e.y, s = r.x, c = r.y, l = f.x, T = f.y, d = (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, e, r, f, i, g, t) {
-              var o = (r - a) * (r - a) + (f - e) * (f - e), s = 2 * ((a - i) * (r - a) + (e - g) * (f - e)), c = (a - i) * (a - i) + (e - g) * (e - 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;
@@ -753,7 +753,7 @@ function gr() {
             }, 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?.forEach(function(o) {
@@ -840,7 +840,7 @@ function gr() {
                 }
               }]), i;
             }();
-            A.exports = f;
+            A.exports = l;
           },
           /* 12 */
           /***/
@@ -940,13 +940,13 @@ function gr() {
           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), e = N(3), r = 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,7 +962,7 @@ function gr() {
               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 e(this.graphManager, s);
             }, o.prototype.newEdge = function(s) {
@@ -979,8 +979,8 @@ function gr() {
               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) {
@@ -989,8 +989,8 @@ function gr() {
               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);
@@ -1001,7 +1001,7 @@ function gr() {
                   var L = v.vGraphObject;
                   L.update(v);
                 }
-              } else if (s instanceof f) {
+              } else if (s instanceof l) {
                 var b = s;
                 if (b.vGraphObject != null) {
                   var C = b.vGraphObject;
@@ -1014,9 +1014,9 @@ function gr() {
               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,15 +1025,15 @@ function gr() {
               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 = [], b = /* @__PURE__ */ new Map(), C = [];
-              for (C = C.concat(l); C.length > 0 && 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);
@@ -1062,32 +1062,32 @@ function gr() {
               }
               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()), b = l.bendpoints.get(d);
+                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;
@@ -1101,14 +1101,14 @@ function gr() {
             }, 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 b = c[L], C = b.getNeighborsList().size;
-                T.set(b, b.getNeighborsList().size), C == 1 && l.push(b);
+                T.set(b, b.getNeighborsList().size), C == 1 && f.push(b);
               }
               var G = [];
-              for (G = G.concat(l); !d; ) {
+              for (G = G.concat(f); !d; ) {
                 var k = [];
                 k = k.concat(G), G = [];
                 for (var L = 0; L < c.length; L++) {
@@ -1116,13 +1116,13 @@ function gr() {
                   Y >= 0 && c.splice(Y, 1);
                   var K = b.getNeighborsList();
                   K.forEach(function(n) {
-                    if (l.indexOf(n) < 0) {
+                    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) {
@@ -1205,7 +1205,7 @@ function gr() {
               } else
                 return Array.from(t);
             }
-            var h = N(15), a = N(4), e = N(0), r = 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 gr() {
             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 * e.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 gr() {
               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 gr() {
               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, b, 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)) {
-                r.calcSeparationAmount(s, c, l, a.DEFAULT_EDGE_LENGTH / 2), G = 2 * l[0], k = 2 * l[1];
+                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()) : (r.getIntersection(s, c, T), d = T[2] - T[0], v = T[3] - T[1]), Math.abs(d) < a.MIN_REPULSION_DIST && (d = f.sign(d) * a.MIN_REPULSION_DIST), Math.abs(v) < a.MIN_REPULSION_DIST && (v = f.sign(v) * a.MIN_REPULSION_DIST), L = d * d + v * v, b = Math.sqrt(L), C = (t.nodeRepulsion / 2 + o.nodeRepulsion / 2) * t.noOfChildren * o.noOfChildren / L, G = C * d / b, k = C * v / b, t.repulsionForceX -= G, t.repulsionForceY -= k, o.repulsionForceX += G, o.repulsionForceY += k;
+                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 gr() {
             }, 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 b = 0; b < d[v][L].length; b++)
-                        if (T = d[v][L][b], !(t.getOwner() != T.getOwner() || t == T) && !o.has(T) && !l.has(T)) {
+                        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,8 +1308,8 @@ function gr() {
           /***/
           function(A, P, N) {
             var u = N(1), h = N(4);
-            function a(r, f, i) {
-              u.call(this, r, 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 e in u)
@@ -1320,14 +1320,14 @@ function gr() {
           /***/
           function(A, P, N) {
             var u = N(3), h = N(4);
-            function a(r, f, i, g) {
-              u.call(this, r, 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 e in u)
               a[e] = u[e];
-            a.prototype.setGridCoordinates = function(r, f, i, g) {
-              this.startX = r, this.finishX = f, this.startY = i, this.finishY = g;
+            a.prototype.setGridCoordinates = function(r, l, i, g) {
+              this.startX = r, this.finishX = l, this.startY = i, this.finishY = g;
             }, A.exports = a;
           },
           /* 21 */
@@ -1386,14 +1386,14 @@ function gr() {
             }, h.prototype.size = function() {
               return Object.keys(this.set).length;
             }, h.prototype.addAllTo = function(a) {
-              for (var e = Object.keys(this.set), r = e.length, f = 0; f < r; f++)
-                a.push(this.set[e[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 e = a.length, r = 0; r < e; r++) {
-                var f = a[r];
-                this.add(f);
+                var l = a[r];
+                this.add(l);
               }
             }, A.exports = h;
           },
@@ -1405,10 +1405,10 @@ function gr() {
             u.multMat = function(h, a) {
               for (var e = [], r = 0; r < h.length; r++) {
                 e[r] = [];
-                for (var f = 0; f < a[0].length; f++) {
-                  e[r][f] = 0;
+                for (var l = 0; l < a[0].length; l++) {
+                  e[r][l] = 0;
                   for (var i = 0; i < h[0].length; i++)
-                    e[r][f] += h[r][i] * a[i][f];
+                    e[r][l] += h[r][i] * a[i][l];
                 }
               }
               return e;
@@ -1441,18 +1441,18 @@ function gr() {
               for (var a = [], e = 0, r = 0; r < h.length; r++)
                 e += h[r];
               e *= -1 / h.length;
-              for (var f = 0; f < h.length; f++)
-                a[f] = e + h[f];
+              for (var l = 0; l < h.length; l++)
+                a[l] = e + h[l];
               return a;
             }, u.multL = function(h, a, e) {
-              for (var r = [], f = [], i = [], g = 0; g < a[0].length; g++) {
+              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 < e.length; s++) {
-                for (var c = 0, l = 0; l < e.length; l++)
-                  c += e[s][l] * f[l];
+                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++) {
@@ -1467,25 +1467,25 @@ function gr() {
           /***/
           function(A, P, N) {
             var u = /* @__PURE__ */ function() {
-              function r(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 && r(f.prototype, i), g && r(f, g), f;
+              return function(l, i, g) {
+                return i && r(l.prototype, i), g && r(l, g), l;
               };
             }();
-            function h(r, f) {
-              if (!(r instanceof f))
+            function h(r, l) {
+              if (!(r instanceof l))
                 throw new TypeError("Cannot call a class as a function");
             }
             var a = N(11), e = function() {
-              function r(f, i) {
+              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(r, [{
                 key: "_quicksort",
@@ -1572,7 +1572,7 @@ function gr() {
                 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,17 +1589,17 @@ function gr() {
                   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];
                   }
                   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) {
@@ -1767,14 +1767,14 @@ function gr() {
           /***/
           function(A, P, N) {
             var u = /* @__PURE__ */ function() {
-              function e(r, f) {
-                for (var i = 0; i < f.length; i++) {
-                  var g = f[i];
+              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(r, f, i) {
-                return f && e(r.prototype, f), i && e(r, i), r;
+              return function(r, l, i) {
+                return l && e(r.prototype, l), i && e(r, i), r;
               };
             }();
             function h(e, r) {
@@ -1782,9 +1782,9 @@ function gr() {
                 throw new TypeError("Cannot call a class as a function");
             }
             var a = function() {
-              function e(r, 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, e), this.sequence1 = r, this.sequence2 = f, this.match_score = i, this.mismatch_penalty = g, this.gap_penalty = t, this.iMax = r.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,8 +1793,8 @@ function gr() {
                 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();
               }
@@ -1812,16 +1812,16 @@ function gr() {
               }, {
                 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,44 +1829,44 @@ function gr() {
               }, {
                 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));
                 }
               }]), e;
             }();
@@ -1893,13 +1893,13 @@ function gr() {
               });
             }, h.removeListener = function(a, e) {
               for (var r = this.listeners.length; r >= 0; r--) {
-                var f = this.listeners[r];
-                f.event === a && f.callback === e && this.listeners.splice(r, 1);
+                var l = this.listeners[r];
+                l.event === a && l.callback === e && this.listeners.splice(r, 1);
               }
             }, h.emit = function(a, e) {
               for (var r = 0; r < this.listeners.length; r++) {
-                var f = this.listeners[r];
-                a === f.event && f.callback(e);
+                var l = this.listeners[r];
+                a === l.event && l.callback(e);
               }
             }, A.exports = u;
           }
@@ -1909,12 +1909,12 @@ function gr() {
     });
   }(fe)), fe.exports;
 }
-var ur = le.exports, Oe;
-function dr() {
+var dr = le.exports, Oe;
+function vr() {
   return Oe || (Oe = 1, function(I, x) {
     (function(P, N) {
-      I.exports = N(gr());
-    })(ur, function(A) {
+      I.exports = N(ur());
+    })(dr, function(A) {
       return (
         /******/
         (() => {
@@ -1923,33 +1923,33 @@ function dr() {
             45: (
               /***/
               (a, e, r) => {
-                var f = {};
-                f.layoutBase = r(551), f.CoSEConstants = r(806), f.CoSEEdge = r(767), f.CoSEGraph = r(880), f.CoSEGraphManager = r(578), f.CoSELayout = r(765), f.CoSENode = r(991), f.ConstraintHandler = r(902), a.exports = f;
+                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, e, r) => {
-                var f = r(551).FDLayoutConstants;
+                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, e, r) => {
-                var f = r(551).FDLayoutEdge;
+                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;
               }
             ),
@@ -1957,13 +1957,13 @@ function dr() {
             880: (
               /***/
               (a, e, r) => {
-                var f = r(551).LGraph;
+                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;
               }
             ),
@@ -1971,13 +1971,13 @@ function dr() {
             578: (
               /***/
               (a, e, r) => {
-                var f = r(551).LGraphManager;
+                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;
               }
             ),
@@ -1985,13 +1985,13 @@ function dr() {
             765: (
               /***/
               (a, e, r) => {
-                var f = r(551).FDLayout, i = r(578), g = r(880), t = r(991), o = r(767), s = r(806), c = r(902), l = r(551).FDLayoutConstants, T = r(551).LayoutConstants, d = r(551).Point, v = r(551).PointD, L = r(551).DimensionD, b = r(551).Layout, C = r(551).Integer, G = r(551).IGeometry, k = r(551).LGraph, Y = r(551).Transform, K = r(551).LinkedList;
+                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 it in f)
-                  O[it] = f[it];
+                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 dr() {
                 }, 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 dr() {
                       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 dr() {
                         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 dr() {
                   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 dr() {
                 }, 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; )
@@ -2640,7 +2640,7 @@ function dr() {
                       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;
               }
@@ -2649,19 +2649,19 @@ function dr() {
             991: (
               /***/
               (a, e, r) => {
-                var f = r(551).FDLayoutNode, i = r(551).IMath;
-                function g(o, s, c, l) {
-                  f.call(this, o, s, c, l);
+                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;
@@ -2686,10 +2686,10 @@ function dr() {
             902: (
               /***/
               (a, e, r) => {
-                function f(c) {
+                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);
@@ -2698,13 +2698,13 @@ function dr() {
                 function s() {
                 }
                 s.handleConstraints = function(c) {
-                  var l = {};
-                  l.fixedNodeConstraint = c.constraints.fixedNodeConstraint, l.alignmentConstraint = c.constraints.alignmentConstraint, l.relativePlacementConstraint = c.constraints.relativePlacementConstraint;
+                  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(F) {
+                  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 Y = function(U, $) {
@@ -2810,7 +2810,7 @@ function dr() {
                           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));
@@ -2902,25 +2902,25 @@ function dr() {
                       });
                     }), $;
                   }, E = [], y = [], R = !1, M = !1, S = /* @__PURE__ */ new Set(), W = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), q = [];
-                  if (l.fixedNodeConstraint && l.fixedNodeConstraint.forEach(function(F) {
+                  if (f.fixedNodeConstraint && f.fixedNodeConstraint.forEach(function(F) {
                     S.add(F.nodeId);
-                  }), l.relativePlacementConstraint && (l.relativePlacementConstraint.forEach(function(F) {
+                  }), 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 (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 1)
-                      l.fixedNodeConstraint.forEach(function(F, U) {
+                    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 F = 0;
-                        if (l.alignmentConstraint.vertical) {
-                          for (var U = l.alignmentConstraint.vertical, $ = function(tt) {
+                        if (f.alignmentConstraint.vertical) {
+                          for (var U = f.alignmentConstraint.vertical, $ = 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) {
+                            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 = K(j).x, U[tt].forEach(function(pt) {
@@ -2930,13 +2930,13 @@ function dr() {
                             $(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) {
+                            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 = K(j).y, Z[tt].forEach(function(pt) {
@@ -2946,13 +2946,13 @@ function dr() {
                             at(ct);
                           R = !0;
                         }
-                        l.relativePlacementConstraint && (M = !0);
+                        f.relativePlacementConstraint && (M = !0);
                       })();
-                    else if (l.relativePlacementConstraint) {
+                    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(l.relativePlacementConstraint), R = !1, M = !1;
+                        it(f.relativePlacementConstraint), R = !1, M = !1;
                       else {
                         var z = /* @__PURE__ */ new Map(), w = /* @__PURE__ */ new Map(), H = [];
                         q[X].forEach(function(F) {
@@ -2975,31 +2975,31 @@ function dr() {
                         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 && it(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(F, U) {
+                      f.fixedNodeConstraint.forEach(function(F, U) {
                         var $ = { x: v[d.get(F.nodeId)], y: L[d.get(F.nodeId)] }, J = F.position, Z = Y(J, $);
                         Et.x += Z.x, Et.y += Z.y;
-                      }), Et.x /= l.fixedNodeConstraint.length, Et.y /= l.fixedNodeConstraint.length, v.forEach(function(F, U) {
+                      }), Et.x /= f.fixedNodeConstraint.length, Et.y /= f.fixedNodeConstraint.length, v.forEach(function(F, U) {
                         v[U] += Et.x;
                       }), L.forEach(function(F, U) {
                         L[U] += Et.y;
-                      }), l.fixedNodeConstraint.forEach(function(F) {
+                      }), 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 $ = /* @__PURE__ */ new Set();
                           Dt[U].forEach(function(at) {
                             $.add(at);
                           });
-                          var J = new Set([].concat(f($)).filter(function(at) {
+                          var J = new Set([].concat(l($)).filter(function(at) {
                             return S.has(at);
                           })), Z = void 0;
                           J.size > 0 ? Z = v[d.get(J.values().next().value)] : Z = K($).x, $.forEach(function(at) {
@@ -3007,13 +3007,13 @@ function dr() {
                           });
                         }, 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 $ = /* @__PURE__ */ new Set();
                           Ut[U].forEach(function(at) {
                             $.add(at);
                           });
-                          var J = new Set([].concat(f($)).filter(function(at) {
+                          var J = new Set([].concat(l($)).filter(function(at) {
                             return S.has(at);
                           })), Z = void 0;
                           J.size > 0 ? Z = L[d.get(J.values().next().value)] : Z = K($).y, $.forEach(function(at) {
@@ -3022,20 +3022,20 @@ function dr() {
                         }, Ft = 0; Ft < Ut.length; Ft++)
                           Pt(Ft);
                     }
-                    l.relativePlacementConstraint && function() {
+                    f.relativePlacementConstraint && function() {
                       var F = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), at = /* @__PURE__ */ new Map(), ct = /* @__PURE__ */ new Set(), nt = /* @__PURE__ */ new Set();
                       if (S.forEach(function(Gt) {
                         ct.add(Gt), nt.add(Gt);
-                      }), l.alignmentConstraint) {
-                        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) {
                             $.set("dummy" + yt, []), tt[yt].forEach(function(wt) {
                               F.set(wt, "dummy" + yt), $.get("dummy" + yt).push(wt), S.has(wt) && ct.add("dummy" + yt);
                             }), 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), S.has(wt) && nt.add("dummy" + yt);
                             }), at.set("dummy" + yt, L[d.get(Mt[yt][0])]);
@@ -3153,12 +3153,12 @@ function dr() {
     });
   }(le)), le.exports;
 }
-var vr = he.exports, De;
-function pr() {
+var pr = he.exports, De;
+function yr() {
   return De || (De = 1, function(I, x) {
     (function(P, N) {
-      I.exports = N(dr());
-    })(vr, function(A) {
+      I.exports = N(vr());
+    })(pr, function(A) {
       return (
         /******/
         (() => {
@@ -3168,9 +3168,9 @@ function pr() {
               /***/
               (a) => {
                 a.exports = Object.assign != null ? Object.assign.bind(Object) : function(e) {
-                  for (var r = arguments.length, f = Array(r > 1 ? r - 1 : 0), i = 1; i < r; i++)
-                    f[i - 1] = arguments[i];
-                  return f.forEach(function(g) {
+                  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 e[t] = g[t];
                     });
@@ -3182,17 +3182,17 @@ function pr() {
             548: (
               /***/
               (a, e, r) => {
-                var f = /* @__PURE__ */ function() {
+                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 (b) {
                       T = !0, d = b;
                     } finally {
                       try {
-                        !l && v.return && v.return();
+                        !f && v.return && v.return();
                       } finally {
                         if (T) throw d;
                       }
@@ -3210,9 +3210,9 @@ function pr() {
                 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,15 +3221,15 @@ function pr() {
                   });
                   return c;
                 }, g.connectComponents = function(t, o, s, c) {
-                  var l = new i(), T = /* @__PURE__ */ new Set(), d = [], v = void 0, L = void 0, b = void 0, C = !1, G = 1, k = [], Y = [], K = function() {
+                  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), it.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(D) {
                         o.intersection(n.edgesWith(D)).length > 0 && R.merge(D);
@@ -3239,11 +3239,11 @@ function pr() {
                         if (v = s.intersection(S.union(S.ancestors())), v != null && !T.has(v[0])) {
                           var W = v.union(v.descendants());
                           W.forEach(function(D) {
-                            l.push(D), T.add(D), it.merge(D), s.has(D) && d.push(D);
+                            f.push(D), T.add(D), it.merge(D), s.has(D) && d.push(D);
                           });
                         }
                       }
-                    }; l.length != 0; )
+                    }; f.length != 0; )
                       p();
                     if (it.forEach(function(y) {
                       o.intersection(y.connectedEdges()).forEach(function(R) {
@@ -3265,15 +3265,15 @@ function pr() {
                   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, b = void 0;
                       try {
                         for (var C = o.nodeIndexes[Symbol.iterator](), G; !(v = (G = C.next()).done); v = !0) {
-                          var k = G.value, Y = f(k, 2), K = Y[0], O = Y[1], it = s.cy.getElementById(K);
+                          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 > l && (l = p), E < T && (T = E), y > d && (d = y);
+                            m < c && (c = m), p > f && (f = p), E < T && (T = E), y > d && (d = y);
                           }
                         }
                       } catch (D) {
@@ -3286,7 +3286,7 @@ function pr() {
                             throw b;
                         }
                       }
-                      var R = t.x - (l + c) / 2, M = t.y - (d + T) / 2;
+                      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) {
@@ -3295,9 +3295,9 @@ function pr() {
                     } else {
                       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 > l && (l = X), et < T && (T = et), z > d && (d = z);
+                        V < c && (c = V), X > f && (f = X), et < T && (T = et), z > d && (d = z);
                       });
-                      var S = t.x - (l + c) / 2, W = t.y - (d + T) / 2;
+                      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);
@@ -3305,19 +3305,19 @@ function pr() {
                     }
                   }
                 }, g.calcBoundingBox = function(t, o, s, c) {
-                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, d = Number.MAX_SAFE_INTEGER, v = Number.MIN_SAFE_INTEGER, L = void 0, b = void 0, C = void 0, G = void 0, k = t.descendants().not(":parent"), Y = k.length, K = 0; K < Y; K++) {
+                  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, l > L && (l = L), T < b && (T = b), d > C && (d = C), v < G && (v = G);
+                    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 it = {};
-                  return it.topLeftX = l, it.topLeftY = d, it.width = T - l, it.height = v - d, 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;
               }
@@ -3326,14 +3326,14 @@ function pr() {
             816: (
               /***/
               (a, e, r) => {
-                var f = r(548), i = r(140).CoSELayout, g = r(140).CoSENode, t = r(140).layoutBase.PointD, o = r(140).layoutBase.DimensionD, s = r(140).layoutBase.LayoutConstants, c = r(140).layoutBase.FDLayoutConstants, l = r(140).CoSEConstants, T = function(v, L) {
+                var 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 = f.calcParentsWithoutChildren(b, C), E = function W(D, q, V, X) {
+                  }, 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());
@@ -3345,7 +3345,7 @@ function pr() {
                           if (!w.isParent())
                             B = 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, K, O, Y);
+                            var ht = l.calcBoundingBox(w, K, O, Y);
                             w.intersection(p).length == 0 ? B = D.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(ht.width, ht.height))) : B = D.add(new g(V.graphManager, new t(ht.topLeftX, ht.topLeftY), new o(parseFloat(_.w), parseFloat(_.h))));
                           }
                         else
@@ -3365,13 +3365,13 @@ function pr() {
                         _.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 = X / 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);
+                    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;
+                  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(), f.getTopMostNodes(G), M, v), y(M, S, k), R(M, v), M.runLayout(), it;
+                  return E(S.addRoot(), l.getTopMostNodes(G), M, v), y(M, S, k), R(M, v), M.runLayout(), it;
                 };
                 a.exports = { coseLayout: T };
               }
@@ -3380,7 +3380,7 @@ function pr() {
             212: (
               /***/
               (a, e, r) => {
-                var f = /* @__PURE__ */ function() {
+                var l = /* @__PURE__ */ function() {
                   function v(L, b) {
                     for (var C = 0; C < b.length; C++) {
                       var G = b[C];
@@ -3395,7 +3395,7 @@ function pr() {
                   if (!(v instanceof L))
                     throw new TypeError("Cannot call a class as a function");
                 }
-                var g = r(658), t = r(548), o = r(657), s = o.spectralLayout, c = r(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,7 +3488,7 @@ function pr() {
                   function v(L) {
                     i(this, v), this.options = g({}, T, L);
                   }
-                  return f(v, [{
+                  return l(v, [{
                     key: "run",
                     value: function() {
                       var b = this, C = this.options, G = C.cy, k = C.eles, Y = [], K = [], O = void 0, it = [];
@@ -3520,7 +3520,7 @@ function pr() {
                               }
                             }
                             O.forEach(function(vt, rt) {
-                              C.eles = vt, K.push(l(C, Y[rt])), t.relocateComponent(it[rt], K[rt], C);
+                              C.eles = vt, K.push(f(C, Y[rt])), t.relocateComponent(it[rt], K[rt], C);
                             });
                           } else
                             O.forEach(function(vt, rt) {
@@ -3594,7 +3594,7 @@ function pr() {
                             var y = s(C);
                             Y.push(y);
                           }
-                          C.quality == "default" || C.quality == "proof" ? (K.push(l(C, Y[0])), t.relocateComponent(it[0], K[0], C)) : t.relocateComponent(it[0], Y[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(rt, gt) {
                         if (C.quality == "default" || C.quality == "proof") {
@@ -3636,8 +3636,8 @@ function pr() {
             657: (
               /***/
               (a, e, r) => {
-                var f = r(548), i = r(140).layoutBase.Matrix, g = r(140).layoutBase.SVD, t = function(s) {
-                  var c = s.cy, l = s.eles, T = l.nodes(), d = l.nodes(":parent"), v = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), C = [], G = [], 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() {
+                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, $ = 0, J = !1; $ < S; ) {
                       U = Math.floor(Math.random() * m), J = !1;
                       for (var Z = 0; Z < $; Z++)
@@ -3718,8 +3718,8 @@ function pr() {
                       ct[lt] = Z[lt];
                     G = i.multCons(at, Math.sqrt(Math.abs(U))), k = i.multCons(ct, Math.sqrt(Math.abs($)));
                   };
-                  f.connectComponents(c, l, f.getTopMostNodes(T), v), d.forEach(function(F) {
-                    f.connectComponents(c, l, f.getTopMostNodes(F.descendants().intersection(l)), v);
+                  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++);
@@ -3742,8 +3742,8 @@ function pr() {
                   for (var It = 0; It < L.size; It++)
                     C[It] = [];
                   d.forEach(function(F) {
-                    for (var U = F.children().intersection(l); U.nodes(":childless").length == 0; )
-                      U = U.nodes()[0].children().intersection(l);
+                    for (var U = F.children().intersection(f); U.nodes(":childless").length == 0; )
+                      U = U.nodes()[0].children().intersection(f);
                     var $ = 0, J = U.nodes(":childless")[0].connectedEdges().length;
                     U.nodes(":childless").forEach(function(Z, at) {
                       Z.connectedEdges().length < J && (J = Z.connectedEdges().length, $ = at);
@@ -3751,7 +3751,7 @@ function pr() {
                   }), T.forEach(function(F) {
                     var U = void 0;
                     F.isParent() ? U = L.get(b.get(F.id())) : U = L.get(F.id()), F.neighborhood().nodes().forEach(function($) {
-                      l.intersection(F.edgesWith($)).length > 0 && ($.isParent() ? C[U].push(b.get($.id())) : C[U].push($.id()));
+                      f.intersection(F.edgesWith($)).length > 0 && ($.isParent() ? C[U].push(b.get($.id())) : C[U].push($.id()));
                     });
                   });
                   var Nt = function(U) {
@@ -3802,8 +3802,8 @@ function pr() {
             579: (
               /***/
               (a, e, r) => {
-                var f = r(212), i = function(t) {
-                  t && t("layout", "fcose", f);
+                var l = r(212), i = function(t) {
+                  t && t("layout", "fcose", l);
                 };
                 typeof cytoscape < "u" && i(cytoscape), a.exports = i;
               }
@@ -3839,8 +3839,8 @@ function pr() {
     });
   }(he)), he.exports;
 }
-var yr = pr();
-const Er = /* @__PURE__ */ Ze(yr);
+var Er = yr();
+const mr = /* @__PURE__ */ Ze(Er);
 var xe = {
   L: "left",
   R: "right",
@@ -3856,7 +3856,7 @@ var xe = {
   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")
-}, mr = /* @__PURE__ */ dt(function(I) {
+}, Tr = /* @__PURE__ */ dt(function(I) {
   return Wt(I) ? I === "L" ? "R" : "L" : I === "T" ? "B" : "T";
 }, "getOppositeArchitectureDirection"), Re = /* @__PURE__ */ dt(function(I) {
   const x = I;
@@ -3870,26 +3870,26 @@ var xe = {
 }, "isArchitectureDirectionY"), Te = /* @__PURE__ */ dt(function(I, x) {
   const A = Wt(I) && qt(x), P = qt(I) && Wt(x);
   return A || P;
-}, "isArchitectureDirectionXY"), Tr = /* @__PURE__ */ dt(function(I) {
+}, "isArchitectureDirectionXY"), Nr = /* @__PURE__ */ dt(function(I) {
   const x = I[0], A = I[1], P = Wt(x) && qt(A), N = qt(x) && Wt(A);
   return P || N;
-}, "isArchitecturePairXY"), Nr = /* @__PURE__ */ dt(function(I) {
+}, "isArchitecturePairXY"), Lr = /* @__PURE__ */ dt(function(I) {
   return I !== "LL" && I !== "RR" && I !== "TT" && I !== "BB";
 }, "isValidArchitectureDirectionPair"), ye = /* @__PURE__ */ dt(function(I, x) {
   const A = `${I}${x}`;
-  return Nr(A) ? A : void 0;
-}, "getArchitectureDirectionPair"), Lr = /* @__PURE__ */ dt(function([I, x], A) {
+  return Lr(A) ? A : void 0;
+}, "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), 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"), Cr = /* @__PURE__ */ dt(function(I) {
+}, "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"), Ar = /* @__PURE__ */ dt(function(I, x) {
+}, "getArchitectureDirectionXYFactors"), Mr = /* @__PURE__ */ dt(function(I, x) {
   return Te(I, x) ? "bend" : Wt(I) ? "horizontal" : "vertical";
-}, "getArchitectureDirectionAlignment"), Mr = /* @__PURE__ */ dt(function(I) {
+}, "getArchitectureDirectionAlignment"), wr = /* @__PURE__ */ dt(function(I) {
   return I.type === "service";
-}, "isArchitectureService"), wr = /* @__PURE__ */ dt(function(I) {
+}, "isArchitectureService"), Or = /* @__PURE__ */ dt(function(I) {
   return I.type === "junction";
-}, "isArchitectureJunction"), be = /* @__PURE__ */ dt((I) => I.data(), "edgeData"), ie = /* @__PURE__ */ dt((I) => I.data(), "nodeData"), Or = ar.architecture, ae, Pe = (ae = class {
+}, "isArchitectureJunction"), be = /* @__PURE__ */ dt((I) => I.data(), "edgeData"), ie = /* @__PURE__ */ dt((I) => I.data(), "nodeData"), Dr = ar.architecture, ae, Pe = (ae = class {
   constructor() {
     this.nodes = {}, this.groups = {}, this.edges = [], this.registeredIds = {}, this.elements = {}, this.setAccTitle = Qe, this.getAccTitle = Je, this.setDiagramTitle = Ke, this.getDiagramTitle = je, this.getAccDescription = _e, this.setAccDescription = tr, this.clear();
   }
@@ -3928,7 +3928,7 @@ var xe = {
     };
   }
   getServices() {
-    return Object.values(this.nodes).filter(Mr);
+    return Object.values(this.nodes).filter(wr);
   }
   addJunction({ id: x, in: A }) {
     this.registeredIds[x] = "node", this.nodes[x] = {
@@ -3939,7 +3939,7 @@ var xe = {
     };
   }
   getJunctions() {
-    return Object.values(this.nodes).filter(wr);
+    return Object.values(this.nodes).filter(Or);
   }
   getNodes() {
     return Object.values(this.nodes);
@@ -3999,12 +3999,12 @@ var xe = {
       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[x].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 [${x}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
       );
-    if (e && 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.`
       );
@@ -4031,10 +4031,10 @@ var xe = {
    */
   getDataStructures() {
     if (this.dataStructures === void 0) {
-      const x = {}, A = Object.entries(this.nodes).reduce((e, [r, f]) => (e[r] = f.edges.reduce((i, g) => {
+      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 s = Ar(g.lhsDir, g.rhsDir);
+          const s = Mr(g.lhsDir, g.rhsDir);
           s !== "bend" && (x[t] ??= {}, x[t][o] = s, x[o] ??= {}, x[o][t] = s);
         }
         if (g.lhsId === r) {
@@ -4049,17 +4049,17 @@ var xe = {
         (e, r) => r === P ? e : { ...e, [r]: 1 },
         {}
       ), h = /* @__PURE__ */ dt((e) => {
-        const r = { [e]: [0, 0] }, f = [e];
-        for (; f.length > 0; ) {
-          const i = f.shift();
+        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] = r[i];
             Object.entries(g).forEach(([s, c]) => {
-              N[c] || (r[c] = Lr(
+              N[c] || (r[c] = Cr(
                 [t, o],
                 s
-              ), f.push(c));
+              ), l.push(c));
             });
           }
         }
@@ -4083,31 +4083,31 @@ var xe = {
   }
   getConfig() {
     return rr({
-      ...Or,
+      ...Dr,
       ...ir().architecture
     });
   }
   getConfigField(x) {
     return this.getConfig()[x];
   }
-}, dt(ae, "ArchitectureDB"), ae), Dr = /* @__PURE__ */ dt((I, x) => {
-  lr(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));
+}, 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) => {
-    const x = await fr("architecture", I);
+    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."
       );
-    Dr(x, A);
+    xr(x, A);
   }, "parse")
-}, xr = /* @__PURE__ */ dt((I) => `
+}, Ir = /* @__PURE__ */ dt((I) => `
   .edge {
     stroke-width: ${I.archEdgeWidth};
     stroke: ${I.archEdgeColor};
@@ -4138,7 +4138,7 @@ var xe = {
     display: -webkit-box;
     -webkit-box-orient: vertical;
   }
-`, "getStyles"), Ir = xr, re = /* @__PURE__ */ dt((I) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${I}</g>`, "wrapIcon"), ne = {
+`, "getStyles"), Rr = Ir, re = /* @__PURE__ */ dt((I) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${I}</g>`, "wrapIcon"), ne = {
   prefix: "mermaid-architecture",
   height: 80,
   width: 80,
@@ -4168,48 +4168,48 @@ var xe = {
         '<path d="m65,47.5c0,2.76-2.24,5-5,5H20c-2.76,0-5-2.24-5-5,0-1.87,1.03-3.51,2.56-4.36-.04-.21-.06-.42-.06-.64,0-2.6,2.48-4.74,5.65-4.97,1.65-4.51,6.34-7.76,11.85-7.76.86,0,1.69.08,2.5.23,2.09-1.57,4.69-2.5,7.5-2.5,6.1,0,11.19,4.38,12.28,10.17,2.14.56,3.72,2.51,3.72,4.83,0,.03,0,.07-.01.1,2.29.46,4.01,2.48,4.01,4.9Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
       )
     },
-    unknown: hr,
+    unknown: lr,
     blank: {
       body: re("")
     }
   }
-}, Rr = /* @__PURE__ */ dt(async function(I, x, 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(
     x.edges().map(async (e) => {
       const {
         source: r,
-        sourceDir: f,
+        sourceDir: l,
         sourceArrow: i,
         sourceGroup: g,
         target: t,
         targetDir: o,
         targetArrow: s,
         targetGroup: c,
-        label: l
+        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) ? b += o === "L" ? -G : G : C += o === "T" ? -G : G + 18), !g && A.getNode(r)?.type === "junction" && (Wt(f) ? T += f === "L" ? u : -u : d += f === "T" ? u : -u), !c && A.getNode(t)?.type === "junction" && (Wt(o) ? b += o === "L" ? u : -u : C += o === "T" ? u : -u), e[0]._private.rscratch) {
+      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"), i) {
-          const Y = Wt(f) ? se[f](T, h) : T - a, K = qt(f) ? se[f](d, h) : d - a;
-          k.insert("polygon").attr("points", Ie[f](h)).attr("transform", `translate(${Y},${K})`).attr("class", "arrow");
+        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 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 Y = Te(f, o) ? "XY" : Wt(f) ? "X" : "Y";
+        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(
             O,
-            l,
+            f,
             {
               useHtmlLabels: !1,
               width: K,
@@ -4221,9 +4221,9 @@ var xe = {
           else if (Y === "Y")
             O.attr("transform", "translate(" + v + ", " + L + ") rotate(-90)");
           else if (Y === "XY") {
-            const it = ye(f, o);
-            if (it && Tr(it)) {
-              const n = O.node().getBoundingClientRect(), [m, p] = Cr(it);
+            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(
@@ -4240,29 +4240,29 @@ var xe = {
       }
     })
   );
-}, "drawEdges"), Sr = /* @__PURE__ */ dt(async function(I, x, 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(
     x.nodes().map(async (e) => {
       const r = ie(e);
       if (r.type === "group") {
-        const { h: f, w: i, x1: g, y1: t } = e.boundingBox();
-        I.append("rect").attr("x", g + a).attr("y", t + a).attr("width", i).attr("height", f).attr("class", "node-bkg");
-        const o = I.append("g");
-        let s = g, c = t;
+        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, f = t;
         if (r.icon) {
-          const l = o.append("g");
-          l.html(
+          const T = s.append("g");
+          T.html(
             `<g>${await pe(r.icon, { height: N, width: N, fallbackPrefix: ne.prefix })}</g>`
-          ), l.attr(
+          ), T.attr(
             "transform",
-            "translate(" + (s + a + 1) + ", " + (c + a + 1) + ")"
-          ), s += N, c += u / 2 - 1 - 2;
+            "translate(" + (c + a + 1) + ", " + (f + a + 1) + ")"
+          ), c += N, f += u / 2 - 1 - 2;
         }
         if (r.label) {
-          const l = o.append("g");
+          const T = s.append("g");
           await me(
-            l,
+            T,
             r.label,
             {
               useHtmlLabels: !1,
@@ -4270,22 +4270,23 @@ var xe = {
               classes: "architecture-service-label"
             },
             Ee()
-          ), l.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), l.attr(
+          ), T.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), T.attr(
             "transform",
-            "translate(" + (s + a + 4) + ", " + (c + a + 2) + ")"
+            "translate(" + (c + a + 4) + ", " + (f + a + 2) + ")"
           );
         }
+        A.setElementForId(r.id, o);
       }
     })
   );
-}, "drawGroups"), Fr = /* @__PURE__ */ dt(async function(I, x, A) {
+}, "drawGroups"), br = /* @__PURE__ */ dt(async function(I, x, A) {
   const P = Ee();
   for (const N of A) {
     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,
@@ -4293,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)
@@ -4313,12 +4314,12 @@ var xe = {
         "d",
         `M0 ${h} v${-h} q0,-5 5,-5 h${h} q5,0 5,5 v${h} H0 Z`
       );
-    u.attr("class", "architecture-service");
-    const { width: e, height: r } = u._groups[0][0].getBBox();
+    u.attr("id", `service-${N.id}`).attr("class", "architecture-service");
+    const { width: e, height: r } = u.node().getBBox();
     N.width = e, N.height = r, I.setElementForId(N.id, u);
   }
   return 0;
-}, "drawServices"), br = /* @__PURE__ */ dt(function(I, x, A) {
+}, "drawServices"), Pr = /* @__PURE__ */ dt(function(I, x, A) {
   A.forEach((P) => {
     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");
@@ -4326,13 +4327,13 @@ var xe = {
     N.width = a, N.height = e, I.setElementForId(P.id, N);
   });
 }, "drawJunctions");
-sr([
+hr([
   {
     name: ne.prefix,
     icons: ne
   }
 ]);
-Fe.use(Er);
+Fe.use(mr);
 function Ue(I, x, A) {
   I.forEach((P) => {
     x.add({
@@ -4394,7 +4395,7 @@ function He(I, x) {
 dt(He, "addGroups");
 function We(I, x) {
   I.forEach((A) => {
-    const { lhsId: P, rhsId: N, lhsInto: u, lhsGroup: h, rhsInto: a, lhsDir: e, rhsDir: r, 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,
@@ -4405,7 +4406,7 @@ function We(I, x) {
       target: N,
       targetDir: r,
       targetArrow: a,
-      targetGroup: f,
+      targetGroup: l,
       targetEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%"
     };
     x.add({
@@ -4418,22 +4419,22 @@ function We(I, x) {
 dt(We, "addEdges");
 function Ve(I, x, A) {
   const P = /* @__PURE__ */ dt((a, e) => Object.entries(a).reduce(
-    (r, [f, i]) => {
+    (r, [l, i]) => {
       let g = 0;
       const t = Object.entries(i);
       if (t.length === 1)
-        return r[f] = t[0][1], r;
+        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, l] = t[o], [T, d] = t[s];
+          const [c, f] = t[o], [T, d] = t[s];
           if (A[c]?.[T] === e)
-            r[f] ??= [], r[f] = [...r[f], ...l, ...d];
+            r[l] ??= [], r[l] = [...r[l], ...f, ...d];
           else if (c === "default" || T === "default")
-            r[f] ??= [], r[f] = [...r[f], ...l, ...d];
+            r[l] ??= [], r[l] = [...r[l], ...f, ...d];
           else {
-            const L = `${f}-${g++}`;
-            r[L] = l;
-            const b = `${f}-${g++}`;
+            const L = `${l}-${g++}`;
+            r[L] = f;
+            const b = `${l}-${g++}`;
             r[b] = d;
           }
         }
@@ -4442,21 +4443,21 @@ function Ve(I, x, A) {
     {}
   ), "flattenAlignments"), N = x.map((a) => {
     const e = {}, r = {};
-    return Object.entries(a).forEach(([f, [i, g]]) => {
-      const t = I.getNode(f)?.in ?? "default";
-      e[g] ??= {}, e[g][t] ??= [], e[g][t].push(f), r[i] ??= {}, r[i][t] ??= [], r[i][t].push(f);
+    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(e, "horizontal")).filter(
-        (f) => f.length > 1
+        (l) => l.length > 1
       ),
       vert: Object.values(P(r, "vertical")).filter(
-        (f) => f.length > 1
+        (l) => l.length > 1
       )
     };
   }), [u, h] = N.reduce(
-    ([a, e], { horiz: r, vert: f }) => [
+    ([a, e], { horiz: r, vert: l }) => [
       [...a, ...r],
-      [...e, ...f]
+      [...e, ...l]
     ],
     [[], []]
   );
@@ -4470,7 +4471,7 @@ 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])
+      Object.entries(u).map(([l, i]) => [P(i), l])
     ), a = [P([0, 0])], e = {}, r = {
       L: [-1, 0],
       R: [1, 0],
@@ -4478,17 +4479,17 @@ function ze(I, x) {
       B: [0, -1]
     };
     for (; a.length > 0; ) {
-      const f = a.shift();
-      if (f) {
-        e[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);
+          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 && !e[s] && (a.push(s), A.push({
               [xe[t]]: c,
-              [xe[mr(t)]]: i,
+              [xe[Tr(t)]]: i,
               gap: 1.5 * x.getConfigField("iconSize")
             }));
           });
@@ -4573,7 +4574,7 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
       }
     });
     e.remove(), He(A, r), Ue(I, r, N), Ye(x, r, N), We(P, r);
-    const f = Ve(N, u, h), i = ze(u, N), g = r.layout({
+    const l = Ve(N, u, h), i = ze(u, N), g = r.layout({
       name: "fcose",
       quality: "proof",
       styleEnabled: !1,
@@ -4582,24 +4583,24 @@ function Be(I, x, 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", () => {
-      function t(o, s, c, l) {
+      function t(o, s, c, f) {
         let T, d;
         const { x: v, y: L } = o, { x: b, y: C } = s;
-        d = (l - L + (v - c) * (L - C) / (v - b)) / Math.sqrt(1 + Math.pow((L - C) / (v - b), 2)), T = Math.sqrt(Math.pow(l - L, 2) + Math.pow(c - v, 2) - Math.pow(d, 2));
+        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) * (l - L) - (C - L) * (c - v);
+        let k = (b - v) * (f - L) - (C - L) * (c - v);
         switch (!0) {
           case k >= 0:
             k = 1;
@@ -4608,7 +4609,7 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
             k = -1;
             break;
         }
-        let Y = (b - v) * (c - v) + (C - L) * (l - L);
+        let Y = (b - v) * (c - v) + (C - L) * (f - L);
         switch (!0) {
           case Y >= 0:
             Y = 1;
@@ -4625,8 +4626,8 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
       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: l, y: T } = o.target().position();
-          if (s !== l && c !== T) {
+          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);
           }
@@ -4638,23 +4639,23 @@ function Be(I, x, A, P, N, { spatialMaps: u, groupAlignments: h }) {
   });
 }
 dt(Be, "layoutArchitecture");
-var Pr = /* @__PURE__ */ dt(async (I, x, A, P) => {
-  const N = P.db, u = N.getServices(), h = N.getJunctions(), a = N.getGroups(), e = N.getEdges(), r = N.getDataStructures(), f = ke(x), 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");
-  t.attr("class", "architecture-groups"), await Fr(N, g, u), br(N, g, h);
+  const t = l.append("g");
+  t.attr("class", "architecture-groups"), await br(N, g, u), Pr(N, g, h);
   const o = await Be(u, h, a, e, N, r);
-  await Rr(i, o, N), await Sr(t, o, N), Xe(N, o), qe(void 0, f, N.getConfigField("padding"), N.getConfigField("useMaxWidth"));
-}, "draw"), Gr = { draw: Pr }, Wr = {
+  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() {
     return new Pe();
   },
-  renderer: Gr,
-  styles: Ir
+  renderer: Ur,
+  styles: Rr
 };
 export {
-  Wr as diagram
+  Vr as diagram
 };