@elmethis/core 1.0.0-alpha.135 → 1.0.0-alpha.136

package/dist/architectureDiagram-UYN6MBPD-CIvqBNYd.js

@@ -0,0 +1,4595 @@
+import { D as ke, _ as at, aG as qe, aH as Je, q as Qe, r as Ke, s as je, g as _e, c as tr, b as er, d as ge, l as Fe, j as rr, x as ir, I as nr, ac as ar, al as Ne, aI as me } from "./mermaid.core-gtllNrzr.js";
+import { p as or } from "./chunk-TMUBEWPD-LmMMNIqt.js";
+import { I as sr } from "./chunk-KFBOBJHC-DWru5GNu.js";
+import { p as hr } from "./mermaid-parser.core-CL_REaxY.js";
+import { c as be } from "./cytoscape.esm-CsRvAgYT.js";
+import { g as lr } from "./index-DQdUr-_f.js";
+var le = { exports: {} }, fe = { exports: {} }, ce = { exports: {} }, fr = ce.exports, Oe;
+function cr() {
+  return Oe || (Oe = 1, function(C, Y) {
+    (function(G, N) {
+      C.exports = N();
+    })(fr, function() {
+      return (
+        /******/
+        function(A) {
+          var G = {};
+          function N(u) {
+            if (G[u])
+              return G[u].exports;
+            var s = G[u] = {
+              /******/
+              i: u,
+              /******/
+              l: !1,
+              /******/
+              exports: {}
+              /******/
+            };
+            return A[u].call(s.exports, s, s.exports, N), s.l = !0, s.exports;
+          }
+          return N.m = A, N.c = G, N.i = function(u) {
+            return u;
+          }, N.d = function(u, s, i) {
+            N.o(u, s) || Object.defineProperty(u, s, {
+              /******/
+              configurable: !1,
+              /******/
+              enumerable: !0,
+              /******/
+              get: i
+              /******/
+            });
+          }, N.n = function(u) {
+            var s = u && u.__esModule ? (
+              /******/
+              function() {
+                return u.default;
+              }
+            ) : (
+              /******/
+              function() {
+                return u;
+              }
+            );
+            return N.d(s, "a", s), s;
+          }, N.o = function(u, s) {
+            return Object.prototype.hasOwnProperty.call(u, s);
+          }, N.p = "", N(N.s = 28);
+        }([
+          /* 0 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.QUALITY = 1, u.DEFAULT_CREATE_BENDS_AS_NEEDED = !1, u.DEFAULT_INCREMENTAL = !1, u.DEFAULT_ANIMATION_ON_LAYOUT = !0, u.DEFAULT_ANIMATION_DURING_LAYOUT = !1, u.DEFAULT_ANIMATION_PERIOD = 50, u.DEFAULT_UNIFORM_LEAF_NODE_SIZES = !1, u.DEFAULT_GRAPH_MARGIN = 15, u.NODE_DIMENSIONS_INCLUDE_LABELS = !1, u.SIMPLE_NODE_SIZE = 40, u.SIMPLE_NODE_HALF_SIZE = u.SIMPLE_NODE_SIZE / 2, u.EMPTY_COMPOUND_NODE_SIZE = 40, u.MIN_EDGE_LENGTH = 1, u.WORLD_BOUNDARY = 1e6, u.INITIAL_WORLD_BOUNDARY = u.WORLD_BOUNDARY / 1e3, u.WORLD_CENTER_X = 1200, u.WORLD_CENTER_Y = 900, A.exports = u;
+          },
+          /* 1 */
+          /***/
+          function(A, G, N) {
+            var u = N(2), s = N(8), i = N(9);
+            function r(f, n, y) {
+              u.call(this, y), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = y, this.bendpoints = [], this.source = f, this.target = n;
+            }
+            r.prototype = Object.create(u.prototype);
+            for (var e in u)
+              r[e] = u[e];
+            r.prototype.getSource = function() {
+              return this.source;
+            }, r.prototype.getTarget = function() {
+              return this.target;
+            }, r.prototype.isInterGraph = function() {
+              return this.isInterGraph;
+            }, r.prototype.getLength = function() {
+              return this.length;
+            }, r.prototype.isOverlapingSourceAndTarget = function() {
+              return this.isOverlapingSourceAndTarget;
+            }, r.prototype.getBendpoints = function() {
+              return this.bendpoints;
+            }, r.prototype.getLca = function() {
+              return this.lca;
+            }, r.prototype.getSourceInLca = function() {
+              return this.sourceInLca;
+            }, r.prototype.getTargetInLca = function() {
+              return this.targetInLca;
+            }, r.prototype.getOtherEnd = function(f) {
+              if (this.source === f)
+                return this.target;
+              if (this.target === f)
+                return this.source;
+              throw "Node is not incident with this edge";
+            }, r.prototype.getOtherEndInGraph = function(f, n) {
+              for (var y = this.getOtherEnd(f), t = n.getGraphManager().getRoot(); ; ) {
+                if (y.getOwner() == n)
+                  return y;
+                if (y.getOwner() == t)
+                  break;
+                y = y.getOwner().getParent();
+              }
+              return null;
+            }, r.prototype.updateLength = function() {
+              var f = new Array(4);
+              this.isOverlapingSourceAndTarget = s.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 = i.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = i.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY));
+            }, r.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 = i.sign(this.lengthX)), Math.abs(this.lengthY) < 1 && (this.lengthY = i.sign(this.lengthY)), this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
+            }, A.exports = r;
+          },
+          /* 2 */
+          /***/
+          function(A, G, N) {
+            function u(s) {
+              this.vGraphObject = s;
+            }
+            A.exports = u;
+          },
+          /* 3 */
+          /***/
+          function(A, G, N) {
+            var u = N(2), s = N(10), i = N(13), r = N(0), e = N(16), f = N(5);
+            function n(t, h, o, c) {
+              o == null && c == null && (c = h), u.call(this, c), t.graphManager != null && (t = t.graphManager), this.estimatedSize = s.MIN_VALUE, this.inclusionTreeDepth = s.MAX_VALUE, this.vGraphObject = c, this.edges = [], this.graphManager = t, o != null && h != null ? this.rect = new i(h.x, h.y, o.width, o.height) : this.rect = new i();
+            }
+            n.prototype = Object.create(u.prototype);
+            for (var y in u)
+              n[y] = u[y];
+            n.prototype.getEdges = function() {
+              return this.edges;
+            }, n.prototype.getChild = function() {
+              return this.child;
+            }, n.prototype.getOwner = function() {
+              return this.owner;
+            }, n.prototype.getWidth = function() {
+              return this.rect.width;
+            }, n.prototype.setWidth = function(t) {
+              this.rect.width = t;
+            }, n.prototype.getHeight = function() {
+              return this.rect.height;
+            }, n.prototype.setHeight = function(t) {
+              this.rect.height = t;
+            }, n.prototype.getCenterX = function() {
+              return this.rect.x + this.rect.width / 2;
+            }, n.prototype.getCenterY = function() {
+              return this.rect.y + this.rect.height / 2;
+            }, n.prototype.getCenter = function() {
+              return new f(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
+            }, n.prototype.getLocation = function() {
+              return new f(this.rect.x, this.rect.y);
+            }, n.prototype.getRect = function() {
+              return this.rect;
+            }, n.prototype.getDiagonal = function() {
+              return Math.sqrt(this.rect.width * this.rect.width + this.rect.height * this.rect.height);
+            }, n.prototype.getHalfTheDiagonal = function() {
+              return Math.sqrt(this.rect.height * this.rect.height + this.rect.width * this.rect.width) / 2;
+            }, n.prototype.setRect = function(t, h) {
+              this.rect.x = t.x, this.rect.y = t.y, this.rect.width = h.width, this.rect.height = h.height;
+            }, n.prototype.setCenter = function(t, h) {
+              this.rect.x = t - this.rect.width / 2, this.rect.y = h - this.rect.height / 2;
+            }, n.prototype.setLocation = function(t, h) {
+              this.rect.x = t, this.rect.y = h;
+            }, n.prototype.moveBy = function(t, h) {
+              this.rect.x += t, this.rect.y += h;
+            }, n.prototype.getEdgeListToNode = function(t) {
+              var h = [], o = this;
+              return o.edges.forEach(function(c) {
+                if (c.target == t) {
+                  if (c.source != o) throw "Incorrect edge source!";
+                  h.push(c);
+                }
+              }), h;
+            }, n.prototype.getEdgesBetween = function(t) {
+              var h = [], o = this;
+              return o.edges.forEach(function(c) {
+                if (!(c.source == o || c.target == o)) throw "Incorrect edge source and/or target";
+                (c.target == t || c.source == t) && h.push(c);
+              }), h;
+            }, n.prototype.getNeighborsList = function() {
+              var t = /* @__PURE__ */ new Set(), h = this;
+              return h.edges.forEach(function(o) {
+                if (o.source == h)
+                  t.add(o.target);
+                else {
+                  if (o.target != h)
+                    throw "Incorrect incidency!";
+                  t.add(o.source);
+                }
+              }), t;
+            }, n.prototype.withChildren = function() {
+              var t = /* @__PURE__ */ new Set(), h, o;
+              if (t.add(this), this.child != null)
+                for (var c = this.child.getNodes(), l = 0; l < c.length; l++)
+                  h = c[l], o = h.withChildren(), o.forEach(function(T) {
+                    t.add(T);
+                  });
+              return t;
+            }, n.prototype.getNoOfChildren = function() {
+              var t = 0, h;
+              if (this.child == null)
+                t = 1;
+              else
+                for (var o = this.child.getNodes(), c = 0; c < o.length; c++)
+                  h = o[c], t += h.getNoOfChildren();
+              return t == 0 && (t = 1), t;
+            }, n.prototype.getEstimatedSize = function() {
+              if (this.estimatedSize == s.MIN_VALUE)
+                throw "assert failed";
+              return this.estimatedSize;
+            }, n.prototype.calcEstimatedSize = function() {
+              return this.child == null ? this.estimatedSize = (this.rect.width + this.rect.height) / 2 : (this.estimatedSize = this.child.calcEstimatedSize(), this.rect.width = this.estimatedSize, this.rect.height = this.estimatedSize, this.estimatedSize);
+            }, n.prototype.scatter = function() {
+              var t, h, o = -r.INITIAL_WORLD_BOUNDARY, c = r.INITIAL_WORLD_BOUNDARY;
+              t = r.WORLD_CENTER_X + e.nextDouble() * (c - o) + o;
+              var l = -r.INITIAL_WORLD_BOUNDARY, T = r.INITIAL_WORLD_BOUNDARY;
+              h = r.WORLD_CENTER_Y + e.nextDouble() * (T - l) + l, this.rect.x = t, this.rect.y = h;
+            }, n.prototype.updateBounds = function() {
+              if (this.getChild() == null)
+                throw "assert failed";
+              if (this.getChild().getNodes().length != 0) {
+                var t = this.getChild();
+                if (t.updateBounds(!0), this.rect.x = t.getLeft(), this.rect.y = t.getTop(), this.setWidth(t.getRight() - t.getLeft()), this.setHeight(t.getBottom() - t.getTop()), r.NODE_DIMENSIONS_INCLUDE_LABELS) {
+                  var h = t.getRight() - t.getLeft(), o = t.getBottom() - t.getTop();
+                  this.labelWidth && (this.labelPosHorizontal == "left" ? (this.rect.x -= this.labelWidth, this.setWidth(h + this.labelWidth)) : this.labelPosHorizontal == "center" && this.labelWidth > h ? (this.rect.x -= (this.labelWidth - h) / 2, this.setWidth(this.labelWidth)) : this.labelPosHorizontal == "right" && this.setWidth(h + this.labelWidth)), this.labelHeight && (this.labelPosVertical == "top" ? (this.rect.y -= this.labelHeight, this.setHeight(o + this.labelHeight)) : this.labelPosVertical == "center" && this.labelHeight > o ? (this.rect.y -= (this.labelHeight - o) / 2, this.setHeight(this.labelHeight)) : this.labelPosVertical == "bottom" && this.setHeight(o + this.labelHeight));
+                }
+              }
+            }, n.prototype.getInclusionTreeDepth = function() {
+              if (this.inclusionTreeDepth == s.MAX_VALUE)
+                throw "assert failed";
+              return this.inclusionTreeDepth;
+            }, n.prototype.transform = function(t) {
+              var h = this.rect.x;
+              h > r.WORLD_BOUNDARY ? h = r.WORLD_BOUNDARY : h < -r.WORLD_BOUNDARY && (h = -r.WORLD_BOUNDARY);
+              var o = this.rect.y;
+              o > r.WORLD_BOUNDARY ? o = r.WORLD_BOUNDARY : o < -r.WORLD_BOUNDARY && (o = -r.WORLD_BOUNDARY);
+              var c = new f(h, o), l = t.inverseTransformPoint(c);
+              this.setLocation(l.x, l.y);
+            }, n.prototype.getLeft = function() {
+              return this.rect.x;
+            }, n.prototype.getRight = function() {
+              return this.rect.x + this.rect.width;
+            }, n.prototype.getTop = function() {
+              return this.rect.y;
+            }, n.prototype.getBottom = function() {
+              return this.rect.y + this.rect.height;
+            }, n.prototype.getParent = function() {
+              return this.owner == null ? null : this.owner.getParent();
+            }, A.exports = n;
+          },
+          /* 4 */
+          /***/
+          function(A, G, N) {
+            var u = N(0);
+            function s() {
+            }
+            for (var i in u)
+              s[i] = u[i];
+            s.MAX_ITERATIONS = 2500, s.DEFAULT_EDGE_LENGTH = 50, s.DEFAULT_SPRING_STRENGTH = 0.45, s.DEFAULT_REPULSION_STRENGTH = 4500, s.DEFAULT_GRAVITY_STRENGTH = 0.4, s.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1, s.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8, s.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5, s.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = !0, s.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = !0, s.DEFAULT_COOLING_FACTOR_INCREMENTAL = 0.3, s.COOLING_ADAPTATION_FACTOR = 0.33, s.ADAPTATION_LOWER_NODE_LIMIT = 1e3, s.ADAPTATION_UPPER_NODE_LIMIT = 5e3, s.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100, s.MAX_NODE_DISPLACEMENT = s.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3, s.MIN_REPULSION_DIST = s.DEFAULT_EDGE_LENGTH / 10, s.CONVERGENCE_CHECK_PERIOD = 100, s.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = 0.1, s.MIN_EDGE_LENGTH = 1, s.GRID_CALCULATION_CHECK_PERIOD = 10, A.exports = s;
+          },
+          /* 5 */
+          /***/
+          function(A, G, N) {
+            function u(s, i) {
+              s == null && i == null ? (this.x = 0, this.y = 0) : (this.x = s, this.y = i);
+            }
+            u.prototype.getX = function() {
+              return this.x;
+            }, u.prototype.getY = function() {
+              return this.y;
+            }, u.prototype.setX = function(s) {
+              this.x = s;
+            }, u.prototype.setY = function(s) {
+              this.y = s;
+            }, u.prototype.getDifference = function(s) {
+              return new DimensionD(this.x - s.x, this.y - s.y);
+            }, u.prototype.getCopy = function() {
+              return new u(this.x, this.y);
+            }, u.prototype.translate = function(s) {
+              return this.x += s.width, this.y += s.height, this;
+            }, A.exports = u;
+          },
+          /* 6 */
+          /***/
+          function(A, G, N) {
+            var u = N(2), s = N(10), i = N(0), r = N(7), e = N(3), f = N(1), n = N(13), y = N(12), t = N(11);
+            function h(c, l, T) {
+              u.call(this, T), this.estimatedSize = s.MIN_VALUE, this.margin = i.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = c, l != null && l instanceof r ? this.graphManager = l : l != null && l instanceof Layout && (this.graphManager = l.graphManager);
+            }
+            h.prototype = Object.create(u.prototype);
+            for (var o in u)
+              h[o] = u[o];
+            h.prototype.getNodes = function() {
+              return this.nodes;
+            }, h.prototype.getEdges = function() {
+              return this.edges;
+            }, h.prototype.getGraphManager = function() {
+              return this.graphManager;
+            }, h.prototype.getParent = function() {
+              return this.parent;
+            }, h.prototype.getLeft = function() {
+              return this.left;
+            }, h.prototype.getRight = function() {
+              return this.right;
+            }, h.prototype.getTop = function() {
+              return this.top;
+            }, h.prototype.getBottom = function() {
+              return this.bottom;
+            }, h.prototype.isConnected = function() {
+              return this.isConnected;
+            }, h.prototype.add = function(c, l, T) {
+              if (l == null && T == null) {
+                var g = c;
+                if (this.graphManager == null)
+                  throw "Graph has no graph mgr!";
+                if (this.getNodes().indexOf(g) > -1)
+                  throw "Node already in graph!";
+                return g.owner = this, this.getNodes().push(g), g;
+              } else {
+                var d = c;
+                if (!(this.getNodes().indexOf(l) > -1 && this.getNodes().indexOf(T) > -1))
+                  throw "Source or target not in graph!";
+                if (!(l.owner == T.owner && l.owner == this))
+                  throw "Both owners must be this graph!";
+                return l.owner != T.owner ? null : (d.source = l, d.target = T, d.isInterGraph = !1, this.getEdges().push(d), l.edges.push(d), T != l && T.edges.push(d), d);
+              }
+            }, h.prototype.remove = function(c) {
+              var l = c;
+              if (c instanceof e) {
+                if (l == null)
+                  throw "Node is null!";
+                if (!(l.owner != null && l.owner == this))
+                  throw "Owner graph is invalid!";
+                if (this.graphManager == null)
+                  throw "Owner graph manager is invalid!";
+                for (var T = l.edges.slice(), g, d = T.length, L = 0; L < d; L++)
+                  g = T[L], g.isInterGraph ? this.graphManager.remove(g) : g.source.owner.remove(g);
+                var F = this.nodes.indexOf(l);
+                if (F == -1)
+                  throw "Node not in owner node list!";
+                this.nodes.splice(F, 1);
+              } else if (c instanceof f) {
+                var g = c;
+                if (g == null)
+                  throw "Edge is null!";
+                if (!(g.source != null && g.target != null))
+                  throw "Source and/or target is null!";
+                if (!(g.source.owner != null && g.target.owner != null && g.source.owner == this && g.target.owner == this))
+                  throw "Source and/or target owner is invalid!";
+                var M = g.source.edges.indexOf(g), P = g.target.edges.indexOf(g);
+                if (!(M > -1 && P > -1))
+                  throw "Source and/or target doesn't know this edge!";
+                g.source.edges.splice(M, 1), g.target != g.source && g.target.edges.splice(P, 1);
+                var F = g.source.owner.getEdges().indexOf(g);
+                if (F == -1)
+                  throw "Not in owner's edge list!";
+                g.source.owner.getEdges().splice(F, 1);
+              }
+            }, h.prototype.updateLeftTop = function() {
+              for (var c = s.MAX_VALUE, l = s.MAX_VALUE, T, g, d, L = this.getNodes(), F = L.length, M = 0; M < F; M++) {
+                var P = L[M];
+                T = P.getTop(), g = P.getLeft(), c > T && (c = T), l > g && (l = g);
+              }
+              return c == s.MAX_VALUE ? null : (L[0].getParent().paddingLeft != null ? d = L[0].getParent().paddingLeft : d = this.margin, this.left = l - d, this.top = c - d, new y(this.left, this.top));
+            }, h.prototype.updateBounds = function(c) {
+              for (var l = s.MAX_VALUE, T = -s.MAX_VALUE, g = s.MAX_VALUE, d = -s.MAX_VALUE, L, F, M, P, J, V = this.nodes, Q = V.length, D = 0; D < Q; D++) {
+                var rt = V[D];
+                c && rt.child != null && rt.updateBounds(), L = rt.getLeft(), F = rt.getRight(), M = rt.getTop(), P = rt.getBottom(), l > L && (l = L), T < F && (T = F), g > M && (g = M), d < P && (d = P);
+              }
+              var a = new n(l, g, T - l, d - g);
+              l == s.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), V[0].getParent().paddingLeft != null ? J = V[0].getParent().paddingLeft : J = this.margin, this.left = a.x - J, this.right = a.x + a.width + J, this.top = a.y - J, this.bottom = a.y + a.height + J;
+            }, h.calculateBounds = function(c) {
+              for (var l = s.MAX_VALUE, T = -s.MAX_VALUE, g = s.MAX_VALUE, d = -s.MAX_VALUE, L, F, M, P, J = c.length, V = 0; V < J; V++) {
+                var Q = c[V];
+                L = Q.getLeft(), F = Q.getRight(), M = Q.getTop(), P = Q.getBottom(), l > L && (l = L), T < F && (T = F), g > M && (g = M), d < P && (d = P);
+              }
+              var D = new n(l, g, T - l, d - g);
+              return D;
+            }, h.prototype.getInclusionTreeDepth = function() {
+              return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
+            }, h.prototype.getEstimatedSize = function() {
+              if (this.estimatedSize == s.MIN_VALUE)
+                throw "assert failed";
+              return this.estimatedSize;
+            }, h.prototype.calcEstimatedSize = function() {
+              for (var c = 0, l = this.nodes, T = l.length, g = 0; g < T; g++) {
+                var d = l[g];
+                c += d.calcEstimatedSize();
+              }
+              return c == 0 ? this.estimatedSize = i.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = c / Math.sqrt(this.nodes.length), this.estimatedSize;
+            }, h.prototype.updateConnected = function() {
+              var c = this;
+              if (this.nodes.length == 0) {
+                this.isConnected = !0;
+                return;
+              }
+              var l = new t(), T = /* @__PURE__ */ new Set(), g = this.nodes[0], d, L, F = g.withChildren();
+              for (F.forEach(function(D) {
+                l.push(D), T.add(D);
+              }); l.length !== 0; ) {
+                g = l.shift(), d = g.getEdges();
+                for (var M = d.length, P = 0; P < M; P++) {
+                  var J = d[P];
+                  if (L = J.getOtherEndInGraph(g, this), L != null && !T.has(L)) {
+                    var V = L.withChildren();
+                    V.forEach(function(D) {
+                      l.push(D), T.add(D);
+                    });
+                  }
+                }
+              }
+              if (this.isConnected = !1, T.size >= this.nodes.length) {
+                var Q = 0;
+                T.forEach(function(D) {
+                  D.owner == c && Q++;
+                }), Q == this.nodes.length && (this.isConnected = !0);
+              }
+            }, A.exports = h;
+          },
+          /* 7 */
+          /***/
+          function(A, G, N) {
+            var u, s = N(1);
+            function i(r) {
+              u = N(6), this.layout = r, this.graphs = [], this.edges = [];
+            }
+            i.prototype.addRoot = function() {
+              var r = this.layout.newGraph(), e = this.layout.newNode(null), f = this.add(r, e);
+              return this.setRootGraph(f), this.rootGraph;
+            }, i.prototype.add = function(r, e, f, n, y) {
+              if (f == null && n == null && y == null) {
+                if (r == null)
+                  throw "Graph is null!";
+                if (e == null)
+                  throw "Parent node is null!";
+                if (this.graphs.indexOf(r) > -1)
+                  throw "Graph already in this graph mgr!";
+                if (this.graphs.push(r), r.parent != null)
+                  throw "Already has a parent!";
+                if (e.child != null)
+                  throw "Already has a child!";
+                return r.parent = e, e.child = r, r;
+              } else {
+                y = f, n = e, f = r;
+                var t = n.getOwner(), h = y.getOwner();
+                if (!(t != null && t.getGraphManager() == this))
+                  throw "Source not in this graph mgr!";
+                if (!(h != null && h.getGraphManager() == this))
+                  throw "Target not in this graph mgr!";
+                if (t == h)
+                  return f.isInterGraph = !1, t.add(f, n, y);
+                if (f.isInterGraph = !0, f.source = n, f.target = y, this.edges.indexOf(f) > -1)
+                  throw "Edge already in inter-graph edge list!";
+                if (this.edges.push(f), !(f.source != null && f.target != null))
+                  throw "Edge source and/or target is null!";
+                if (!(f.source.edges.indexOf(f) == -1 && f.target.edges.indexOf(f) == -1))
+                  throw "Edge already in source and/or target incidency list!";
+                return f.source.edges.push(f), f.target.edges.push(f), f;
+              }
+            }, i.prototype.remove = function(r) {
+              if (r instanceof u) {
+                var e = r;
+                if (e.getGraphManager() != this)
+                  throw "Graph not in this graph mgr";
+                if (!(e == this.rootGraph || e.parent != null && e.parent.graphManager == this))
+                  throw "Invalid parent node!";
+                var f = [];
+                f = f.concat(e.getEdges());
+                for (var n, y = f.length, t = 0; t < y; t++)
+                  n = f[t], e.remove(n);
+                var h = [];
+                h = h.concat(e.getNodes());
+                var o;
+                y = h.length;
+                for (var t = 0; t < y; t++)
+                  o = h[t], e.remove(o);
+                e == this.rootGraph && this.setRootGraph(null);
+                var c = this.graphs.indexOf(e);
+                this.graphs.splice(c, 1), e.parent = null;
+              } else if (r instanceof s) {
+                if (n = r, n == null)
+                  throw "Edge is null!";
+                if (!n.isInterGraph)
+                  throw "Not an inter-graph edge!";
+                if (!(n.source != null && n.target != null))
+                  throw "Source and/or target is null!";
+                if (!(n.source.edges.indexOf(n) != -1 && n.target.edges.indexOf(n) != -1))
+                  throw "Source and/or target doesn't know this edge!";
+                var c = n.source.edges.indexOf(n);
+                if (n.source.edges.splice(c, 1), c = n.target.edges.indexOf(n), n.target.edges.splice(c, 1), !(n.source.owner != null && n.source.owner.getGraphManager() != null))
+                  throw "Edge owner graph or owner graph manager is null!";
+                if (n.source.owner.getGraphManager().edges.indexOf(n) == -1)
+                  throw "Not in owner graph manager's edge list!";
+                var c = n.source.owner.getGraphManager().edges.indexOf(n);
+                n.source.owner.getGraphManager().edges.splice(c, 1);
+              }
+            }, i.prototype.updateBounds = function() {
+              this.rootGraph.updateBounds(!0);
+            }, i.prototype.getGraphs = function() {
+              return this.graphs;
+            }, i.prototype.getAllNodes = function() {
+              if (this.allNodes == null) {
+                for (var r = [], e = this.getGraphs(), f = e.length, n = 0; n < f; n++)
+                  r = r.concat(e[n].getNodes());
+                this.allNodes = r;
+              }
+              return this.allNodes;
+            }, i.prototype.resetAllNodes = function() {
+              this.allNodes = null;
+            }, i.prototype.resetAllEdges = function() {
+              this.allEdges = null;
+            }, i.prototype.resetAllNodesToApplyGravitation = function() {
+              this.allNodesToApplyGravitation = null;
+            }, i.prototype.getAllEdges = function() {
+              if (this.allEdges == null) {
+                var r = [], e = this.getGraphs();
+                e.length;
+                for (var f = 0; f < e.length; f++)
+                  r = r.concat(e[f].getEdges());
+                r = r.concat(this.edges), this.allEdges = r;
+              }
+              return this.allEdges;
+            }, i.prototype.getAllNodesToApplyGravitation = function() {
+              return this.allNodesToApplyGravitation;
+            }, i.prototype.setAllNodesToApplyGravitation = function(r) {
+              if (this.allNodesToApplyGravitation != null)
+                throw "assert failed";
+              this.allNodesToApplyGravitation = r;
+            }, i.prototype.getRoot = function() {
+              return this.rootGraph;
+            }, i.prototype.setRootGraph = function(r) {
+              if (r.getGraphManager() != this)
+                throw "Root not in this graph mgr!";
+              this.rootGraph = r, r.parent == null && (r.parent = this.layout.newNode("Root node"));
+            }, i.prototype.getLayout = function() {
+              return this.layout;
+            }, i.prototype.isOneAncestorOfOther = function(r, e) {
+              if (!(r != null && e != null))
+                throw "assert failed";
+              if (r == e)
+                return !0;
+              var f = r.getOwner(), n;
+              do {
+                if (n = f.getParent(), n == null)
+                  break;
+                if (n == e)
+                  return !0;
+                if (f = n.getOwner(), f == null)
+                  break;
+              } while (!0);
+              f = e.getOwner();
+              do {
+                if (n = f.getParent(), n == null)
+                  break;
+                if (n == r)
+                  return !0;
+                if (f = n.getOwner(), f == null)
+                  break;
+              } while (!0);
+              return !1;
+            }, i.prototype.calcLowestCommonAncestors = function() {
+              for (var r, e, f, n, y, t = this.getAllEdges(), h = t.length, o = 0; o < h; o++) {
+                if (r = t[o], e = r.source, f = r.target, r.lca = null, r.sourceInLca = e, r.targetInLca = f, e == f) {
+                  r.lca = e.getOwner();
+                  continue;
+                }
+                for (n = e.getOwner(); r.lca == null; ) {
+                  for (r.targetInLca = f, y = f.getOwner(); r.lca == null; ) {
+                    if (y == n) {
+                      r.lca = y;
+                      break;
+                    }
+                    if (y == this.rootGraph)
+                      break;
+                    if (r.lca != null)
+                      throw "assert failed";
+                    r.targetInLca = y.getParent(), y = r.targetInLca.getOwner();
+                  }
+                  if (n == this.rootGraph)
+                    break;
+                  r.lca == null && (r.sourceInLca = n.getParent(), n = r.sourceInLca.getOwner());
+                }
+                if (r.lca == null)
+                  throw "assert failed";
+              }
+            }, i.prototype.calcLowestCommonAncestor = function(r, e) {
+              if (r == e)
+                return r.getOwner();
+              var f = r.getOwner();
+              do {
+                if (f == null)
+                  break;
+                var n = e.getOwner();
+                do {
+                  if (n == null)
+                    break;
+                  if (n == f)
+                    return n;
+                  n = n.getParent().getOwner();
+                } while (!0);
+                f = f.getParent().getOwner();
+              } while (!0);
+              return f;
+            }, i.prototype.calcInclusionTreeDepths = function(r, e) {
+              r == null && e == null && (r = this.rootGraph, e = 1);
+              for (var f, n = r.getNodes(), y = n.length, t = 0; t < y; t++)
+                f = n[t], f.inclusionTreeDepth = e, f.child != null && this.calcInclusionTreeDepths(f.child, e + 1);
+            }, i.prototype.includesInvalidEdge = function() {
+              for (var r, e = [], f = this.edges.length, n = 0; n < f; n++)
+                r = this.edges[n], this.isOneAncestorOfOther(r.source, r.target) && e.push(r);
+              for (var n = 0; n < e.length; n++)
+                this.remove(e[n]);
+              return !1;
+            }, A.exports = i;
+          },
+          /* 8 */
+          /***/
+          function(A, G, N) {
+            var u = N(12);
+            function s() {
+            }
+            s.calcSeparationAmount = function(i, r, e, f) {
+              if (!i.intersects(r))
+                throw "assert failed";
+              var n = new Array(2);
+              this.decideDirectionsForOverlappingNodes(i, r, n), e[0] = Math.min(i.getRight(), r.getRight()) - Math.max(i.x, r.x), e[1] = Math.min(i.getBottom(), r.getBottom()) - Math.max(i.y, r.y), i.getX() <= r.getX() && i.getRight() >= r.getRight() ? e[0] += Math.min(r.getX() - i.getX(), i.getRight() - r.getRight()) : r.getX() <= i.getX() && r.getRight() >= i.getRight() && (e[0] += Math.min(i.getX() - r.getX(), r.getRight() - i.getRight())), i.getY() <= r.getY() && i.getBottom() >= r.getBottom() ? e[1] += Math.min(r.getY() - i.getY(), i.getBottom() - r.getBottom()) : r.getY() <= i.getY() && r.getBottom() >= i.getBottom() && (e[1] += Math.min(i.getY() - r.getY(), r.getBottom() - i.getBottom()));
+              var y = Math.abs((r.getCenterY() - i.getCenterY()) / (r.getCenterX() - i.getCenterX()));
+              r.getCenterY() === i.getCenterY() && r.getCenterX() === i.getCenterX() && (y = 1);
+              var t = y * e[0], h = e[1] / y;
+              e[0] < h ? h = e[0] : t = e[1], e[0] = -1 * n[0] * (h / 2 + f), e[1] = -1 * n[1] * (t / 2 + f);
+            }, s.decideDirectionsForOverlappingNodes = function(i, r, e) {
+              i.getCenterX() < r.getCenterX() ? e[0] = -1 : e[0] = 1, i.getCenterY() < r.getCenterY() ? e[1] = -1 : e[1] = 1;
+            }, s.getIntersection2 = function(i, r, e) {
+              var f = i.getCenterX(), n = i.getCenterY(), y = r.getCenterX(), t = r.getCenterY();
+              if (i.intersects(r))
+                return e[0] = f, e[1] = n, e[2] = y, e[3] = t, !0;
+              var h = i.getX(), o = i.getY(), c = i.getRight(), l = i.getX(), T = i.getBottom(), g = i.getRight(), d = i.getWidthHalf(), L = i.getHeightHalf(), F = r.getX(), M = r.getY(), P = r.getRight(), J = r.getX(), V = r.getBottom(), Q = r.getRight(), D = r.getWidthHalf(), rt = r.getHeightHalf(), a = !1, m = !1;
+              if (f === y) {
+                if (n > t)
+                  return e[0] = f, e[1] = o, e[2] = y, e[3] = V, !1;
+                if (n < t)
+                  return e[0] = f, e[1] = T, e[2] = y, e[3] = M, !1;
+              } else if (n === t) {
+                if (f > y)
+                  return e[0] = h, e[1] = n, e[2] = P, e[3] = t, !1;
+                if (f < y)
+                  return e[0] = c, e[1] = n, e[2] = F, e[3] = t, !1;
+              } else {
+                var v = i.height / i.width, E = r.height / r.width, p = (t - n) / (y - f), I = void 0, w = void 0, R = void 0, H = void 0, x = void 0, k = void 0;
+                if (-v === p ? f > y ? (e[0] = l, e[1] = T, a = !0) : (e[0] = c, e[1] = o, a = !0) : v === p && (f > y ? (e[0] = h, e[1] = o, a = !0) : (e[0] = g, e[1] = T, a = !0)), -E === p ? y > f ? (e[2] = J, e[3] = V, m = !0) : (e[2] = P, e[3] = M, m = !0) : E === p && (y > f ? (e[2] = F, e[3] = M, m = !0) : (e[2] = Q, e[3] = V, m = !0)), a && m)
+                  return !1;
+                if (f > y ? n > t ? (I = this.getCardinalDirection(v, p, 4), w = this.getCardinalDirection(E, p, 2)) : (I = this.getCardinalDirection(-v, p, 3), w = this.getCardinalDirection(-E, p, 1)) : n > t ? (I = this.getCardinalDirection(-v, p, 1), w = this.getCardinalDirection(-E, p, 3)) : (I = this.getCardinalDirection(v, p, 2), w = this.getCardinalDirection(E, p, 4)), !a)
+                  switch (I) {
+                    case 1:
+                      H = o, R = f + -L / p, e[0] = R, e[1] = H;
+                      break;
+                    case 2:
+                      R = g, H = n + d * p, e[0] = R, e[1] = H;
+                      break;
+                    case 3:
+                      H = T, R = f + L / p, e[0] = R, e[1] = H;
+                      break;
+                    case 4:
+                      R = l, H = n + -d * p, e[0] = R, e[1] = H;
+                      break;
+                  }
+                if (!m)
+                  switch (w) {
+                    case 1:
+                      k = M, x = y + -rt / p, e[2] = x, e[3] = k;
+                      break;
+                    case 2:
+                      x = Q, k = t + D * p, e[2] = x, e[3] = k;
+                      break;
+                    case 3:
+                      k = V, x = y + rt / p, e[2] = x, e[3] = k;
+                      break;
+                    case 4:
+                      x = J, k = t + -D * p, e[2] = x, e[3] = k;
+                      break;
+                  }
+              }
+              return !1;
+            }, s.getCardinalDirection = function(i, r, e) {
+              return i > r ? e : 1 + e % 4;
+            }, s.getIntersection = function(i, r, e, f) {
+              if (f == null)
+                return this.getIntersection2(i, r, e);
+              var n = i.x, y = i.y, t = r.x, h = r.y, o = e.x, c = e.y, l = f.x, T = f.y, g = void 0, d = void 0, L = void 0, F = void 0, M = void 0, P = void 0, J = void 0, V = void 0, Q = void 0;
+              return L = h - y, M = n - t, J = t * y - n * h, F = T - c, P = o - l, V = l * c - o * T, Q = L * P - F * M, Q === 0 ? null : (g = (M * V - P * J) / Q, d = (F * J - L * V) / Q, new u(g, d));
+            }, s.angleOfVector = function(i, r, e, f) {
+              var n = void 0;
+              return i !== e ? (n = Math.atan((f - r) / (e - i)), e < i ? n += Math.PI : f < r && (n += this.TWO_PI)) : f < r ? n = this.ONE_AND_HALF_PI : n = this.HALF_PI, n;
+            }, s.doIntersect = function(i, r, e, f) {
+              var n = i.x, y = i.y, t = r.x, h = r.y, o = e.x, c = e.y, l = f.x, T = f.y, g = (t - n) * (T - c) - (l - o) * (h - y);
+              if (g === 0)
+                return !1;
+              var d = ((T - c) * (l - n) + (o - l) * (T - y)) / g, L = ((y - h) * (l - n) + (t - n) * (T - y)) / g;
+              return 0 < d && d < 1 && 0 < L && L < 1;
+            }, s.findCircleLineIntersections = function(i, r, e, f, n, y, t) {
+              var h = (e - i) * (e - i) + (f - r) * (f - r), o = 2 * ((i - n) * (e - i) + (r - y) * (f - r)), c = (i - n) * (i - n) + (r - y) * (r - y) - t * t, l = o * o - 4 * h * c;
+              if (l >= 0) {
+                var T = (-o + Math.sqrt(o * o - 4 * h * c)) / (2 * h), g = (-o - Math.sqrt(o * o - 4 * h * c)) / (2 * h), d = null;
+                return T >= 0 && T <= 1 ? [T] : g >= 0 && g <= 1 ? [g] : d;
+              } else return null;
+            }, s.HALF_PI = 0.5 * Math.PI, s.ONE_AND_HALF_PI = 1.5 * Math.PI, s.TWO_PI = 2 * Math.PI, s.THREE_PI = 3 * Math.PI, A.exports = s;
+          },
+          /* 9 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.sign = function(s) {
+              return s > 0 ? 1 : s < 0 ? -1 : 0;
+            }, u.floor = function(s) {
+              return s < 0 ? Math.ceil(s) : Math.floor(s);
+            }, u.ceil = function(s) {
+              return s < 0 ? Math.floor(s) : Math.ceil(s);
+            }, A.exports = u;
+          },
+          /* 10 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.MAX_VALUE = 2147483647, u.MIN_VALUE = -2147483648, A.exports = u;
+          },
+          /* 11 */
+          /***/
+          function(A, G, N) {
+            var u = /* @__PURE__ */ function() {
+              function n(y, t) {
+                for (var h = 0; h < t.length; h++) {
+                  var o = t[h];
+                  o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(y, o.key, o);
+                }
+              }
+              return function(y, t, h) {
+                return t && n(y.prototype, t), h && n(y, h), y;
+              };
+            }();
+            function s(n, y) {
+              if (!(n instanceof y))
+                throw new TypeError("Cannot call a class as a function");
+            }
+            var i = function(y) {
+              return { value: y, next: null, prev: null };
+            }, r = function(y, t, h, o) {
+              return y !== null ? y.next = t : o.head = t, h !== null ? h.prev = t : o.tail = t, t.prev = y, t.next = h, o.length++, t;
+            }, e = function(y, t) {
+              var h = y.prev, o = y.next;
+              return h !== null ? h.next = o : t.head = o, o !== null ? o.prev = h : t.tail = h, y.prev = y.next = null, t.length--, y;
+            }, f = function() {
+              function n(y) {
+                var t = this;
+                s(this, n), this.length = 0, this.head = null, this.tail = null, y != null && y.forEach(function(h) {
+                  return t.push(h);
+                });
+              }
+              return u(n, [{
+                key: "size",
+                value: function() {
+                  return this.length;
+                }
+              }, {
+                key: "insertBefore",
+                value: function(t, h) {
+                  return r(h.prev, i(t), h, this);
+                }
+              }, {
+                key: "insertAfter",
+                value: function(t, h) {
+                  return r(h, i(t), h.next, this);
+                }
+              }, {
+                key: "insertNodeBefore",
+                value: function(t, h) {
+                  return r(h.prev, t, h, this);
+                }
+              }, {
+                key: "insertNodeAfter",
+                value: function(t, h) {
+                  return r(h, t, h.next, this);
+                }
+              }, {
+                key: "push",
+                value: function(t) {
+                  return r(this.tail, i(t), null, this);
+                }
+              }, {
+                key: "unshift",
+                value: function(t) {
+                  return r(null, i(t), this.head, this);
+                }
+              }, {
+                key: "remove",
+                value: function(t) {
+                  return e(t, this);
+                }
+              }, {
+                key: "pop",
+                value: function() {
+                  return e(this.tail, this).value;
+                }
+              }, {
+                key: "popNode",
+                value: function() {
+                  return e(this.tail, this);
+                }
+              }, {
+                key: "shift",
+                value: function() {
+                  return e(this.head, this).value;
+                }
+              }, {
+                key: "shiftNode",
+                value: function() {
+                  return e(this.head, this);
+                }
+              }, {
+                key: "get_object_at",
+                value: function(t) {
+                  if (t <= this.length()) {
+                    for (var h = 1, o = this.head; h < t; )
+                      o = o.next, h++;
+                    return o.value;
+                  }
+                }
+              }, {
+                key: "set_object_at",
+                value: function(t, h) {
+                  if (t <= this.length()) {
+                    for (var o = 1, c = this.head; o < t; )
+                      c = c.next, o++;
+                    c.value = h;
+                  }
+                }
+              }]), n;
+            }();
+            A.exports = f;
+          },
+          /* 12 */
+          /***/
+          function(A, G, N) {
+            function u(s, i, r) {
+              this.x = null, this.y = null, s == null && i == null && r == null ? (this.x = 0, this.y = 0) : typeof s == "number" && typeof i == "number" && r == null ? (this.x = s, this.y = i) : s.constructor.name == "Point" && i == null && r == null && (r = s, this.x = r.x, this.y = r.y);
+            }
+            u.prototype.getX = function() {
+              return this.x;
+            }, u.prototype.getY = function() {
+              return this.y;
+            }, u.prototype.getLocation = function() {
+              return new u(this.x, this.y);
+            }, u.prototype.setLocation = function(s, i, r) {
+              s.constructor.name == "Point" && i == null && r == null ? (r = s, this.setLocation(r.x, r.y)) : typeof s == "number" && typeof i == "number" && r == null && (parseInt(s) == s && parseInt(i) == i ? this.move(s, i) : (this.x = Math.floor(s + 0.5), this.y = Math.floor(i + 0.5)));
+            }, u.prototype.move = function(s, i) {
+              this.x = s, this.y = i;
+            }, u.prototype.translate = function(s, i) {
+              this.x += s, this.y += i;
+            }, u.prototype.equals = function(s) {
+              if (s.constructor.name == "Point") {
+                var i = s;
+                return this.x == i.x && this.y == i.y;
+              }
+              return this == s;
+            }, u.prototype.toString = function() {
+              return new u().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
+            }, A.exports = u;
+          },
+          /* 13 */
+          /***/
+          function(A, G, N) {
+            function u(s, i, r, e) {
+              this.x = 0, this.y = 0, this.width = 0, this.height = 0, s != null && i != null && r != null && e != null && (this.x = s, this.y = i, this.width = r, this.height = e);
+            }
+            u.prototype.getX = function() {
+              return this.x;
+            }, u.prototype.setX = function(s) {
+              this.x = s;
+            }, u.prototype.getY = function() {
+              return this.y;
+            }, u.prototype.setY = function(s) {
+              this.y = s;
+            }, u.prototype.getWidth = function() {
+              return this.width;
+            }, u.prototype.setWidth = function(s) {
+              this.width = s;
+            }, u.prototype.getHeight = function() {
+              return this.height;
+            }, u.prototype.setHeight = function(s) {
+              this.height = s;
+            }, u.prototype.getRight = function() {
+              return this.x + this.width;
+            }, u.prototype.getBottom = function() {
+              return this.y + this.height;
+            }, u.prototype.intersects = function(s) {
+              return !(this.getRight() < s.x || this.getBottom() < s.y || s.getRight() < this.x || s.getBottom() < this.y);
+            }, u.prototype.getCenterX = function() {
+              return this.x + this.width / 2;
+            }, u.prototype.getMinX = function() {
+              return this.getX();
+            }, u.prototype.getMaxX = function() {
+              return this.getX() + this.width;
+            }, u.prototype.getCenterY = function() {
+              return this.y + this.height / 2;
+            }, u.prototype.getMinY = function() {
+              return this.getY();
+            }, u.prototype.getMaxY = function() {
+              return this.getY() + this.height;
+            }, u.prototype.getWidthHalf = function() {
+              return this.width / 2;
+            }, u.prototype.getHeightHalf = function() {
+              return this.height / 2;
+            }, A.exports = u;
+          },
+          /* 14 */
+          /***/
+          function(A, G, N) {
+            var u = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(i) {
+              return typeof i;
+            } : function(i) {
+              return i && typeof Symbol == "function" && i.constructor === Symbol && i !== Symbol.prototype ? "symbol" : typeof i;
+            };
+            function s() {
+            }
+            s.lastID = 0, s.createID = function(i) {
+              return s.isPrimitive(i) ? i : (i.uniqueID != null || (i.uniqueID = s.getString(), s.lastID++), i.uniqueID);
+            }, s.getString = function(i) {
+              return i == null && (i = s.lastID), "Object#" + i;
+            }, s.isPrimitive = function(i) {
+              var r = typeof i > "u" ? "undefined" : u(i);
+              return i == null || r != "object" && r != "function";
+            }, A.exports = s;
+          },
+          /* 15 */
+          /***/
+          function(A, G, N) {
+            function u(o) {
+              if (Array.isArray(o)) {
+                for (var c = 0, l = Array(o.length); c < o.length; c++)
+                  l[c] = o[c];
+                return l;
+              } else
+                return Array.from(o);
+            }
+            var s = N(0), i = N(7), r = N(3), e = N(1), f = N(6), n = N(5), y = N(17), t = N(29);
+            function h(o) {
+              t.call(this), this.layoutQuality = s.QUALITY, this.createBendsAsNeeded = s.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = s.DEFAULT_INCREMENTAL, this.animationOnLayout = s.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = s.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = s.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = s.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new i(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, o != null && (this.isRemoteUse = o);
+            }
+            h.RANDOM_SEED = 1, h.prototype = Object.create(t.prototype), h.prototype.getGraphManager = function() {
+              return this.graphManager;
+            }, h.prototype.getAllNodes = function() {
+              return this.graphManager.getAllNodes();
+            }, h.prototype.getAllEdges = function() {
+              return this.graphManager.getAllEdges();
+            }, h.prototype.getAllNodesToApplyGravitation = function() {
+              return this.graphManager.getAllNodesToApplyGravitation();
+            }, h.prototype.newGraphManager = function() {
+              var o = new i(this);
+              return this.graphManager = o, o;
+            }, h.prototype.newGraph = function(o) {
+              return new f(null, this.graphManager, o);
+            }, h.prototype.newNode = function(o) {
+              return new r(this.graphManager, o);
+            }, h.prototype.newEdge = function(o) {
+              return new e(null, null, o);
+            }, h.prototype.checkLayoutSuccess = function() {
+              return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
+            }, h.prototype.runLayout = function() {
+              this.isLayoutFinished = !1, this.tilingPreLayout && this.tilingPreLayout(), this.initParameters();
+              var o;
+              return this.checkLayoutSuccess() ? o = !1 : o = this.layout(), s.ANIMATE === "during" ? !1 : (o && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, o);
+            }, h.prototype.doPostLayout = function() {
+              this.incremental || this.transform(), this.update();
+            }, h.prototype.update2 = function() {
+              if (this.createBendsAsNeeded && (this.createBendpointsFromDummyNodes(), this.graphManager.resetAllEdges()), !this.isRemoteUse) {
+                for (var o = this.graphManager.getAllEdges(), c = 0; c < o.length; c++)
+                  o[c];
+                for (var l = this.graphManager.getRoot().getNodes(), c = 0; c < l.length; c++)
+                  l[c];
+                this.update(this.graphManager.getRoot());
+              }
+            }, h.prototype.update = function(o) {
+              if (o == null)
+                this.update2();
+              else if (o instanceof r) {
+                var c = o;
+                if (c.getChild() != null)
+                  for (var l = c.getChild().getNodes(), T = 0; T < l.length; T++)
+                    update(l[T]);
+                if (c.vGraphObject != null) {
+                  var g = c.vGraphObject;
+                  g.update(c);
+                }
+              } else if (o instanceof e) {
+                var d = o;
+                if (d.vGraphObject != null) {
+                  var L = d.vGraphObject;
+                  L.update(d);
+                }
+              } else if (o instanceof f) {
+                var F = o;
+                if (F.vGraphObject != null) {
+                  var M = F.vGraphObject;
+                  M.update(F);
+                }
+              }
+            }, h.prototype.initParameters = function() {
+              this.isSubLayout || (this.layoutQuality = s.QUALITY, this.animationDuringLayout = s.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = s.DEFAULT_ANIMATION_PERIOD, this.animationOnLayout = s.DEFAULT_ANIMATION_ON_LAYOUT, this.incremental = s.DEFAULT_INCREMENTAL, this.createBendsAsNeeded = s.DEFAULT_CREATE_BENDS_AS_NEEDED, this.uniformLeafNodeSizes = s.DEFAULT_UNIFORM_LEAF_NODE_SIZES), this.animationDuringLayout && (this.animationOnLayout = !1);
+            }, h.prototype.transform = function(o) {
+              if (o == null)
+                this.transform(new n(0, 0));
+              else {
+                var c = new y(), l = this.graphManager.getRoot().updateLeftTop();
+                if (l != null) {
+                  c.setWorldOrgX(o.x), c.setWorldOrgY(o.y), c.setDeviceOrgX(l.x), c.setDeviceOrgY(l.y);
+                  for (var T = this.getAllNodes(), g, d = 0; d < T.length; d++)
+                    g = T[d], g.transform(c);
+                }
+              }
+            }, h.prototype.positionNodesRandomly = function(o) {
+              if (o == null)
+                this.positionNodesRandomly(this.getGraphManager().getRoot()), this.getGraphManager().getRoot().updateBounds(!0);
+              else
+                for (var c, l, T = o.getNodes(), g = 0; g < T.length; g++)
+                  c = T[g], l = c.getChild(), l == null || l.getNodes().length == 0 ? c.scatter() : (this.positionNodesRandomly(l), c.updateBounds());
+            }, h.prototype.getFlatForest = function() {
+              for (var o = [], c = !0, l = this.graphManager.getRoot().getNodes(), T = !0, g = 0; g < l.length; g++)
+                l[g].getChild() != null && (T = !1);
+              if (!T)
+                return o;
+              var d = /* @__PURE__ */ new Set(), L = [], F = /* @__PURE__ */ new Map(), M = [];
+              for (M = M.concat(l); M.length > 0 && c; ) {
+                for (L.push(M[0]); L.length > 0 && c; ) {
+                  var P = L[0];
+                  L.splice(0, 1), d.add(P);
+                  for (var J = P.getEdges(), g = 0; g < J.length; g++) {
+                    var V = J[g].getOtherEnd(P);
+                    if (F.get(P) != V)
+                      if (!d.has(V))
+                        L.push(V), F.set(V, P);
+                      else {
+                        c = !1;
+                        break;
+                      }
+                  }
+                }
+                if (!c)
+                  o = [];
+                else {
+                  var Q = [].concat(u(d));
+                  o.push(Q);
+                  for (var g = 0; g < Q.length; g++) {
+                    var D = Q[g], rt = M.indexOf(D);
+                    rt > -1 && M.splice(rt, 1);
+                  }
+                  d = /* @__PURE__ */ new Set(), F = /* @__PURE__ */ new Map();
+                }
+              }
+              return o;
+            }, h.prototype.createDummyNodesForBendpoints = function(o) {
+              for (var c = [], l = o.source, T = this.graphManager.calcLowestCommonAncestor(o.source, o.target), g = 0; g < o.bendpoints.length; g++) {
+                var d = this.newNode(null);
+                d.setRect(new Point(0, 0), new Dimension(1, 1)), T.add(d);
+                var L = this.newEdge(null);
+                this.graphManager.add(L, l, d), c.add(d), l = d;
+              }
+              var L = this.newEdge(null);
+              return this.graphManager.add(L, l, o.target), this.edgeToDummyNodes.set(o, c), o.isInterGraph() ? this.graphManager.remove(o) : T.remove(o), c;
+            }, h.prototype.createBendpointsFromDummyNodes = function() {
+              var o = [];
+              o = o.concat(this.graphManager.getAllEdges()), o = [].concat(u(this.edgeToDummyNodes.keys())).concat(o);
+              for (var c = 0; c < o.length; c++) {
+                var l = o[c];
+                if (l.bendpoints.length > 0) {
+                  for (var T = this.edgeToDummyNodes.get(l), g = 0; g < T.length; g++) {
+                    var d = T[g], L = new n(d.getCenterX(), d.getCenterY()), F = l.bendpoints.get(g);
+                    F.x = L.x, F.y = L.y, d.getOwner().remove(d);
+                  }
+                  this.graphManager.add(l, l.source, l.target);
+                }
+              }
+            }, h.transform = function(o, c, l, T) {
+              if (l != null && T != null) {
+                var g = c;
+                if (o <= 50) {
+                  var d = c / l;
+                  g -= (c - d) / 50 * (50 - o);
+                } else {
+                  var L = c * T;
+                  g += (L - c) / 50 * (o - 50);
+                }
+                return g;
+              } else {
+                var F, M;
+                return o <= 50 ? (F = 9 * c / 500, M = c / 10) : (F = 9 * c / 50, M = -8 * c), F * o + M;
+              }
+            }, h.findCenterOfTree = function(o) {
+              var c = [];
+              c = c.concat(o);
+              var l = [], T = /* @__PURE__ */ new Map(), g = !1, d = null;
+              (c.length == 1 || c.length == 2) && (g = !0, d = c[0]);
+              for (var L = 0; L < c.length; L++) {
+                var F = c[L], M = F.getNeighborsList().size;
+                T.set(F, F.getNeighborsList().size), M == 1 && l.push(F);
+              }
+              var P = [];
+              for (P = P.concat(l); !g; ) {
+                var J = [];
+                J = J.concat(P), P = [];
+                for (var L = 0; L < c.length; L++) {
+                  var F = c[L], V = c.indexOf(F);
+                  V >= 0 && c.splice(V, 1);
+                  var Q = F.getNeighborsList();
+                  Q.forEach(function(a) {
+                    if (l.indexOf(a) < 0) {
+                      var m = T.get(a), v = m - 1;
+                      v == 1 && P.push(a), T.set(a, v);
+                    }
+                  });
+                }
+                l = l.concat(P), (c.length == 1 || c.length == 2) && (g = !0, d = c[0]);
+              }
+              return d;
+            }, h.prototype.setGraphManager = function(o) {
+              this.graphManager = o;
+            }, A.exports = h;
+          },
+          /* 16 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.seed = 1, u.x = 0, u.nextDouble = function() {
+              return u.x = Math.sin(u.seed++) * 1e4, u.x - Math.floor(u.x);
+            }, A.exports = u;
+          },
+          /* 17 */
+          /***/
+          function(A, G, N) {
+            var u = N(5);
+            function s(i, r) {
+              this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
+            }
+            s.prototype.getWorldOrgX = function() {
+              return this.lworldOrgX;
+            }, s.prototype.setWorldOrgX = function(i) {
+              this.lworldOrgX = i;
+            }, s.prototype.getWorldOrgY = function() {
+              return this.lworldOrgY;
+            }, s.prototype.setWorldOrgY = function(i) {
+              this.lworldOrgY = i;
+            }, s.prototype.getWorldExtX = function() {
+              return this.lworldExtX;
+            }, s.prototype.setWorldExtX = function(i) {
+              this.lworldExtX = i;
+            }, s.prototype.getWorldExtY = function() {
+              return this.lworldExtY;
+            }, s.prototype.setWorldExtY = function(i) {
+              this.lworldExtY = i;
+            }, s.prototype.getDeviceOrgX = function() {
+              return this.ldeviceOrgX;
+            }, s.prototype.setDeviceOrgX = function(i) {
+              this.ldeviceOrgX = i;
+            }, s.prototype.getDeviceOrgY = function() {
+              return this.ldeviceOrgY;
+            }, s.prototype.setDeviceOrgY = function(i) {
+              this.ldeviceOrgY = i;
+            }, s.prototype.getDeviceExtX = function() {
+              return this.ldeviceExtX;
+            }, s.prototype.setDeviceExtX = function(i) {
+              this.ldeviceExtX = i;
+            }, s.prototype.getDeviceExtY = function() {
+              return this.ldeviceExtY;
+            }, s.prototype.setDeviceExtY = function(i) {
+              this.ldeviceExtY = i;
+            }, s.prototype.transformX = function(i) {
+              var r = 0, e = this.lworldExtX;
+              return e != 0 && (r = this.ldeviceOrgX + (i - this.lworldOrgX) * this.ldeviceExtX / e), r;
+            }, s.prototype.transformY = function(i) {
+              var r = 0, e = this.lworldExtY;
+              return e != 0 && (r = this.ldeviceOrgY + (i - this.lworldOrgY) * this.ldeviceExtY / e), r;
+            }, s.prototype.inverseTransformX = function(i) {
+              var r = 0, e = this.ldeviceExtX;
+              return e != 0 && (r = this.lworldOrgX + (i - this.ldeviceOrgX) * this.lworldExtX / e), r;
+            }, s.prototype.inverseTransformY = function(i) {
+              var r = 0, e = this.ldeviceExtY;
+              return e != 0 && (r = this.lworldOrgY + (i - this.ldeviceOrgY) * this.lworldExtY / e), r;
+            }, s.prototype.inverseTransformPoint = function(i) {
+              var r = new u(this.inverseTransformX(i.x), this.inverseTransformY(i.y));
+              return r;
+            }, A.exports = s;
+          },
+          /* 18 */
+          /***/
+          function(A, G, N) {
+            function u(t) {
+              if (Array.isArray(t)) {
+                for (var h = 0, o = Array(t.length); h < t.length; h++)
+                  o[h] = t[h];
+                return o;
+              } else
+                return Array.from(t);
+            }
+            var s = N(15), i = N(4), r = N(0), e = N(8), f = N(9);
+            function n() {
+              s.call(this), this.useSmartIdealEdgeLengthCalculation = i.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION, this.gravityConstant = i.DEFAULT_GRAVITY_STRENGTH, this.compoundGravityConstant = i.DEFAULT_COMPOUND_GRAVITY_STRENGTH, this.gravityRangeFactor = i.DEFAULT_GRAVITY_RANGE_FACTOR, this.compoundGravityRangeFactor = i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR, this.displacementThresholdPerNode = 3 * i.DEFAULT_EDGE_LENGTH / 100, this.coolingFactor = i.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.initialCoolingFactor = i.DEFAULT_COOLING_FACTOR_INCREMENTAL, this.totalDisplacement = 0, this.oldTotalDisplacement = 0, this.maxIterations = i.MAX_ITERATIONS;
+            }
+            n.prototype = Object.create(s.prototype);
+            for (var y in s)
+              n[y] = s[y];
+            n.prototype.initParameters = function() {
+              s.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = i.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
+            }, n.prototype.calcIdealEdgeLengths = function() {
+              for (var t, h, o, c, l, T, g, d = this.getGraphManager().getAllEdges(), L = 0; L < d.length; L++)
+                t = d[L], h = t.idealLength, t.isInterGraph && (c = t.getSource(), l = t.getTarget(), T = t.getSourceInLca().getEstimatedSize(), g = t.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (t.idealLength += T + g - 2 * r.SIMPLE_NODE_SIZE), o = t.getLca().getInclusionTreeDepth(), t.idealLength += h * i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (c.getInclusionTreeDepth() + l.getInclusionTreeDepth() - 2 * o));
+            }, n.prototype.initSpringEmbedder = function() {
+              var t = this.getAllNodes().length;
+              this.incremental ? (t > i.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * i.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (t - i.ADAPTATION_LOWER_NODE_LIMIT) / (i.ADAPTATION_UPPER_NODE_LIMIT - i.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - i.COOLING_ADAPTATION_FACTOR))), this.maxNodeDisplacement = i.MAX_NODE_DISPLACEMENT_INCREMENTAL) : (t > i.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(i.COOLING_ADAPTATION_FACTOR, 1 - (t - i.ADAPTATION_LOWER_NODE_LIMIT) / (i.ADAPTATION_UPPER_NODE_LIMIT - i.ADAPTATION_LOWER_NODE_LIMIT) * (1 - i.COOLING_ADAPTATION_FACTOR)) : this.coolingFactor = 1, this.initialCoolingFactor = this.coolingFactor, this.maxNodeDisplacement = i.MAX_NODE_DISPLACEMENT), this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations), this.displacementThresholdPerNode = 3 * i.DEFAULT_EDGE_LENGTH / 100, this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length, this.repulsionRange = this.calcRepulsionRange();
+            }, n.prototype.calcSpringForces = function() {
+              for (var t = this.getAllEdges(), h, o = 0; o < t.length; o++)
+                h = t[o], this.calcSpringForce(h, h.idealLength);
+            }, n.prototype.calcRepulsionForces = function() {
+              var t = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, h = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, o, c, l, T, g = this.getAllNodes(), d;
+              if (this.useFRGridVariant)
+                for (this.totalIterations % i.GRID_CALCULATION_CHECK_PERIOD == 1 && t && this.updateGrid(), d = /* @__PURE__ */ new Set(), o = 0; o < g.length; o++)
+                  l = g[o], this.calculateRepulsionForceOfANode(l, d, t, h), d.add(l);
+              else
+                for (o = 0; o < g.length; o++)
+                  for (l = g[o], c = o + 1; c < g.length; c++)
+                    T = g[c], l.getOwner() == T.getOwner() && this.calcRepulsionForce(l, T);
+            }, n.prototype.calcGravitationalForces = function() {
+              for (var t, h = this.getAllNodesToApplyGravitation(), o = 0; o < h.length; o++)
+                t = h[o], this.calcGravitationalForce(t);
+            }, n.prototype.moveNodes = function() {
+              for (var t = this.getAllNodes(), h, o = 0; o < t.length; o++)
+                h = t[o], h.move();
+            }, n.prototype.calcSpringForce = function(t, h) {
+              var o = t.getSource(), c = t.getTarget(), l, T, g, d;
+              if (this.uniformLeafNodeSizes && o.getChild() == null && c.getChild() == null)
+                t.updateLengthSimple();
+              else if (t.updateLength(), t.isOverlapingSourceAndTarget)
+                return;
+              l = t.getLength(), l != 0 && (T = t.edgeElasticity * (l - h), g = T * (t.lengthX / l), d = T * (t.lengthY / l), o.springForceX += g, o.springForceY += d, c.springForceX -= g, c.springForceY -= d);
+            }, n.prototype.calcRepulsionForce = function(t, h) {
+              var o = t.getRect(), c = h.getRect(), l = new Array(2), T = new Array(4), g, d, L, F, M, P, J;
+              if (o.intersects(c)) {
+                e.calcSeparationAmount(o, c, l, i.DEFAULT_EDGE_LENGTH / 2), P = 2 * l[0], J = 2 * l[1];
+                var V = t.noOfChildren * h.noOfChildren / (t.noOfChildren + h.noOfChildren);
+                t.repulsionForceX -= V * P, t.repulsionForceY -= V * J, h.repulsionForceX += V * P, h.repulsionForceY += V * J;
+              } else
+                this.uniformLeafNodeSizes && t.getChild() == null && h.getChild() == null ? (g = c.getCenterX() - o.getCenterX(), d = c.getCenterY() - o.getCenterY()) : (e.getIntersection(o, c, T), g = T[2] - T[0], d = T[3] - T[1]), Math.abs(g) < i.MIN_REPULSION_DIST && (g = f.sign(g) * i.MIN_REPULSION_DIST), Math.abs(d) < i.MIN_REPULSION_DIST && (d = f.sign(d) * i.MIN_REPULSION_DIST), L = g * g + d * d, F = Math.sqrt(L), M = (t.nodeRepulsion / 2 + h.nodeRepulsion / 2) * t.noOfChildren * h.noOfChildren / L, P = M * g / F, J = M * d / F, t.repulsionForceX -= P, t.repulsionForceY -= J, h.repulsionForceX += P, h.repulsionForceY += J;
+            }, n.prototype.calcGravitationalForce = function(t) {
+              var h, o, c, l, T, g, d, L;
+              h = t.getOwner(), o = (h.getRight() + h.getLeft()) / 2, c = (h.getTop() + h.getBottom()) / 2, l = t.getCenterX() - o, T = t.getCenterY() - c, g = Math.abs(l) + t.getWidth() / 2, d = Math.abs(T) + t.getHeight() / 2, t.getOwner() == this.graphManager.getRoot() ? (L = h.getEstimatedSize() * this.gravityRangeFactor, (g > L || d > L) && (t.gravitationForceX = -this.gravityConstant * l, t.gravitationForceY = -this.gravityConstant * T)) : (L = h.getEstimatedSize() * this.compoundGravityRangeFactor, (g > L || d > L) && (t.gravitationForceX = -this.gravityConstant * l * this.compoundGravityConstant, t.gravitationForceY = -this.gravityConstant * T * this.compoundGravityConstant));
+            }, n.prototype.isConverged = function() {
+              var t, h = !1;
+              return this.totalIterations > this.maxIterations / 3 && (h = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2), t = this.totalDisplacement < this.totalDisplacementThreshold, this.oldTotalDisplacement = this.totalDisplacement, t || h;
+            }, n.prototype.animate = function() {
+              this.animationDuringLayout && !this.isSubLayout && (this.notAnimatedIterations == this.animationPeriod ? (this.update(), this.notAnimatedIterations = 0) : this.notAnimatedIterations++);
+            }, n.prototype.calcNoOfChildrenForAllNodes = function() {
+              for (var t, h = this.graphManager.getAllNodes(), o = 0; o < h.length; o++)
+                t = h[o], t.noOfChildren = t.getNoOfChildren();
+            }, n.prototype.calcGrid = function(t) {
+              var h = 0, o = 0;
+              h = parseInt(Math.ceil((t.getRight() - t.getLeft()) / this.repulsionRange)), o = parseInt(Math.ceil((t.getBottom() - t.getTop()) / this.repulsionRange));
+              for (var c = new Array(h), l = 0; l < h; l++)
+                c[l] = new Array(o);
+              for (var l = 0; l < h; l++)
+                for (var T = 0; T < o; T++)
+                  c[l][T] = new Array();
+              return c;
+            }, n.prototype.addNodeToGrid = function(t, h, o) {
+              var c = 0, l = 0, T = 0, g = 0;
+              c = parseInt(Math.floor((t.getRect().x - h) / this.repulsionRange)), l = parseInt(Math.floor((t.getRect().width + t.getRect().x - h) / this.repulsionRange)), T = parseInt(Math.floor((t.getRect().y - o) / this.repulsionRange)), g = parseInt(Math.floor((t.getRect().height + t.getRect().y - o) / this.repulsionRange));
+              for (var d = c; d <= l; d++)
+                for (var L = T; L <= g; L++)
+                  this.grid[d][L].push(t), t.setGridCoordinates(c, l, T, g);
+            }, n.prototype.updateGrid = function() {
+              var t, h, o = this.getAllNodes();
+              for (this.grid = this.calcGrid(this.graphManager.getRoot()), t = 0; t < o.length; t++)
+                h = o[t], this.addNodeToGrid(h, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
+            }, n.prototype.calculateRepulsionForceOfANode = function(t, h, o, c) {
+              if (this.totalIterations % i.GRID_CALCULATION_CHECK_PERIOD == 1 && o || c) {
+                var l = /* @__PURE__ */ new Set();
+                t.surrounding = new Array();
+                for (var T, g = this.grid, d = t.startX - 1; d < t.finishX + 2; d++)
+                  for (var L = t.startY - 1; L < t.finishY + 2; L++)
+                    if (!(d < 0 || L < 0 || d >= g.length || L >= g[0].length)) {
+                      for (var F = 0; F < g[d][L].length; F++)
+                        if (T = g[d][L][F], !(t.getOwner() != T.getOwner() || t == T) && !h.has(T) && !l.has(T)) {
+                          var M = Math.abs(t.getCenterX() - T.getCenterX()) - (t.getWidth() / 2 + T.getWidth() / 2), P = Math.abs(t.getCenterY() - T.getCenterY()) - (t.getHeight() / 2 + T.getHeight() / 2);
+                          M <= this.repulsionRange && P <= this.repulsionRange && l.add(T);
+                        }
+                    }
+                t.surrounding = [].concat(u(l));
+              }
+              for (d = 0; d < t.surrounding.length; d++)
+                this.calcRepulsionForce(t, t.surrounding[d]);
+            }, n.prototype.calcRepulsionRange = function() {
+              return 0;
+            }, A.exports = n;
+          },
+          /* 19 */
+          /***/
+          function(A, G, N) {
+            var u = N(1), s = N(4);
+            function i(e, f, n) {
+              u.call(this, e, f, n), this.idealLength = s.DEFAULT_EDGE_LENGTH, this.edgeElasticity = s.DEFAULT_SPRING_STRENGTH;
+            }
+            i.prototype = Object.create(u.prototype);
+            for (var r in u)
+              i[r] = u[r];
+            A.exports = i;
+          },
+          /* 20 */
+          /***/
+          function(A, G, N) {
+            var u = N(3), s = N(4);
+            function i(e, f, n, y) {
+              u.call(this, e, f, n, y), this.nodeRepulsion = s.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 = [];
+            }
+            i.prototype = Object.create(u.prototype);
+            for (var r in u)
+              i[r] = u[r];
+            i.prototype.setGridCoordinates = function(e, f, n, y) {
+              this.startX = e, this.finishX = f, this.startY = n, this.finishY = y;
+            }, A.exports = i;
+          },
+          /* 21 */
+          /***/
+          function(A, G, N) {
+            function u(s, i) {
+              this.width = 0, this.height = 0, s !== null && i !== null && (this.height = i, this.width = s);
+            }
+            u.prototype.getWidth = function() {
+              return this.width;
+            }, u.prototype.setWidth = function(s) {
+              this.width = s;
+            }, u.prototype.getHeight = function() {
+              return this.height;
+            }, u.prototype.setHeight = function(s) {
+              this.height = s;
+            }, A.exports = u;
+          },
+          /* 22 */
+          /***/
+          function(A, G, N) {
+            var u = N(14);
+            function s() {
+              this.map = {}, this.keys = [];
+            }
+            s.prototype.put = function(i, r) {
+              var e = u.createID(i);
+              this.contains(e) || (this.map[e] = r, this.keys.push(i));
+            }, s.prototype.contains = function(i) {
+              return u.createID(i), this.map[i] != null;
+            }, s.prototype.get = function(i) {
+              var r = u.createID(i);
+              return this.map[r];
+            }, s.prototype.keySet = function() {
+              return this.keys;
+            }, A.exports = s;
+          },
+          /* 23 */
+          /***/
+          function(A, G, N) {
+            var u = N(14);
+            function s() {
+              this.set = {};
+            }
+            s.prototype.add = function(i) {
+              var r = u.createID(i);
+              this.contains(r) || (this.set[r] = i);
+            }, s.prototype.remove = function(i) {
+              delete this.set[u.createID(i)];
+            }, s.prototype.clear = function() {
+              this.set = {};
+            }, s.prototype.contains = function(i) {
+              return this.set[u.createID(i)] == i;
+            }, s.prototype.isEmpty = function() {
+              return this.size() === 0;
+            }, s.prototype.size = function() {
+              return Object.keys(this.set).length;
+            }, s.prototype.addAllTo = function(i) {
+              for (var r = Object.keys(this.set), e = r.length, f = 0; f < e; f++)
+                i.push(this.set[r[f]]);
+            }, s.prototype.size = function() {
+              return Object.keys(this.set).length;
+            }, s.prototype.addAll = function(i) {
+              for (var r = i.length, e = 0; e < r; e++) {
+                var f = i[e];
+                this.add(f);
+              }
+            }, A.exports = s;
+          },
+          /* 24 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.multMat = function(s, i) {
+              for (var r = [], e = 0; e < s.length; e++) {
+                r[e] = [];
+                for (var f = 0; f < i[0].length; f++) {
+                  r[e][f] = 0;
+                  for (var n = 0; n < s[0].length; n++)
+                    r[e][f] += s[e][n] * i[n][f];
+                }
+              }
+              return r;
+            }, u.transpose = function(s) {
+              for (var i = [], r = 0; r < s[0].length; r++) {
+                i[r] = [];
+                for (var e = 0; e < s.length; e++)
+                  i[r][e] = s[e][r];
+              }
+              return i;
+            }, u.multCons = function(s, i) {
+              for (var r = [], e = 0; e < s.length; e++)
+                r[e] = s[e] * i;
+              return r;
+            }, u.minusOp = function(s, i) {
+              for (var r = [], e = 0; e < s.length; e++)
+                r[e] = s[e] - i[e];
+              return r;
+            }, u.dotProduct = function(s, i) {
+              for (var r = 0, e = 0; e < s.length; e++)
+                r += s[e] * i[e];
+              return r;
+            }, u.mag = function(s) {
+              return Math.sqrt(this.dotProduct(s, s));
+            }, u.normalize = function(s) {
+              for (var i = [], r = this.mag(s), e = 0; e < s.length; e++)
+                i[e] = s[e] / r;
+              return i;
+            }, u.multGamma = function(s) {
+              for (var i = [], r = 0, e = 0; e < s.length; e++)
+                r += s[e];
+              r *= -1 / s.length;
+              for (var f = 0; f < s.length; f++)
+                i[f] = r + s[f];
+              return i;
+            }, u.multL = function(s, i, r) {
+              for (var e = [], f = [], n = [], y = 0; y < i[0].length; y++) {
+                for (var t = 0, h = 0; h < i.length; h++)
+                  t += -0.5 * i[h][y] * s[h];
+                f[y] = t;
+              }
+              for (var o = 0; o < r.length; o++) {
+                for (var c = 0, l = 0; l < r.length; l++)
+                  c += r[o][l] * f[l];
+                n[o] = c;
+              }
+              for (var T = 0; T < i.length; T++) {
+                for (var g = 0, d = 0; d < i[0].length; d++)
+                  g += i[T][d] * n[d];
+                e[T] = g;
+              }
+              return e;
+            }, A.exports = u;
+          },
+          /* 25 */
+          /***/
+          function(A, G, N) {
+            var u = /* @__PURE__ */ function() {
+              function e(f, n) {
+                for (var y = 0; y < n.length; y++) {
+                  var t = n[y];
+                  t.enumerable = t.enumerable || !1, t.configurable = !0, "value" in t && (t.writable = !0), Object.defineProperty(f, t.key, t);
+                }
+              }
+              return function(f, n, y) {
+                return n && e(f.prototype, n), y && e(f, y), f;
+              };
+            }();
+            function s(e, f) {
+              if (!(e instanceof f))
+                throw new TypeError("Cannot call a class as a function");
+            }
+            var i = N(11), r = function() {
+              function e(f, n) {
+                s(this, e), (n !== null || n !== void 0) && (this.compareFunction = this._defaultCompareFunction);
+                var y = void 0;
+                f instanceof i ? y = f.size() : y = f.length, this._quicksort(f, 0, y - 1);
+              }
+              return u(e, [{
+                key: "_quicksort",
+                value: function(n, y, t) {
+                  if (y < t) {
+                    var h = this._partition(n, y, t);
+                    this._quicksort(n, y, h), this._quicksort(n, h + 1, t);
+                  }
+                }
+              }, {
+                key: "_partition",
+                value: function(n, y, t) {
+                  for (var h = this._get(n, y), o = y, c = t; ; ) {
+                    for (; this.compareFunction(h, this._get(n, c)); )
+                      c--;
+                    for (; this.compareFunction(this._get(n, o), h); )
+                      o++;
+                    if (o < c)
+                      this._swap(n, o, c), o++, c--;
+                    else return c;
+                  }
+                }
+              }, {
+                key: "_get",
+                value: function(n, y) {
+                  return n instanceof i ? n.get_object_at(y) : n[y];
+                }
+              }, {
+                key: "_set",
+                value: function(n, y, t) {
+                  n instanceof i ? n.set_object_at(y, t) : n[y] = t;
+                }
+              }, {
+                key: "_swap",
+                value: function(n, y, t) {
+                  var h = this._get(n, y);
+                  this._set(n, y, this._get(n, t)), this._set(n, t, h);
+                }
+              }, {
+                key: "_defaultCompareFunction",
+                value: function(n, y) {
+                  return y > n;
+                }
+              }]), e;
+            }();
+            A.exports = r;
+          },
+          /* 26 */
+          /***/
+          function(A, G, N) {
+            function u() {
+            }
+            u.svd = function(s) {
+              this.U = null, this.V = null, this.s = null, this.m = 0, this.n = 0, this.m = s.length, this.n = s[0].length;
+              var i = Math.min(this.m, this.n);
+              this.s = function(Nt) {
+                for (var Mt = []; Nt-- > 0; )
+                  Mt.push(0);
+                return Mt;
+              }(Math.min(this.m + 1, this.n)), this.U = function(Nt) {
+                var Mt = function Zt(Gt) {
+                  if (Gt.length == 0)
+                    return 0;
+                  for (var $t = [], Ft = 0; Ft < Gt[0]; Ft++)
+                    $t.push(Zt(Gt.slice(1)));
+                  return $t;
+                };
+                return Mt(Nt);
+              }([this.m, i]), this.V = function(Nt) {
+                var Mt = function Zt(Gt) {
+                  if (Gt.length == 0)
+                    return 0;
+                  for (var $t = [], Ft = 0; Ft < Gt[0]; Ft++)
+                    $t.push(Zt(Gt.slice(1)));
+                  return $t;
+                };
+                return Mt(Nt);
+              }([this.n, this.n]);
+              for (var r = function(Nt) {
+                for (var Mt = []; Nt-- > 0; )
+                  Mt.push(0);
+                return Mt;
+              }(this.n), e = function(Nt) {
+                for (var Mt = []; Nt-- > 0; )
+                  Mt.push(0);
+                return Mt;
+              }(this.m), f = !0, n = Math.min(this.m - 1, this.n), y = Math.max(0, Math.min(this.n - 2, this.m)), t = 0; t < Math.max(n, y); t++) {
+                if (t < n) {
+                  this.s[t] = 0;
+                  for (var h = t; h < this.m; h++)
+                    this.s[t] = u.hypot(this.s[t], s[h][t]);
+                  if (this.s[t] !== 0) {
+                    s[t][t] < 0 && (this.s[t] = -this.s[t]);
+                    for (var o = t; o < this.m; o++)
+                      s[o][t] /= this.s[t];
+                    s[t][t] += 1;
+                  }
+                  this.s[t] = -this.s[t];
+                }
+                for (var c = t + 1; c < this.n; c++) {
+                  if (/* @__PURE__ */ function(Nt, Mt) {
+                    return Nt && Mt;
+                  }(t < n, this.s[t] !== 0)) {
+                    for (var l = 0, T = t; T < this.m; T++)
+                      l += s[T][t] * s[T][c];
+                    l = -l / s[t][t];
+                    for (var g = t; g < this.m; g++)
+                      s[g][c] += l * s[g][t];
+                  }
+                  r[c] = s[t][c];
+                }
+                if (/* @__PURE__ */ function(Nt, Mt) {
+                  return Mt;
+                }(f, t < n))
+                  for (var d = t; d < this.m; d++)
+                    this.U[d][t] = s[d][t];
+                if (t < y) {
+                  r[t] = 0;
+                  for (var L = t + 1; L < this.n; L++)
+                    r[t] = u.hypot(r[t], r[L]);
+                  if (r[t] !== 0) {
+                    r[t + 1] < 0 && (r[t] = -r[t]);
+                    for (var F = t + 1; F < this.n; F++)
+                      r[F] /= r[t];
+                    r[t + 1] += 1;
+                  }
+                  if (r[t] = -r[t], /* @__PURE__ */ function(Nt, Mt) {
+                    return Nt && Mt;
+                  }(t + 1 < this.m, r[t] !== 0)) {
+                    for (var M = t + 1; M < this.m; M++)
+                      e[M] = 0;
+                    for (var P = t + 1; P < this.n; P++)
+                      for (var J = t + 1; J < this.m; J++)
+                        e[J] += r[P] * s[J][P];
+                    for (var V = t + 1; V < this.n; V++)
+                      for (var Q = -r[V] / r[t + 1], D = t + 1; D < this.m; D++)
+                        s[D][V] += Q * e[D];
+                  }
+                  for (var rt = t + 1; rt < this.n; rt++)
+                    this.V[rt][t] = r[rt];
+                }
+              }
+              var a = Math.min(this.n, this.m + 1);
+              n < this.n && (this.s[n] = s[n][n]), this.m < a && (this.s[a - 1] = 0), y + 1 < a && (r[y] = s[y][a - 1]), r[a - 1] = 0;
+              {
+                for (var m = n; m < i; m++) {
+                  for (var v = 0; v < this.m; v++)
+                    this.U[v][m] = 0;
+                  this.U[m][m] = 1;
+                }
+                for (var E = n - 1; E >= 0; E--)
+                  if (this.s[E] !== 0) {
+                    for (var p = E + 1; p < i; p++) {
+                      for (var I = 0, w = E; w < this.m; w++)
+                        I += this.U[w][E] * this.U[w][p];
+                      I = -I / this.U[E][E];
+                      for (var R = E; R < this.m; R++)
+                        this.U[R][p] += I * this.U[R][E];
+                    }
+                    for (var H = E; H < this.m; H++)
+                      this.U[H][E] = -this.U[H][E];
+                    this.U[E][E] = 1 + this.U[E][E];
+                    for (var x = 0; x < E - 1; x++)
+                      this.U[x][E] = 0;
+                  } else {
+                    for (var k = 0; k < this.m; k++)
+                      this.U[k][E] = 0;
+                    this.U[E][E] = 1;
+                  }
+              }
+              for (var W = this.n - 1; W >= 0; W--) {
+                if (/* @__PURE__ */ function(Nt, Mt) {
+                  return Nt && Mt;
+                }(W < y, r[W] !== 0))
+                  for (var U = W + 1; U < i; U++) {
+                    for (var et = 0, z = W + 1; z < this.n; z++)
+                      et += this.V[z][W] * this.V[z][U];
+                    et = -et / this.V[W + 1][W];
+                    for (var O = W + 1; O < this.n; O++)
+                      this.V[O][U] += et * this.V[O][W];
+                  }
+                for (var X = 0; X < this.n; X++)
+                  this.V[X][W] = 0;
+                this.V[W][W] = 1;
+              }
+              for (var B = a - 1, _ = Math.pow(2, -52), lt = Math.pow(2, -966); a > 0; ) {
+                var q = void 0, Rt = void 0;
+                for (q = a - 2; q >= -1 && q !== -1; q--)
+                  if (Math.abs(r[q]) <= lt + _ * (Math.abs(this.s[q]) + Math.abs(this.s[q + 1]))) {
+                    r[q] = 0;
+                    break;
+                  }
+                if (q === a - 2)
+                  Rt = 4;
+                else {
+                  var Lt = void 0;
+                  for (Lt = a - 1; Lt >= q && Lt !== q; Lt--) {
+                    var vt = (Lt !== a ? Math.abs(r[Lt]) : 0) + (Lt !== q + 1 ? Math.abs(r[Lt - 1]) : 0);
+                    if (Math.abs(this.s[Lt]) <= lt + _ * vt) {
+                      this.s[Lt] = 0;
+                      break;
+                    }
+                  }
+                  Lt === q ? Rt = 3 : Lt === a - 1 ? Rt = 1 : (Rt = 2, q = Lt);
+                }
+                switch (q++, Rt) {
+                  case 1:
+                    {
+                      var it = r[a - 2];
+                      r[a - 2] = 0;
+                      for (var gt = a - 2; gt >= q; gt--) {
+                        var Tt = u.hypot(this.s[gt], it), At = this.s[gt] / Tt, Dt = it / Tt;
+                        this.s[gt] = Tt, gt !== q && (it = -Dt * r[gt - 1], r[gt - 1] = At * r[gt - 1]);
+                        for (var mt = 0; mt < this.n; mt++)
+                          Tt = At * this.V[mt][gt] + Dt * this.V[mt][a - 1], this.V[mt][a - 1] = -Dt * this.V[mt][gt] + At * this.V[mt][a - 1], this.V[mt][gt] = Tt;
+                      }
+                    }
+                    break;
+                  case 2:
+                    {
+                      var xt = r[q - 1];
+                      r[q - 1] = 0;
+                      for (var St = q; St < a; St++) {
+                        var Vt = u.hypot(this.s[St], xt), Xt = this.s[St] / Vt, Ut = xt / Vt;
+                        this.s[St] = Vt, xt = -Ut * r[St], r[St] = Xt * r[St];
+                        for (var bt = 0; bt < this.m; bt++)
+                          Vt = Xt * this.U[bt][St] + Ut * this.U[bt][q - 1], this.U[bt][q - 1] = -Ut * this.U[bt][St] + Xt * this.U[bt][q - 1], this.U[bt][St] = Vt;
+                      }
+                    }
+                    break;
+                  case 3:
+                    {
+                      var Ht = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[a - 1]), Math.abs(this.s[a - 2])), Math.abs(r[a - 2])), Math.abs(this.s[q])), Math.abs(r[q])), Bt = this.s[a - 1] / Ht, S = this.s[a - 2] / Ht, b = r[a - 2] / Ht, $ = this.s[q] / Ht, K = r[q] / Ht, Z = ((S + Bt) * (S - Bt) + b * b) / 2, nt = Bt * b * (Bt * b), ut = 0;
+                      /* @__PURE__ */ (function(Nt, Mt) {
+                        return Nt || Mt;
+                      })(Z !== 0, nt !== 0) && (ut = Math.sqrt(Z * Z + nt), Z < 0 && (ut = -ut), ut = nt / (Z + ut));
+                      for (var ot = ($ + Bt) * ($ - Bt) + ut, tt = $ * K, j = q; j < a - 1; j++) {
+                        var dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt;
+                        j !== q && (r[j - 1] = dt), ot = wt * this.s[j] + yt * r[j], r[j] = wt * r[j] - yt * this.s[j], tt = yt * this.s[j + 1], this.s[j + 1] = wt * this.s[j + 1];
+                        for (var It = 0; It < this.n; It++)
+                          dt = wt * this.V[It][j] + yt * this.V[It][j + 1], this.V[It][j + 1] = -yt * this.V[It][j] + wt * this.V[It][j + 1], this.V[It][j] = dt;
+                        if (dt = u.hypot(ot, tt), wt = ot / dt, yt = tt / dt, this.s[j] = dt, ot = wt * r[j] + yt * this.s[j + 1], this.s[j + 1] = -yt * r[j] + wt * this.s[j + 1], tt = yt * r[j + 1], r[j + 1] = wt * r[j + 1], j < this.m - 1)
+                          for (var ft = 0; ft < this.m; ft++)
+                            dt = wt * this.U[ft][j] + yt * this.U[ft][j + 1], this.U[ft][j + 1] = -yt * this.U[ft][j] + wt * this.U[ft][j + 1], this.U[ft][j] = dt;
+                      }
+                      r[a - 2] = ot;
+                    }
+                    break;
+                  case 4:
+                    {
+                      if (this.s[q] <= 0) {
+                        this.s[q] = this.s[q] < 0 ? -this.s[q] : 0;
+                        for (var st = 0; st <= B; st++)
+                          this.V[st][q] = -this.V[st][q];
+                      }
+                      for (; q < B && !(this.s[q] >= this.s[q + 1]); ) {
+                        var Ct = this.s[q];
+                        if (this.s[q] = this.s[q + 1], this.s[q + 1] = Ct, q < this.n - 1)
+                          for (var ct = 0; ct < this.n; ct++)
+                            Ct = this.V[ct][q + 1], this.V[ct][q + 1] = this.V[ct][q], this.V[ct][q] = Ct;
+                        if (q < this.m - 1)
+                          for (var ht = 0; ht < this.m; ht++)
+                            Ct = this.U[ht][q + 1], this.U[ht][q + 1] = this.U[ht][q], this.U[ht][q] = Ct;
+                        q++;
+                      }
+                      a--;
+                    }
+                    break;
+                }
+              }
+              var Wt = { U: this.U, V: this.V, S: this.s };
+              return Wt;
+            }, u.hypot = function(s, i) {
+              var r = void 0;
+              return Math.abs(s) > Math.abs(i) ? (r = i / s, r = Math.abs(s) * Math.sqrt(1 + r * r)) : i != 0 ? (r = s / i, r = Math.abs(i) * Math.sqrt(1 + r * r)) : r = 0, r;
+            }, A.exports = u;
+          },
+          /* 27 */
+          /***/
+          function(A, G, N) {
+            var u = /* @__PURE__ */ function() {
+              function r(e, f) {
+                for (var n = 0; n < f.length; n++) {
+                  var y = f[n];
+                  y.enumerable = y.enumerable || !1, y.configurable = !0, "value" in y && (y.writable = !0), Object.defineProperty(e, y.key, y);
+                }
+              }
+              return function(e, f, n) {
+                return f && r(e.prototype, f), n && r(e, n), e;
+              };
+            }();
+            function s(r, e) {
+              if (!(r instanceof e))
+                throw new TypeError("Cannot call a class as a function");
+            }
+            var i = function() {
+              function r(e, f) {
+                var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, y = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : -1, t = arguments.length > 4 && arguments[4] !== void 0 ? arguments[4] : -1;
+                s(this, r), this.sequence1 = e, this.sequence2 = f, this.match_score = n, this.mismatch_penalty = y, this.gap_penalty = t, this.iMax = e.length + 1, this.jMax = f.length + 1, this.grid = new Array(this.iMax);
+                for (var h = 0; h < this.iMax; h++) {
+                  this.grid[h] = new Array(this.jMax);
+                  for (var o = 0; o < this.jMax; o++)
+                    this.grid[h][o] = 0;
+                }
+                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];
+                }
+                this.alignments = [], this.score = -1, this.computeGrids();
+              }
+              return u(r, [{
+                key: "getScore",
+                value: function() {
+                  return this.score;
+                }
+              }, {
+                key: "getAlignments",
+                value: function() {
+                  return this.alignments;
+                }
+                // Main dynamic programming procedure
+              }, {
+                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 n = 1; n < this.iMax; n++)
+                    this.grid[n][0] = this.grid[n - 1][0] + this.gap_penalty, this.tracebackGrid[n][0] = [!1, !0, !1];
+                  for (var y = 1; y < this.iMax; y++)
+                    for (var t = 1; t < this.jMax; t++) {
+                      var h = void 0;
+                      this.sequence1[y - 1] === this.sequence2[t - 1] ? h = this.grid[y - 1][t - 1] + this.match_score : h = this.grid[y - 1][t - 1] + this.mismatch_penalty;
+                      var o = this.grid[y - 1][t] + this.gap_penalty, c = this.grid[y][t - 1] + this.gap_penalty, l = [h, o, c], T = this.arrayAllMaxIndexes(l);
+                      this.grid[y][t] = l[T[0]], this.tracebackGrid[y][t] = [T.includes(0), T.includes(1), T.includes(2)];
+                    }
+                  this.score = this.grid[this.iMax - 1][this.jMax - 1];
+                }
+                // Gets all possible valid sequence combinations
+              }, {
+                key: "alignmentTraceback",
+                value: function() {
+                  var f = [];
+                  for (f.push({
+                    pos: [this.sequence1.length, this.sequence2.length],
+                    seq1: "",
+                    seq2: ""
+                  }); f[0]; ) {
+                    var n = f[0], y = this.tracebackGrid[n.pos[0]][n.pos[1]];
+                    y[0] && f.push({
+                      pos: [n.pos[0] - 1, n.pos[1] - 1],
+                      seq1: this.sequence1[n.pos[0] - 1] + n.seq1,
+                      seq2: this.sequence2[n.pos[1] - 1] + n.seq2
+                    }), y[1] && f.push({
+                      pos: [n.pos[0] - 1, n.pos[1]],
+                      seq1: this.sequence1[n.pos[0] - 1] + n.seq1,
+                      seq2: "-" + n.seq2
+                    }), y[2] && f.push({
+                      pos: [n.pos[0], n.pos[1] - 1],
+                      seq1: "-" + n.seq1,
+                      seq2: this.sequence2[n.pos[1] - 1] + n.seq2
+                    }), n.pos[0] === 0 && n.pos[1] === 0 && this.alignments.push({
+                      sequence1: n.seq1,
+                      sequence2: n.seq2
+                    }), f.shift();
+                  }
+                  return this.alignments;
+                }
+                // Helper Functions
+              }, {
+                key: "getAllIndexes",
+                value: function(f, n) {
+                  for (var y = [], t = -1; (t = f.indexOf(n, t + 1)) !== -1; )
+                    y.push(t);
+                  return y;
+                }
+              }, {
+                key: "arrayAllMaxIndexes",
+                value: function(f) {
+                  return this.getAllIndexes(f, Math.max.apply(null, f));
+                }
+              }]), r;
+            }();
+            A.exports = i;
+          },
+          /* 28 */
+          /***/
+          function(A, G, N) {
+            var u = function() {
+            };
+            u.FDLayout = N(18), u.FDLayoutConstants = N(4), u.FDLayoutEdge = N(19), u.FDLayoutNode = N(20), u.DimensionD = N(21), u.HashMap = N(22), u.HashSet = N(23), u.IGeometry = N(8), u.IMath = N(9), u.Integer = N(10), u.Point = N(12), u.PointD = N(5), u.RandomSeed = N(16), u.RectangleD = N(13), u.Transform = N(17), u.UniqueIDGeneretor = N(14), u.Quicksort = N(25), u.LinkedList = N(11), u.LGraphObject = N(2), u.LGraph = N(6), u.LEdge = N(1), u.LGraphManager = N(7), u.LNode = N(3), u.Layout = N(15), u.LayoutConstants = N(0), u.NeedlemanWunsch = N(27), u.Matrix = N(24), u.SVD = N(26), A.exports = u;
+          },
+          /* 29 */
+          /***/
+          function(A, G, N) {
+            function u() {
+              this.listeners = [];
+            }
+            var s = u.prototype;
+            s.addListener = function(i, r) {
+              this.listeners.push({
+                event: i,
+                callback: r
+              });
+            }, s.removeListener = function(i, r) {
+              for (var e = this.listeners.length; e >= 0; e--) {
+                var f = this.listeners[e];
+                f.event === i && f.callback === r && this.listeners.splice(e, 1);
+              }
+            }, s.emit = function(i, r) {
+              for (var e = 0; e < this.listeners.length; e++) {
+                var f = this.listeners[e];
+                i === f.event && f.callback(r);
+              }
+            }, A.exports = u;
+          }
+          /******/
+        ])
+      );
+    });
+  }(ce)), ce.exports;
+}
+var ur = fe.exports, De;
+function gr() {
+  return De || (De = 1, function(C, Y) {
+    (function(G, N) {
+      C.exports = N(cr());
+    })(ur, function(A) {
+      return (
+        /******/
+        (() => {
+          var G = {
+            /***/
+            45: (
+              /***/
+              (i, r, e) => {
+                var f = {};
+                f.layoutBase = e(551), f.CoSEConstants = e(806), f.CoSEEdge = e(767), f.CoSEGraph = e(880), f.CoSEGraphManager = e(578), f.CoSELayout = e(765), f.CoSENode = e(991), f.ConstraintHandler = e(902), i.exports = f;
+              }
+            ),
+            /***/
+            806: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).FDLayoutConstants;
+                function n() {
+                }
+                for (var y in f)
+                  n[y] = f[y];
+                n.DEFAULT_USE_MULTI_LEVEL_SCALING = !1, n.DEFAULT_RADIAL_SEPARATION = f.DEFAULT_EDGE_LENGTH, n.DEFAULT_COMPONENT_SEPERATION = 60, n.TILE = !0, n.TILING_PADDING_VERTICAL = 10, n.TILING_PADDING_HORIZONTAL = 10, n.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, n.ENFORCE_CONSTRAINTS = !0, n.APPLY_LAYOUT = !0, n.RELAX_MOVEMENT_ON_CONSTRAINTS = !0, n.TREE_REDUCTION_ON_INCREMENTAL = !0, n.PURE_INCREMENTAL = n.DEFAULT_INCREMENTAL, i.exports = n;
+              }
+            ),
+            /***/
+            767: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).FDLayoutEdge;
+                function n(t, h, o) {
+                  f.call(this, t, h, o);
+                }
+                n.prototype = Object.create(f.prototype);
+                for (var y in f)
+                  n[y] = f[y];
+                i.exports = n;
+              }
+            ),
+            /***/
+            880: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).LGraph;
+                function n(t, h, o) {
+                  f.call(this, t, h, o);
+                }
+                n.prototype = Object.create(f.prototype);
+                for (var y in f)
+                  n[y] = f[y];
+                i.exports = n;
+              }
+            ),
+            /***/
+            578: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).LGraphManager;
+                function n(t) {
+                  f.call(this, t);
+                }
+                n.prototype = Object.create(f.prototype);
+                for (var y in f)
+                  n[y] = f[y];
+                i.exports = n;
+              }
+            ),
+            /***/
+            765: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).FDLayout, n = e(578), y = e(880), t = e(991), h = e(767), o = e(806), c = e(902), l = e(551).FDLayoutConstants, T = e(551).LayoutConstants, g = e(551).Point, d = e(551).PointD, L = e(551).DimensionD, F = e(551).Layout, M = e(551).Integer, P = e(551).IGeometry, J = e(551).LGraph, V = e(551).Transform, Q = e(551).LinkedList;
+                function D() {
+                  f.call(this), this.toBeTiled = {}, this.constraints = {};
+                }
+                D.prototype = Object.create(f.prototype);
+                for (var rt in f)
+                  D[rt] = f[rt];
+                D.prototype.newGraphManager = function() {
+                  var a = new n(this);
+                  return this.graphManager = a, a;
+                }, D.prototype.newGraph = function(a) {
+                  return new y(null, this.graphManager, a);
+                }, D.prototype.newNode = function(a) {
+                  return new t(this.graphManager, a);
+                }, D.prototype.newEdge = function(a) {
+                  return new h(null, null, a);
+                }, D.prototype.initParameters = function() {
+                  f.prototype.initParameters.call(this, arguments), this.isSubLayout || (o.DEFAULT_EDGE_LENGTH < 10 ? this.idealEdgeLength = 10 : this.idealEdgeLength = o.DEFAULT_EDGE_LENGTH, this.useSmartIdealEdgeLengthCalculation = o.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);
+                }, D.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;
+                }, D.prototype.layout = function() {
+                  var a = T.DEFAULT_CREATE_BENDS_AS_NEEDED;
+                  return a && (this.createBendpoints(), this.graphManager.resetAllEdges()), this.level = 0, this.classicLayout();
+                }, D.prototype.classicLayout = function() {
+                  if (this.nodesWithGravity = this.calculateNodesToApplyGravitationTo(), this.graphManager.setAllNodesToApplyGravitation(this.nodesWithGravity), this.calcNoOfChildrenForAllNodes(), this.graphManager.calcLowestCommonAncestors(), this.graphManager.calcInclusionTreeDepths(), this.graphManager.getRoot().calcEstimatedSize(), this.calcIdealEdgeLengths(), this.incremental) {
+                    if (o.TREE_REDUCTION_ON_INCREMENTAL) {
+                      this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
+                      var m = new Set(this.getAllNodes()), v = this.nodesWithGravity.filter(function(I) {
+                        return m.has(I);
+                      });
+                      this.graphManager.setAllNodesToApplyGravitation(v);
+                    }
+                  } else {
+                    var a = this.getFlatForest();
+                    if (a.length > 0)
+                      this.positionNodesRadially(a);
+                    else {
+                      this.reduceTrees(), this.graphManager.resetAllNodesToApplyGravitation();
+                      var m = new Set(this.getAllNodes()), v = this.nodesWithGravity.filter(function(E) {
+                        return m.has(E);
+                      });
+                      this.graphManager.setAllNodesToApplyGravitation(v), this.positionNodesRandomly();
+                    }
+                  }
+                  return Object.keys(this.constraints).length > 0 && (c.handleConstraints(this), this.initConstraintVariables()), this.initSpringEmbedder(), o.APPLY_LAYOUT && this.runSpringEmbedder(), !0;
+                }, D.prototype.tick = function() {
+                  if (this.totalIterations++, this.totalIterations === this.maxIterations && !this.isTreeGrowing && !this.isGrowthFinished)
+                    if (this.prunedNodesAll.length > 0)
+                      this.isTreeGrowing = !0;
+                    else
+                      return !0;
+                  if (this.totalIterations % l.CONVERGENCE_CHECK_PERIOD == 0 && !this.isTreeGrowing && !this.isGrowthFinished) {
+                    if (this.isConverged())
+                      if (this.prunedNodesAll.length > 0)
+                        this.isTreeGrowing = !0;
+                      else
+                        return !0;
+                    this.coolingCycle++, this.layoutQuality == 0 ? this.coolingAdjuster = this.coolingCycle : this.layoutQuality == 1 && (this.coolingAdjuster = this.coolingCycle / 3), this.coolingFactor = Math.max(this.initialCoolingFactor - Math.pow(this.coolingCycle, Math.log(100 * (this.initialCoolingFactor - this.finalTemperature)) / Math.log(this.maxCoolingCycle)) / 100 * this.coolingAdjuster, this.finalTemperature), this.animationPeriod = Math.ceil(this.initialAnimationPeriod * Math.sqrt(this.coolingFactor));
+                  }
+                  if (this.isTreeGrowing) {
+                    if (this.growTreeIterations % 10 == 0)
+                      if (this.prunedNodesAll.length > 0) {
+                        this.graphManager.updateBounds(), this.updateGrid(), this.growTree(this.prunedNodesAll), this.graphManager.resetAllNodesToApplyGravitation();
+                        var a = new Set(this.getAllNodes()), m = this.nodesWithGravity.filter(function(p) {
+                          return a.has(p);
+                        });
+                        this.graphManager.setAllNodesToApplyGravitation(m), this.graphManager.updateBounds(), this.updateGrid(), o.PURE_INCREMENTAL ? this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL / 2 : this.coolingFactor = l.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+                      } else
+                        this.isTreeGrowing = !1, this.isGrowthFinished = !0;
+                    this.growTreeIterations++;
+                  }
+                  if (this.isGrowthFinished) {
+                    if (this.isConverged())
+                      return !0;
+                    this.afterGrowthIterations % 10 == 0 && (this.graphManager.updateBounds(), this.updateGrid()), o.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++;
+                  }
+                  var v = !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(v, E), this.calcGravitationalForces(), this.moveNodes(), this.animate(), !1;
+                }, D.prototype.getPositionsData = function() {
+                  for (var a = this.graphManager.getAllNodes(), m = {}, v = 0; v < a.length; v++) {
+                    var E = a[v].rect, p = a[v].id;
+                    m[p] = {
+                      id: p,
+                      x: E.getCenterX(),
+                      y: E.getCenterY(),
+                      w: E.width,
+                      h: E.height
+                    };
+                  }
+                  return m;
+                }, D.prototype.runSpringEmbedder = function() {
+                  this.initialAnimationPeriod = 25, this.animationPeriod = this.initialAnimationPeriod;
+                  var a = !1;
+                  if (l.ANIMATE === "during")
+                    this.emit("layoutstarted");
+                  else {
+                    for (; !a; )
+                      a = this.tick();
+                    this.graphManager.updateBounds();
+                  }
+                }, D.prototype.moveNodes = function() {
+                  for (var a = this.getAllNodes(), m, v = 0; v < a.length; v++)
+                    m = a[v], m.calculateDisplacement();
+                  Object.keys(this.constraints).length > 0 && this.updateDisplacements();
+                  for (var v = 0; v < a.length; v++)
+                    m = a[v], m.move();
+                }, D.prototype.initConstraintVariables = function() {
+                  var a = this;
+                  this.idToNodeMap = /* @__PURE__ */ new Map(), this.fixedNodeSet = /* @__PURE__ */ new Set();
+                  for (var m = this.graphManager.getAllNodes(), v = 0; v < m.length; v++) {
+                    var E = m[v];
+                    this.idToNodeMap.set(E.id, E);
+                  }
+                  var p = function O(X) {
+                    for (var B = X.getChild().getNodes(), _, lt = 0, q = 0; q < B.length; q++)
+                      _ = B[q], _.getChild() == null ? a.fixedNodeSet.has(_.id) && (lt += 100) : lt += O(_);
+                    return lt;
+                  };
+                  if (this.constraints.fixedNodeConstraint) {
+                    this.constraints.fixedNodeConstraint.forEach(function(B) {
+                      a.fixedNodeSet.add(B.nodeId);
+                    });
+                    for (var m = this.graphManager.getAllNodes(), E, v = 0; v < m.length; v++)
+                      if (E = m[v], E.getChild() != null) {
+                        var I = p(E);
+                        I > 0 && (E.fixedNodeWeight = I);
+                      }
+                  }
+                  if (this.constraints.relativePlacementConstraint) {
+                    var w = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map();
+                    if (this.dummyToNodeForVerticalAlignment = /* @__PURE__ */ new Map(), this.dummyToNodeForHorizontalAlignment = /* @__PURE__ */ new Map(), this.fixedNodesOnHorizontal = /* @__PURE__ */ new Set(), this.fixedNodesOnVertical = /* @__PURE__ */ new Set(), this.fixedNodeSet.forEach(function(O) {
+                      a.fixedNodesOnHorizontal.add(O), a.fixedNodesOnVertical.add(O);
+                    }), this.constraints.alignmentConstraint) {
+                      if (this.constraints.alignmentConstraint.vertical)
+                        for (var H = this.constraints.alignmentConstraint.vertical, v = 0; v < H.length; v++)
+                          this.dummyToNodeForVerticalAlignment.set("dummy" + v, []), H[v].forEach(function(X) {
+                            w.set(X, "dummy" + v), a.dummyToNodeForVerticalAlignment.get("dummy" + v).push(X), a.fixedNodeSet.has(X) && a.fixedNodesOnHorizontal.add("dummy" + v);
+                          });
+                      if (this.constraints.alignmentConstraint.horizontal)
+                        for (var x = this.constraints.alignmentConstraint.horizontal, v = 0; v < x.length; v++)
+                          this.dummyToNodeForHorizontalAlignment.set("dummy" + v, []), x[v].forEach(function(X) {
+                            R.set(X, "dummy" + v), a.dummyToNodeForHorizontalAlignment.get("dummy" + v).push(X), a.fixedNodeSet.has(X) && a.fixedNodesOnVertical.add("dummy" + v);
+                          });
+                    }
+                    if (o.RELAX_MOVEMENT_ON_CONSTRAINTS)
+                      this.shuffle = function(O) {
+                        var X, B, _;
+                        for (_ = O.length - 1; _ >= 2 * O.length / 3; _--)
+                          X = Math.floor(Math.random() * (_ + 1)), B = O[_], O[_] = O[X], O[X] = B;
+                        return O;
+                      }, this.nodesInRelativeHorizontal = [], this.nodesInRelativeVertical = [], this.nodeToRelativeConstraintMapHorizontal = /* @__PURE__ */ new Map(), this.nodeToRelativeConstraintMapVertical = /* @__PURE__ */ new Map(), this.nodeToTempPositionMapHorizontal = /* @__PURE__ */ new Map(), this.nodeToTempPositionMapVertical = /* @__PURE__ */ new Map(), this.constraints.relativePlacementConstraint.forEach(function(O) {
+                        if (O.left) {
+                          var X = w.has(O.left) ? w.get(O.left) : O.left, B = w.has(O.right) ? w.get(O.right) : O.right;
+                          a.nodesInRelativeHorizontal.includes(X) || (a.nodesInRelativeHorizontal.push(X), a.nodeToRelativeConstraintMapHorizontal.set(X, []), a.dummyToNodeForVerticalAlignment.has(X) ? a.nodeToTempPositionMapHorizontal.set(X, a.idToNodeMap.get(a.dummyToNodeForVerticalAlignment.get(X)[0]).getCenterX()) : a.nodeToTempPositionMapHorizontal.set(X, a.idToNodeMap.get(X).getCenterX())), a.nodesInRelativeHorizontal.includes(B) || (a.nodesInRelativeHorizontal.push(B), a.nodeToRelativeConstraintMapHorizontal.set(B, []), a.dummyToNodeForVerticalAlignment.has(B) ? a.nodeToTempPositionMapHorizontal.set(B, a.idToNodeMap.get(a.dummyToNodeForVerticalAlignment.get(B)[0]).getCenterX()) : a.nodeToTempPositionMapHorizontal.set(B, a.idToNodeMap.get(B).getCenterX())), a.nodeToRelativeConstraintMapHorizontal.get(X).push({ right: B, gap: O.gap }), a.nodeToRelativeConstraintMapHorizontal.get(B).push({ left: X, gap: O.gap });
+                        } else {
+                          var _ = R.has(O.top) ? R.get(O.top) : O.top, lt = R.has(O.bottom) ? R.get(O.bottom) : O.bottom;
+                          a.nodesInRelativeVertical.includes(_) || (a.nodesInRelativeVertical.push(_), a.nodeToRelativeConstraintMapVertical.set(_, []), a.dummyToNodeForHorizontalAlignment.has(_) ? a.nodeToTempPositionMapVertical.set(_, a.idToNodeMap.get(a.dummyToNodeForHorizontalAlignment.get(_)[0]).getCenterY()) : a.nodeToTempPositionMapVertical.set(_, a.idToNodeMap.get(_).getCenterY())), a.nodesInRelativeVertical.includes(lt) || (a.nodesInRelativeVertical.push(lt), a.nodeToRelativeConstraintMapVertical.set(lt, []), a.dummyToNodeForHorizontalAlignment.has(lt) ? a.nodeToTempPositionMapVertical.set(lt, a.idToNodeMap.get(a.dummyToNodeForHorizontalAlignment.get(lt)[0]).getCenterY()) : a.nodeToTempPositionMapVertical.set(lt, a.idToNodeMap.get(lt).getCenterY())), a.nodeToRelativeConstraintMapVertical.get(_).push({ bottom: lt, gap: O.gap }), a.nodeToRelativeConstraintMapVertical.get(lt).push({ top: _, gap: O.gap });
+                        }
+                      });
+                    else {
+                      var k = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ new Map();
+                      this.constraints.relativePlacementConstraint.forEach(function(O) {
+                        if (O.left) {
+                          var X = w.has(O.left) ? w.get(O.left) : O.left, B = w.has(O.right) ? w.get(O.right) : O.right;
+                          k.has(X) ? k.get(X).push(B) : k.set(X, [B]), k.has(B) ? k.get(B).push(X) : k.set(B, [X]);
+                        } else {
+                          var _ = R.has(O.top) ? R.get(O.top) : O.top, lt = R.has(O.bottom) ? R.get(O.bottom) : O.bottom;
+                          W.has(_) ? W.get(_).push(lt) : W.set(_, [lt]), W.has(lt) ? W.get(lt).push(_) : W.set(lt, [_]);
+                        }
+                      });
+                      var U = function(X, B) {
+                        var _ = [], lt = [], q = new Q(), Rt = /* @__PURE__ */ new Set(), Lt = 0;
+                        return X.forEach(function(vt, it) {
+                          if (!Rt.has(it)) {
+                            _[Lt] = [], lt[Lt] = !1;
+                            var gt = it;
+                            for (q.push(gt), Rt.add(gt), _[Lt].push(gt); q.length != 0; ) {
+                              gt = q.shift(), B.has(gt) && (lt[Lt] = !0);
+                              var Tt = X.get(gt);
+                              Tt.forEach(function(At) {
+                                Rt.has(At) || (q.push(At), Rt.add(At), _[Lt].push(At));
+                              });
+                            }
+                            Lt++;
+                          }
+                        }), { components: _, isFixed: lt };
+                      }, et = U(k, a.fixedNodesOnHorizontal);
+                      this.componentsOnHorizontal = et.components, this.fixedComponentsOnHorizontal = et.isFixed;
+                      var z = U(W, a.fixedNodesOnVertical);
+                      this.componentsOnVertical = z.components, this.fixedComponentsOnVertical = z.isFixed;
+                    }
+                  }
+                }, D.prototype.updateDisplacements = function() {
+                  var a = this;
+                  if (this.constraints.fixedNodeConstraint && this.constraints.fixedNodeConstraint.forEach(function(z) {
+                    var O = a.idToNodeMap.get(z.nodeId);
+                    O.displacementX = 0, O.displacementY = 0;
+                  }), this.constraints.alignmentConstraint) {
+                    if (this.constraints.alignmentConstraint.vertical)
+                      for (var m = this.constraints.alignmentConstraint.vertical, v = 0; v < m.length; v++) {
+                        for (var E = 0, p = 0; p < m[v].length; p++) {
+                          if (this.fixedNodeSet.has(m[v][p])) {
+                            E = 0;
+                            break;
+                          }
+                          E += this.idToNodeMap.get(m[v][p]).displacementX;
+                        }
+                        for (var I = E / m[v].length, p = 0; p < m[v].length; p++)
+                          this.idToNodeMap.get(m[v][p]).displacementX = I;
+                      }
+                    if (this.constraints.alignmentConstraint.horizontal)
+                      for (var w = this.constraints.alignmentConstraint.horizontal, v = 0; v < w.length; v++) {
+                        for (var R = 0, p = 0; p < w[v].length; p++) {
+                          if (this.fixedNodeSet.has(w[v][p])) {
+                            R = 0;
+                            break;
+                          }
+                          R += this.idToNodeMap.get(w[v][p]).displacementY;
+                        }
+                        for (var H = R / w[v].length, p = 0; p < w[v].length; p++)
+                          this.idToNodeMap.get(w[v][p]).displacementY = H;
+                      }
+                  }
+                  if (this.constraints.relativePlacementConstraint)
+                    if (o.RELAX_MOVEMENT_ON_CONSTRAINTS)
+                      this.totalIterations % 10 == 0 && (this.shuffle(this.nodesInRelativeHorizontal), this.shuffle(this.nodesInRelativeVertical)), this.nodesInRelativeHorizontal.forEach(function(z) {
+                        if (!a.fixedNodesOnHorizontal.has(z)) {
+                          var O = 0;
+                          a.dummyToNodeForVerticalAlignment.has(z) ? O = a.idToNodeMap.get(a.dummyToNodeForVerticalAlignment.get(z)[0]).displacementX : O = a.idToNodeMap.get(z).displacementX, a.nodeToRelativeConstraintMapHorizontal.get(z).forEach(function(X) {
+                            if (X.right) {
+                              var B = a.nodeToTempPositionMapHorizontal.get(X.right) - a.nodeToTempPositionMapHorizontal.get(z) - O;
+                              B < X.gap && (O -= X.gap - B);
+                            } else {
+                              var B = a.nodeToTempPositionMapHorizontal.get(z) - a.nodeToTempPositionMapHorizontal.get(X.left) + O;
+                              B < X.gap && (O += X.gap - B);
+                            }
+                          }), a.nodeToTempPositionMapHorizontal.set(z, a.nodeToTempPositionMapHorizontal.get(z) + O), a.dummyToNodeForVerticalAlignment.has(z) ? a.dummyToNodeForVerticalAlignment.get(z).forEach(function(X) {
+                            a.idToNodeMap.get(X).displacementX = O;
+                          }) : a.idToNodeMap.get(z).displacementX = O;
+                        }
+                      }), this.nodesInRelativeVertical.forEach(function(z) {
+                        if (!a.fixedNodesOnHorizontal.has(z)) {
+                          var O = 0;
+                          a.dummyToNodeForHorizontalAlignment.has(z) ? O = a.idToNodeMap.get(a.dummyToNodeForHorizontalAlignment.get(z)[0]).displacementY : O = a.idToNodeMap.get(z).displacementY, a.nodeToRelativeConstraintMapVertical.get(z).forEach(function(X) {
+                            if (X.bottom) {
+                              var B = a.nodeToTempPositionMapVertical.get(X.bottom) - a.nodeToTempPositionMapVertical.get(z) - O;
+                              B < X.gap && (O -= X.gap - B);
+                            } else {
+                              var B = a.nodeToTempPositionMapVertical.get(z) - a.nodeToTempPositionMapVertical.get(X.top) + O;
+                              B < X.gap && (O += X.gap - B);
+                            }
+                          }), a.nodeToTempPositionMapVertical.set(z, a.nodeToTempPositionMapVertical.get(z) + O), a.dummyToNodeForHorizontalAlignment.has(z) ? a.dummyToNodeForHorizontalAlignment.get(z).forEach(function(X) {
+                            a.idToNodeMap.get(X).displacementY = O;
+                          }) : a.idToNodeMap.get(z).displacementY = O;
+                        }
+                      });
+                    else {
+                      for (var v = 0; v < this.componentsOnHorizontal.length; v++) {
+                        var x = this.componentsOnHorizontal[v];
+                        if (this.fixedComponentsOnHorizontal[v])
+                          for (var p = 0; p < x.length; p++)
+                            this.dummyToNodeForVerticalAlignment.has(x[p]) ? this.dummyToNodeForVerticalAlignment.get(x[p]).forEach(function(X) {
+                              a.idToNodeMap.get(X).displacementX = 0;
+                            }) : this.idToNodeMap.get(x[p]).displacementX = 0;
+                        else {
+                          for (var k = 0, W = 0, p = 0; p < x.length; p++)
+                            if (this.dummyToNodeForVerticalAlignment.has(x[p])) {
+                              var U = this.dummyToNodeForVerticalAlignment.get(x[p]);
+                              k += U.length * this.idToNodeMap.get(U[0]).displacementX, W += U.length;
+                            } else
+                              k += this.idToNodeMap.get(x[p]).displacementX, W++;
+                          for (var et = k / W, p = 0; p < x.length; p++)
+                            this.dummyToNodeForVerticalAlignment.has(x[p]) ? this.dummyToNodeForVerticalAlignment.get(x[p]).forEach(function(X) {
+                              a.idToNodeMap.get(X).displacementX = et;
+                            }) : this.idToNodeMap.get(x[p]).displacementX = et;
+                        }
+                      }
+                      for (var v = 0; v < this.componentsOnVertical.length; v++) {
+                        var x = this.componentsOnVertical[v];
+                        if (this.fixedComponentsOnVertical[v])
+                          for (var p = 0; p < x.length; p++)
+                            this.dummyToNodeForHorizontalAlignment.has(x[p]) ? this.dummyToNodeForHorizontalAlignment.get(x[p]).forEach(function(B) {
+                              a.idToNodeMap.get(B).displacementY = 0;
+                            }) : this.idToNodeMap.get(x[p]).displacementY = 0;
+                        else {
+                          for (var k = 0, W = 0, p = 0; p < x.length; p++)
+                            if (this.dummyToNodeForHorizontalAlignment.has(x[p])) {
+                              var U = this.dummyToNodeForHorizontalAlignment.get(x[p]);
+                              k += U.length * this.idToNodeMap.get(U[0]).displacementY, W += U.length;
+                            } else
+                              k += this.idToNodeMap.get(x[p]).displacementY, W++;
+                          for (var et = k / W, p = 0; p < x.length; p++)
+                            this.dummyToNodeForHorizontalAlignment.has(x[p]) ? this.dummyToNodeForHorizontalAlignment.get(x[p]).forEach(function(q) {
+                              a.idToNodeMap.get(q).displacementY = et;
+                            }) : this.idToNodeMap.get(x[p]).displacementY = et;
+                        }
+                      }
+                    }
+                }, D.prototype.calculateNodesToApplyGravitationTo = function() {
+                  var a = [], m, v = this.graphManager.getGraphs(), E = v.length, p;
+                  for (p = 0; p < E; p++)
+                    m = v[p], m.updateConnected(), m.isConnected || (a = a.concat(m.getNodes()));
+                  return a;
+                }, D.prototype.createBendpoints = function() {
+                  var a = [];
+                  a = a.concat(this.graphManager.getAllEdges());
+                  var m = /* @__PURE__ */ new Set(), v;
+                  for (v = 0; v < a.length; v++) {
+                    var E = a[v];
+                    if (!m.has(E)) {
+                      var p = E.getSource(), I = E.getTarget();
+                      if (p == I)
+                        E.getBendpoints().push(new d()), E.getBendpoints().push(new d()), this.createDummyNodesForBendpoints(E), m.add(E);
+                      else {
+                        var w = [];
+                        if (w = w.concat(p.getEdgeListToNode(I)), w = w.concat(I.getEdgeListToNode(p)), !m.has(w[0])) {
+                          if (w.length > 1) {
+                            var R;
+                            for (R = 0; R < w.length; R++) {
+                              var H = w[R];
+                              H.getBendpoints().push(new d()), this.createDummyNodesForBendpoints(H);
+                            }
+                          }
+                          w.forEach(function(x) {
+                            m.add(x);
+                          });
+                        }
+                      }
+                    }
+                    if (m.size == a.length)
+                      break;
+                  }
+                }, D.prototype.positionNodesRadially = function(a) {
+                  for (var m = new g(0, 0), v = Math.ceil(Math.sqrt(a.length)), E = 0, p = 0, I = 0, w = new d(0, 0), R = 0; R < a.length; R++) {
+                    R % v == 0 && (I = 0, p = E, R != 0 && (p += o.DEFAULT_COMPONENT_SEPERATION), E = 0);
+                    var H = a[R], x = F.findCenterOfTree(H);
+                    m.x = I, m.y = p, w = D.radialLayout(H, x, m), w.y > E && (E = Math.floor(w.y)), I = Math.floor(w.x + o.DEFAULT_COMPONENT_SEPERATION);
+                  }
+                  this.transform(new d(T.WORLD_CENTER_X - w.x / 2, T.WORLD_CENTER_Y - w.y / 2));
+                }, D.radialLayout = function(a, m, v) {
+                  var E = Math.max(this.maxDiagonalInTree(a), o.DEFAULT_RADIAL_SEPARATION);
+                  D.branchRadialLayout(m, null, 0, 359, 0, E);
+                  var p = J.calculateBounds(a), I = new V();
+                  I.setDeviceOrgX(p.getMinX()), I.setDeviceOrgY(p.getMinY()), I.setWorldOrgX(v.x), I.setWorldOrgY(v.y);
+                  for (var w = 0; w < a.length; w++) {
+                    var R = a[w];
+                    R.transform(I);
+                  }
+                  var H = new d(p.getMaxX(), p.getMaxY());
+                  return I.inverseTransformPoint(H);
+                }, D.branchRadialLayout = function(a, m, v, E, p, I) {
+                  var w = (E - v + 1) / 2;
+                  w < 0 && (w += 180);
+                  var R = (w + v) % 360, H = R * P.TWO_PI / 360, x = p * Math.cos(H), k = p * Math.sin(H);
+                  a.setCenter(x, k);
+                  var W = [];
+                  W = W.concat(a.getEdges());
+                  var U = W.length;
+                  m != null && U--;
+                  for (var et = 0, z = W.length, O, X = a.getEdgesBetween(m); X.length > 1; ) {
+                    var B = X[0];
+                    X.splice(0, 1);
+                    var _ = W.indexOf(B);
+                    _ >= 0 && W.splice(_, 1), z--, U--;
+                  }
+                  m != null ? O = (W.indexOf(X[0]) + 1) % z : O = 0;
+                  for (var lt = Math.abs(E - v) / U, q = O; et != U; q = ++q % z) {
+                    var Rt = W[q].getOtherEnd(a);
+                    if (Rt != m) {
+                      var Lt = (v + et * lt) % 360, vt = (Lt + lt) % 360;
+                      D.branchRadialLayout(Rt, a, Lt, vt, p + I, I), et++;
+                    }
+                  }
+                }, D.maxDiagonalInTree = function(a) {
+                  for (var m = M.MIN_VALUE, v = 0; v < a.length; v++) {
+                    var E = a[v], p = E.getDiagonal();
+                    p > m && (m = p);
+                  }
+                  return m;
+                }, D.prototype.calcRepulsionRange = function() {
+                  return 2 * (this.level + 1) * this.idealEdgeLength;
+                }, D.prototype.groupZeroDegreeMembers = function() {
+                  var a = this, m = {};
+                  this.memberGroups = {}, this.idToDummyNode = {};
+                  for (var v = [], E = this.graphManager.getAllNodes(), p = 0; p < E.length; p++) {
+                    var I = E[p], w = I.getParent();
+                    this.getNodeDegreeWithChildren(I) === 0 && (w.id == null || !this.getToBeTiled(w)) && v.push(I);
+                  }
+                  for (var p = 0; p < v.length; p++) {
+                    var I = v[p], R = I.getParent().id;
+                    typeof m[R] > "u" && (m[R] = []), m[R] = m[R].concat(I);
+                  }
+                  Object.keys(m).forEach(function(H) {
+                    if (m[H].length > 1) {
+                      var x = "DummyCompound_" + H;
+                      a.memberGroups[x] = m[H];
+                      var k = m[H][0].getParent(), W = new t(a.graphManager);
+                      W.id = x, W.paddingLeft = k.paddingLeft || 0, W.paddingRight = k.paddingRight || 0, W.paddingBottom = k.paddingBottom || 0, W.paddingTop = k.paddingTop || 0, a.idToDummyNode[x] = W;
+                      var U = a.getGraphManager().add(a.newGraph(), W), et = k.getChild();
+                      et.add(W);
+                      for (var z = 0; z < m[H].length; z++) {
+                        var O = m[H][z];
+                        et.remove(O), U.add(O);
+                      }
+                    }
+                  });
+                }, D.prototype.clearCompounds = function() {
+                  var a = {}, m = {};
+                  this.performDFSOnCompounds();
+                  for (var v = 0; v < this.compoundOrder.length; v++)
+                    m[this.compoundOrder[v].id] = this.compoundOrder[v], a[this.compoundOrder[v].id] = [].concat(this.compoundOrder[v].getChild().getNodes()), this.graphManager.remove(this.compoundOrder[v].getChild()), this.compoundOrder[v].child = null;
+                  this.graphManager.resetAllNodes(), this.tileCompoundMembers(a, m);
+                }, D.prototype.clearZeroDegreeMembers = function() {
+                  var a = this, m = this.tiledZeroDegreePack = [];
+                  Object.keys(this.memberGroups).forEach(function(v) {
+                    var E = a.idToDummyNode[v];
+                    if (m[v] = a.tileNodes(a.memberGroups[v], E.paddingLeft + E.paddingRight), E.rect.width = m[v].width, E.rect.height = m[v].height, E.setCenter(m[v].centerX, m[v].centerY), E.labelMarginLeft = 0, E.labelMarginTop = 0, o.NODE_DIMENSIONS_INCLUDE_LABELS) {
+                      var p = E.rect.width, I = E.rect.height;
+                      E.labelWidth && (E.labelPosHorizontal == "left" ? (E.rect.x -= E.labelWidth, E.setWidth(p + E.labelWidth), E.labelMarginLeft = E.labelWidth) : E.labelPosHorizontal == "center" && E.labelWidth > p ? (E.rect.x -= (E.labelWidth - p) / 2, E.setWidth(E.labelWidth), E.labelMarginLeft = (E.labelWidth - p) / 2) : E.labelPosHorizontal == "right" && E.setWidth(p + E.labelWidth)), E.labelHeight && (E.labelPosVertical == "top" ? (E.rect.y -= E.labelHeight, E.setHeight(I + E.labelHeight), E.labelMarginTop = E.labelHeight) : E.labelPosVertical == "center" && E.labelHeight > I ? (E.rect.y -= (E.labelHeight - I) / 2, E.setHeight(E.labelHeight), E.labelMarginTop = (E.labelHeight - I) / 2) : E.labelPosVertical == "bottom" && E.setHeight(I + E.labelHeight));
+                    }
+                  });
+                }, D.prototype.repopulateCompounds = function() {
+                  for (var a = this.compoundOrder.length - 1; a >= 0; a--) {
+                    var m = this.compoundOrder[a], v = m.id, E = m.paddingLeft, p = m.paddingTop, I = m.labelMarginLeft, w = m.labelMarginTop;
+                    this.adjustLocations(this.tiledMemberPack[v], m.rect.x, m.rect.y, E, p, I, w);
+                  }
+                }, D.prototype.repopulateZeroDegreeMembers = function() {
+                  var a = this, m = this.tiledZeroDegreePack;
+                  Object.keys(m).forEach(function(v) {
+                    var E = a.idToDummyNode[v], p = E.paddingLeft, I = E.paddingTop, w = E.labelMarginLeft, R = E.labelMarginTop;
+                    a.adjustLocations(m[v], E.rect.x, E.rect.y, p, I, w, R);
+                  });
+                }, D.prototype.getToBeTiled = function(a) {
+                  var m = a.id;
+                  if (this.toBeTiled[m] != null)
+                    return this.toBeTiled[m];
+                  var v = a.getChild();
+                  if (v == null)
+                    return this.toBeTiled[m] = !1, !1;
+                  for (var E = v.getNodes(), p = 0; p < E.length; p++) {
+                    var I = E[p];
+                    if (this.getNodeDegree(I) > 0)
+                      return this.toBeTiled[m] = !1, !1;
+                    if (I.getChild() == null) {
+                      this.toBeTiled[I.id] = !1;
+                      continue;
+                    }
+                    if (!this.getToBeTiled(I))
+                      return this.toBeTiled[m] = !1, !1;
+                  }
+                  return this.toBeTiled[m] = !0, !0;
+                }, D.prototype.getNodeDegree = function(a) {
+                  a.id;
+                  for (var m = a.getEdges(), v = 0, E = 0; E < m.length; E++) {
+                    var p = m[E];
+                    p.getSource().id !== p.getTarget().id && (v = v + 1);
+                  }
+                  return v;
+                }, D.prototype.getNodeDegreeWithChildren = function(a) {
+                  var m = this.getNodeDegree(a);
+                  if (a.getChild() == null)
+                    return m;
+                  for (var v = a.getChild().getNodes(), E = 0; E < v.length; E++) {
+                    var p = v[E];
+                    m += this.getNodeDegreeWithChildren(p);
+                  }
+                  return m;
+                }, D.prototype.performDFSOnCompounds = function() {
+                  this.compoundOrder = [], this.fillCompexOrderByDFS(this.graphManager.getRoot().getNodes());
+                }, D.prototype.fillCompexOrderByDFS = function(a) {
+                  for (var m = 0; m < a.length; m++) {
+                    var v = a[m];
+                    v.getChild() != null && this.fillCompexOrderByDFS(v.getChild().getNodes()), this.getToBeTiled(v) && this.compoundOrder.push(v);
+                  }
+                }, D.prototype.adjustLocations = function(a, m, v, E, p, I, w) {
+                  m += E + I, v += p + w;
+                  for (var R = m, H = 0; H < a.rows.length; H++) {
+                    var x = a.rows[H];
+                    m = R;
+                    for (var k = 0, W = 0; W < x.length; W++) {
+                      var U = x[W];
+                      U.rect.x = m, U.rect.y = v, m += U.rect.width + a.horizontalPadding, U.rect.height > k && (k = U.rect.height);
+                    }
+                    v += k + a.verticalPadding;
+                  }
+                }, D.prototype.tileCompoundMembers = function(a, m) {
+                  var v = this;
+                  this.tiledMemberPack = [], Object.keys(a).forEach(function(E) {
+                    var p = m[E];
+                    if (v.tiledMemberPack[E] = v.tileNodes(a[E], p.paddingLeft + p.paddingRight), p.rect.width = v.tiledMemberPack[E].width, p.rect.height = v.tiledMemberPack[E].height, p.setCenter(v.tiledMemberPack[E].centerX, v.tiledMemberPack[E].centerY), p.labelMarginLeft = 0, p.labelMarginTop = 0, o.NODE_DIMENSIONS_INCLUDE_LABELS) {
+                      var I = p.rect.width, w = p.rect.height;
+                      p.labelWidth && (p.labelPosHorizontal == "left" ? (p.rect.x -= p.labelWidth, p.setWidth(I + p.labelWidth), p.labelMarginLeft = p.labelWidth) : p.labelPosHorizontal == "center" && p.labelWidth > I ? (p.rect.x -= (p.labelWidth - I) / 2, p.setWidth(p.labelWidth), p.labelMarginLeft = (p.labelWidth - I) / 2) : p.labelPosHorizontal == "right" && p.setWidth(I + p.labelWidth)), p.labelHeight && (p.labelPosVertical == "top" ? (p.rect.y -= p.labelHeight, p.setHeight(w + p.labelHeight), p.labelMarginTop = p.labelHeight) : p.labelPosVertical == "center" && p.labelHeight > w ? (p.rect.y -= (p.labelHeight - w) / 2, p.setHeight(p.labelHeight), p.labelMarginTop = (p.labelHeight - w) / 2) : p.labelPosVertical == "bottom" && p.setHeight(w + p.labelHeight));
+                    }
+                  });
+                }, D.prototype.tileNodes = function(a, m) {
+                  var v = this.tileNodesByFavoringDim(a, m, !0), E = this.tileNodesByFavoringDim(a, m, !1), p = this.getOrgRatio(v), I = this.getOrgRatio(E), w;
+                  return I < p ? w = E : w = v, w;
+                }, D.prototype.getOrgRatio = function(a) {
+                  var m = a.width, v = a.height, E = m / v;
+                  return E < 1 && (E = 1 / E), E;
+                }, D.prototype.calcIdealRowWidth = function(a, m) {
+                  var v = o.TILING_PADDING_VERTICAL, E = o.TILING_PADDING_HORIZONTAL, p = a.length, I = 0, w = 0, R = 0;
+                  a.forEach(function(z) {
+                    I += z.getWidth(), w += z.getHeight(), z.getWidth() > R && (R = z.getWidth());
+                  });
+                  var H = I / p, x = w / p, k = Math.pow(v - E, 2) + 4 * (H + E) * (x + v) * p, W = (E - v + Math.sqrt(k)) / (2 * (H + E)), U;
+                  m ? (U = Math.ceil(W), U == W && U++) : U = Math.floor(W);
+                  var et = U * (H + E) - E;
+                  return R > et && (et = R), et += E * 2, et;
+                }, D.prototype.tileNodesByFavoringDim = function(a, m, v) {
+                  var E = o.TILING_PADDING_VERTICAL, p = o.TILING_PADDING_HORIZONTAL, I = o.TILING_COMPARE_BY, w = {
+                    rows: [],
+                    rowWidth: [],
+                    rowHeight: [],
+                    width: 0,
+                    height: m,
+                    // assume minHeight equals to minWidth
+                    verticalPadding: E,
+                    horizontalPadding: p,
+                    centerX: 0,
+                    centerY: 0
+                  };
+                  I && (w.idealRowWidth = this.calcIdealRowWidth(a, v));
+                  var R = function(O) {
+                    return O.rect.width * O.rect.height;
+                  }, H = function(O, X) {
+                    return R(X) - R(O);
+                  };
+                  a.sort(function(z, O) {
+                    var X = H;
+                    return w.idealRowWidth ? (X = I, X(z.id, O.id)) : X(z, O);
+                  });
+                  for (var x = 0, k = 0, W = 0; W < a.length; W++) {
+                    var U = a[W];
+                    x += U.getCenterX(), k += U.getCenterY();
+                  }
+                  w.centerX = x / a.length, w.centerY = k / a.length;
+                  for (var W = 0; W < a.length; W++) {
+                    var U = a[W];
+                    if (w.rows.length == 0)
+                      this.insertNodeToRow(w, U, 0, m);
+                    else if (this.canAddHorizontal(w, U.rect.width, U.rect.height)) {
+                      var et = w.rows.length - 1;
+                      w.idealRowWidth || (et = this.getShortestRowIndex(w)), this.insertNodeToRow(w, U, et, m);
+                    } else
+                      this.insertNodeToRow(w, U, w.rows.length, m);
+                    this.shiftToLastRow(w);
+                  }
+                  return w;
+                }, D.prototype.insertNodeToRow = function(a, m, v, E) {
+                  var p = E;
+                  if (v == a.rows.length) {
+                    var I = [];
+                    a.rows.push(I), a.rowWidth.push(p), a.rowHeight.push(0);
+                  }
+                  var w = a.rowWidth[v] + m.rect.width;
+                  a.rows[v].length > 0 && (w += a.horizontalPadding), a.rowWidth[v] = w, a.width < w && (a.width = w);
+                  var R = m.rect.height;
+                  v > 0 && (R += a.verticalPadding);
+                  var H = 0;
+                  R > a.rowHeight[v] && (H = a.rowHeight[v], a.rowHeight[v] = R, H = a.rowHeight[v] - H), a.height += H, a.rows[v].push(m);
+                }, D.prototype.getShortestRowIndex = function(a) {
+                  for (var m = -1, v = Number.MAX_VALUE, E = 0; E < a.rows.length; E++)
+                    a.rowWidth[E] < v && (m = E, v = a.rowWidth[E]);
+                  return m;
+                }, D.prototype.getLongestRowIndex = function(a) {
+                  for (var m = -1, v = Number.MIN_VALUE, E = 0; E < a.rows.length; E++)
+                    a.rowWidth[E] > v && (m = E, v = a.rowWidth[E]);
+                  return m;
+                }, D.prototype.canAddHorizontal = function(a, m, v) {
+                  if (a.idealRowWidth) {
+                    var E = a.rows.length - 1, p = a.rowWidth[E];
+                    return p + m + a.horizontalPadding <= a.idealRowWidth;
+                  }
+                  var I = this.getShortestRowIndex(a);
+                  if (I < 0)
+                    return !0;
+                  var w = a.rowWidth[I];
+                  if (w + a.horizontalPadding + m <= a.width) return !0;
+                  var R = 0;
+                  a.rowHeight[I] < v && I > 0 && (R = v + a.verticalPadding - a.rowHeight[I]);
+                  var H;
+                  a.width - w >= m + a.horizontalPadding ? H = (a.height + R) / (w + m + a.horizontalPadding) : H = (a.height + R) / a.width, R = v + a.verticalPadding;
+                  var x;
+                  return a.width < m ? x = (a.height + R) / m : x = (a.height + R) / a.width, x < 1 && (x = 1 / x), H < 1 && (H = 1 / H), H < x;
+                }, D.prototype.shiftToLastRow = function(a) {
+                  var m = this.getLongestRowIndex(a), v = a.rowWidth.length - 1, E = a.rows[m], p = E[E.length - 1], I = p.width + a.horizontalPadding;
+                  if (a.width - a.rowWidth[v] > I && m != v) {
+                    E.splice(-1, 1), a.rows[v].push(p), a.rowWidth[m] = a.rowWidth[m] - I, a.rowWidth[v] = a.rowWidth[v] + I, a.width = a.rowWidth[instance.getLongestRowIndex(a)];
+                    for (var w = Number.MIN_VALUE, R = 0; R < E.length; R++)
+                      E[R].height > w && (w = E[R].height);
+                    m > 0 && (w += a.verticalPadding);
+                    var H = a.rowHeight[m] + a.rowHeight[v];
+                    a.rowHeight[m] = w, a.rowHeight[v] < p.height + a.verticalPadding && (a.rowHeight[v] = p.height + a.verticalPadding);
+                    var x = a.rowHeight[m] + a.rowHeight[v];
+                    a.height += x - H, this.shiftToLastRow(a);
+                  }
+                }, D.prototype.tilingPreLayout = function() {
+                  o.TILE && (this.groupZeroDegreeMembers(), this.clearCompounds(), this.clearZeroDegreeMembers());
+                }, D.prototype.tilingPostLayout = function() {
+                  o.TILE && (this.repopulateZeroDegreeMembers(), this.repopulateCompounds());
+                }, D.prototype.reduceTrees = function() {
+                  for (var a = [], m = !0, v; m; ) {
+                    var E = this.graphManager.getAllNodes(), p = [];
+                    m = !1;
+                    for (var I = 0; I < E.length; I++)
+                      if (v = E[I], v.getEdges().length == 1 && !v.getEdges()[0].isInterGraph && v.getChild() == null) {
+                        if (o.PURE_INCREMENTAL) {
+                          var w = v.getEdges()[0].getOtherEnd(v), R = new L(v.getCenterX() - w.getCenterX(), v.getCenterY() - w.getCenterY());
+                          p.push([v, v.getEdges()[0], v.getOwner(), R]);
+                        } else
+                          p.push([v, v.getEdges()[0], v.getOwner()]);
+                        m = !0;
+                      }
+                    if (m == !0) {
+                      for (var H = [], x = 0; x < p.length; x++)
+                        p[x][0].getEdges().length == 1 && (H.push(p[x]), p[x][0].getOwner().remove(p[x][0]));
+                      a.push(H), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
+                    }
+                  }
+                  this.prunedNodesAll = a;
+                }, D.prototype.growTree = function(a) {
+                  for (var m = a.length, v = a[m - 1], E, p = 0; p < v.length; p++)
+                    E = v[p], this.findPlaceforPrunedNode(E), E[2].add(E[0]), E[2].add(E[1], E[1].source, E[1].target);
+                  a.splice(a.length - 1, 1), this.graphManager.resetAllNodes(), this.graphManager.resetAllEdges();
+                }, D.prototype.findPlaceforPrunedNode = function(a) {
+                  var m, v, E = a[0];
+                  if (E == a[1].source ? v = a[1].target : v = a[1].source, o.PURE_INCREMENTAL)
+                    E.setCenter(v.getCenterX() + a[3].getWidth(), v.getCenterY() + a[3].getHeight());
+                  else {
+                    var p = v.startX, I = v.finishX, w = v.startY, R = v.finishY, H = 0, x = 0, k = 0, W = 0, U = [H, k, x, W];
+                    if (w > 0)
+                      for (var et = p; et <= I; et++)
+                        U[0] += this.grid[et][w - 1].length + this.grid[et][w].length - 1;
+                    if (I < this.grid.length - 1)
+                      for (var et = w; et <= R; et++)
+                        U[1] += this.grid[I + 1][et].length + this.grid[I][et].length - 1;
+                    if (R < this.grid[0].length - 1)
+                      for (var et = p; et <= I; et++)
+                        U[2] += this.grid[et][R + 1].length + this.grid[et][R].length - 1;
+                    if (p > 0)
+                      for (var et = w; et <= R; et++)
+                        U[3] += this.grid[p - 1][et].length + this.grid[p][et].length - 1;
+                    for (var z = M.MAX_VALUE, O, X, B = 0; B < U.length; B++)
+                      U[B] < z ? (z = U[B], O = 1, X = B) : U[B] == z && O++;
+                    if (O == 3 && z == 0)
+                      U[0] == 0 && U[1] == 0 && U[2] == 0 ? m = 1 : U[0] == 0 && U[1] == 0 && U[3] == 0 ? m = 0 : U[0] == 0 && U[2] == 0 && U[3] == 0 ? m = 3 : U[1] == 0 && U[2] == 0 && U[3] == 0 && (m = 2);
+                    else if (O == 2 && z == 0) {
+                      var _ = Math.floor(Math.random() * 2);
+                      U[0] == 0 && U[1] == 0 ? _ == 0 ? m = 0 : m = 1 : U[0] == 0 && U[2] == 0 ? _ == 0 ? m = 0 : m = 2 : U[0] == 0 && U[3] == 0 ? _ == 0 ? m = 0 : m = 3 : U[1] == 0 && U[2] == 0 ? _ == 0 ? m = 1 : m = 2 : U[1] == 0 && U[3] == 0 ? _ == 0 ? m = 1 : m = 3 : _ == 0 ? m = 2 : m = 3;
+                    } else if (O == 4 && z == 0) {
+                      var _ = Math.floor(Math.random() * 4);
+                      m = _;
+                    } else
+                      m = X;
+                    m == 0 ? E.setCenter(v.getCenterX(), v.getCenterY() - v.getHeight() / 2 - l.DEFAULT_EDGE_LENGTH - E.getHeight() / 2) : m == 1 ? E.setCenter(v.getCenterX() + v.getWidth() / 2 + l.DEFAULT_EDGE_LENGTH + E.getWidth() / 2, v.getCenterY()) : m == 2 ? E.setCenter(v.getCenterX(), v.getCenterY() + v.getHeight() / 2 + l.DEFAULT_EDGE_LENGTH + E.getHeight() / 2) : E.setCenter(v.getCenterX() - v.getWidth() / 2 - l.DEFAULT_EDGE_LENGTH - E.getWidth() / 2, v.getCenterY());
+                  }
+                }, i.exports = D;
+              }
+            ),
+            /***/
+            991: (
+              /***/
+              (i, r, e) => {
+                var f = e(551).FDLayoutNode, n = e(551).IMath;
+                function y(h, o, c, l) {
+                  f.call(this, h, o, c, l);
+                }
+                y.prototype = Object.create(f.prototype);
+                for (var t in f)
+                  y[t] = f[t];
+                y.prototype.calculateDisplacement = function() {
+                  var h = this.graphManager.getLayout();
+                  this.getChild() != null && this.fixedNodeWeight ? (this.displacementX += h.coolingFactor * (this.springForceX + this.repulsionForceX + this.gravitationForceX) / this.fixedNodeWeight, this.displacementY += h.coolingFactor * (this.springForceY + this.repulsionForceY + this.gravitationForceY) / this.fixedNodeWeight) : (this.displacementX += h.coolingFactor * (this.springForceX + this.repulsionForceX + this.gravitationForceX) / this.noOfChildren, this.displacementY += h.coolingFactor * (this.springForceY + this.repulsionForceY + this.gravitationForceY) / this.noOfChildren), Math.abs(this.displacementX) > h.coolingFactor * h.maxNodeDisplacement && (this.displacementX = h.coolingFactor * h.maxNodeDisplacement * n.sign(this.displacementX)), Math.abs(this.displacementY) > h.coolingFactor * h.maxNodeDisplacement && (this.displacementY = h.coolingFactor * h.maxNodeDisplacement * n.sign(this.displacementY)), this.child && this.child.getNodes().length > 0 && this.propogateDisplacementToChildren(this.displacementX, this.displacementY);
+                }, y.prototype.propogateDisplacementToChildren = function(h, o) {
+                  for (var c = this.getChild().getNodes(), l, T = 0; T < c.length; T++)
+                    l = c[T], l.getChild() == null ? (l.displacementX += h, l.displacementY += o) : l.propogateDisplacementToChildren(h, o);
+                }, y.prototype.move = function() {
+                  var h = this.graphManager.getLayout();
+                  (this.child == null || this.child.getNodes().length == 0) && (this.moveBy(this.displacementX, this.displacementY), h.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;
+                }, y.prototype.setPred1 = function(h) {
+                  this.pred1 = h;
+                }, y.prototype.getPred1 = function() {
+                  return pred1;
+                }, y.prototype.getPred2 = function() {
+                  return pred2;
+                }, y.prototype.setNext = function(h) {
+                  this.next = h;
+                }, y.prototype.getNext = function() {
+                  return next;
+                }, y.prototype.setProcessed = function(h) {
+                  this.processed = h;
+                }, y.prototype.isProcessed = function() {
+                  return processed;
+                }, i.exports = y;
+              }
+            ),
+            /***/
+            902: (
+              /***/
+              (i, r, e) => {
+                function f(c) {
+                  if (Array.isArray(c)) {
+                    for (var l = 0, T = Array(c.length); l < c.length; l++)
+                      T[l] = c[l];
+                    return T;
+                  } else
+                    return Array.from(c);
+                }
+                var n = e(806), y = e(551).LinkedList, t = e(551).Matrix, h = e(551).SVD;
+                function o() {
+                }
+                o.handleConstraints = function(c) {
+                  var l = {};
+                  l.fixedNodeConstraint = c.constraints.fixedNodeConstraint, l.alignmentConstraint = c.constraints.alignmentConstraint, l.relativePlacementConstraint = c.constraints.relativePlacementConstraint;
+                  for (var T = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Map(), d = [], L = [], F = c.getAllNodes(), M = 0, P = 0; P < F.length; P++) {
+                    var J = F[P];
+                    J.getChild() == null && (g.set(J.id, M++), d.push(J.getCenterX()), L.push(J.getCenterY()), T.set(J.id, J));
+                  }
+                  l.relativePlacementConstraint && l.relativePlacementConstraint.forEach(function(S) {
+                    !S.gap && S.gap != 0 && (S.left ? S.gap = n.DEFAULT_EDGE_LENGTH + T.get(S.left).getWidth() / 2 + T.get(S.right).getWidth() / 2 : S.gap = n.DEFAULT_EDGE_LENGTH + T.get(S.top).getHeight() / 2 + T.get(S.bottom).getHeight() / 2);
+                  });
+                  var V = function(b, $) {
+                    return { x: b.x - $.x, y: b.y - $.y };
+                  }, Q = function(b) {
+                    var $ = 0, K = 0;
+                    return b.forEach(function(Z) {
+                      $ += d[g.get(Z)], K += L[g.get(Z)];
+                    }), { x: $ / b.size, y: K / b.size };
+                  }, D = function(b, $, K, Z, nt) {
+                    function ut(ft, st) {
+                      var Ct = new Set(ft), ct = !0, ht = !1, Wt = void 0;
+                      try {
+                        for (var Nt = st[Symbol.iterator](), Mt; !(ct = (Mt = Nt.next()).done); ct = !0) {
+                          var Zt = Mt.value;
+                          Ct.add(Zt);
+                        }
+                      } catch (Gt) {
+                        ht = !0, Wt = Gt;
+                      } finally {
+                        try {
+                          !ct && Nt.return && Nt.return();
+                        } finally {
+                          if (ht)
+                            throw Wt;
+                        }
+                      }
+                      return Ct;
+                    }
+                    var ot = /* @__PURE__ */ new Map();
+                    b.forEach(function(ft, st) {
+                      ot.set(st, 0);
+                    }), b.forEach(function(ft, st) {
+                      ft.forEach(function(Ct) {
+                        ot.set(Ct.id, ot.get(Ct.id) + 1);
+                      });
+                    });
+                    var tt = /* @__PURE__ */ new Map(), j = /* @__PURE__ */ new Map(), dt = new y();
+                    ot.forEach(function(ft, st) {
+                      ft == 0 ? (dt.push(st), K || ($ == "horizontal" ? tt.set(st, g.has(st) ? d[g.get(st)] : Z.get(st)) : tt.set(st, g.has(st) ? L[g.get(st)] : Z.get(st)))) : tt.set(st, Number.NEGATIVE_INFINITY), K && j.set(st, /* @__PURE__ */ new Set([st]));
+                    }), K && nt.forEach(function(ft) {
+                      var st = [];
+                      if (ft.forEach(function(ht) {
+                        K.has(ht) && st.push(ht);
+                      }), st.length > 0) {
+                        var Ct = 0;
+                        st.forEach(function(ht) {
+                          $ == "horizontal" ? (tt.set(ht, g.has(ht) ? d[g.get(ht)] : Z.get(ht)), Ct += tt.get(ht)) : (tt.set(ht, g.has(ht) ? L[g.get(ht)] : Z.get(ht)), Ct += tt.get(ht));
+                        }), Ct = Ct / st.length, ft.forEach(function(ht) {
+                          K.has(ht) || tt.set(ht, Ct);
+                        });
+                      } else {
+                        var ct = 0;
+                        ft.forEach(function(ht) {
+                          $ == "horizontal" ? ct += g.has(ht) ? d[g.get(ht)] : Z.get(ht) : ct += g.has(ht) ? L[g.get(ht)] : Z.get(ht);
+                        }), ct = ct / ft.length, ft.forEach(function(ht) {
+                          tt.set(ht, ct);
+                        });
+                      }
+                    });
+                    for (var wt = function() {
+                      var st = dt.shift(), Ct = b.get(st);
+                      Ct.forEach(function(ct) {
+                        if (tt.get(ct.id) < tt.get(st) + ct.gap)
+                          if (K && K.has(ct.id)) {
+                            var ht = void 0;
+                            if ($ == "horizontal" ? ht = g.has(ct.id) ? d[g.get(ct.id)] : Z.get(ct.id) : ht = g.has(ct.id) ? L[g.get(ct.id)] : Z.get(ct.id), tt.set(ct.id, ht), ht < tt.get(st) + ct.gap) {
+                              var Wt = tt.get(st) + ct.gap - ht;
+                              j.get(st).forEach(function(Nt) {
+                                tt.set(Nt, tt.get(Nt) - Wt);
+                              });
+                            }
+                          } else
+                            tt.set(ct.id, tt.get(st) + ct.gap);
+                        ot.set(ct.id, ot.get(ct.id) - 1), ot.get(ct.id) == 0 && dt.push(ct.id), K && j.set(ct.id, ut(j.get(st), j.get(ct.id)));
+                      });
+                    }; dt.length != 0; )
+                      wt();
+                    if (K) {
+                      var yt = /* @__PURE__ */ new Set();
+                      b.forEach(function(ft, st) {
+                        ft.length == 0 && yt.add(st);
+                      });
+                      var It = [];
+                      j.forEach(function(ft, st) {
+                        if (yt.has(st)) {
+                          var Ct = !1, ct = !0, ht = !1, Wt = void 0;
+                          try {
+                            for (var Nt = ft[Symbol.iterator](), Mt; !(ct = (Mt = Nt.next()).done); ct = !0) {
+                              var Zt = Mt.value;
+                              K.has(Zt) && (Ct = !0);
+                            }
+                          } catch (Ft) {
+                            ht = !0, Wt = Ft;
+                          } finally {
+                            try {
+                              !ct && Nt.return && Nt.return();
+                            } finally {
+                              if (ht)
+                                throw Wt;
+                            }
+                          }
+                          if (!Ct) {
+                            var Gt = !1, $t = void 0;
+                            It.forEach(function(Ft, qt) {
+                              Ft.has([].concat(f(ft))[0]) && (Gt = !0, $t = qt);
+                            }), Gt ? ft.forEach(function(Ft) {
+                              It[$t].add(Ft);
+                            }) : It.push(new Set(ft));
+                          }
+                        }
+                      }), It.forEach(function(ft, st) {
+                        var Ct = Number.POSITIVE_INFINITY, ct = Number.POSITIVE_INFINITY, ht = Number.NEGATIVE_INFINITY, Wt = Number.NEGATIVE_INFINITY, Nt = !0, Mt = !1, Zt = void 0;
+                        try {
+                          for (var Gt = ft[Symbol.iterator](), $t; !(Nt = ($t = Gt.next()).done); Nt = !0) {
+                            var Ft = $t.value, qt = void 0;
+                            $ == "horizontal" ? qt = g.has(Ft) ? d[g.get(Ft)] : Z.get(Ft) : qt = g.has(Ft) ? L[g.get(Ft)] : Z.get(Ft);
+                            var _t = tt.get(Ft);
+                            qt < Ct && (Ct = qt), qt > ht && (ht = qt), _t < ct && (ct = _t), _t > Wt && (Wt = _t);
+                          }
+                        } catch (ie) {
+                          Mt = !0, Zt = ie;
+                        } finally {
+                          try {
+                            !Nt && Gt.return && Gt.return();
+                          } finally {
+                            if (Mt)
+                              throw Zt;
+                          }
+                        }
+                        var de = (Ct + ht) / 2 - (ct + Wt) / 2, Kt = !0, te = !1, ee = void 0;
+                        try {
+                          for (var jt = ft[Symbol.iterator](), se; !(Kt = (se = jt.next()).done); Kt = !0) {
+                            var re = se.value;
+                            tt.set(re, tt.get(re) + de);
+                          }
+                        } catch (ie) {
+                          te = !0, ee = ie;
+                        } finally {
+                          try {
+                            !Kt && jt.return && jt.return();
+                          } finally {
+                            if (te)
+                              throw ee;
+                          }
+                        }
+                      });
+                    }
+                    return tt;
+                  }, rt = function(b) {
+                    var $ = 0, K = 0, Z = 0, nt = 0;
+                    if (b.forEach(function(j) {
+                      j.left ? d[g.get(j.left)] - d[g.get(j.right)] >= 0 ? $++ : K++ : L[g.get(j.top)] - L[g.get(j.bottom)] >= 0 ? Z++ : nt++;
+                    }), $ > K && Z > nt)
+                      for (var ut = 0; ut < g.size; ut++)
+                        d[ut] = -1 * d[ut], L[ut] = -1 * L[ut];
+                    else if ($ > K)
+                      for (var ot = 0; ot < g.size; ot++)
+                        d[ot] = -1 * d[ot];
+                    else if (Z > nt)
+                      for (var tt = 0; tt < g.size; tt++)
+                        L[tt] = -1 * L[tt];
+                  }, a = function(b) {
+                    var $ = [], K = new y(), Z = /* @__PURE__ */ new Set(), nt = 0;
+                    return b.forEach(function(ut, ot) {
+                      if (!Z.has(ot)) {
+                        $[nt] = [];
+                        var tt = ot;
+                        for (K.push(tt), Z.add(tt), $[nt].push(tt); K.length != 0; ) {
+                          tt = K.shift();
+                          var j = b.get(tt);
+                          j.forEach(function(dt) {
+                            Z.has(dt.id) || (K.push(dt.id), Z.add(dt.id), $[nt].push(dt.id));
+                          });
+                        }
+                        nt++;
+                      }
+                    }), $;
+                  }, m = function(b) {
+                    var $ = /* @__PURE__ */ new Map();
+                    return b.forEach(function(K, Z) {
+                      $.set(Z, []);
+                    }), b.forEach(function(K, Z) {
+                      K.forEach(function(nt) {
+                        $.get(Z).push(nt), $.get(nt.id).push({ id: Z, gap: nt.gap, direction: nt.direction });
+                      });
+                    }), $;
+                  }, v = function(b) {
+                    var $ = /* @__PURE__ */ new Map();
+                    return b.forEach(function(K, Z) {
+                      $.set(Z, []);
+                    }), b.forEach(function(K, Z) {
+                      K.forEach(function(nt) {
+                        $.get(nt.id).push({ id: Z, gap: nt.gap, direction: nt.direction });
+                      });
+                    }), $;
+                  }, E = [], p = [], I = !1, w = !1, R = /* @__PURE__ */ new Set(), H = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), k = [];
+                  if (l.fixedNodeConstraint && l.fixedNodeConstraint.forEach(function(S) {
+                    R.add(S.nodeId);
+                  }), l.relativePlacementConstraint && (l.relativePlacementConstraint.forEach(function(S) {
+                    S.left ? (H.has(S.left) ? H.get(S.left).push({ id: S.right, gap: S.gap, direction: "horizontal" }) : H.set(S.left, [{ id: S.right, gap: S.gap, direction: "horizontal" }]), H.has(S.right) || H.set(S.right, [])) : (H.has(S.top) ? H.get(S.top).push({ id: S.bottom, gap: S.gap, direction: "vertical" }) : H.set(S.top, [{ id: S.bottom, gap: S.gap, direction: "vertical" }]), H.has(S.bottom) || H.set(S.bottom, []));
+                  }), x = m(H), k = a(x)), n.TRANSFORM_ON_CONSTRAINT_HANDLING) {
+                    if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 1)
+                      l.fixedNodeConstraint.forEach(function(S, b) {
+                        E[b] = [S.position.x, S.position.y], p[b] = [d[g.get(S.nodeId)], L[g.get(S.nodeId)]];
+                      }), I = !0;
+                    else if (l.alignmentConstraint)
+                      (function() {
+                        var S = 0;
+                        if (l.alignmentConstraint.vertical) {
+                          for (var b = l.alignmentConstraint.vertical, $ = function(tt) {
+                            var j = /* @__PURE__ */ new Set();
+                            b[tt].forEach(function(yt) {
+                              j.add(yt);
+                            });
+                            var dt = new Set([].concat(f(j)).filter(function(yt) {
+                              return R.has(yt);
+                            })), wt = void 0;
+                            dt.size > 0 ? wt = d[g.get(dt.values().next().value)] : wt = Q(j).x, b[tt].forEach(function(yt) {
+                              E[S] = [wt, L[g.get(yt)]], p[S] = [d[g.get(yt)], L[g.get(yt)]], S++;
+                            });
+                          }, K = 0; K < b.length; K++)
+                            $(K);
+                          I = !0;
+                        }
+                        if (l.alignmentConstraint.horizontal) {
+                          for (var Z = l.alignmentConstraint.horizontal, nt = function(tt) {
+                            var j = /* @__PURE__ */ new Set();
+                            Z[tt].forEach(function(yt) {
+                              j.add(yt);
+                            });
+                            var dt = new Set([].concat(f(j)).filter(function(yt) {
+                              return R.has(yt);
+                            })), wt = void 0;
+                            dt.size > 0 ? wt = d[g.get(dt.values().next().value)] : wt = Q(j).y, Z[tt].forEach(function(yt) {
+                              E[S] = [d[g.get(yt)], wt], p[S] = [d[g.get(yt)], L[g.get(yt)]], S++;
+                            });
+                          }, ut = 0; ut < Z.length; ut++)
+                            nt(ut);
+                          I = !0;
+                        }
+                        l.relativePlacementConstraint && (w = !0);
+                      })();
+                    else if (l.relativePlacementConstraint) {
+                      for (var W = 0, U = 0, et = 0; et < k.length; et++)
+                        k[et].length > W && (W = k[et].length, U = et);
+                      if (W < x.size / 2)
+                        rt(l.relativePlacementConstraint), I = !1, w = !1;
+                      else {
+                        var z = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map(), X = [];
+                        k[U].forEach(function(S) {
+                          H.get(S).forEach(function(b) {
+                            b.direction == "horizontal" ? (z.has(S) ? z.get(S).push(b) : z.set(S, [b]), z.has(b.id) || z.set(b.id, []), X.push({ left: S, right: b.id })) : (O.has(S) ? O.get(S).push(b) : O.set(S, [b]), O.has(b.id) || O.set(b.id, []), X.push({ top: S, bottom: b.id }));
+                          });
+                        }), rt(X), w = !1;
+                        var B = D(z, "horizontal"), _ = D(O, "vertical");
+                        k[U].forEach(function(S, b) {
+                          p[b] = [d[g.get(S)], L[g.get(S)]], E[b] = [], B.has(S) ? E[b][0] = B.get(S) : E[b][0] = d[g.get(S)], _.has(S) ? E[b][1] = _.get(S) : E[b][1] = L[g.get(S)];
+                        }), I = !0;
+                      }
+                    }
+                    if (I) {
+                      for (var lt = void 0, q = t.transpose(E), Rt = t.transpose(p), Lt = 0; Lt < q.length; Lt++)
+                        q[Lt] = t.multGamma(q[Lt]), Rt[Lt] = t.multGamma(Rt[Lt]);
+                      var vt = t.multMat(q, t.transpose(Rt)), it = h.svd(vt);
+                      lt = t.multMat(it.V, t.transpose(it.U));
+                      for (var gt = 0; gt < g.size; gt++) {
+                        var Tt = [d[gt], L[gt]], At = [lt[0][0], lt[1][0]], Dt = [lt[0][1], lt[1][1]];
+                        d[gt] = t.dotProduct(Tt, At), L[gt] = t.dotProduct(Tt, Dt);
+                      }
+                      w && rt(l.relativePlacementConstraint);
+                    }
+                  }
+                  if (n.ENFORCE_CONSTRAINTS) {
+                    if (l.fixedNodeConstraint && l.fixedNodeConstraint.length > 0) {
+                      var mt = { x: 0, y: 0 };
+                      l.fixedNodeConstraint.forEach(function(S, b) {
+                        var $ = { x: d[g.get(S.nodeId)], y: L[g.get(S.nodeId)] }, K = S.position, Z = V(K, $);
+                        mt.x += Z.x, mt.y += Z.y;
+                      }), mt.x /= l.fixedNodeConstraint.length, mt.y /= l.fixedNodeConstraint.length, d.forEach(function(S, b) {
+                        d[b] += mt.x;
+                      }), L.forEach(function(S, b) {
+                        L[b] += mt.y;
+                      }), l.fixedNodeConstraint.forEach(function(S) {
+                        d[g.get(S.nodeId)] = S.position.x, L[g.get(S.nodeId)] = S.position.y;
+                      });
+                    }
+                    if (l.alignmentConstraint) {
+                      if (l.alignmentConstraint.vertical)
+                        for (var xt = l.alignmentConstraint.vertical, St = function(b) {
+                          var $ = /* @__PURE__ */ new Set();
+                          xt[b].forEach(function(nt) {
+                            $.add(nt);
+                          });
+                          var K = new Set([].concat(f($)).filter(function(nt) {
+                            return R.has(nt);
+                          })), Z = void 0;
+                          K.size > 0 ? Z = d[g.get(K.values().next().value)] : Z = Q($).x, $.forEach(function(nt) {
+                            R.has(nt) || (d[g.get(nt)] = Z);
+                          });
+                        }, Vt = 0; Vt < xt.length; Vt++)
+                          St(Vt);
+                      if (l.alignmentConstraint.horizontal)
+                        for (var Xt = l.alignmentConstraint.horizontal, Ut = function(b) {
+                          var $ = /* @__PURE__ */ new Set();
+                          Xt[b].forEach(function(nt) {
+                            $.add(nt);
+                          });
+                          var K = new Set([].concat(f($)).filter(function(nt) {
+                            return R.has(nt);
+                          })), Z = void 0;
+                          K.size > 0 ? Z = L[g.get(K.values().next().value)] : Z = Q($).y, $.forEach(function(nt) {
+                            R.has(nt) || (L[g.get(nt)] = Z);
+                          });
+                        }, bt = 0; bt < Xt.length; bt++)
+                          Ut(bt);
+                    }
+                    l.relativePlacementConstraint && function() {
+                      var S = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), $ = /* @__PURE__ */ new Map(), K = /* @__PURE__ */ new Map(), Z = /* @__PURE__ */ new Map(), nt = /* @__PURE__ */ new Map(), ut = /* @__PURE__ */ new Set(), ot = /* @__PURE__ */ new Set();
+                      if (R.forEach(function(Yt) {
+                        ut.add(Yt), ot.add(Yt);
+                      }), l.alignmentConstraint) {
+                        if (l.alignmentConstraint.vertical)
+                          for (var tt = l.alignmentConstraint.vertical, j = function(Et) {
+                            $.set("dummy" + Et, []), tt[Et].forEach(function(Ot) {
+                              S.set(Ot, "dummy" + Et), $.get("dummy" + Et).push(Ot), R.has(Ot) && ut.add("dummy" + Et);
+                            }), Z.set("dummy" + Et, d[g.get(tt[Et][0])]);
+                          }, dt = 0; dt < tt.length; dt++)
+                            j(dt);
+                        if (l.alignmentConstraint.horizontal)
+                          for (var wt = l.alignmentConstraint.horizontal, yt = function(Et) {
+                            K.set("dummy" + Et, []), wt[Et].forEach(function(Ot) {
+                              b.set(Ot, "dummy" + Et), K.get("dummy" + Et).push(Ot), R.has(Ot) && ot.add("dummy" + Et);
+                            }), nt.set("dummy" + Et, L[g.get(wt[Et][0])]);
+                          }, It = 0; It < wt.length; It++)
+                            yt(It);
+                      }
+                      var ft = /* @__PURE__ */ new Map(), st = /* @__PURE__ */ new Map(), Ct = function(Et) {
+                        H.get(Et).forEach(function(Ot) {
+                          var Jt = void 0, kt = void 0;
+                          Ot.direction == "horizontal" ? (Jt = S.get(Et) ? S.get(Et) : Et, S.get(Ot.id) ? kt = { id: S.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, ft.has(Jt) ? ft.get(Jt).push(kt) : ft.set(Jt, [kt]), ft.has(kt.id) || ft.set(kt.id, [])) : (Jt = b.get(Et) ? b.get(Et) : Et, b.get(Ot.id) ? kt = { id: b.get(Ot.id), gap: Ot.gap, direction: Ot.direction } : kt = Ot, st.has(Jt) ? st.get(Jt).push(kt) : st.set(Jt, [kt]), st.has(kt.id) || st.set(kt.id, []));
+                        });
+                      }, ct = !0, ht = !1, Wt = void 0;
+                      try {
+                        for (var Nt = H.keys()[Symbol.iterator](), Mt; !(ct = (Mt = Nt.next()).done); ct = !0) {
+                          var Zt = Mt.value;
+                          Ct(Zt);
+                        }
+                      } catch (Yt) {
+                        ht = !0, Wt = Yt;
+                      } finally {
+                        try {
+                          !ct && Nt.return && Nt.return();
+                        } finally {
+                          if (ht)
+                            throw Wt;
+                        }
+                      }
+                      var Gt = m(ft), $t = m(st), Ft = a(Gt), qt = a($t), _t = v(ft), de = v(st), Kt = [], te = [];
+                      Ft.forEach(function(Yt, Et) {
+                        Kt[Et] = [], Yt.forEach(function(Ot) {
+                          _t.get(Ot).length == 0 && Kt[Et].push(Ot);
+                        });
+                      }), qt.forEach(function(Yt, Et) {
+                        te[Et] = [], Yt.forEach(function(Ot) {
+                          de.get(Ot).length == 0 && te[Et].push(Ot);
+                        });
+                      });
+                      var ee = D(ft, "horizontal", ut, Z, Kt), jt = D(st, "vertical", ot, nt, te), se = function(Et) {
+                        $.get(Et) ? $.get(Et).forEach(function(Ot) {
+                          d[g.get(Ot)] = ee.get(Et);
+                        }) : d[g.get(Et)] = ee.get(Et);
+                      }, re = !0, ie = !1, Le = void 0;
+                      try {
+                        for (var ve = ee.keys()[Symbol.iterator](), Ce; !(re = (Ce = ve.next()).done); re = !0) {
+                          var pe = Ce.value;
+                          se(pe);
+                        }
+                      } catch (Yt) {
+                        ie = !0, Le = Yt;
+                      } finally {
+                        try {
+                          !re && ve.return && ve.return();
+                        } finally {
+                          if (ie)
+                            throw Le;
+                        }
+                      }
+                      var Ze = function(Et) {
+                        K.get(Et) ? K.get(Et).forEach(function(Ot) {
+                          L[g.get(Ot)] = jt.get(Et);
+                        }) : L[g.get(Et)] = jt.get(Et);
+                      }, ye = !0, Me = !1, Ae = void 0;
+                      try {
+                        for (var Ee = jt.keys()[Symbol.iterator](), we; !(ye = (we = Ee.next()).done); ye = !0) {
+                          var pe = we.value;
+                          Ze(pe);
+                        }
+                      } catch (Yt) {
+                        Me = !0, Ae = Yt;
+                      } finally {
+                        try {
+                          !ye && Ee.return && Ee.return();
+                        } finally {
+                          if (Me)
+                            throw Ae;
+                        }
+                      }
+                    }();
+                  }
+                  for (var Ht = 0; Ht < F.length; Ht++) {
+                    var Bt = F[Ht];
+                    Bt.getChild() == null && Bt.setCenter(d[g.get(Bt.id)], L[g.get(Bt.id)]);
+                  }
+                }, i.exports = o;
+              }
+            ),
+            /***/
+            551: (
+              /***/
+              (i) => {
+                i.exports = A;
+              }
+            )
+            /******/
+          }, N = {};
+          function u(i) {
+            var r = N[i];
+            if (r !== void 0)
+              return r.exports;
+            var e = N[i] = {
+              /******/
+              // no module.id needed
+              /******/
+              // no module.loaded needed
+              /******/
+              exports: {}
+              /******/
+            };
+            return G[i](e, e.exports, u), e.exports;
+          }
+          var s = u(45);
+          return s;
+        })()
+      );
+    });
+  }(fe)), fe.exports;
+}
+var dr = le.exports, xe;
+function vr() {
+  return xe || (xe = 1, function(C, Y) {
+    (function(G, N) {
+      C.exports = N(gr());
+    })(dr, function(A) {
+      return (
+        /******/
+        (() => {
+          var G = {
+            /***/
+            658: (
+              /***/
+              (i) => {
+                i.exports = Object.assign != null ? Object.assign.bind(Object) : function(r) {
+                  for (var e = arguments.length, f = Array(e > 1 ? e - 1 : 0), n = 1; n < e; n++)
+                    f[n - 1] = arguments[n];
+                  return f.forEach(function(y) {
+                    Object.keys(y).forEach(function(t) {
+                      return r[t] = y[t];
+                    });
+                  }), r;
+                };
+              }
+            ),
+            /***/
+            548: (
+              /***/
+              (i, r, e) => {
+                var f = /* @__PURE__ */ function() {
+                  function t(h, o) {
+                    var c = [], l = !0, T = !1, g = void 0;
+                    try {
+                      for (var d = h[Symbol.iterator](), L; !(l = (L = d.next()).done) && (c.push(L.value), !(o && c.length === o)); l = !0)
+                        ;
+                    } catch (F) {
+                      T = !0, g = F;
+                    } finally {
+                      try {
+                        !l && d.return && d.return();
+                      } finally {
+                        if (T) throw g;
+                      }
+                    }
+                    return c;
+                  }
+                  return function(h, o) {
+                    if (Array.isArray(h))
+                      return h;
+                    if (Symbol.iterator in Object(h))
+                      return t(h, o);
+                    throw new TypeError("Invalid attempt to destructure non-iterable instance");
+                  };
+                }(), n = e(140).layoutBase.LinkedList, y = {};
+                y.getTopMostNodes = function(t) {
+                  for (var h = {}, o = 0; o < t.length; o++)
+                    h[t[o].id()] = !0;
+                  var c = t.filter(function(l, T) {
+                    typeof l == "number" && (l = T);
+                    for (var g = l.parent()[0]; g != null; ) {
+                      if (h[g.id()])
+                        return !1;
+                      g = g.parent()[0];
+                    }
+                    return !0;
+                  });
+                  return c;
+                }, y.connectComponents = function(t, h, o, c) {
+                  var l = new n(), T = /* @__PURE__ */ new Set(), g = [], d = void 0, L = void 0, F = void 0, M = !1, P = 1, J = [], V = [], Q = function() {
+                    var rt = t.collection();
+                    V.push(rt);
+                    var a = o[0], m = t.collection();
+                    m.merge(a).merge(a.descendants().intersection(h)), g.push(a), m.forEach(function(p) {
+                      l.push(p), T.add(p), rt.merge(p);
+                    });
+                    for (var v = function() {
+                      a = l.shift();
+                      var I = t.collection();
+                      a.neighborhood().nodes().forEach(function(x) {
+                        h.intersection(a.edgesWith(x)).length > 0 && I.merge(x);
+                      });
+                      for (var w = 0; w < I.length; w++) {
+                        var R = I[w];
+                        if (d = o.intersection(R.union(R.ancestors())), d != null && !T.has(d[0])) {
+                          var H = d.union(d.descendants());
+                          H.forEach(function(x) {
+                            l.push(x), T.add(x), rt.merge(x), o.has(x) && g.push(x);
+                          });
+                        }
+                      }
+                    }; l.length != 0; )
+                      v();
+                    if (rt.forEach(function(p) {
+                      h.intersection(p.connectedEdges()).forEach(function(I) {
+                        rt.has(I.source()) && rt.has(I.target()) && rt.merge(I);
+                      });
+                    }), g.length == o.length && (M = !0), !M || M && P > 1) {
+                      L = g[0], F = L.connectedEdges().length, g.forEach(function(p) {
+                        p.connectedEdges().length < F && (F = p.connectedEdges().length, L = p);
+                      }), J.push(L.id());
+                      var E = t.collection();
+                      E.merge(g[0]), g.forEach(function(p) {
+                        E.merge(p);
+                      }), g = [], o = o.difference(E), P++;
+                    }
+                  };
+                  do
+                    Q();
+                  while (!M);
+                  return c && J.length > 0 && c.set("dummy" + (c.size + 1), J), V;
+                }, y.relocateComponent = function(t, h, o) {
+                  if (!o.fixedNodeConstraint) {
+                    var c = Number.POSITIVE_INFINITY, l = Number.NEGATIVE_INFINITY, T = Number.POSITIVE_INFINITY, g = Number.NEGATIVE_INFINITY;
+                    if (o.quality == "draft") {
+                      var d = !0, L = !1, F = void 0;
+                      try {
+                        for (var M = h.nodeIndexes[Symbol.iterator](), P; !(d = (P = M.next()).done); d = !0) {
+                          var J = P.value, V = f(J, 2), Q = V[0], D = V[1], rt = o.cy.getElementById(Q);
+                          if (rt) {
+                            var a = rt.boundingBox(), m = h.xCoords[D] - a.w / 2, v = h.xCoords[D] + a.w / 2, E = h.yCoords[D] - a.h / 2, p = h.yCoords[D] + a.h / 2;
+                            m < c && (c = m), v > l && (l = v), E < T && (T = E), p > g && (g = p);
+                          }
+                        }
+                      } catch (x) {
+                        L = !0, F = x;
+                      } finally {
+                        try {
+                          !d && M.return && M.return();
+                        } finally {
+                          if (L)
+                            throw F;
+                        }
+                      }
+                      var I = t.x - (l + c) / 2, w = t.y - (g + T) / 2;
+                      h.xCoords = h.xCoords.map(function(x) {
+                        return x + I;
+                      }), h.yCoords = h.yCoords.map(function(x) {
+                        return x + w;
+                      });
+                    } else {
+                      Object.keys(h).forEach(function(x) {
+                        var k = h[x], W = k.getRect().x, U = k.getRect().x + k.getRect().width, et = k.getRect().y, z = k.getRect().y + k.getRect().height;
+                        W < c && (c = W), U > l && (l = U), et < T && (T = et), z > g && (g = z);
+                      });
+                      var R = t.x - (l + c) / 2, H = t.y - (g + T) / 2;
+                      Object.keys(h).forEach(function(x) {
+                        var k = h[x];
+                        k.setCenter(k.getCenterX() + R, k.getCenterY() + H);
+                      });
+                    }
+                  }
+                }, y.calcBoundingBox = function(t, h, o, c) {
+                  for (var l = Number.MAX_SAFE_INTEGER, T = Number.MIN_SAFE_INTEGER, g = Number.MAX_SAFE_INTEGER, d = Number.MIN_SAFE_INTEGER, L = void 0, F = void 0, M = void 0, P = void 0, J = t.descendants().not(":parent"), V = J.length, Q = 0; Q < V; Q++) {
+                    var D = J[Q];
+                    L = h[c.get(D.id())] - D.width() / 2, F = h[c.get(D.id())] + D.width() / 2, M = o[c.get(D.id())] - D.height() / 2, P = o[c.get(D.id())] + D.height() / 2, l > L && (l = L), T < F && (T = F), g > M && (g = M), d < P && (d = P);
+                  }
+                  var rt = {};
+                  return rt.topLeftX = l, rt.topLeftY = g, rt.width = T - l, rt.height = d - g, rt;
+                }, y.calcParentsWithoutChildren = function(t, h) {
+                  var o = t.collection();
+                  return h.nodes(":parent").forEach(function(c) {
+                    var l = !1;
+                    c.children().forEach(function(T) {
+                      T.css("display") != "none" && (l = !0);
+                    }), l || o.merge(c);
+                  }), o;
+                }, i.exports = y;
+              }
+            ),
+            /***/
+            816: (
+              /***/
+              (i, r, e) => {
+                var f = e(548), n = e(140).CoSELayout, y = e(140).CoSENode, t = e(140).layoutBase.PointD, h = e(140).layoutBase.DimensionD, o = e(140).layoutBase.LayoutConstants, c = e(140).layoutBase.FDLayoutConstants, l = e(140).CoSEConstants, T = function(d, L) {
+                  var F = d.cy, M = d.eles, P = M.nodes(), J = M.edges(), V = void 0, Q = void 0, D = void 0, rt = {};
+                  d.randomize && (V = L.nodeIndexes, Q = L.xCoords, D = L.yCoords);
+                  var a = function(x) {
+                    return typeof x == "function";
+                  }, m = function(x, k) {
+                    return a(x) ? x(k) : x;
+                  }, v = f.calcParentsWithoutChildren(F, M), E = function H(x, k, W, U) {
+                    for (var et = k.length, z = 0; z < et; z++) {
+                      var O = k[z], X = null;
+                      O.intersection(v).length == 0 && (X = O.children());
+                      var B = void 0, _ = O.layoutDimensions({
+                        nodeDimensionsIncludeLabels: U.nodeDimensionsIncludeLabels
+                      });
+                      if (O.outerWidth() != null && O.outerHeight() != null)
+                        if (U.randomize)
+                          if (!O.isParent())
+                            B = x.add(new y(W.graphManager, new t(Q[V.get(O.id())] - _.w / 2, D[V.get(O.id())] - _.h / 2), new h(parseFloat(_.w), parseFloat(_.h))));
+                          else {
+                            var lt = f.calcBoundingBox(O, Q, D, V);
+                            O.intersection(v).length == 0 ? B = x.add(new y(W.graphManager, new t(lt.topLeftX, lt.topLeftY), new h(lt.width, lt.height))) : B = x.add(new y(W.graphManager, new t(lt.topLeftX, lt.topLeftY), new h(parseFloat(_.w), parseFloat(_.h))));
+                          }
+                        else
+                          B = x.add(new y(W.graphManager, new t(O.position("x") - _.w / 2, O.position("y") - _.h / 2), new h(parseFloat(_.w), parseFloat(_.h))));
+                      else
+                        B = x.add(new y(this.graphManager));
+                      if (B.id = O.data("id"), B.nodeRepulsion = m(U.nodeRepulsion, O), B.paddingLeft = parseInt(O.css("padding")), B.paddingTop = parseInt(O.css("padding")), B.paddingRight = parseInt(O.css("padding")), B.paddingBottom = parseInt(O.css("padding")), U.nodeDimensionsIncludeLabels && (B.labelWidth = O.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).w, B.labelHeight = O.boundingBox({ includeLabels: !0, includeNodes: !1, includeOverlays: !1 }).h, B.labelPosVertical = O.css("text-valign"), B.labelPosHorizontal = O.css("text-halign")), rt[O.data("id")] = B, isNaN(B.rect.x) && (B.rect.x = 0), isNaN(B.rect.y) && (B.rect.y = 0), X != null && X.length > 0) {
+                        var q = void 0;
+                        q = W.getGraphManager().add(W.newGraph(), B), H(q, X, W, U);
+                      }
+                    }
+                  }, p = function(x, k, W) {
+                    for (var U = 0, et = 0, z = 0; z < W.length; z++) {
+                      var O = W[z], X = rt[O.data("source")], B = rt[O.data("target")];
+                      if (X && B && X !== B && X.getEdgesBetween(B).length == 0) {
+                        var _ = k.add(x.newEdge(), X, B);
+                        _.id = O.id(), _.idealLength = m(d.idealEdgeLength, O), _.edgeElasticity = m(d.edgeElasticity, O), U += _.idealLength, et++;
+                      }
+                    }
+                    d.idealEdgeLength != null && (et > 0 ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = U / et : a(d.idealEdgeLength) ? l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = 50 : l.DEFAULT_EDGE_LENGTH = c.DEFAULT_EDGE_LENGTH = d.idealEdgeLength, l.MIN_REPULSION_DIST = c.MIN_REPULSION_DIST = c.DEFAULT_EDGE_LENGTH / 10, l.DEFAULT_RADIAL_SEPARATION = c.DEFAULT_EDGE_LENGTH);
+                  }, I = function(x, k) {
+                    k.fixedNodeConstraint && (x.constraints.fixedNodeConstraint = k.fixedNodeConstraint), k.alignmentConstraint && (x.constraints.alignmentConstraint = k.alignmentConstraint), k.relativePlacementConstraint && (x.constraints.relativePlacementConstraint = k.relativePlacementConstraint);
+                  };
+                  d.nestingFactor != null && (l.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = c.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = d.nestingFactor), d.gravity != null && (l.DEFAULT_GRAVITY_STRENGTH = c.DEFAULT_GRAVITY_STRENGTH = d.gravity), d.numIter != null && (l.MAX_ITERATIONS = c.MAX_ITERATIONS = d.numIter), d.gravityRange != null && (l.DEFAULT_GRAVITY_RANGE_FACTOR = c.DEFAULT_GRAVITY_RANGE_FACTOR = d.gravityRange), d.gravityCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_STRENGTH = c.DEFAULT_COMPOUND_GRAVITY_STRENGTH = d.gravityCompound), d.gravityRangeCompound != null && (l.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = c.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = d.gravityRangeCompound), d.initialEnergyOnIncremental != null && (l.DEFAULT_COOLING_FACTOR_INCREMENTAL = c.DEFAULT_COOLING_FACTOR_INCREMENTAL = d.initialEnergyOnIncremental), d.tilingCompareBy != null && (l.TILING_COMPARE_BY = d.tilingCompareBy), d.quality == "proof" ? o.QUALITY = 2 : o.QUALITY = 0, l.NODE_DIMENSIONS_INCLUDE_LABELS = c.NODE_DIMENSIONS_INCLUDE_LABELS = o.NODE_DIMENSIONS_INCLUDE_LABELS = d.nodeDimensionsIncludeLabels, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = o.DEFAULT_INCREMENTAL = !d.randomize, l.ANIMATE = c.ANIMATE = o.ANIMATE = d.animate, l.TILE = d.tile, l.TILING_PADDING_VERTICAL = typeof d.tilingPaddingVertical == "function" ? d.tilingPaddingVertical.call() : d.tilingPaddingVertical, l.TILING_PADDING_HORIZONTAL = typeof d.tilingPaddingHorizontal == "function" ? d.tilingPaddingHorizontal.call() : d.tilingPaddingHorizontal, l.DEFAULT_INCREMENTAL = c.DEFAULT_INCREMENTAL = o.DEFAULT_INCREMENTAL = !0, l.PURE_INCREMENTAL = !d.randomize, o.DEFAULT_UNIFORM_LEAF_NODE_SIZES = d.uniformNodeDimensions, d.step == "transformed" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !1), d.step == "enforced" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !1), d.step == "cose" && (l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !1, l.APPLY_LAYOUT = !0), d.step == "all" && (d.randomize ? l.TRANSFORM_ON_CONSTRAINT_HANDLING = !0 : l.TRANSFORM_ON_CONSTRAINT_HANDLING = !1, l.ENFORCE_CONSTRAINTS = !0, l.APPLY_LAYOUT = !0), d.fixedNodeConstraint || d.alignmentConstraint || d.relativePlacementConstraint ? l.TREE_REDUCTION_ON_INCREMENTAL = !1 : l.TREE_REDUCTION_ON_INCREMENTAL = !0;
+                  var w = new n(), R = w.newGraphManager();
+                  return E(R.addRoot(), f.getTopMostNodes(P), w, d), p(w, R, J), I(w, d), w.runLayout(), rt;
+                };
+                i.exports = { coseLayout: T };
+              }
+            ),
+            /***/
+            212: (
+              /***/
+              (i, r, e) => {
+                var f = /* @__PURE__ */ function() {
+                  function d(L, F) {
+                    for (var M = 0; M < F.length; M++) {
+                      var P = F[M];
+                      P.enumerable = P.enumerable || !1, P.configurable = !0, "value" in P && (P.writable = !0), Object.defineProperty(L, P.key, P);
+                    }
+                  }
+                  return function(L, F, M) {
+                    return F && d(L.prototype, F), M && d(L, M), L;
+                  };
+                }();
+                function n(d, L) {
+                  if (!(d instanceof L))
+                    throw new TypeError("Cannot call a class as a function");
+                }
+                var y = e(658), t = e(548), h = e(657), o = h.spectralLayout, c = e(816), l = 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)
+                  // - 'proof' improves the quality with subsequent CoSE layout (slow cooling rate) 
+                  quality: "default",
+                  // Use random node positions at beginning of layout
+                  // if this is set to false, then quality option must be "proof"
+                  randomize: !0,
+                  // Whether or not to animate the layout
+                  animate: !0,
+                  // Duration of animation in ms, if enabled
+                  animationDuration: 1e3,
+                  // Easing of animation, if enabled
+                  animationEasing: void 0,
+                  // Fit the viewport to the repositioned nodes
+                  fit: !0,
+                  // Padding around layout
+                  padding: 30,
+                  // Whether to include labels in node dimensions. Valid in "proof" quality
+                  nodeDimensionsIncludeLabels: !1,
+                  // Whether or not simple nodes (non-compound nodes) are of uniform dimensions
+                  uniformNodeDimensions: !1,
+                  // Whether to pack disconnected components - valid only if randomize: true
+                  packComponents: !0,
+                  // Layout step - all, transformed, enforced, cose - for debug purpose only
+                  step: "all",
+                  /* spectral layout options */
+                  // False for random, true for greedy
+                  samplingType: !0,
+                  // Sample size to construct distance matrix
+                  sampleSize: 25,
+                  // Separation amount between nodes
+                  nodeSeparation: 75,
+                  // Power iteration tolerance
+                  piTol: 1e-7,
+                  /* CoSE layout options */
+                  // Node repulsion (non overlapping) multiplier
+                  nodeRepulsion: function(L) {
+                    return 4500;
+                  },
+                  // Ideal edge (non nested) length
+                  idealEdgeLength: function(L) {
+                    return 50;
+                  },
+                  // Divisor to compute edge forces
+                  edgeElasticity: function(L) {
+                    return 0.45;
+                  },
+                  // Nesting factor (multiplier) to compute ideal edge length for nested edges
+                  nestingFactor: 0.1,
+                  // Gravity force (constant)
+                  gravity: 0.25,
+                  // Maximum number of iterations to perform
+                  numIter: 2500,
+                  // For enabling tiling
+                  tile: !0,
+                  // The function that specifies the criteria for comparing nodes while sorting them during tiling operation.
+                  // Takes the node id as a parameter and the default tiling operation is perfomed when this option is not set.
+                  tilingCompareBy: void 0,
+                  // Represents the amount of the vertical space to put between the zero degree members during the tiling operation(can also be a function)
+                  tilingPaddingVertical: 10,
+                  // Represents the amount of the horizontal space to put between the zero degree members during the tiling operation(can also be a function)
+                  tilingPaddingHorizontal: 10,
+                  // Gravity range (constant) for compounds
+                  gravityRangeCompound: 1.5,
+                  // Gravity force (constant) for compounds
+                  gravityCompound: 1,
+                  // Gravity range (constant)
+                  gravityRange: 3.8,
+                  // Initial cooling factor for incremental layout  
+                  initialEnergyOnIncremental: 0.3,
+                  /* constraint options */
+                  // Fix required nodes to predefined positions
+                  // [{nodeId: 'n1', position: {x: 100, y: 200}, {...}]
+                  fixedNodeConstraint: void 0,
+                  // Align required nodes in vertical/horizontal direction
+                  // {vertical: [['n1', 'n2')], ['n3', 'n4']], horizontal: ['n2', 'n4']}
+                  alignmentConstraint: void 0,
+                  // Place two nodes relatively in vertical/horizontal direction 
+                  // [{top: 'n1', bottom: 'n2', gap: 100}, {left: 'n3', right: 'n4', gap: 75}]
+                  relativePlacementConstraint: void 0,
+                  /* layout event callbacks */
+                  ready: function() {
+                  },
+                  // on layoutready
+                  stop: function() {
+                  }
+                  // on layoutstop
+                }), g = function() {
+                  function d(L) {
+                    n(this, d), this.options = y({}, T, L);
+                  }
+                  return f(d, [{
+                    key: "run",
+                    value: function() {
+                      var F = this, M = this.options, P = M.cy, J = M.eles, V = [], Q = [], D = void 0, rt = [];
+                      M.fixedNodeConstraint && (!Array.isArray(M.fixedNodeConstraint) || M.fixedNodeConstraint.length == 0) && (M.fixedNodeConstraint = void 0), M.alignmentConstraint && (M.alignmentConstraint.vertical && (!Array.isArray(M.alignmentConstraint.vertical) || M.alignmentConstraint.vertical.length == 0) && (M.alignmentConstraint.vertical = void 0), M.alignmentConstraint.horizontal && (!Array.isArray(M.alignmentConstraint.horizontal) || M.alignmentConstraint.horizontal.length == 0) && (M.alignmentConstraint.horizontal = void 0)), M.relativePlacementConstraint && (!Array.isArray(M.relativePlacementConstraint) || M.relativePlacementConstraint.length == 0) && (M.relativePlacementConstraint = void 0);
+                      var a = M.fixedNodeConstraint || M.alignmentConstraint || M.relativePlacementConstraint;
+                      a && (M.tile = !1, M.packComponents = !1);
+                      var m = void 0, v = !1;
+                      if (P.layoutUtilities && M.packComponents && (m = P.layoutUtilities("get"), m || (m = P.layoutUtilities()), v = !0), J.nodes().length > 0)
+                        if (v) {
+                          var I = t.getTopMostNodes(M.eles.nodes());
+                          if (D = t.connectComponents(P, M.eles, I), D.forEach(function(vt) {
+                            var it = vt.boundingBox();
+                            rt.push({ x: it.x1 + it.w / 2, y: it.y1 + it.h / 2 });
+                          }), M.randomize && D.forEach(function(vt) {
+                            M.eles = vt, V.push(o(M));
+                          }), M.quality == "default" || M.quality == "proof") {
+                            var w = P.collection();
+                            if (M.tile) {
+                              var R = /* @__PURE__ */ new Map(), H = [], x = [], k = 0, W = { nodeIndexes: R, xCoords: H, yCoords: x }, U = [];
+                              if (D.forEach(function(vt, it) {
+                                vt.edges().length == 0 && (vt.nodes().forEach(function(gt, Tt) {
+                                  w.merge(vt.nodes()[Tt]), gt.isParent() || (W.nodeIndexes.set(vt.nodes()[Tt].id(), k++), W.xCoords.push(vt.nodes()[0].position().x), W.yCoords.push(vt.nodes()[0].position().y));
+                                }), U.push(it));
+                              }), w.length > 1) {
+                                var et = w.boundingBox();
+                                rt.push({ x: et.x1 + et.w / 2, y: et.y1 + et.h / 2 }), D.push(w), V.push(W);
+                                for (var z = U.length - 1; z >= 0; z--)
+                                  D.splice(U[z], 1), V.splice(U[z], 1), rt.splice(U[z], 1);
+                              }
+                            }
+                            D.forEach(function(vt, it) {
+                              M.eles = vt, Q.push(l(M, V[it])), t.relocateComponent(rt[it], Q[it], M);
+                            });
+                          } else
+                            D.forEach(function(vt, it) {
+                              t.relocateComponent(rt[it], V[it], M);
+                            });
+                          var O = /* @__PURE__ */ new Set();
+                          if (D.length > 1) {
+                            var X = [], B = J.filter(function(vt) {
+                              return vt.css("display") == "none";
+                            });
+                            D.forEach(function(vt, it) {
+                              var gt = void 0;
+                              if (M.quality == "draft" && (gt = V[it].nodeIndexes), vt.nodes().not(B).length > 0) {
+                                var Tt = {};
+                                Tt.edges = [], Tt.nodes = [];
+                                var At = void 0;
+                                vt.nodes().not(B).forEach(function(Dt) {
+                                  if (M.quality == "draft")
+                                    if (!Dt.isParent())
+                                      At = gt.get(Dt.id()), Tt.nodes.push({ x: V[it].xCoords[At] - Dt.boundingbox().w / 2, y: V[it].yCoords[At] - Dt.boundingbox().h / 2, width: Dt.boundingbox().w, height: Dt.boundingbox().h });
+                                    else {
+                                      var mt = t.calcBoundingBox(Dt, V[it].xCoords, V[it].yCoords, gt);
+                                      Tt.nodes.push({ x: mt.topLeftX, y: mt.topLeftY, width: mt.width, height: mt.height });
+                                    }
+                                  else
+                                    Q[it][Dt.id()] && Tt.nodes.push({ x: Q[it][Dt.id()].getLeft(), y: Q[it][Dt.id()].getTop(), width: Q[it][Dt.id()].getWidth(), height: Q[it][Dt.id()].getHeight() });
+                                }), vt.edges().forEach(function(Dt) {
+                                  var mt = Dt.source(), xt = Dt.target();
+                                  if (mt.css("display") != "none" && xt.css("display") != "none")
+                                    if (M.quality == "draft") {
+                                      var St = gt.get(mt.id()), Vt = gt.get(xt.id()), Xt = [], Ut = [];
+                                      if (mt.isParent()) {
+                                        var bt = t.calcBoundingBox(mt, V[it].xCoords, V[it].yCoords, gt);
+                                        Xt.push(bt.topLeftX + bt.width / 2), Xt.push(bt.topLeftY + bt.height / 2);
+                                      } else
+                                        Xt.push(V[it].xCoords[St]), Xt.push(V[it].yCoords[St]);
+                                      if (xt.isParent()) {
+                                        var Ht = t.calcBoundingBox(xt, V[it].xCoords, V[it].yCoords, gt);
+                                        Ut.push(Ht.topLeftX + Ht.width / 2), Ut.push(Ht.topLeftY + Ht.height / 2);
+                                      } else
+                                        Ut.push(V[it].xCoords[Vt]), Ut.push(V[it].yCoords[Vt]);
+                                      Tt.edges.push({ startX: Xt[0], startY: Xt[1], endX: Ut[0], endY: Ut[1] });
+                                    } else
+                                      Q[it][mt.id()] && Q[it][xt.id()] && Tt.edges.push({ startX: Q[it][mt.id()].getCenterX(), startY: Q[it][mt.id()].getCenterY(), endX: Q[it][xt.id()].getCenterX(), endY: Q[it][xt.id()].getCenterY() });
+                                }), Tt.nodes.length > 0 && (X.push(Tt), O.add(it));
+                              }
+                            });
+                            var _ = m.packComponents(X, M.randomize).shifts;
+                            if (M.quality == "draft")
+                              V.forEach(function(vt, it) {
+                                var gt = vt.xCoords.map(function(At) {
+                                  return At + _[it].dx;
+                                }), Tt = vt.yCoords.map(function(At) {
+                                  return At + _[it].dy;
+                                });
+                                vt.xCoords = gt, vt.yCoords = Tt;
+                              });
+                            else {
+                              var lt = 0;
+                              O.forEach(function(vt) {
+                                Object.keys(Q[vt]).forEach(function(it) {
+                                  var gt = Q[vt][it];
+                                  gt.setCenter(gt.getCenterX() + _[lt].dx, gt.getCenterY() + _[lt].dy);
+                                }), lt++;
+                              });
+                            }
+                          }
+                        } else {
+                          var E = M.eles.boundingBox();
+                          if (rt.push({ x: E.x1 + E.w / 2, y: E.y1 + E.h / 2 }), M.randomize) {
+                            var p = o(M);
+                            V.push(p);
+                          }
+                          M.quality == "default" || M.quality == "proof" ? (Q.push(l(M, V[0])), t.relocateComponent(rt[0], Q[0], M)) : t.relocateComponent(rt[0], V[0], M);
+                        }
+                      var q = function(it, gt) {
+                        if (M.quality == "default" || M.quality == "proof") {
+                          typeof it == "number" && (it = gt);
+                          var Tt = void 0, At = void 0, Dt = it.data("id");
+                          return Q.forEach(function(xt) {
+                            Dt in xt && (Tt = { x: xt[Dt].getRect().getCenterX(), y: xt[Dt].getRect().getCenterY() }, At = xt[Dt]);
+                          }), M.nodeDimensionsIncludeLabels && (At.labelWidth && (At.labelPosHorizontal == "left" ? Tt.x += At.labelWidth / 2 : At.labelPosHorizontal == "right" && (Tt.x -= At.labelWidth / 2)), At.labelHeight && (At.labelPosVertical == "top" ? Tt.y += At.labelHeight / 2 : At.labelPosVertical == "bottom" && (Tt.y -= At.labelHeight / 2))), Tt == null && (Tt = { x: it.position("x"), y: it.position("y") }), {
+                            x: Tt.x,
+                            y: Tt.y
+                          };
+                        } else {
+                          var mt = void 0;
+                          return V.forEach(function(xt) {
+                            var St = xt.nodeIndexes.get(it.id());
+                            St != null && (mt = { x: xt.xCoords[St], y: xt.yCoords[St] });
+                          }), mt == null && (mt = { x: it.position("x"), y: it.position("y") }), {
+                            x: mt.x,
+                            y: mt.y
+                          };
+                        }
+                      };
+                      if (M.quality == "default" || M.quality == "proof" || M.randomize) {
+                        var Rt = t.calcParentsWithoutChildren(P, J), Lt = J.filter(function(vt) {
+                          return vt.css("display") == "none";
+                        });
+                        M.eles = J.not(Lt), J.nodes().not(":parent").not(Lt).layoutPositions(F, M, q), Rt.length > 0 && Rt.forEach(function(vt) {
+                          vt.position(q(vt));
+                        });
+                      } else
+                        console.log("If randomize option is set to false, then quality option must be 'default' or 'proof'.");
+                    }
+                  }]), d;
+                }();
+                i.exports = g;
+              }
+            ),
+            /***/
+            657: (
+              /***/
+              (i, r, e) => {
+                var f = e(548), n = e(140).layoutBase.Matrix, y = e(140).layoutBase.SVD, t = function(o) {
+                  var c = o.cy, l = o.eles, T = l.nodes(), g = l.nodes(":parent"), d = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), M = [], P = [], J = [], V = [], Q = [], D = [], rt = [], a = [], m = void 0, v = 1e8, E = 1e-9, p = o.piTol, I = o.samplingType, w = o.nodeSeparation, R = void 0, H = function() {
+                    for (var b = 0, $ = 0, K = !1; $ < R; ) {
+                      b = Math.floor(Math.random() * m), K = !1;
+                      for (var Z = 0; Z < $; Z++)
+                        if (V[Z] == b) {
+                          K = !0;
+                          break;
+                        }
+                      if (!K)
+                        V[$] = b, $++;
+                      else
+                        continue;
+                    }
+                  }, x = function(b, $, K) {
+                    for (var Z = [], nt = 0, ut = 0, ot = 0, tt = void 0, j = [], dt = 0, wt = 1, yt = 0; yt < m; yt++)
+                      j[yt] = v;
+                    for (Z[ut] = b, j[b] = 0; ut >= nt; ) {
+                      ot = Z[nt++];
+                      for (var It = M[ot], ft = 0; ft < It.length; ft++)
+                        tt = L.get(It[ft]), j[tt] == v && (j[tt] = j[ot] + 1, Z[++ut] = tt);
+                      D[ot][$] = j[ot] * w;
+                    }
+                    if (K) {
+                      for (var st = 0; st < m; st++)
+                        D[st][$] < Q[st] && (Q[st] = D[st][$]);
+                      for (var Ct = 0; Ct < m; Ct++)
+                        Q[Ct] > dt && (dt = Q[Ct], wt = Ct);
+                    }
+                    return wt;
+                  }, k = function(b) {
+                    var $ = void 0;
+                    if (b) {
+                      $ = Math.floor(Math.random() * m);
+                      for (var Z = 0; Z < m; Z++)
+                        Q[Z] = v;
+                      for (var nt = 0; nt < R; nt++)
+                        V[nt] = $, $ = x($, nt, b);
+                    } else {
+                      H();
+                      for (var K = 0; K < R; K++)
+                        x(V[K], K, b);
+                    }
+                    for (var ut = 0; ut < m; ut++)
+                      for (var ot = 0; ot < R; ot++)
+                        D[ut][ot] *= D[ut][ot];
+                    for (var tt = 0; tt < R; tt++)
+                      rt[tt] = [];
+                    for (var j = 0; j < R; j++)
+                      for (var dt = 0; dt < R; dt++)
+                        rt[j][dt] = D[V[dt]][j];
+                  }, W = function() {
+                    for (var b = y.svd(rt), $ = b.S, K = b.U, Z = b.V, nt = $[0] * $[0] * $[0], ut = [], ot = 0; ot < R; ot++) {
+                      ut[ot] = [];
+                      for (var tt = 0; tt < R; tt++)
+                        ut[ot][tt] = 0, ot == tt && (ut[ot][tt] = $[ot] / ($[ot] * $[ot] + nt / ($[ot] * $[ot])));
+                    }
+                    a = n.multMat(n.multMat(Z, ut), n.transpose(K));
+                  }, U = function() {
+                    for (var b = void 0, $ = void 0, K = [], Z = [], nt = [], ut = [], ot = 0; ot < m; ot++)
+                      K[ot] = Math.random(), Z[ot] = Math.random();
+                    K = n.normalize(K), Z = n.normalize(Z);
+                    for (var tt = E, j = E, dt = void 0; ; ) {
+                      for (var wt = 0; wt < m; wt++)
+                        nt[wt] = K[wt];
+                      if (K = n.multGamma(n.multL(n.multGamma(nt), D, a)), b = n.dotProduct(nt, K), K = n.normalize(K), tt = n.dotProduct(nt, K), dt = Math.abs(tt / j), dt <= 1 + p && dt >= 1)
+                        break;
+                      j = tt;
+                    }
+                    for (var yt = 0; yt < m; yt++)
+                      nt[yt] = K[yt];
+                    for (j = E; ; ) {
+                      for (var It = 0; It < m; It++)
+                        ut[It] = Z[It];
+                      if (ut = n.minusOp(ut, n.multCons(nt, n.dotProduct(nt, ut))), Z = n.multGamma(n.multL(n.multGamma(ut), D, a)), $ = n.dotProduct(ut, Z), Z = n.normalize(Z), tt = n.dotProduct(ut, Z), dt = Math.abs(tt / j), dt <= 1 + p && dt >= 1)
+                        break;
+                      j = tt;
+                    }
+                    for (var ft = 0; ft < m; ft++)
+                      ut[ft] = Z[ft];
+                    P = n.multCons(nt, Math.sqrt(Math.abs(b))), J = n.multCons(ut, Math.sqrt(Math.abs($)));
+                  };
+                  f.connectComponents(c, l, f.getTopMostNodes(T), d), g.forEach(function(S) {
+                    f.connectComponents(c, l, f.getTopMostNodes(S.descendants().intersection(l)), d);
+                  });
+                  for (var et = 0, z = 0; z < T.length; z++)
+                    T[z].isParent() || L.set(T[z].id(), et++);
+                  var O = !0, X = !1, B = void 0;
+                  try {
+                    for (var _ = d.keys()[Symbol.iterator](), lt; !(O = (lt = _.next()).done); O = !0) {
+                      var q = lt.value;
+                      L.set(q, et++);
+                    }
+                  } catch (S) {
+                    X = !0, B = S;
+                  } finally {
+                    try {
+                      !O && _.return && _.return();
+                    } finally {
+                      if (X)
+                        throw B;
+                    }
+                  }
+                  for (var Rt = 0; Rt < L.size; Rt++)
+                    M[Rt] = [];
+                  g.forEach(function(S) {
+                    for (var b = S.children().intersection(l); b.nodes(":childless").length == 0; )
+                      b = b.nodes()[0].children().intersection(l);
+                    var $ = 0, K = b.nodes(":childless")[0].connectedEdges().length;
+                    b.nodes(":childless").forEach(function(Z, nt) {
+                      Z.connectedEdges().length < K && (K = Z.connectedEdges().length, $ = nt);
+                    }), F.set(S.id(), b.nodes(":childless")[$].id());
+                  }), T.forEach(function(S) {
+                    var b = void 0;
+                    S.isParent() ? b = L.get(F.get(S.id())) : b = L.get(S.id()), S.neighborhood().nodes().forEach(function($) {
+                      l.intersection(S.edgesWith($)).length > 0 && ($.isParent() ? M[b].push(F.get($.id())) : M[b].push($.id()));
+                    });
+                  });
+                  var Lt = function(b) {
+                    var $ = L.get(b), K = void 0;
+                    d.get(b).forEach(function(Z) {
+                      c.getElementById(Z).isParent() ? K = F.get(Z) : K = Z, M[$].push(K), M[L.get(K)].push(b);
+                    });
+                  }, vt = !0, it = !1, gt = void 0;
+                  try {
+                    for (var Tt = d.keys()[Symbol.iterator](), At; !(vt = (At = Tt.next()).done); vt = !0) {
+                      var Dt = At.value;
+                      Lt(Dt);
+                    }
+                  } catch (S) {
+                    it = !0, gt = S;
+                  } finally {
+                    try {
+                      !vt && Tt.return && Tt.return();
+                    } finally {
+                      if (it)
+                        throw gt;
+                    }
+                  }
+                  m = L.size;
+                  var mt = void 0;
+                  if (m > 2) {
+                    R = m < o.sampleSize ? m : o.sampleSize;
+                    for (var xt = 0; xt < m; xt++)
+                      D[xt] = [];
+                    for (var St = 0; St < R; St++)
+                      a[St] = [];
+                    return o.quality == "draft" || o.step == "all" ? (k(I), W(), U(), mt = { nodeIndexes: L, xCoords: P, yCoords: J }) : (L.forEach(function(S, b) {
+                      P.push(c.getElementById(b).position("x")), J.push(c.getElementById(b).position("y"));
+                    }), mt = { nodeIndexes: L, xCoords: P, yCoords: J }), mt;
+                  } else {
+                    var Vt = L.keys(), Xt = c.getElementById(Vt.next().value), Ut = Xt.position(), bt = Xt.outerWidth();
+                    if (P.push(Ut.x), J.push(Ut.y), m == 2) {
+                      var Ht = c.getElementById(Vt.next().value), Bt = Ht.outerWidth();
+                      P.push(Ut.x + bt / 2 + Bt / 2 + o.idealEdgeLength), J.push(Ut.y);
+                    }
+                    return mt = { nodeIndexes: L, xCoords: P, yCoords: J }, mt;
+                  }
+                };
+                i.exports = { spectralLayout: t };
+              }
+            ),
+            /***/
+            579: (
+              /***/
+              (i, r, e) => {
+                var f = e(212), n = function(t) {
+                  t && t("layout", "fcose", f);
+                };
+                typeof cytoscape < "u" && n(cytoscape), i.exports = n;
+              }
+            ),
+            /***/
+            140: (
+              /***/
+              (i) => {
+                i.exports = A;
+              }
+            )
+            /******/
+          }, N = {};
+          function u(i) {
+            var r = N[i];
+            if (r !== void 0)
+              return r.exports;
+            var e = N[i] = {
+              /******/
+              // no module.id needed
+              /******/
+              // no module.loaded needed
+              /******/
+              exports: {}
+              /******/
+            };
+            return G[i](e, e.exports, u), e.exports;
+          }
+          var s = u(579);
+          return s;
+        })()
+      );
+    });
+  }(le)), le.exports;
+}
+var pr = vr();
+const yr = /* @__PURE__ */ lr(pr);
+var Ie = {
+  L: "left",
+  R: "right",
+  T: "top",
+  B: "bottom"
+}, Re = {
+  L: /* @__PURE__ */ at((C) => `${C},${C / 2} 0,${C} 0,0`, "L"),
+  R: /* @__PURE__ */ at((C) => `0,${C / 2} ${C},0 ${C},${C}`, "R"),
+  T: /* @__PURE__ */ at((C) => `0,0 ${C},0 ${C / 2},${C}`, "T"),
+  B: /* @__PURE__ */ at((C) => `${C / 2},0 ${C},${C} 0,${C}`, "B")
+}, he = {
+  L: /* @__PURE__ */ at((C, Y) => C - Y + 2, "L"),
+  R: /* @__PURE__ */ at((C, Y) => C - 2, "R"),
+  T: /* @__PURE__ */ at((C, Y) => C - Y + 2, "T"),
+  B: /* @__PURE__ */ at((C, Y) => C - 2, "B")
+}, Er = /* @__PURE__ */ at(function(C) {
+  return zt(C) ? C === "L" ? "R" : "L" : C === "T" ? "B" : "T";
+}, "getOppositeArchitectureDirection"), Se = /* @__PURE__ */ at(function(C) {
+  const Y = C;
+  return Y === "L" || Y === "R" || Y === "T" || Y === "B";
+}, "isArchitectureDirection"), zt = /* @__PURE__ */ at(function(C) {
+  const Y = C;
+  return Y === "L" || Y === "R";
+}, "isArchitectureDirectionX"), Qt = /* @__PURE__ */ at(function(C) {
+  const Y = C;
+  return Y === "T" || Y === "B";
+}, "isArchitectureDirectionY"), Pe = /* @__PURE__ */ at(function(C, Y) {
+  const A = zt(C) && Qt(Y), G = Qt(C) && zt(Y);
+  return A || G;
+}, "isArchitectureDirectionXY"), mr = /* @__PURE__ */ at(function(C) {
+  const Y = C[0], A = C[1], G = zt(Y) && Qt(A), N = Qt(Y) && zt(A);
+  return G || N;
+}, "isArchitecturePairXY"), Tr = /* @__PURE__ */ at(function(C) {
+  return C !== "LL" && C !== "RR" && C !== "TT" && C !== "BB";
+}, "isValidArchitectureDirectionPair"), Te = /* @__PURE__ */ at(function(C, Y) {
+  const A = `${C}${Y}`;
+  return Tr(A) ? A : void 0;
+}, "getArchitectureDirectionPair"), Nr = /* @__PURE__ */ at(function([C, Y], A) {
+  const G = A[0], N = A[1];
+  return zt(G) ? Qt(N) ? [C + (G === "L" ? -1 : 1), Y + (N === "T" ? 1 : -1)] : [C + (G === "L" ? -1 : 1), Y] : zt(N) ? [C + (N === "L" ? 1 : -1), Y + (G === "T" ? 1 : -1)] : [C, Y + (G === "T" ? 1 : -1)];
+}, "shiftPositionByArchitectureDirectionPair"), Lr = /* @__PURE__ */ at(function(C) {
+  return C === "LT" || C === "TL" ? [1, 1] : C === "BL" || C === "LB" ? [1, -1] : C === "BR" || C === "RB" ? [-1, -1] : [-1, 1];
+}, "getArchitectureDirectionXYFactors"), Cr = /* @__PURE__ */ at(function(C) {
+  return C.type === "service";
+}, "isArchitectureService"), Mr = /* @__PURE__ */ at(function(C) {
+  return C.type === "junction";
+}, "isArchitectureJunction"), Ge = /* @__PURE__ */ at((C) => C.data(), "edgeData"), ae = /* @__PURE__ */ at((C) => C.data(), "nodeData"), Ue = ke.architecture, pt = new sr(() => ({
+  nodes: {},
+  groups: {},
+  edges: [],
+  registeredIds: {},
+  config: Ue,
+  dataStructures: void 0,
+  elements: {}
+})), Ar = /* @__PURE__ */ at(() => {
+  pt.reset(), ir();
+}, "clear"), wr = /* @__PURE__ */ at(function({
+  id: C,
+  icon: Y,
+  in: A,
+  title: G,
+  iconText: N
+}) {
+  if (pt.records.registeredIds[C] !== void 0)
+    throw new Error(
+      `The service id [${C}] is already in use by another ${pt.records.registeredIds[C]}`
+    );
+  if (A !== void 0) {
+    if (C === A)
+      throw new Error(`The service [${C}] cannot be placed within itself`);
+    if (pt.records.registeredIds[A] === void 0)
+      throw new Error(
+        `The service [${C}]'s parent does not exist. Please make sure the parent is created before this service`
+      );
+    if (pt.records.registeredIds[A] === "node")
+      throw new Error(`The service [${C}]'s parent is not a group`);
+  }
+  pt.records.registeredIds[C] = "node", pt.records.nodes[C] = {
+    id: C,
+    type: "service",
+    icon: Y,
+    iconText: N,
+    title: G,
+    edges: [],
+    in: A
+  };
+}, "addService"), Or = /* @__PURE__ */ at(() => Object.values(pt.records.nodes).filter(Cr), "getServices"), Dr = /* @__PURE__ */ at(function({ id: C, in: Y }) {
+  pt.records.registeredIds[C] = "node", pt.records.nodes[C] = {
+    id: C,
+    type: "junction",
+    edges: [],
+    in: Y
+  };
+}, "addJunction"), xr = /* @__PURE__ */ at(() => Object.values(pt.records.nodes).filter(Mr), "getJunctions"), Ir = /* @__PURE__ */ at(() => Object.values(pt.records.nodes), "getNodes"), Rr = /* @__PURE__ */ at((C) => pt.records.nodes[C], "getNode"), Sr = /* @__PURE__ */ at(function({ id: C, icon: Y, in: A, title: G }) {
+  if (pt.records.registeredIds[C] !== void 0)
+    throw new Error(
+      `The group id [${C}] is already in use by another ${pt.records.registeredIds[C]}`
+    );
+  if (A !== void 0) {
+    if (C === A)
+      throw new Error(`The group [${C}] cannot be placed within itself`);
+    if (pt.records.registeredIds[A] === void 0)
+      throw new Error(
+        `The group [${C}]'s parent does not exist. Please make sure the parent is created before this group`
+      );
+    if (pt.records.registeredIds[A] === "node")
+      throw new Error(`The group [${C}]'s parent is not a group`);
+  }
+  pt.records.registeredIds[C] = "group", pt.records.groups[C] = {
+    id: C,
+    icon: Y,
+    title: G,
+    in: A
+  };
+}, "addGroup"), Fr = /* @__PURE__ */ at(() => Object.values(pt.records.groups), "getGroups"), br = /* @__PURE__ */ at(function({
+  lhsId: C,
+  rhsId: Y,
+  lhsDir: A,
+  rhsDir: G,
+  lhsInto: N,
+  rhsInto: u,
+  lhsGroup: s,
+  rhsGroup: i,
+  title: r
+}) {
+  if (!Se(A))
+    throw new Error(
+      `Invalid direction given for left hand side of edge ${C}--${Y}. Expected (L,R,T,B) got ${A}`
+    );
+  if (!Se(G))
+    throw new Error(
+      `Invalid direction given for right hand side of edge ${C}--${Y}. Expected (L,R,T,B) got ${G}`
+    );
+  if (pt.records.nodes[C] === void 0 && pt.records.groups[C] === void 0)
+    throw new Error(
+      `The left-hand id [${C}] does not yet exist. Please create the service/group before declaring an edge to it.`
+    );
+  if (pt.records.nodes[Y] === void 0 && pt.records.groups[C] === void 0)
+    throw new Error(
+      `The right-hand id [${Y}] does not yet exist. Please create the service/group before declaring an edge to it.`
+    );
+  const e = pt.records.nodes[C].in, f = pt.records.nodes[Y].in;
+  if (s && e && f && e == f)
+    throw new Error(
+      `The left-hand id [${C}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
+    );
+  if (i && e && f && e == f)
+    throw new Error(
+      `The right-hand id [${Y}] is modified to traverse the group boundary, but the edge does not pass through two groups.`
+    );
+  const n = {
+    lhsId: C,
+    lhsDir: A,
+    lhsInto: N,
+    lhsGroup: s,
+    rhsId: Y,
+    rhsDir: G,
+    rhsInto: u,
+    rhsGroup: i,
+    title: r
+  };
+  pt.records.edges.push(n), pt.records.nodes[C] && pt.records.nodes[Y] && (pt.records.nodes[C].edges.push(pt.records.edges[pt.records.edges.length - 1]), pt.records.nodes[Y].edges.push(pt.records.edges[pt.records.edges.length - 1]));
+}, "addEdge"), Pr = /* @__PURE__ */ at(() => pt.records.edges, "getEdges"), Gr = /* @__PURE__ */ at(() => {
+  if (pt.records.dataStructures === void 0) {
+    const C = Object.entries(pt.records.nodes).reduce((s, [i, r]) => (s[i] = r.edges.reduce((e, f) => {
+      if (f.lhsId === i) {
+        const n = Te(f.lhsDir, f.rhsDir);
+        n && (e[n] = f.rhsId);
+      } else {
+        const n = Te(f.rhsDir, f.lhsDir);
+        n && (e[n] = f.lhsId);
+      }
+      return e;
+    }, {}), s), {}), Y = Object.keys(C)[0], A = { [Y]: 1 }, G = Object.keys(C).reduce(
+      (s, i) => i === Y ? s : { ...s, [i]: 1 },
+      {}
+    ), N = /* @__PURE__ */ at((s) => {
+      const i = { [s]: [0, 0] }, r = [s];
+      for (; r.length > 0; ) {
+        const e = r.shift();
+        if (e) {
+          A[e] = 1, delete G[e];
+          const f = C[e], [n, y] = i[e];
+          Object.entries(f).forEach(([t, h]) => {
+            A[h] || (i[h] = Nr(
+              [n, y],
+              t
+            ), r.push(h));
+          });
+        }
+      }
+      return i;
+    }, "BFS"), u = [N(Y)];
+    for (; Object.keys(G).length > 0; )
+      u.push(N(Object.keys(G)[0]));
+    pt.records.dataStructures = {
+      adjList: C,
+      spatialMaps: u
+    };
+  }
+  return pt.records.dataStructures;
+}, "getDataStructures"), Ur = /* @__PURE__ */ at((C, Y) => {
+  pt.records.elements[C] = Y;
+}, "setElementForId"), Yr = /* @__PURE__ */ at((C) => pt.records.elements[C], "getElementById"), ue = {
+  clear: Ar,
+  setDiagramTitle: Qe,
+  getDiagramTitle: Ke,
+  setAccTitle: je,
+  getAccTitle: _e,
+  setAccDescription: tr,
+  getAccDescription: er,
+  addService: wr,
+  getServices: Or,
+  addJunction: Dr,
+  getJunctions: xr,
+  getNodes: Ir,
+  getNode: Rr,
+  addGroup: Sr,
+  getGroups: Fr,
+  addEdge: br,
+  getEdges: Pr,
+  setElementForId: Ur,
+  getElementById: Yr,
+  getDataStructures: Gr
+};
+function Pt(C) {
+  const Y = ge().architecture;
+  return Y != null && Y[C] ? Y[C] : Ue[C];
+}
+at(Pt, "getConfigField");
+var Xr = /* @__PURE__ */ at((C, Y) => {
+  or(C, Y), C.groups.map(Y.addGroup), C.services.map((A) => Y.addService({ ...A, type: "service" })), C.junctions.map((A) => Y.addJunction({ ...A, type: "junction" })), C.edges.map(Y.addEdge);
+}, "populateDb"), Hr = {
+  parse: /* @__PURE__ */ at(async (C) => {
+    const Y = await hr("architecture", C);
+    Fe.debug(Y), Xr(Y, ue);
+  }, "parse")
+}, Wr = /* @__PURE__ */ at((C) => `
+  .edge {
+    stroke-width: ${C.archEdgeWidth};
+    stroke: ${C.archEdgeColor};
+    fill: none;
+  }
+
+  .arrow {
+    fill: ${C.archEdgeArrowColor};
+  }
+
+  .node-bkg {
+    fill: none;
+    stroke: ${C.archGroupBorderColor};
+    stroke-width: ${C.archGroupBorderWidth};
+    stroke-dasharray: 8;
+  }
+  .node-icon-text {
+    display: flex; 
+    align-items: center;
+  }
+  
+  .node-icon-text > div {
+    color: #fff;
+    margin: 1px;
+    height: fit-content;
+    text-align: center;
+    overflow: hidden;
+    display: -webkit-box;
+    -webkit-box-orient: vertical;
+  }
+`, "getStyles"), Vr = Wr, ne = /* @__PURE__ */ at((C) => `<g><rect width="80" height="80" style="fill: #087ebf; stroke-width: 0px;"/>${C}</g>`, "wrapIcon"), oe = {
+  prefix: "mermaid-architecture",
+  height: 80,
+  width: 80,
+  icons: {
+    database: {
+      body: ne(
+        '<path id="b" data-name="4" d="m20,57.86c0,3.94,8.95,7.14,20,7.14s20-3.2,20-7.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><path id="c" data-name="3" d="m20,45.95c0,3.94,8.95,7.14,20,7.14s20-3.2,20-7.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><path id="d" data-name="2" d="m20,34.05c0,3.94,8.95,7.14,20,7.14s20-3.2,20-7.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse id="e" data-name="1" cx="40" cy="22.14" rx="20" ry="7.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="20" y1="57.86" x2="20" y2="22.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="60" y1="57.86" x2="60" y2="22.14" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
+      )
+    },
+    server: {
+      body: ne(
+        '<rect x="17.5" y="17.5" width="45" height="45" rx="2" ry="2" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="17.5" y1="32.5" x2="62.5" y2="32.5" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="17.5" y1="47.5" x2="62.5" y2="47.5" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><g><path d="m56.25,25c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: #fff; stroke-width: 0px;"/><path d="m56.25,25c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10;"/></g><g><path d="m56.25,40c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: #fff; stroke-width: 0px;"/><path d="m56.25,40c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10;"/></g><g><path d="m56.25,55c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: #fff; stroke-width: 0px;"/><path d="m56.25,55c0,.27-.45.5-1,.5h-10.5c-.55,0-1-.23-1-.5s.45-.5,1-.5h10.5c.55,0,1,.23,1,.5Z" style="fill: none; stroke: #fff; stroke-miterlimit: 10;"/></g><g><circle cx="32.5" cy="25" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="27.5" cy="25" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="22.5" cy="25" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/></g><g><circle cx="32.5" cy="40" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="27.5" cy="40" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="22.5" cy="40" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/></g><g><circle cx="32.5" cy="55" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="27.5" cy="55" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/><circle cx="22.5" cy="55" r=".75" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10;"/></g>'
+      )
+    },
+    disk: {
+      body: ne(
+        '<rect x="20" y="15" width="40" height="50" rx="1" ry="1" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="24" cy="19.17" rx=".8" ry=".83" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="56" cy="19.17" rx=".8" ry=".83" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="24" cy="60.83" rx=".8" ry=".83" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="56" cy="60.83" rx=".8" ry=".83" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="40" cy="33.75" rx="14" ry="14.58" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><ellipse cx="40" cy="33.75" rx="4" ry="4.17" style="fill: #fff; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><path d="m37.51,42.52l-4.83,13.22c-.26.71-1.1,1.02-1.76.64l-4.18-2.42c-.66-.38-.81-1.26-.33-1.84l9.01-10.8c.88-1.05,2.56-.08,2.09,1.2Z" style="fill: #fff; stroke-width: 0px;"/>'
+      )
+    },
+    internet: {
+      body: ne(
+        '<circle cx="40" cy="40" r="22.5" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="40" y1="17.5" x2="40" y2="62.5" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="17.5" y1="40" x2="62.5" y2="40" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><path d="m39.99,17.51c-15.28,11.1-15.28,33.88,0,44.98" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><path d="m40.01,17.51c15.28,11.1,15.28,33.88,0,44.98" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="19.75" y1="30.1" x2="60.25" y2="30.1" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/><line x1="19.75" y1="49.9" x2="60.25" y2="49.9" style="fill: none; stroke: #fff; stroke-miterlimit: 10; stroke-width: 2px;"/>'
+      )
+    },
+    cloud: {
+      body: ne(
+        '<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: qe,
+    blank: {
+      body: ne("")
+    }
+  }
+}, zr = /* @__PURE__ */ at(async function(C, Y) {
+  const A = Pt("padding"), G = Pt("iconSize"), N = G / 2, u = G / 6, s = u / 2;
+  await Promise.all(
+    Y.edges().map(async (i) => {
+      var P, J;
+      const {
+        source: r,
+        sourceDir: e,
+        sourceArrow: f,
+        sourceGroup: n,
+        target: y,
+        targetDir: t,
+        targetArrow: h,
+        targetGroup: o,
+        label: c
+      } = Ge(i);
+      let { x: l, y: T } = i[0].sourceEndpoint();
+      const { x: g, y: d } = i[0].midpoint();
+      let { x: L, y: F } = i[0].targetEndpoint();
+      const M = A + 4;
+      if (n && (zt(e) ? l += e === "L" ? -M : M : T += e === "T" ? -M : M + 18), o && (zt(t) ? L += t === "L" ? -M : M : F += t === "T" ? -M : M + 18), !n && ((P = ue.getNode(r)) == null ? void 0 : P.type) === "junction" && (zt(e) ? l += e === "L" ? N : -N : T += e === "T" ? N : -N), !o && ((J = ue.getNode(y)) == null ? void 0 : J.type) === "junction" && (zt(t) ? L += t === "L" ? N : -N : F += t === "T" ? N : -N), i[0]._private.rscratch) {
+        const V = C.insert("g");
+        if (V.insert("path").attr("d", `M ${l},${T} L ${g},${d} L${L},${F} `).attr("class", "edge"), f) {
+          const Q = zt(e) ? he[e](l, u) : l - s, D = Qt(e) ? he[e](T, u) : T - s;
+          V.insert("polygon").attr("points", Re[e](u)).attr("transform", `translate(${Q},${D})`).attr("class", "arrow");
+        }
+        if (h) {
+          const Q = zt(t) ? he[t](L, u) : L - s, D = Qt(t) ? he[t](F, u) : F - s;
+          V.insert("polygon").attr("points", Re[t](u)).attr("transform", `translate(${Q},${D})`).attr("class", "arrow");
+        }
+        if (c) {
+          const Q = Pe(e, t) ? "XY" : zt(e) ? "X" : "Y";
+          let D = 0;
+          Q === "X" ? D = Math.abs(l - L) : Q === "Y" ? D = Math.abs(T - F) / 1.5 : D = Math.abs(l - L) / 2;
+          const rt = V.append("g");
+          if (await Ne(
+            rt,
+            c,
+            {
+              useHtmlLabels: !1,
+              width: D,
+              classes: "architecture-service-label"
+            },
+            ge()
+          ), rt.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), Q === "X")
+            rt.attr("transform", "translate(" + g + ", " + d + ")");
+          else if (Q === "Y")
+            rt.attr("transform", "translate(" + g + ", " + d + ") rotate(-90)");
+          else if (Q === "XY") {
+            const a = Te(e, t);
+            if (a && mr(a)) {
+              const m = rt.node().getBoundingClientRect(), [v, E] = Lr(a);
+              rt.attr("dominant-baseline", "auto").attr("transform", `rotate(${-1 * v * E * 45})`);
+              const p = rt.node().getBoundingClientRect();
+              rt.attr(
+                "transform",
+                `
+                translate(${g}, ${d - m.height / 2})
+                translate(${v * p.width / 2}, ${E * p.height / 2})
+                rotate(${-1 * v * E * 45}, 0, ${m.height / 2})
+              `
+              );
+            }
+          }
+        }
+      }
+    })
+  );
+}, "drawEdges"), Br = /* @__PURE__ */ at(async function(C, Y) {
+  const G = Pt("padding") * 0.75, N = Pt("fontSize"), s = Pt("iconSize") / 2;
+  await Promise.all(
+    Y.nodes().map(async (i) => {
+      const r = ae(i);
+      if (r.type === "group") {
+        const { h: e, w: f, x1: n, y1: y } = i.boundingBox();
+        C.append("rect").attr("x", n + s).attr("y", y + s).attr("width", f).attr("height", e).attr("class", "node-bkg");
+        const t = C.append("g");
+        let h = n, o = y;
+        if (r.icon) {
+          const c = t.append("g");
+          c.html(
+            `<g>${await me(r.icon, { height: G, width: G, fallbackPrefix: oe.prefix })}</g>`
+          ), c.attr(
+            "transform",
+            "translate(" + (h + s + 1) + ", " + (o + s + 1) + ")"
+          ), h += G, o += N / 2 - 1 - 2;
+        }
+        if (r.label) {
+          const c = t.append("g");
+          await Ne(
+            c,
+            r.label,
+            {
+              useHtmlLabels: !1,
+              width: f,
+              classes: "architecture-service-label"
+            },
+            ge()
+          ), c.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "start").attr("text-anchor", "start"), c.attr(
+            "transform",
+            "translate(" + (h + s + 4) + ", " + (o + s + 2) + ")"
+          );
+        }
+      }
+    })
+  );
+}, "drawGroups"), $r = /* @__PURE__ */ at(async function(C, Y, A) {
+  for (const G of A) {
+    const N = Y.append("g"), u = Pt("iconSize");
+    if (G.title) {
+      const e = N.append("g");
+      await Ne(
+        e,
+        G.title,
+        {
+          useHtmlLabels: !1,
+          width: u * 1.5,
+          classes: "architecture-service-label"
+        },
+        ge()
+      ), e.attr("dy", "1em").attr("alignment-baseline", "middle").attr("dominant-baseline", "middle").attr("text-anchor", "middle"), e.attr("transform", "translate(" + u / 2 + ", " + u + ")");
+    }
+    const s = N.append("g");
+    if (G.icon)
+      s.html(
+        `<g>${await me(G.icon, { height: u, width: u, fallbackPrefix: oe.prefix })}</g>`
+      );
+    else if (G.iconText) {
+      s.html(
+        `<g>${await me("blank", { height: u, width: u, fallbackPrefix: oe.prefix })}</g>`
+      );
+      const n = s.append("g").append("foreignObject").attr("width", u).attr("height", u).append("div").attr("class", "node-icon-text").attr("style", `height: ${u}px;`).append("div").html(G.iconText), y = parseInt(
+        window.getComputedStyle(n.node(), null).getPropertyValue("font-size").replace(/\D/g, "")
+      ) ?? 16;
+      n.attr("style", `-webkit-line-clamp: ${Math.floor((u - 2) / y)};`);
+    } else
+      s.append("path").attr("class", "node-bkg").attr("id", "node-" + G.id).attr(
+        "d",
+        `M0 ${u} v${-u} q0,-5 5,-5 h${u} q5,0 5,5 v${u} H0 Z`
+      );
+    N.attr("class", "architecture-service");
+    const { width: i, height: r } = N._groups[0][0].getBBox();
+    G.width = i, G.height = r, C.setElementForId(G.id, N);
+  }
+  return 0;
+}, "drawServices"), Zr = /* @__PURE__ */ at(function(C, Y, A) {
+  A.forEach((G) => {
+    const N = Y.append("g"), u = Pt("iconSize");
+    N.append("g").append("rect").attr("id", "node-" + G.id).attr("fill-opacity", "0").attr("width", u).attr("height", u), N.attr("class", "architecture-junction");
+    const { width: i, height: r } = N._groups[0][0].getBBox();
+    N.width = i, N.height = r, C.setElementForId(G.id, N);
+  });
+}, "drawJunctions");
+Je([
+  {
+    name: oe.prefix,
+    icons: oe
+  }
+]);
+be.use(yr);
+function Ye(C, Y) {
+  C.forEach((A) => {
+    Y.add({
+      group: "nodes",
+      data: {
+        type: "service",
+        id: A.id,
+        icon: A.icon,
+        label: A.title,
+        parent: A.in,
+        width: Pt("iconSize"),
+        height: Pt("iconSize")
+      },
+      classes: "node-service"
+    });
+  });
+}
+at(Ye, "addServices");
+function Xe(C, Y) {
+  C.forEach((A) => {
+    Y.add({
+      group: "nodes",
+      data: {
+        type: "junction",
+        id: A.id,
+        parent: A.in,
+        width: Pt("iconSize"),
+        height: Pt("iconSize")
+      },
+      classes: "node-junction"
+    });
+  });
+}
+at(Xe, "addJunctions");
+function He(C, Y) {
+  Y.nodes().map((A) => {
+    const G = ae(A);
+    if (G.type === "group")
+      return;
+    G.x = A.position().x, G.y = A.position().y, C.getElementById(G.id).attr("transform", "translate(" + (G.x || 0) + "," + (G.y || 0) + ")");
+  });
+}
+at(He, "positionNodes");
+function We(C, Y) {
+  C.forEach((A) => {
+    Y.add({
+      group: "nodes",
+      data: {
+        type: "group",
+        id: A.id,
+        icon: A.icon,
+        label: A.title,
+        parent: A.in
+      },
+      classes: "node-group"
+    });
+  });
+}
+at(We, "addGroups");
+function Ve(C, Y) {
+  C.forEach((A) => {
+    const { lhsId: G, rhsId: N, lhsInto: u, lhsGroup: s, rhsInto: i, lhsDir: r, rhsDir: e, rhsGroup: f, title: n } = A, y = Pe(A.lhsDir, A.rhsDir) ? "segments" : "straight", t = {
+      id: `${G}-${N}`,
+      label: n,
+      source: G,
+      sourceDir: r,
+      sourceArrow: u,
+      sourceGroup: s,
+      sourceEndpoint: r === "L" ? "0 50%" : r === "R" ? "100% 50%" : r === "T" ? "50% 0" : "50% 100%",
+      target: N,
+      targetDir: e,
+      targetArrow: i,
+      targetGroup: f,
+      targetEndpoint: e === "L" ? "0 50%" : e === "R" ? "100% 50%" : e === "T" ? "50% 0" : "50% 100%"
+    };
+    Y.add({
+      group: "edges",
+      data: t,
+      classes: y
+    });
+  });
+}
+at(Ve, "addEdges");
+function ze(C) {
+  const Y = C.map((N) => {
+    const u = {}, s = {};
+    return Object.entries(N).forEach(([i, [r, e]]) => {
+      u[e] || (u[e] = []), s[r] || (s[r] = []), u[e].push(i), s[r].push(i);
+    }), {
+      horiz: Object.values(u).filter((i) => i.length > 1),
+      vert: Object.values(s).filter((i) => i.length > 1)
+    };
+  }), [A, G] = Y.reduce(
+    ([N, u], { horiz: s, vert: i }) => [
+      [...N, ...s],
+      [...u, ...i]
+    ],
+    [[], []]
+  );
+  return {
+    horizontal: A,
+    vertical: G
+  };
+}
+at(ze, "getAlignments");
+function Be(C) {
+  const Y = [], A = /* @__PURE__ */ at((N) => `${N[0]},${N[1]}`, "posToStr"), G = /* @__PURE__ */ at((N) => N.split(",").map((u) => parseInt(u)), "strToPos");
+  return C.forEach((N) => {
+    const u = Object.fromEntries(
+      Object.entries(N).map(([e, f]) => [A(f), e])
+    ), s = [A([0, 0])], i = {}, r = {
+      L: [-1, 0],
+      R: [1, 0],
+      T: [0, 1],
+      B: [0, -1]
+    };
+    for (; s.length > 0; ) {
+      const e = s.shift();
+      if (e) {
+        i[e] = 1;
+        const f = u[e];
+        if (f) {
+          const n = G(e);
+          Object.entries(r).forEach(([y, t]) => {
+            const h = A([n[0] + t[0], n[1] + t[1]]), o = u[h];
+            o && !i[h] && (s.push(h), Y.push({
+              [Ie[y]]: o,
+              [Ie[Er(y)]]: f,
+              gap: 1.5 * Pt("iconSize")
+            }));
+          });
+        }
+      }
+    }
+  }), Y;
+}
+at(Be, "getRelativeConstraints");
+function $e(C, Y, A, G, { spatialMaps: N }) {
+  return new Promise((u) => {
+    const s = rr("body").append("div").attr("id", "cy").attr("style", "display:none"), i = be({
+      container: document.getElementById("cy"),
+      style: [
+        {
+          selector: "edge",
+          style: {
+            "curve-style": "straight",
+            label: "data(label)",
+            "source-endpoint": "data(sourceEndpoint)",
+            "target-endpoint": "data(targetEndpoint)"
+          }
+        },
+        {
+          selector: "edge.segments",
+          style: {
+            "curve-style": "segments",
+            "segment-weights": "0",
+            "segment-distances": [0.5],
+            // @ts-ignore Incorrect library types
+            "edge-distances": "endpoints",
+            "source-endpoint": "data(sourceEndpoint)",
+            "target-endpoint": "data(targetEndpoint)"
+          }
+        },
+        {
+          selector: "node",
+          style: {
+            // @ts-ignore Incorrect library types
+            "compound-sizing-wrt-labels": "include"
+          }
+        },
+        {
+          selector: "node[label]",
+          style: {
+            "text-valign": "bottom",
+            "text-halign": "center",
+            "font-size": `${Pt("fontSize")}px`
+          }
+        },
+        {
+          selector: ".node-service",
+          style: {
+            label: "data(label)",
+            width: "data(width)",
+            height: "data(height)"
+          }
+        },
+        {
+          selector: ".node-junction",
+          style: {
+            width: "data(width)",
+            height: "data(height)"
+          }
+        },
+        {
+          selector: ".node-group",
+          style: {
+            // @ts-ignore Incorrect library types
+            padding: `${Pt("padding")}px`
+          }
+        }
+      ]
+    });
+    s.remove(), We(A, i), Ye(C, i), Xe(Y, i), Ve(G, i);
+    const r = ze(N), e = Be(N), f = i.layout({
+      name: "fcose",
+      quality: "proof",
+      styleEnabled: !1,
+      animate: !1,
+      nodeDimensionsIncludeLabels: !1,
+      // 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(n) {
+        const [y, t] = n.connectedNodes(), { parent: h } = ae(y), { parent: o } = ae(t);
+        return h === o ? 1.5 * Pt("iconSize") : 0.5 * Pt("iconSize");
+      },
+      edgeElasticity(n) {
+        const [y, t] = n.connectedNodes(), { parent: h } = ae(y), { parent: o } = ae(t);
+        return h === o ? 0.45 : 1e-3;
+      },
+      alignmentConstraint: r,
+      relativePlacementConstraint: e
+    });
+    f.one("layoutstop", () => {
+      var y;
+      function n(t, h, o, c) {
+        let l, T;
+        const { x: g, y: d } = t, { x: L, y: F } = h;
+        T = (c - d + (g - o) * (d - F) / (g - L)) / Math.sqrt(1 + Math.pow((d - F) / (g - L), 2)), l = Math.sqrt(Math.pow(c - d, 2) + Math.pow(o - g, 2) - Math.pow(T, 2));
+        const M = Math.sqrt(Math.pow(L - g, 2) + Math.pow(F - d, 2));
+        l = l / M;
+        let P = (L - g) * (c - d) - (F - d) * (o - g);
+        switch (!0) {
+          case P >= 0:
+            P = 1;
+            break;
+          case P < 0:
+            P = -1;
+            break;
+        }
+        let J = (L - g) * (o - g) + (F - d) * (c - d);
+        switch (!0) {
+          case J >= 0:
+            J = 1;
+            break;
+          case J < 0:
+            J = -1;
+            break;
+        }
+        return T = Math.abs(T) * P, l = l * J, {
+          distances: T,
+          weights: l
+        };
+      }
+      at(n, "getSegmentWeights"), i.startBatch();
+      for (const t of Object.values(i.edges()))
+        if ((y = t.data) != null && y.call(t)) {
+          const { x: h, y: o } = t.source().position(), { x: c, y: l } = t.target().position();
+          if (h !== c && o !== l) {
+            const T = t.sourceEndpoint(), g = t.targetEndpoint(), { sourceDir: d } = Ge(t), [L, F] = Qt(d) ? [T.x, g.y] : [g.x, T.y], { weights: M, distances: P } = n(T, g, L, F);
+            t.style("segment-distances", P), t.style("segment-weights", M);
+          }
+        }
+      i.endBatch(), f.run();
+    }), f.run(), i.ready((n) => {
+      Fe.info("Ready", n), u(i);
+    });
+  });
+}
+at($e, "layoutArchitecture");
+var kr = /* @__PURE__ */ at(async (C, Y, A, G) => {
+  const N = G.db, u = N.getServices(), s = N.getJunctions(), i = N.getGroups(), r = N.getEdges(), e = N.getDataStructures(), f = nr(Y), n = f.append("g");
+  n.attr("class", "architecture-edges");
+  const y = f.append("g");
+  y.attr("class", "architecture-services");
+  const t = f.append("g");
+  t.attr("class", "architecture-groups"), await $r(N, y, u), Zr(N, y, s);
+  const h = await $e(u, s, i, r, e);
+  await zr(n, h), await Br(t, h), He(N, h), ar(void 0, f, Pt("padding"), Pt("useMaxWidth"));
+}, "draw"), qr = { draw: kr }, ei = {
+  parser: Hr,
+  db: ue,
+  renderer: qr,
+  styles: Vr
+};
+export {
+  ei as diagram
+};