@kong-ui-public/documentation 1.4.17-pr.2640.fb8bab909.0 → 1.4.17

package/dist/architectureDiagram-UYN6MBPD-DkZdgpXi-BTThTJ0F.js

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