@aidapt/caity-chat 3.0.0

package/dist/lib/architectureDiagram-Q4EWVU46-DA4kYaz_.js

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