@sourcegraph/amp 0.0.1749571294-gef5aa3 → 0.0.1749600114-g5c00b8

package/dist/architectureDiagram-RWNHDUBN-1v8WgxdD.js

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