@orangelogic/design-system 2.162.0 → 2.164.0

package/library/chunks/architectureDiagram-ZJ3FMSHR.CBIOk9Kp.js

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