@loopstack/loopstack-studio 0.20.3 → 0.21.0-rc.0

package/dist/node_modules/cytoscape-fcose/node_modules/layout-base/layout-base.js

@@ -0,0 +1,1635 @@
+import { __commonJSMin } from "../../../../_virtual/rolldown_runtime.js";
+var require_layout_base = /* @__PURE__ */ __commonJSMin(((e, t) => {
+	(function(n, r) {
+		typeof e == "object" && typeof t == "object" ? t.exports = r() : typeof define == "function" && define.amd ? define([], r) : typeof e == "object" ? e.layoutBase = r() : n.layoutBase = r();
+	})(e, function() {
+		return (function(e) {
+			var t = {};
+			function n(r) {
+				if (t[r]) return t[r].exports;
+				var i = t[r] = {
+					i: r,
+					l: !1,
+					exports: {}
+				};
+				return e[r].call(i.exports, i, i.exports, n), i.l = !0, i.exports;
+			}
+			return n.m = e, n.c = t, n.i = function(e) {
+				return e;
+			}, n.d = function(e, t, r) {
+				n.o(e, t) || Object.defineProperty(e, t, {
+					configurable: !1,
+					enumerable: !0,
+					get: r
+				});
+			}, n.n = function(e) {
+				var t = e && e.__esModule ? function() {
+					return e.default;
+				} : function() {
+					return e;
+				};
+				return n.d(t, "a", t), t;
+			}, n.o = function(e, t) {
+				return Object.prototype.hasOwnProperty.call(e, t);
+			}, n.p = "", n(n.s = 28);
+		})([
+			(function(e, t, n) {
+				function r() {}
+				r.QUALITY = 1, r.DEFAULT_CREATE_BENDS_AS_NEEDED = !1, r.DEFAULT_INCREMENTAL = !1, r.DEFAULT_ANIMATION_ON_LAYOUT = !0, r.DEFAULT_ANIMATION_DURING_LAYOUT = !1, r.DEFAULT_ANIMATION_PERIOD = 50, r.DEFAULT_UNIFORM_LEAF_NODE_SIZES = !1, r.DEFAULT_GRAPH_MARGIN = 15, r.NODE_DIMENSIONS_INCLUDE_LABELS = !1, r.SIMPLE_NODE_SIZE = 40, r.SIMPLE_NODE_HALF_SIZE = r.SIMPLE_NODE_SIZE / 2, r.EMPTY_COMPOUND_NODE_SIZE = 40, r.MIN_EDGE_LENGTH = 1, r.WORLD_BOUNDARY = 1e6, r.INITIAL_WORLD_BOUNDARY = r.WORLD_BOUNDARY / 1e3, r.WORLD_CENTER_X = 1200, r.WORLD_CENTER_Y = 900, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = n(2), i = n(8), a = n(9);
+				function o(e, t, n) {
+					r.call(this, n), this.isOverlapingSourceAndTarget = !1, this.vGraphObject = n, this.bendpoints = [], this.source = e, this.target = t;
+				}
+				for (var s in o.prototype = Object.create(r.prototype), r) o[s] = r[s];
+				o.prototype.getSource = function() {
+					return this.source;
+				}, o.prototype.getTarget = function() {
+					return this.target;
+				}, o.prototype.isInterGraph = function() {
+					return this.isInterGraph;
+				}, o.prototype.getLength = function() {
+					return this.length;
+				}, o.prototype.isOverlapingSourceAndTarget = function() {
+					return this.isOverlapingSourceAndTarget;
+				}, o.prototype.getBendpoints = function() {
+					return this.bendpoints;
+				}, o.prototype.getLca = function() {
+					return this.lca;
+				}, o.prototype.getSourceInLca = function() {
+					return this.sourceInLca;
+				}, o.prototype.getTargetInLca = function() {
+					return this.targetInLca;
+				}, o.prototype.getOtherEnd = function(e) {
+					if (this.source === e) return this.target;
+					if (this.target === e) return this.source;
+					throw "Node is not incident with this edge";
+				}, o.prototype.getOtherEndInGraph = function(e, t) {
+					for (var n = this.getOtherEnd(e), r = t.getGraphManager().getRoot();;) {
+						if (n.getOwner() == t) return n;
+						if (n.getOwner() == r) break;
+						n = n.getOwner().getParent();
+					}
+					return null;
+				}, o.prototype.updateLength = function() {
+					var e = [
+						,
+						,
+						,
+						,
+					];
+					this.isOverlapingSourceAndTarget = i.getIntersection(this.target.getRect(), this.source.getRect(), e), this.isOverlapingSourceAndTarget || (this.lengthX = e[0] - e[2], this.lengthY = e[1] - e[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));
+				}, o.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);
+				}, e.exports = o;
+			}),
+			(function(e, t, n) {
+				function r(e) {
+					this.vGraphObject = e;
+				}
+				e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = n(2), i = n(10), a = n(13), o = n(0), s = n(16), c = n(5);
+				function l(e, t, n, o) {
+					n == null && o == null && (o = t), r.call(this, o), e.graphManager != null && (e = e.graphManager), this.estimatedSize = i.MIN_VALUE, this.inclusionTreeDepth = i.MAX_VALUE, this.vGraphObject = o, this.edges = [], this.graphManager = e, n != null && t != null ? this.rect = new a(t.x, t.y, n.width, n.height) : this.rect = new a();
+				}
+				for (var u in l.prototype = Object.create(r.prototype), r) l[u] = r[u];
+				l.prototype.getEdges = function() {
+					return this.edges;
+				}, l.prototype.getChild = function() {
+					return this.child;
+				}, l.prototype.getOwner = function() {
+					return this.owner;
+				}, l.prototype.getWidth = function() {
+					return this.rect.width;
+				}, l.prototype.setWidth = function(e) {
+					this.rect.width = e;
+				}, l.prototype.getHeight = function() {
+					return this.rect.height;
+				}, l.prototype.setHeight = function(e) {
+					this.rect.height = e;
+				}, l.prototype.getCenterX = function() {
+					return this.rect.x + this.rect.width / 2;
+				}, l.prototype.getCenterY = function() {
+					return this.rect.y + this.rect.height / 2;
+				}, l.prototype.getCenter = function() {
+					return new c(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
+				}, l.prototype.getLocation = function() {
+					return new c(this.rect.x, this.rect.y);
+				}, l.prototype.getRect = function() {
+					return this.rect;
+				}, l.prototype.getDiagonal = function() {
+					return Math.sqrt(this.rect.width * this.rect.width + this.rect.height * this.rect.height);
+				}, l.prototype.getHalfTheDiagonal = function() {
+					return Math.sqrt(this.rect.height * this.rect.height + this.rect.width * this.rect.width) / 2;
+				}, l.prototype.setRect = function(e, t) {
+					this.rect.x = e.x, this.rect.y = e.y, this.rect.width = t.width, this.rect.height = t.height;
+				}, l.prototype.setCenter = function(e, t) {
+					this.rect.x = e - this.rect.width / 2, this.rect.y = t - this.rect.height / 2;
+				}, l.prototype.setLocation = function(e, t) {
+					this.rect.x = e, this.rect.y = t;
+				}, l.prototype.moveBy = function(e, t) {
+					this.rect.x += e, this.rect.y += t;
+				}, l.prototype.getEdgeListToNode = function(e) {
+					var t = [], n = this;
+					return n.edges.forEach(function(r) {
+						if (r.target == e) {
+							if (r.source != n) throw "Incorrect edge source!";
+							t.push(r);
+						}
+					}), t;
+				}, l.prototype.getEdgesBetween = function(e) {
+					var t = [], n = this;
+					return n.edges.forEach(function(r) {
+						if (!(r.source == n || r.target == n)) throw "Incorrect edge source and/or target";
+						(r.target == e || r.source == e) && t.push(r);
+					}), t;
+				}, l.prototype.getNeighborsList = function() {
+					var e = /* @__PURE__ */ new Set(), t = this;
+					return t.edges.forEach(function(n) {
+						if (n.source == t) e.add(n.target);
+						else {
+							if (n.target != t) throw "Incorrect incidency!";
+							e.add(n.source);
+						}
+					}), e;
+				}, l.prototype.withChildren = function() {
+					var e = /* @__PURE__ */ new Set(), t, n;
+					if (e.add(this), this.child != null) for (var r = this.child.getNodes(), i = 0; i < r.length; i++) t = r[i], n = t.withChildren(), n.forEach(function(t) {
+						e.add(t);
+					});
+					return e;
+				}, l.prototype.getNoOfChildren = function() {
+					var e = 0, t;
+					if (this.child == null) e = 1;
+					else for (var n = this.child.getNodes(), r = 0; r < n.length; r++) t = n[r], e += t.getNoOfChildren();
+					return e == 0 && (e = 1), e;
+				}, l.prototype.getEstimatedSize = function() {
+					if (this.estimatedSize == i.MIN_VALUE) throw "assert failed";
+					return this.estimatedSize;
+				}, l.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);
+				}, l.prototype.scatter = function() {
+					var e, t, n = -o.INITIAL_WORLD_BOUNDARY, r = o.INITIAL_WORLD_BOUNDARY;
+					e = o.WORLD_CENTER_X + s.nextDouble() * (r - n) + n;
+					var i = -o.INITIAL_WORLD_BOUNDARY, a = o.INITIAL_WORLD_BOUNDARY;
+					t = o.WORLD_CENTER_Y + s.nextDouble() * (a - i) + i, this.rect.x = e, this.rect.y = t;
+				}, l.prototype.updateBounds = function() {
+					if (this.getChild() == null) throw "assert failed";
+					if (this.getChild().getNodes().length != 0) {
+						var e = this.getChild();
+						if (e.updateBounds(!0), this.rect.x = e.getLeft(), this.rect.y = e.getTop(), this.setWidth(e.getRight() - e.getLeft()), this.setHeight(e.getBottom() - e.getTop()), o.NODE_DIMENSIONS_INCLUDE_LABELS) {
+							var t = e.getRight() - e.getLeft(), n = e.getBottom() - e.getTop();
+							this.labelWidth && (this.labelPosHorizontal == "left" ? (this.rect.x -= this.labelWidth, this.setWidth(t + this.labelWidth)) : this.labelPosHorizontal == "center" && this.labelWidth > t ? (this.rect.x -= (this.labelWidth - t) / 2, this.setWidth(this.labelWidth)) : this.labelPosHorizontal == "right" && this.setWidth(t + this.labelWidth)), this.labelHeight && (this.labelPosVertical == "top" ? (this.rect.y -= this.labelHeight, this.setHeight(n + this.labelHeight)) : this.labelPosVertical == "center" && this.labelHeight > n ? (this.rect.y -= (this.labelHeight - n) / 2, this.setHeight(this.labelHeight)) : this.labelPosVertical == "bottom" && this.setHeight(n + this.labelHeight));
+						}
+					}
+				}, l.prototype.getInclusionTreeDepth = function() {
+					if (this.inclusionTreeDepth == i.MAX_VALUE) throw "assert failed";
+					return this.inclusionTreeDepth;
+				}, l.prototype.transform = function(e) {
+					var t = this.rect.x;
+					t > o.WORLD_BOUNDARY ? t = o.WORLD_BOUNDARY : t < -o.WORLD_BOUNDARY && (t = -o.WORLD_BOUNDARY);
+					var n = this.rect.y;
+					n > o.WORLD_BOUNDARY ? n = o.WORLD_BOUNDARY : n < -o.WORLD_BOUNDARY && (n = -o.WORLD_BOUNDARY);
+					var r = new c(t, n), i = e.inverseTransformPoint(r);
+					this.setLocation(i.x, i.y);
+				}, l.prototype.getLeft = function() {
+					return this.rect.x;
+				}, l.prototype.getRight = function() {
+					return this.rect.x + this.rect.width;
+				}, l.prototype.getTop = function() {
+					return this.rect.y;
+				}, l.prototype.getBottom = function() {
+					return this.rect.y + this.rect.height;
+				}, l.prototype.getParent = function() {
+					return this.owner == null ? null : this.owner.getParent();
+				}, e.exports = l;
+			}),
+			(function(e, t, n) {
+				var r = n(0);
+				function i() {}
+				for (var a in r) i[a] = r[a];
+				i.MAX_ITERATIONS = 2500, i.DEFAULT_EDGE_LENGTH = 50, i.DEFAULT_SPRING_STRENGTH = .45, i.DEFAULT_REPULSION_STRENGTH = 4500, i.DEFAULT_GRAVITY_STRENGTH = .4, i.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1, i.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8, i.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5, i.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = !0, i.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = !0, i.DEFAULT_COOLING_FACTOR_INCREMENTAL = .3, i.COOLING_ADAPTATION_FACTOR = .33, i.ADAPTATION_LOWER_NODE_LIMIT = 1e3, i.ADAPTATION_UPPER_NODE_LIMIT = 5e3, i.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100, i.MAX_NODE_DISPLACEMENT = i.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3, i.MIN_REPULSION_DIST = i.DEFAULT_EDGE_LENGTH / 10, i.CONVERGENCE_CHECK_PERIOD = 100, i.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = .1, i.MIN_EDGE_LENGTH = 1, i.GRID_CALCULATION_CHECK_PERIOD = 10, e.exports = i;
+			}),
+			(function(e, t, n) {
+				function r(e, t) {
+					e == null && t == null ? (this.x = 0, this.y = 0) : (this.x = e, this.y = t);
+				}
+				r.prototype.getX = function() {
+					return this.x;
+				}, r.prototype.getY = function() {
+					return this.y;
+				}, r.prototype.setX = function(e) {
+					this.x = e;
+				}, r.prototype.setY = function(e) {
+					this.y = e;
+				}, r.prototype.getDifference = function(e) {
+					return new DimensionD(this.x - e.x, this.y - e.y);
+				}, r.prototype.getCopy = function() {
+					return new r(this.x, this.y);
+				}, r.prototype.translate = function(e) {
+					return this.x += e.width, this.y += e.height, this;
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = n(2), i = n(10), a = n(0), o = n(7), s = n(3), c = n(1), l = n(13), u = n(12), d = n(11);
+				function f(e, t, n) {
+					r.call(this, n), this.estimatedSize = i.MIN_VALUE, this.margin = a.DEFAULT_GRAPH_MARGIN, this.edges = [], this.nodes = [], this.isConnected = !1, this.parent = e, t != null && t instanceof o ? this.graphManager = t : t != null && t instanceof Layout && (this.graphManager = t.graphManager);
+				}
+				for (var p in f.prototype = Object.create(r.prototype), r) f[p] = r[p];
+				f.prototype.getNodes = function() {
+					return this.nodes;
+				}, f.prototype.getEdges = function() {
+					return this.edges;
+				}, f.prototype.getGraphManager = function() {
+					return this.graphManager;
+				}, f.prototype.getParent = function() {
+					return this.parent;
+				}, f.prototype.getLeft = function() {
+					return this.left;
+				}, f.prototype.getRight = function() {
+					return this.right;
+				}, f.prototype.getTop = function() {
+					return this.top;
+				}, f.prototype.getBottom = function() {
+					return this.bottom;
+				}, f.prototype.isConnected = function() {
+					return this.isConnected;
+				}, f.prototype.add = function(e, t, n) {
+					if (t == null && n == null) {
+						var r = e;
+						if (this.graphManager == null) throw "Graph has no graph mgr!";
+						if (this.getNodes().indexOf(r) > -1) throw "Node already in graph!";
+						return r.owner = this, this.getNodes().push(r), r;
+					} else {
+						var i = e;
+						if (!(this.getNodes().indexOf(t) > -1 && this.getNodes().indexOf(n) > -1)) throw "Source or target not in graph!";
+						if (!(t.owner == n.owner && t.owner == this)) throw "Both owners must be this graph!";
+						return t.owner == n.owner ? (i.source = t, i.target = n, i.isInterGraph = !1, this.getEdges().push(i), t.edges.push(i), n != t && n.edges.push(i), i) : null;
+					}
+				}, f.prototype.remove = function(e) {
+					var t = e;
+					if (e instanceof s) {
+						if (t == null) throw "Node is null!";
+						if (!(t.owner != null && t.owner == this)) throw "Owner graph is invalid!";
+						if (this.graphManager == null) throw "Owner graph manager is invalid!";
+						for (var n = t.edges.slice(), r, i = n.length, a = 0; a < i; a++) r = n[a], r.isInterGraph ? this.graphManager.remove(r) : r.source.owner.remove(r);
+						var o = this.nodes.indexOf(t);
+						if (o == -1) throw "Node not in owner node list!";
+						this.nodes.splice(o, 1);
+					} else if (e instanceof c) {
+						var r = e;
+						if (r == null) throw "Edge is null!";
+						if (!(r.source != null && r.target != null)) throw "Source and/or target is null!";
+						if (!(r.source.owner != null && r.target.owner != null && r.source.owner == this && r.target.owner == this)) throw "Source and/or target owner is invalid!";
+						var l = r.source.edges.indexOf(r), u = r.target.edges.indexOf(r);
+						if (!(l > -1 && u > -1)) throw "Source and/or target doesn't know this edge!";
+						r.source.edges.splice(l, 1), r.target != r.source && r.target.edges.splice(u, 1);
+						var o = r.source.owner.getEdges().indexOf(r);
+						if (o == -1) throw "Not in owner's edge list!";
+						r.source.owner.getEdges().splice(o, 1);
+					}
+				}, f.prototype.updateLeftTop = function() {
+					for (var e = i.MAX_VALUE, t = i.MAX_VALUE, n, r, a, o = this.getNodes(), s = o.length, c = 0; c < s; c++) {
+						var l = o[c];
+						n = l.getTop(), r = l.getLeft(), e > n && (e = n), t > r && (t = r);
+					}
+					return e == i.MAX_VALUE ? null : (a = o[0].getParent().paddingLeft == null ? this.margin : o[0].getParent().paddingLeft, this.left = t - a, this.top = e - a, new u(this.left, this.top));
+				}, f.prototype.updateBounds = function(e) {
+					for (var t = i.MAX_VALUE, n = -i.MAX_VALUE, r = i.MAX_VALUE, a = -i.MAX_VALUE, o, s, c, u, d, f = this.nodes, p = f.length, m = 0; m < p; m++) {
+						var h = f[m];
+						e && h.child != null && h.updateBounds(), o = h.getLeft(), s = h.getRight(), c = h.getTop(), u = h.getBottom(), t > o && (t = o), n < s && (n = s), r > c && (r = c), a < u && (a = u);
+					}
+					var g = new l(t, r, n - t, a - r);
+					t == i.MAX_VALUE && (this.left = this.parent.getLeft(), this.right = this.parent.getRight(), this.top = this.parent.getTop(), this.bottom = this.parent.getBottom()), d = f[0].getParent().paddingLeft == null ? this.margin : f[0].getParent().paddingLeft, this.left = g.x - d, this.right = g.x + g.width + d, this.top = g.y - d, this.bottom = g.y + g.height + d;
+				}, f.calculateBounds = function(e) {
+					for (var t = i.MAX_VALUE, n = -i.MAX_VALUE, r = i.MAX_VALUE, a = -i.MAX_VALUE, o, s, c, u, d = e.length, f = 0; f < d; f++) {
+						var p = e[f];
+						o = p.getLeft(), s = p.getRight(), c = p.getTop(), u = p.getBottom(), t > o && (t = o), n < s && (n = s), r > c && (r = c), a < u && (a = u);
+					}
+					return new l(t, r, n - t, a - r);
+				}, f.prototype.getInclusionTreeDepth = function() {
+					return this == this.graphManager.getRoot() ? 1 : this.parent.getInclusionTreeDepth();
+				}, f.prototype.getEstimatedSize = function() {
+					if (this.estimatedSize == i.MIN_VALUE) throw "assert failed";
+					return this.estimatedSize;
+				}, f.prototype.calcEstimatedSize = function() {
+					for (var e = 0, t = this.nodes, n = t.length, r = 0; r < n; r++) {
+						var i = t[r];
+						e += i.calcEstimatedSize();
+					}
+					return e == 0 ? this.estimatedSize = a.EMPTY_COMPOUND_NODE_SIZE : this.estimatedSize = e / Math.sqrt(this.nodes.length), this.estimatedSize;
+				}, f.prototype.updateConnected = function() {
+					var e = this;
+					if (this.nodes.length == 0) {
+						this.isConnected = !0;
+						return;
+					}
+					var t = new d(), n = /* @__PURE__ */ new Set(), r = this.nodes[0], i, a;
+					for (r.withChildren().forEach(function(e) {
+						t.push(e), n.add(e);
+					}); t.length !== 0;) {
+						r = t.shift(), i = r.getEdges();
+						for (var o = i.length, s = 0; s < o; s++) a = i[s].getOtherEndInGraph(r, this), a != null && !n.has(a) && a.withChildren().forEach(function(e) {
+							t.push(e), n.add(e);
+						});
+					}
+					if (this.isConnected = !1, n.size >= this.nodes.length) {
+						var c = 0;
+						n.forEach(function(t) {
+							t.owner == e && c++;
+						}), c == this.nodes.length && (this.isConnected = !0);
+					}
+				}, e.exports = f;
+			}),
+			(function(e, t, n) {
+				var r, i = n(1);
+				function a(e) {
+					r = n(6), this.layout = e, this.graphs = [], this.edges = [];
+				}
+				a.prototype.addRoot = function() {
+					var e = this.layout.newGraph(), t = this.layout.newNode(null), n = this.add(e, t);
+					return this.setRootGraph(n), this.rootGraph;
+				}, a.prototype.add = function(e, t, n, r, i) {
+					if (n == null && r == null && i == null) {
+						if (e == null) throw "Graph is null!";
+						if (t == null) throw "Parent node is null!";
+						if (this.graphs.indexOf(e) > -1) throw "Graph already in this graph mgr!";
+						if (this.graphs.push(e), e.parent != null) throw "Already has a parent!";
+						if (t.child != null) throw "Already has a child!";
+						return e.parent = t, t.child = e, e;
+					} else {
+						i = n, r = t, n = e;
+						var a = r.getOwner(), o = i.getOwner();
+						if (!(a != null && a.getGraphManager() == this)) throw "Source not in this graph mgr!";
+						if (!(o != null && o.getGraphManager() == this)) throw "Target not in this graph mgr!";
+						if (a == o) return n.isInterGraph = !1, a.add(n, r, i);
+						if (n.isInterGraph = !0, n.source = r, n.target = i, this.edges.indexOf(n) > -1) throw "Edge already in inter-graph edge list!";
+						if (this.edges.push(n), !(n.source != null && n.target != null)) throw "Edge source and/or target is null!";
+						if (!(n.source.edges.indexOf(n) == -1 && n.target.edges.indexOf(n) == -1)) throw "Edge already in source and/or target incidency list!";
+						return n.source.edges.push(n), n.target.edges.push(n), n;
+					}
+				}, a.prototype.remove = function(e) {
+					if (e instanceof r) {
+						var t = e;
+						if (t.getGraphManager() != this) throw "Graph not in this graph mgr";
+						if (!(t == this.rootGraph || t.parent != null && t.parent.graphManager == this)) throw "Invalid parent node!";
+						var n = [];
+						n = n.concat(t.getEdges());
+						for (var a, o = n.length, s = 0; s < o; s++) a = n[s], t.remove(a);
+						var c = [];
+						c = c.concat(t.getNodes());
+						var l;
+						o = c.length;
+						for (var s = 0; s < o; s++) l = c[s], t.remove(l);
+						t == this.rootGraph && this.setRootGraph(null);
+						var u = this.graphs.indexOf(t);
+						this.graphs.splice(u, 1), t.parent = null;
+					} else if (e instanceof i) {
+						if (a = e, a == null) throw "Edge is null!";
+						if (!a.isInterGraph) throw "Not an inter-graph edge!";
+						if (!(a.source != null && a.target != null)) throw "Source and/or target is null!";
+						if (!(a.source.edges.indexOf(a) != -1 && a.target.edges.indexOf(a) != -1)) throw "Source and/or target doesn't know this edge!";
+						var u = a.source.edges.indexOf(a);
+						if (a.source.edges.splice(u, 1), u = a.target.edges.indexOf(a), a.target.edges.splice(u, 1), !(a.source.owner != null && a.source.owner.getGraphManager() != null)) throw "Edge owner graph or owner graph manager is null!";
+						if (a.source.owner.getGraphManager().edges.indexOf(a) == -1) throw "Not in owner graph manager's edge list!";
+						var u = a.source.owner.getGraphManager().edges.indexOf(a);
+						a.source.owner.getGraphManager().edges.splice(u, 1);
+					}
+				}, a.prototype.updateBounds = function() {
+					this.rootGraph.updateBounds(!0);
+				}, a.prototype.getGraphs = function() {
+					return this.graphs;
+				}, a.prototype.getAllNodes = function() {
+					if (this.allNodes == null) {
+						for (var e = [], t = this.getGraphs(), n = t.length, r = 0; r < n; r++) e = e.concat(t[r].getNodes());
+						this.allNodes = e;
+					}
+					return this.allNodes;
+				}, a.prototype.resetAllNodes = function() {
+					this.allNodes = null;
+				}, a.prototype.resetAllEdges = function() {
+					this.allEdges = null;
+				}, a.prototype.resetAllNodesToApplyGravitation = function() {
+					this.allNodesToApplyGravitation = null;
+				}, a.prototype.getAllEdges = function() {
+					if (this.allEdges == null) {
+						var e = [], t = this.getGraphs();
+						t.length;
+						for (var n = 0; n < t.length; n++) e = e.concat(t[n].getEdges());
+						e = e.concat(this.edges), this.allEdges = e;
+					}
+					return this.allEdges;
+				}, a.prototype.getAllNodesToApplyGravitation = function() {
+					return this.allNodesToApplyGravitation;
+				}, a.prototype.setAllNodesToApplyGravitation = function(e) {
+					if (this.allNodesToApplyGravitation != null) throw "assert failed";
+					this.allNodesToApplyGravitation = e;
+				}, a.prototype.getRoot = function() {
+					return this.rootGraph;
+				}, a.prototype.setRootGraph = function(e) {
+					if (e.getGraphManager() != this) throw "Root not in this graph mgr!";
+					this.rootGraph = e, e.parent ??= this.layout.newNode("Root node");
+				}, a.prototype.getLayout = function() {
+					return this.layout;
+				}, a.prototype.isOneAncestorOfOther = function(e, t) {
+					if (!(e != null && t != null)) throw "assert failed";
+					if (e == t) return !0;
+					var n = e.getOwner(), r;
+					do {
+						if (r = n.getParent(), r == null) break;
+						if (r == t) return !0;
+						if (n = r.getOwner(), n == null) break;
+					} while (!0);
+					n = t.getOwner();
+					do {
+						if (r = n.getParent(), r == null) break;
+						if (r == e) return !0;
+						if (n = r.getOwner(), n == null) break;
+					} while (!0);
+					return !1;
+				}, a.prototype.calcLowestCommonAncestors = function() {
+					for (var e, t, n, r, i, a = this.getAllEdges(), o = a.length, s = 0; s < o; s++) {
+						if (e = a[s], t = e.source, n = e.target, e.lca = null, e.sourceInLca = t, e.targetInLca = n, t == n) {
+							e.lca = t.getOwner();
+							continue;
+						}
+						for (r = t.getOwner(); e.lca == null;) {
+							for (e.targetInLca = n, i = n.getOwner(); e.lca == null;) {
+								if (i == r) {
+									e.lca = i;
+									break;
+								}
+								if (i == this.rootGraph) break;
+								if (e.lca != null) throw "assert failed";
+								e.targetInLca = i.getParent(), i = e.targetInLca.getOwner();
+							}
+							if (r == this.rootGraph) break;
+							e.lca ?? (e.sourceInLca = r.getParent(), r = e.sourceInLca.getOwner());
+						}
+						if (e.lca == null) throw "assert failed";
+					}
+				}, a.prototype.calcLowestCommonAncestor = function(e, t) {
+					if (e == t) return e.getOwner();
+					var n = e.getOwner();
+					do {
+						if (n == null) break;
+						var r = t.getOwner();
+						do {
+							if (r == null) break;
+							if (r == n) return r;
+							r = r.getParent().getOwner();
+						} while (!0);
+						n = n.getParent().getOwner();
+					} while (!0);
+					return n;
+				}, a.prototype.calcInclusionTreeDepths = function(e, t) {
+					e == null && t == null && (e = this.rootGraph, t = 1);
+					for (var n, r = e.getNodes(), i = r.length, a = 0; a < i; a++) n = r[a], n.inclusionTreeDepth = t, n.child != null && this.calcInclusionTreeDepths(n.child, t + 1);
+				}, a.prototype.includesInvalidEdge = function() {
+					for (var e, t = [], n = this.edges.length, r = 0; r < n; r++) e = this.edges[r], this.isOneAncestorOfOther(e.source, e.target) && t.push(e);
+					for (var r = 0; r < t.length; r++) this.remove(t[r]);
+					return !1;
+				}, e.exports = a;
+			}),
+			(function(e, t, n) {
+				var r = n(12);
+				function i() {}
+				i.calcSeparationAmount = function(e, t, n, r) {
+					if (!e.intersects(t)) throw "assert failed";
+					var i = [, ,];
+					this.decideDirectionsForOverlappingNodes(e, t, i), n[0] = Math.min(e.getRight(), t.getRight()) - Math.max(e.x, t.x), n[1] = Math.min(e.getBottom(), t.getBottom()) - Math.max(e.y, t.y), e.getX() <= t.getX() && e.getRight() >= t.getRight() ? n[0] += Math.min(t.getX() - e.getX(), e.getRight() - t.getRight()) : t.getX() <= e.getX() && t.getRight() >= e.getRight() && (n[0] += Math.min(e.getX() - t.getX(), t.getRight() - e.getRight())), e.getY() <= t.getY() && e.getBottom() >= t.getBottom() ? n[1] += Math.min(t.getY() - e.getY(), e.getBottom() - t.getBottom()) : t.getY() <= e.getY() && t.getBottom() >= e.getBottom() && (n[1] += Math.min(e.getY() - t.getY(), t.getBottom() - e.getBottom()));
+					var a = Math.abs((t.getCenterY() - e.getCenterY()) / (t.getCenterX() - e.getCenterX()));
+					t.getCenterY() === e.getCenterY() && t.getCenterX() === e.getCenterX() && (a = 1);
+					var o = a * n[0], s = n[1] / a;
+					n[0] < s ? s = n[0] : o = n[1], n[0] = -1 * i[0] * (s / 2 + r), n[1] = -1 * i[1] * (o / 2 + r);
+				}, i.decideDirectionsForOverlappingNodes = function(e, t, n) {
+					e.getCenterX() < t.getCenterX() ? n[0] = -1 : n[0] = 1, e.getCenterY() < t.getCenterY() ? n[1] = -1 : n[1] = 1;
+				}, i.getIntersection2 = function(e, t, n) {
+					var r = e.getCenterX(), i = e.getCenterY(), a = t.getCenterX(), o = t.getCenterY();
+					if (e.intersects(t)) return n[0] = r, n[1] = i, n[2] = a, n[3] = o, !0;
+					var s = e.getX(), c = e.getY(), l = e.getRight(), u = e.getX(), d = e.getBottom(), f = e.getRight(), p = e.getWidthHalf(), m = e.getHeightHalf(), h = t.getX(), g = t.getY(), _ = t.getRight(), v = t.getX(), y = t.getBottom(), b = t.getRight(), x = t.getWidthHalf(), S = t.getHeightHalf(), C = !1, w = !1;
+					if (r === a) {
+						if (i > o) return n[0] = r, n[1] = c, n[2] = a, n[3] = y, !1;
+						if (i < o) return n[0] = r, n[1] = d, n[2] = a, n[3] = g, !1;
+					} else if (i === o) {
+						if (r > a) return n[0] = s, n[1] = i, n[2] = _, n[3] = o, !1;
+						if (r < a) return n[0] = l, n[1] = i, n[2] = h, n[3] = o, !1;
+					} else {
+						var T = e.height / e.width, E = t.height / t.width, D = (o - i) / (a - r), O = void 0, k = void 0, A = void 0, j = void 0, M = void 0, N = void 0;
+						if (-T === D ? r > a ? (n[0] = u, n[1] = d, C = !0) : (n[0] = l, n[1] = c, C = !0) : T === D && (r > a ? (n[0] = s, n[1] = c, C = !0) : (n[0] = f, n[1] = d, C = !0)), -E === D ? a > r ? (n[2] = v, n[3] = y, w = !0) : (n[2] = _, n[3] = g, w = !0) : E === D && (a > r ? (n[2] = h, n[3] = g, w = !0) : (n[2] = b, n[3] = y, w = !0)), C && w) return !1;
+						if (r > a ? i > o ? (O = this.getCardinalDirection(T, D, 4), k = this.getCardinalDirection(E, D, 2)) : (O = this.getCardinalDirection(-T, D, 3), k = this.getCardinalDirection(-E, D, 1)) : i > o ? (O = this.getCardinalDirection(-T, D, 1), k = this.getCardinalDirection(-E, D, 3)) : (O = this.getCardinalDirection(T, D, 2), k = this.getCardinalDirection(E, D, 4)), !C) switch (O) {
+							case 1:
+								j = c, A = r + -m / D, n[0] = A, n[1] = j;
+								break;
+							case 2:
+								A = f, j = i + p * D, n[0] = A, n[1] = j;
+								break;
+							case 3:
+								j = d, A = r + m / D, n[0] = A, n[1] = j;
+								break;
+							case 4:
+								A = u, j = i + -p * D, n[0] = A, n[1] = j;
+								break;
+						}
+						if (!w) switch (k) {
+							case 1:
+								N = g, M = a + -S / D, n[2] = M, n[3] = N;
+								break;
+							case 2:
+								M = b, N = o + x * D, n[2] = M, n[3] = N;
+								break;
+							case 3:
+								N = y, M = a + S / D, n[2] = M, n[3] = N;
+								break;
+							case 4:
+								M = v, N = o + -x * D, n[2] = M, n[3] = N;
+								break;
+						}
+					}
+					return !1;
+				}, i.getCardinalDirection = function(e, t, n) {
+					return e > t ? n : 1 + n % 4;
+				}, i.getIntersection = function(e, t, n, i) {
+					if (i == null) return this.getIntersection2(e, t, n);
+					var a = e.x, o = e.y, s = t.x, c = t.y, l = n.x, u = n.y, d = i.x, f = i.y, p = void 0, m = void 0, h = void 0, g = void 0, _ = void 0, v = void 0, y = void 0, b = void 0, x = void 0;
+					return h = c - o, _ = a - s, y = s * o - a * c, g = f - u, v = l - d, b = d * u - l * f, x = h * v - g * _, x === 0 ? null : (p = (_ * b - v * y) / x, m = (g * y - h * b) / x, new r(p, m));
+				}, i.angleOfVector = function(e, t, n, r) {
+					var i = void 0;
+					return e === n ? i = r < t ? this.ONE_AND_HALF_PI : this.HALF_PI : (i = Math.atan((r - t) / (n - e)), n < e ? i += Math.PI : r < t && (i += this.TWO_PI)), i;
+				}, i.doIntersect = function(e, t, n, r) {
+					var i = e.x, a = e.y, o = t.x, s = t.y, c = n.x, l = n.y, u = r.x, d = r.y, f = (o - i) * (d - l) - (u - c) * (s - a);
+					if (f === 0) return !1;
+					var p = ((d - l) * (u - i) + (c - u) * (d - a)) / f, m = ((a - s) * (u - i) + (o - i) * (d - a)) / f;
+					return 0 < p && p < 1 && 0 < m && m < 1;
+				}, i.findCircleLineIntersections = function(e, t, n, r, i, a, o) {
+					var s = (n - e) * (n - e) + (r - t) * (r - t), c = 2 * ((e - i) * (n - e) + (t - a) * (r - t)), l = (e - i) * (e - i) + (t - a) * (t - a) - o * o;
+					if (c * c - 4 * s * l >= 0) {
+						var u = (-c + Math.sqrt(c * c - 4 * s * l)) / (2 * s), d = (-c - Math.sqrt(c * c - 4 * s * l)) / (2 * s);
+						return u >= 0 && u <= 1 ? [u] : d >= 0 && d <= 1 ? [d] : null;
+					} else return null;
+				}, i.HALF_PI = .5 * Math.PI, i.ONE_AND_HALF_PI = 1.5 * Math.PI, i.TWO_PI = 2 * Math.PI, i.THREE_PI = 3 * Math.PI, e.exports = i;
+			}),
+			(function(e, t, n) {
+				function r() {}
+				r.sign = function(e) {
+					return e > 0 ? 1 : e < 0 ? -1 : 0;
+				}, r.floor = function(e) {
+					return e < 0 ? Math.ceil(e) : Math.floor(e);
+				}, r.ceil = function(e) {
+					return e < 0 ? Math.floor(e) : Math.ceil(e);
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				function r() {}
+				r.MAX_VALUE = 2147483647, r.MIN_VALUE = -2147483648, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = function() {
+					function e(e, t) {
+						for (var n = 0; n < t.length; n++) {
+							var r = t[n];
+							r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r);
+						}
+					}
+					return function(t, n, r) {
+						return n && e(t.prototype, n), r && e(t, r), t;
+					};
+				}();
+				function i(e, t) {
+					if (!(e instanceof t)) throw TypeError("Cannot call a class as a function");
+				}
+				var a = function(e) {
+					return {
+						value: e,
+						next: null,
+						prev: null
+					};
+				}, o = function(e, t, n, r) {
+					return e === null ? r.head = t : e.next = t, n === null ? r.tail = t : n.prev = t, t.prev = e, t.next = n, r.length++, t;
+				}, s = function(e, t) {
+					var n = e.prev, r = e.next;
+					return n === null ? t.head = r : n.next = r, r === null ? t.tail = n : r.prev = n, e.prev = e.next = null, t.length--, e;
+				};
+				e.exports = function() {
+					function e(t) {
+						var n = this;
+						i(this, e), this.length = 0, this.head = null, this.tail = null, t?.forEach(function(e) {
+							return n.push(e);
+						});
+					}
+					return r(e, [
+						{
+							key: "size",
+							value: function() {
+								return this.length;
+							}
+						},
+						{
+							key: "insertBefore",
+							value: function(e, t) {
+								return o(t.prev, a(e), t, this);
+							}
+						},
+						{
+							key: "insertAfter",
+							value: function(e, t) {
+								return o(t, a(e), t.next, this);
+							}
+						},
+						{
+							key: "insertNodeBefore",
+							value: function(e, t) {
+								return o(t.prev, e, t, this);
+							}
+						},
+						{
+							key: "insertNodeAfter",
+							value: function(e, t) {
+								return o(t, e, t.next, this);
+							}
+						},
+						{
+							key: "push",
+							value: function(e) {
+								return o(this.tail, a(e), null, this);
+							}
+						},
+						{
+							key: "unshift",
+							value: function(e) {
+								return o(null, a(e), this.head, this);
+							}
+						},
+						{
+							key: "remove",
+							value: function(e) {
+								return s(e, this);
+							}
+						},
+						{
+							key: "pop",
+							value: function() {
+								return s(this.tail, this).value;
+							}
+						},
+						{
+							key: "popNode",
+							value: function() {
+								return s(this.tail, this);
+							}
+						},
+						{
+							key: "shift",
+							value: function() {
+								return s(this.head, this).value;
+							}
+						},
+						{
+							key: "shiftNode",
+							value: function() {
+								return s(this.head, this);
+							}
+						},
+						{
+							key: "get_object_at",
+							value: function(e) {
+								if (e <= this.length()) {
+									for (var t = 1, n = this.head; t < e;) n = n.next, t++;
+									return n.value;
+								}
+							}
+						},
+						{
+							key: "set_object_at",
+							value: function(e, t) {
+								if (e <= this.length()) {
+									for (var n = 1, r = this.head; n < e;) r = r.next, n++;
+									r.value = t;
+								}
+							}
+						}
+					]), e;
+				}();
+			}),
+			(function(e, t, n) {
+				function r(e, t, n) {
+					this.x = null, this.y = null, e == null && t == null && n == null ? (this.x = 0, this.y = 0) : typeof e == "number" && typeof t == "number" && n == null ? (this.x = e, this.y = t) : e.constructor.name == "Point" && t == null && n == null && (n = e, this.x = n.x, this.y = n.y);
+				}
+				r.prototype.getX = function() {
+					return this.x;
+				}, r.prototype.getY = function() {
+					return this.y;
+				}, r.prototype.getLocation = function() {
+					return new r(this.x, this.y);
+				}, r.prototype.setLocation = function(e, t, n) {
+					e.constructor.name == "Point" && t == null && n == null ? (n = e, this.setLocation(n.x, n.y)) : typeof e == "number" && typeof t == "number" && n == null && (parseInt(e) == e && parseInt(t) == t ? this.move(e, t) : (this.x = Math.floor(e + .5), this.y = Math.floor(t + .5)));
+				}, r.prototype.move = function(e, t) {
+					this.x = e, this.y = t;
+				}, r.prototype.translate = function(e, t) {
+					this.x += e, this.y += t;
+				}, r.prototype.equals = function(e) {
+					if (e.constructor.name == "Point") {
+						var t = e;
+						return this.x == t.x && this.y == t.y;
+					}
+					return this == e;
+				}, r.prototype.toString = function() {
+					return new r().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				function r(e, t, n, r) {
+					this.x = 0, this.y = 0, this.width = 0, this.height = 0, e != null && t != null && n != null && r != null && (this.x = e, this.y = t, this.width = n, this.height = r);
+				}
+				r.prototype.getX = function() {
+					return this.x;
+				}, r.prototype.setX = function(e) {
+					this.x = e;
+				}, r.prototype.getY = function() {
+					return this.y;
+				}, r.prototype.setY = function(e) {
+					this.y = e;
+				}, r.prototype.getWidth = function() {
+					return this.width;
+				}, r.prototype.setWidth = function(e) {
+					this.width = e;
+				}, r.prototype.getHeight = function() {
+					return this.height;
+				}, r.prototype.setHeight = function(e) {
+					this.height = e;
+				}, r.prototype.getRight = function() {
+					return this.x + this.width;
+				}, r.prototype.getBottom = function() {
+					return this.y + this.height;
+				}, r.prototype.intersects = function(e) {
+					return !(this.getRight() < e.x || this.getBottom() < e.y || e.getRight() < this.x || e.getBottom() < this.y);
+				}, r.prototype.getCenterX = function() {
+					return this.x + this.width / 2;
+				}, r.prototype.getMinX = function() {
+					return this.getX();
+				}, r.prototype.getMaxX = function() {
+					return this.getX() + this.width;
+				}, r.prototype.getCenterY = function() {
+					return this.y + this.height / 2;
+				}, r.prototype.getMinY = function() {
+					return this.getY();
+				}, r.prototype.getMaxY = function() {
+					return this.getY() + this.height;
+				}, r.prototype.getWidthHalf = function() {
+					return this.width / 2;
+				}, r.prototype.getHeightHalf = function() {
+					return this.height / 2;
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
+					return typeof e;
+				} : function(e) {
+					return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
+				};
+				function i() {}
+				i.lastID = 0, i.createID = function(e) {
+					return i.isPrimitive(e) ? e : e.uniqueID == null ? (e.uniqueID = i.getString(), i.lastID++, e.uniqueID) : e.uniqueID;
+				}, i.getString = function(e) {
+					return e ??= i.lastID, "Object#" + e;
+				}, i.isPrimitive = function(e) {
+					var t = e === void 0 ? "undefined" : r(e);
+					return e == null || t != "object" && t != "function";
+				}, e.exports = i;
+			}),
+			(function(e, t, n) {
+				function r(e) {
+					if (Array.isArray(e)) {
+						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
+						return n;
+					} else return Array.from(e);
+				}
+				var i = n(0), a = n(7), o = n(3), s = n(1), c = n(6), l = n(5), u = n(17), d = n(29);
+				function f(e) {
+					d.call(this), this.layoutQuality = i.QUALITY, this.createBendsAsNeeded = i.DEFAULT_CREATE_BENDS_AS_NEEDED, this.incremental = i.DEFAULT_INCREMENTAL, this.animationOnLayout = i.DEFAULT_ANIMATION_ON_LAYOUT, this.animationDuringLayout = i.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = i.DEFAULT_ANIMATION_PERIOD, this.uniformLeafNodeSizes = i.DEFAULT_UNIFORM_LEAF_NODE_SIZES, this.edgeToDummyNodes = /* @__PURE__ */ new Map(), this.graphManager = new a(this), this.isLayoutFinished = !1, this.isSubLayout = !1, this.isRemoteUse = !1, e != null && (this.isRemoteUse = e);
+				}
+				f.RANDOM_SEED = 1, f.prototype = Object.create(d.prototype), f.prototype.getGraphManager = function() {
+					return this.graphManager;
+				}, f.prototype.getAllNodes = function() {
+					return this.graphManager.getAllNodes();
+				}, f.prototype.getAllEdges = function() {
+					return this.graphManager.getAllEdges();
+				}, f.prototype.getAllNodesToApplyGravitation = function() {
+					return this.graphManager.getAllNodesToApplyGravitation();
+				}, f.prototype.newGraphManager = function() {
+					var e = new a(this);
+					return this.graphManager = e, e;
+				}, f.prototype.newGraph = function(e) {
+					return new c(null, this.graphManager, e);
+				}, f.prototype.newNode = function(e) {
+					return new o(this.graphManager, e);
+				}, f.prototype.newEdge = function(e) {
+					return new s(null, null, e);
+				}, f.prototype.checkLayoutSuccess = function() {
+					return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
+				}, f.prototype.runLayout = function() {
+					this.isLayoutFinished = !1, this.tilingPreLayout && this.tilingPreLayout(), this.initParameters();
+					var e = this.checkLayoutSuccess() ? !1 : this.layout();
+					return i.ANIMATE === "during" ? !1 : (e && (this.isSubLayout || this.doPostLayout()), this.tilingPostLayout && this.tilingPostLayout(), this.isLayoutFinished = !0, e);
+				}, f.prototype.doPostLayout = function() {
+					this.incremental || this.transform(), this.update();
+				}, f.prototype.update2 = function() {
+					if (this.createBendsAsNeeded && (this.createBendpointsFromDummyNodes(), this.graphManager.resetAllEdges()), !this.isRemoteUse) {
+						for (var e = this.graphManager.getAllEdges(), t = 0; t < e.length; t++) e[t];
+						for (var n = this.graphManager.getRoot().getNodes(), t = 0; t < n.length; t++) n[t];
+						this.update(this.graphManager.getRoot());
+					}
+				}, f.prototype.update = function(e) {
+					if (e == null) this.update2();
+					else if (e instanceof o) {
+						var t = e;
+						if (t.getChild() != null) for (var n = t.getChild().getNodes(), r = 0; r < n.length; r++) update(n[r]);
+						t.vGraphObject != null && t.vGraphObject.update(t);
+					} else if (e instanceof s) {
+						var i = e;
+						i.vGraphObject != null && i.vGraphObject.update(i);
+					} else if (e instanceof c) {
+						var a = e;
+						a.vGraphObject != null && a.vGraphObject.update(a);
+					}
+				}, f.prototype.initParameters = function() {
+					this.isSubLayout || (this.layoutQuality = i.QUALITY, this.animationDuringLayout = i.DEFAULT_ANIMATION_DURING_LAYOUT, this.animationPeriod = i.DEFAULT_ANIMATION_PERIOD, this.animationOnLayout = i.DEFAULT_ANIMATION_ON_LAYOUT, this.incremental = i.DEFAULT_INCREMENTAL, this.createBendsAsNeeded = i.DEFAULT_CREATE_BENDS_AS_NEEDED, this.uniformLeafNodeSizes = i.DEFAULT_UNIFORM_LEAF_NODE_SIZES), this.animationDuringLayout && (this.animationOnLayout = !1);
+				}, f.prototype.transform = function(e) {
+					if (e == null) this.transform(new l(0, 0));
+					else {
+						var t = new u(), n = this.graphManager.getRoot().updateLeftTop();
+						if (n != null) {
+							t.setWorldOrgX(e.x), t.setWorldOrgY(e.y), t.setDeviceOrgX(n.x), t.setDeviceOrgY(n.y);
+							for (var r = this.getAllNodes(), i, a = 0; a < r.length; a++) i = r[a], i.transform(t);
+						}
+					}
+				}, f.prototype.positionNodesRandomly = function(e) {
+					if (e == null) this.positionNodesRandomly(this.getGraphManager().getRoot()), this.getGraphManager().getRoot().updateBounds(!0);
+					else for (var t, n, r = e.getNodes(), i = 0; i < r.length; i++) t = r[i], n = t.getChild(), n == null || n.getNodes().length == 0 ? t.scatter() : (this.positionNodesRandomly(n), t.updateBounds());
+				}, f.prototype.getFlatForest = function() {
+					for (var e = [], t = !0, n = this.graphManager.getRoot().getNodes(), i = !0, a = 0; a < n.length; a++) n[a].getChild() != null && (i = !1);
+					if (!i) return e;
+					var o = /* @__PURE__ */ new Set(), s = [], c = /* @__PURE__ */ new Map(), l = [];
+					for (l = l.concat(n); l.length > 0 && t;) {
+						for (s.push(l[0]); s.length > 0 && t;) {
+							var u = s[0];
+							s.splice(0, 1), o.add(u);
+							for (var d = u.getEdges(), a = 0; a < d.length; a++) {
+								var f = d[a].getOtherEnd(u);
+								if (c.get(u) != f) if (!o.has(f)) s.push(f), c.set(f, u);
+								else {
+									t = !1;
+									break;
+								}
+							}
+						}
+						if (!t) e = [];
+						else {
+							var p = [].concat(r(o));
+							e.push(p);
+							for (var a = 0; a < p.length; a++) {
+								var m = p[a], h = l.indexOf(m);
+								h > -1 && l.splice(h, 1);
+							}
+							o = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map();
+						}
+					}
+					return e;
+				}, f.prototype.createDummyNodesForBendpoints = function(e) {
+					for (var t = [], n = e.source, r = this.graphManager.calcLowestCommonAncestor(e.source, e.target), i = 0; i < e.bendpoints.length; i++) {
+						var a = this.newNode(null);
+						a.setRect(new Point(0, 0), new Dimension(1, 1)), r.add(a);
+						var o = this.newEdge(null);
+						this.graphManager.add(o, n, a), t.add(a), n = a;
+					}
+					var o = this.newEdge(null);
+					return this.graphManager.add(o, n, e.target), this.edgeToDummyNodes.set(e, t), e.isInterGraph() ? this.graphManager.remove(e) : r.remove(e), t;
+				}, f.prototype.createBendpointsFromDummyNodes = function() {
+					var e = [];
+					e = e.concat(this.graphManager.getAllEdges()), e = [].concat(r(this.edgeToDummyNodes.keys()), e);
+					for (var t = 0; t < e.length; t++) {
+						var n = e[t];
+						if (n.bendpoints.length > 0) {
+							for (var i = this.edgeToDummyNodes.get(n), a = 0; a < i.length; a++) {
+								var o = i[a], s = new l(o.getCenterX(), o.getCenterY()), c = n.bendpoints.get(a);
+								c.x = s.x, c.y = s.y, o.getOwner().remove(o);
+							}
+							this.graphManager.add(n, n.source, n.target);
+						}
+					}
+				}, f.transform = function(e, t, n, r) {
+					if (n != null && r != null) {
+						var i = t;
+						if (e <= 50) {
+							var a = t / n;
+							i -= (t - a) / 50 * (50 - e);
+						} else {
+							var o = t * r;
+							i += (o - t) / 50 * (e - 50);
+						}
+						return i;
+					} else {
+						var s, c;
+						return e <= 50 ? (s = 9 * t / 500, c = t / 10) : (s = 9 * t / 50, c = -8 * t), s * e + c;
+					}
+				}, f.findCenterOfTree = function(e) {
+					var t = [];
+					t = t.concat(e);
+					var n = [], r = /* @__PURE__ */ new Map(), i = !1, a = null;
+					(t.length == 1 || t.length == 2) && (i = !0, a = t[0]);
+					for (var o = 0; o < t.length; o++) {
+						var s = t[o], c = s.getNeighborsList().size;
+						r.set(s, s.getNeighborsList().size), c == 1 && n.push(s);
+					}
+					var l = [];
+					for (l = l.concat(n); !i;) {
+						var u = [];
+						u = u.concat(l), l = [];
+						for (var o = 0; o < t.length; o++) {
+							var s = t[o], d = t.indexOf(s);
+							d >= 0 && t.splice(d, 1), s.getNeighborsList().forEach(function(e) {
+								if (n.indexOf(e) < 0) {
+									var t = r.get(e) - 1;
+									t == 1 && l.push(e), r.set(e, t);
+								}
+							});
+						}
+						n = n.concat(l), (t.length == 1 || t.length == 2) && (i = !0, a = t[0]);
+					}
+					return a;
+				}, f.prototype.setGraphManager = function(e) {
+					this.graphManager = e;
+				}, e.exports = f;
+			}),
+			(function(e, t, n) {
+				function r() {}
+				r.seed = 1, r.x = 0, r.nextDouble = function() {
+					return r.x = Math.sin(r.seed++) * 1e4, r.x - Math.floor(r.x);
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = n(5);
+				function i(e, t) {
+					this.lworldOrgX = 0, this.lworldOrgY = 0, this.ldeviceOrgX = 0, this.ldeviceOrgY = 0, this.lworldExtX = 1, this.lworldExtY = 1, this.ldeviceExtX = 1, this.ldeviceExtY = 1;
+				}
+				i.prototype.getWorldOrgX = function() {
+					return this.lworldOrgX;
+				}, i.prototype.setWorldOrgX = function(e) {
+					this.lworldOrgX = e;
+				}, i.prototype.getWorldOrgY = function() {
+					return this.lworldOrgY;
+				}, i.prototype.setWorldOrgY = function(e) {
+					this.lworldOrgY = e;
+				}, i.prototype.getWorldExtX = function() {
+					return this.lworldExtX;
+				}, i.prototype.setWorldExtX = function(e) {
+					this.lworldExtX = e;
+				}, i.prototype.getWorldExtY = function() {
+					return this.lworldExtY;
+				}, i.prototype.setWorldExtY = function(e) {
+					this.lworldExtY = e;
+				}, i.prototype.getDeviceOrgX = function() {
+					return this.ldeviceOrgX;
+				}, i.prototype.setDeviceOrgX = function(e) {
+					this.ldeviceOrgX = e;
+				}, i.prototype.getDeviceOrgY = function() {
+					return this.ldeviceOrgY;
+				}, i.prototype.setDeviceOrgY = function(e) {
+					this.ldeviceOrgY = e;
+				}, i.prototype.getDeviceExtX = function() {
+					return this.ldeviceExtX;
+				}, i.prototype.setDeviceExtX = function(e) {
+					this.ldeviceExtX = e;
+				}, i.prototype.getDeviceExtY = function() {
+					return this.ldeviceExtY;
+				}, i.prototype.setDeviceExtY = function(e) {
+					this.ldeviceExtY = e;
+				}, i.prototype.transformX = function(e) {
+					var t = 0, n = this.lworldExtX;
+					return n != 0 && (t = this.ldeviceOrgX + (e - this.lworldOrgX) * this.ldeviceExtX / n), t;
+				}, i.prototype.transformY = function(e) {
+					var t = 0, n = this.lworldExtY;
+					return n != 0 && (t = this.ldeviceOrgY + (e - this.lworldOrgY) * this.ldeviceExtY / n), t;
+				}, i.prototype.inverseTransformX = function(e) {
+					var t = 0, n = this.ldeviceExtX;
+					return n != 0 && (t = this.lworldOrgX + (e - this.ldeviceOrgX) * this.lworldExtX / n), t;
+				}, i.prototype.inverseTransformY = function(e) {
+					var t = 0, n = this.ldeviceExtY;
+					return n != 0 && (t = this.lworldOrgY + (e - this.ldeviceOrgY) * this.lworldExtY / n), t;
+				}, i.prototype.inverseTransformPoint = function(e) {
+					return new r(this.inverseTransformX(e.x), this.inverseTransformY(e.y));
+				}, e.exports = i;
+			}),
+			(function(e, t, n) {
+				function r(e) {
+					if (Array.isArray(e)) {
+						for (var t = 0, n = Array(e.length); t < e.length; t++) n[t] = e[t];
+						return n;
+					} else return Array.from(e);
+				}
+				var i = n(15), a = n(4), o = n(0), s = n(8), c = n(9);
+				function l() {
+					i.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;
+				}
+				for (var u in l.prototype = Object.create(i.prototype), i) l[u] = i[u];
+				l.prototype.initParameters = function() {
+					i.prototype.initParameters.call(this, arguments), this.totalIterations = 0, this.notAnimatedIterations = 0, this.useFRGridVariant = a.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION, this.grid = [];
+				}, l.prototype.calcIdealEdgeLengths = function() {
+					for (var e, t, n, r, i, s, c, l = this.getGraphManager().getAllEdges(), u = 0; u < l.length; u++) e = l[u], t = e.idealLength, e.isInterGraph && (r = e.getSource(), i = e.getTarget(), s = e.getSourceInLca().getEstimatedSize(), c = e.getTargetInLca().getEstimatedSize(), this.useSmartIdealEdgeLengthCalculation && (e.idealLength += s + c - 2 * o.SIMPLE_NODE_SIZE), n = e.getLca().getInclusionTreeDepth(), e.idealLength += t * a.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (r.getInclusionTreeDepth() + i.getInclusionTreeDepth() - 2 * n));
+				}, l.prototype.initSpringEmbedder = function() {
+					var e = this.getAllNodes().length;
+					this.incremental ? (e > a.ADAPTATION_LOWER_NODE_LIMIT && (this.coolingFactor = Math.max(this.coolingFactor * a.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (e - 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) : (e > a.ADAPTATION_LOWER_NODE_LIMIT ? this.coolingFactor = Math.max(a.COOLING_ADAPTATION_FACTOR, 1 - (e - 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();
+				}, l.prototype.calcSpringForces = function() {
+					for (var e = this.getAllEdges(), t, n = 0; n < e.length; n++) t = e[n], this.calcSpringForce(t, t.idealLength);
+				}, l.prototype.calcRepulsionForces = function() {
+					var e = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : !0, t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, n, r, i, o, s = this.getAllNodes(), c;
+					if (this.useFRGridVariant) for (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && e && this.updateGrid(), c = /* @__PURE__ */ new Set(), n = 0; n < s.length; n++) i = s[n], this.calculateRepulsionForceOfANode(i, c, e, t), c.add(i);
+					else for (n = 0; n < s.length; n++) for (i = s[n], r = n + 1; r < s.length; r++) o = s[r], i.getOwner() == o.getOwner() && this.calcRepulsionForce(i, o);
+				}, l.prototype.calcGravitationalForces = function() {
+					for (var e, t = this.getAllNodesToApplyGravitation(), n = 0; n < t.length; n++) e = t[n], this.calcGravitationalForce(e);
+				}, l.prototype.moveNodes = function() {
+					for (var e = this.getAllNodes(), t, n = 0; n < e.length; n++) t = e[n], t.move();
+				}, l.prototype.calcSpringForce = function(e, t) {
+					var n = e.getSource(), r = e.getTarget(), i, a, o, s;
+					if (this.uniformLeafNodeSizes && n.getChild() == null && r.getChild() == null) e.updateLengthSimple();
+					else if (e.updateLength(), e.isOverlapingSourceAndTarget) return;
+					i = e.getLength(), i != 0 && (a = e.edgeElasticity * (i - t), o = a * (e.lengthX / i), s = a * (e.lengthY / i), n.springForceX += o, n.springForceY += s, r.springForceX -= o, r.springForceY -= s);
+				}, l.prototype.calcRepulsionForce = function(e, t) {
+					var n = e.getRect(), r = t.getRect(), i = [, ,], o = [
+						,
+						,
+						,
+						,
+					], l, u, d, f, p, m, h;
+					if (n.intersects(r)) {
+						s.calcSeparationAmount(n, r, i, a.DEFAULT_EDGE_LENGTH / 2), m = 2 * i[0], h = 2 * i[1];
+						var g = e.noOfChildren * t.noOfChildren / (e.noOfChildren + t.noOfChildren);
+						e.repulsionForceX -= g * m, e.repulsionForceY -= g * h, t.repulsionForceX += g * m, t.repulsionForceY += g * h;
+					} else this.uniformLeafNodeSizes && e.getChild() == null && t.getChild() == null ? (l = r.getCenterX() - n.getCenterX(), u = r.getCenterY() - n.getCenterY()) : (s.getIntersection(n, r, o), l = o[2] - o[0], u = o[3] - o[1]), Math.abs(l) < a.MIN_REPULSION_DIST && (l = c.sign(l) * a.MIN_REPULSION_DIST), Math.abs(u) < a.MIN_REPULSION_DIST && (u = c.sign(u) * a.MIN_REPULSION_DIST), d = l * l + u * u, f = Math.sqrt(d), p = (e.nodeRepulsion / 2 + t.nodeRepulsion / 2) * e.noOfChildren * t.noOfChildren / d, m = p * l / f, h = p * u / f, e.repulsionForceX -= m, e.repulsionForceY -= h, t.repulsionForceX += m, t.repulsionForceY += h;
+				}, l.prototype.calcGravitationalForce = function(e) {
+					var t = e.getOwner(), n = (t.getRight() + t.getLeft()) / 2, r = (t.getTop() + t.getBottom()) / 2, i = e.getCenterX() - n, a = e.getCenterY() - r, o = Math.abs(i) + e.getWidth() / 2, s = Math.abs(a) + e.getHeight() / 2, c;
+					e.getOwner() == this.graphManager.getRoot() ? (c = t.getEstimatedSize() * this.gravityRangeFactor, (o > c || s > c) && (e.gravitationForceX = -this.gravityConstant * i, e.gravitationForceY = -this.gravityConstant * a)) : (c = t.getEstimatedSize() * this.compoundGravityRangeFactor, (o > c || s > c) && (e.gravitationForceX = -this.gravityConstant * i * this.compoundGravityConstant, e.gravitationForceY = -this.gravityConstant * a * this.compoundGravityConstant));
+				}, l.prototype.isConverged = function() {
+					var e, t = !1;
+					return this.totalIterations > this.maxIterations / 3 && (t = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2), e = this.totalDisplacement < this.totalDisplacementThreshold, this.oldTotalDisplacement = this.totalDisplacement, e || t;
+				}, l.prototype.animate = function() {
+					this.animationDuringLayout && !this.isSubLayout && (this.notAnimatedIterations == this.animationPeriod ? (this.update(), this.notAnimatedIterations = 0) : this.notAnimatedIterations++);
+				}, l.prototype.calcNoOfChildrenForAllNodes = function() {
+					for (var e, t = this.graphManager.getAllNodes(), n = 0; n < t.length; n++) e = t[n], e.noOfChildren = e.getNoOfChildren();
+				}, l.prototype.calcGrid = function(e) {
+					var t = 0, n = 0;
+					t = parseInt(Math.ceil((e.getRight() - e.getLeft()) / this.repulsionRange)), n = parseInt(Math.ceil((e.getBottom() - e.getTop()) / this.repulsionRange));
+					for (var r = Array(t), i = 0; i < t; i++) r[i] = Array(n);
+					for (var i = 0; i < t; i++) for (var a = 0; a < n; a++) r[i][a] = [];
+					return r;
+				}, l.prototype.addNodeToGrid = function(e, t, n) {
+					var r = 0, i = 0, a = 0, o = 0;
+					r = parseInt(Math.floor((e.getRect().x - t) / this.repulsionRange)), i = parseInt(Math.floor((e.getRect().width + e.getRect().x - t) / this.repulsionRange)), a = parseInt(Math.floor((e.getRect().y - n) / this.repulsionRange)), o = parseInt(Math.floor((e.getRect().height + e.getRect().y - n) / this.repulsionRange));
+					for (var s = r; s <= i; s++) for (var c = a; c <= o; c++) this.grid[s][c].push(e), e.setGridCoordinates(r, i, a, o);
+				}, l.prototype.updateGrid = function() {
+					var e, t, n = this.getAllNodes();
+					for (this.grid = this.calcGrid(this.graphManager.getRoot()), e = 0; e < n.length; e++) t = n[e], this.addNodeToGrid(t, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
+				}, l.prototype.calculateRepulsionForceOfANode = function(e, t, n, i) {
+					if (this.totalIterations % a.GRID_CALCULATION_CHECK_PERIOD == 1 && n || i) {
+						var o = /* @__PURE__ */ new Set();
+						e.surrounding = [];
+						for (var s, c = this.grid, l = e.startX - 1; l < e.finishX + 2; l++) for (var u = e.startY - 1; u < e.finishY + 2; u++) if (!(l < 0 || u < 0 || l >= c.length || u >= c[0].length)) {
+							for (var d = 0; d < c[l][u].length; d++) if (s = c[l][u][d], !(e.getOwner() != s.getOwner() || e == s) && !t.has(s) && !o.has(s)) {
+								var f = Math.abs(e.getCenterX() - s.getCenterX()) - (e.getWidth() / 2 + s.getWidth() / 2), p = Math.abs(e.getCenterY() - s.getCenterY()) - (e.getHeight() / 2 + s.getHeight() / 2);
+								f <= this.repulsionRange && p <= this.repulsionRange && o.add(s);
+							}
+						}
+						e.surrounding = [].concat(r(o));
+					}
+					for (l = 0; l < e.surrounding.length; l++) this.calcRepulsionForce(e, e.surrounding[l]);
+				}, l.prototype.calcRepulsionRange = function() {
+					return 0;
+				}, e.exports = l;
+			}),
+			(function(e, t, n) {
+				var r = n(1), i = n(4);
+				function a(e, t, n) {
+					r.call(this, e, t, n), this.idealLength = i.DEFAULT_EDGE_LENGTH, this.edgeElasticity = i.DEFAULT_SPRING_STRENGTH;
+				}
+				for (var o in a.prototype = Object.create(r.prototype), r) a[o] = r[o];
+				e.exports = a;
+			}),
+			(function(e, t, n) {
+				var r = n(3), i = n(4);
+				function a(e, t, n, a) {
+					r.call(this, e, t, n, a), this.nodeRepulsion = i.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 = [];
+				}
+				for (var o in a.prototype = Object.create(r.prototype), r) a[o] = r[o];
+				a.prototype.setGridCoordinates = function(e, t, n, r) {
+					this.startX = e, this.finishX = t, this.startY = n, this.finishY = r;
+				}, e.exports = a;
+			}),
+			(function(e, t, n) {
+				function r(e, t) {
+					this.width = 0, this.height = 0, e !== null && t !== null && (this.height = t, this.width = e);
+				}
+				r.prototype.getWidth = function() {
+					return this.width;
+				}, r.prototype.setWidth = function(e) {
+					this.width = e;
+				}, r.prototype.getHeight = function() {
+					return this.height;
+				}, r.prototype.setHeight = function(e) {
+					this.height = e;
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = n(14);
+				function i() {
+					this.map = {}, this.keys = [];
+				}
+				i.prototype.put = function(e, t) {
+					var n = r.createID(e);
+					this.contains(n) || (this.map[n] = t, this.keys.push(e));
+				}, i.prototype.contains = function(e) {
+					return r.createID(e), this.map[e] != null;
+				}, i.prototype.get = function(e) {
+					var t = r.createID(e);
+					return this.map[t];
+				}, i.prototype.keySet = function() {
+					return this.keys;
+				}, e.exports = i;
+			}),
+			(function(e, t, n) {
+				var r = n(14);
+				function i() {
+					this.set = {};
+				}
+				i.prototype.add = function(e) {
+					var t = r.createID(e);
+					this.contains(t) || (this.set[t] = e);
+				}, i.prototype.remove = function(e) {
+					delete this.set[r.createID(e)];
+				}, i.prototype.clear = function() {
+					this.set = {};
+				}, i.prototype.contains = function(e) {
+					return this.set[r.createID(e)] == e;
+				}, i.prototype.isEmpty = function() {
+					return this.size() === 0;
+				}, i.prototype.size = function() {
+					return Object.keys(this.set).length;
+				}, i.prototype.addAllTo = function(e) {
+					for (var t = Object.keys(this.set), n = t.length, r = 0; r < n; r++) e.push(this.set[t[r]]);
+				}, i.prototype.size = function() {
+					return Object.keys(this.set).length;
+				}, i.prototype.addAll = function(e) {
+					for (var t = e.length, n = 0; n < t; n++) {
+						var r = e[n];
+						this.add(r);
+					}
+				}, e.exports = i;
+			}),
+			(function(e, t, n) {
+				function r() {}
+				r.multMat = function(e, t) {
+					for (var n = [], r = 0; r < e.length; r++) {
+						n[r] = [];
+						for (var i = 0; i < t[0].length; i++) {
+							n[r][i] = 0;
+							for (var a = 0; a < e[0].length; a++) n[r][i] += e[r][a] * t[a][i];
+						}
+					}
+					return n;
+				}, r.transpose = function(e) {
+					for (var t = [], n = 0; n < e[0].length; n++) {
+						t[n] = [];
+						for (var r = 0; r < e.length; r++) t[n][r] = e[r][n];
+					}
+					return t;
+				}, r.multCons = function(e, t) {
+					for (var n = [], r = 0; r < e.length; r++) n[r] = e[r] * t;
+					return n;
+				}, r.minusOp = function(e, t) {
+					for (var n = [], r = 0; r < e.length; r++) n[r] = e[r] - t[r];
+					return n;
+				}, r.dotProduct = function(e, t) {
+					for (var n = 0, r = 0; r < e.length; r++) n += e[r] * t[r];
+					return n;
+				}, r.mag = function(e) {
+					return Math.sqrt(this.dotProduct(e, e));
+				}, r.normalize = function(e) {
+					for (var t = [], n = this.mag(e), r = 0; r < e.length; r++) t[r] = e[r] / n;
+					return t;
+				}, r.multGamma = function(e) {
+					for (var t = [], n = 0, r = 0; r < e.length; r++) n += e[r];
+					n *= -1 / e.length;
+					for (var i = 0; i < e.length; i++) t[i] = n + e[i];
+					return t;
+				}, r.multL = function(e, t, n) {
+					for (var r = [], i = [], a = [], o = 0; o < t[0].length; o++) {
+						for (var s = 0, c = 0; c < t.length; c++) s += -.5 * t[c][o] * e[c];
+						i[o] = s;
+					}
+					for (var l = 0; l < n.length; l++) {
+						for (var u = 0, d = 0; d < n.length; d++) u += n[l][d] * i[d];
+						a[l] = u;
+					}
+					for (var f = 0; f < t.length; f++) {
+						for (var p = 0, m = 0; m < t[0].length; m++) p += t[f][m] * a[m];
+						r[f] = p;
+					}
+					return r;
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = function() {
+					function e(e, t) {
+						for (var n = 0; n < t.length; n++) {
+							var r = t[n];
+							r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r);
+						}
+					}
+					return function(t, n, r) {
+						return n && e(t.prototype, n), r && e(t, r), t;
+					};
+				}();
+				function i(e, t) {
+					if (!(e instanceof t)) throw TypeError("Cannot call a class as a function");
+				}
+				var a = n(11);
+				e.exports = function() {
+					function e(t, n) {
+						i(this, e), (n !== null || n !== void 0) && (this.compareFunction = this._defaultCompareFunction);
+						var r = void 0;
+						r = t instanceof a ? t.size() : t.length, this._quicksort(t, 0, r - 1);
+					}
+					return r(e, [
+						{
+							key: "_quicksort",
+							value: function(e, t, n) {
+								if (t < n) {
+									var r = this._partition(e, t, n);
+									this._quicksort(e, t, r), this._quicksort(e, r + 1, n);
+								}
+							}
+						},
+						{
+							key: "_partition",
+							value: function(e, t, n) {
+								for (var r = this._get(e, t), i = t, a = n;;) {
+									for (; this.compareFunction(r, this._get(e, a));) a--;
+									for (; this.compareFunction(this._get(e, i), r);) i++;
+									if (i < a) this._swap(e, i, a), i++, a--;
+									else return a;
+								}
+							}
+						},
+						{
+							key: "_get",
+							value: function(e, t) {
+								return e instanceof a ? e.get_object_at(t) : e[t];
+							}
+						},
+						{
+							key: "_set",
+							value: function(e, t, n) {
+								e instanceof a ? e.set_object_at(t, n) : e[t] = n;
+							}
+						},
+						{
+							key: "_swap",
+							value: function(e, t, n) {
+								var r = this._get(e, t);
+								this._set(e, t, this._get(e, n)), this._set(e, n, r);
+							}
+						},
+						{
+							key: "_defaultCompareFunction",
+							value: function(e, t) {
+								return t > e;
+							}
+						}
+					]), e;
+				}();
+			}),
+			(function(e, t, n) {
+				function r() {}
+				r.svd = function(e) {
+					this.U = null, this.V = null, this.s = null, this.m = 0, this.n = 0, this.m = e.length, this.n = e[0].length;
+					var t = Math.min(this.m, this.n);
+					this.s = function(e) {
+						for (var t = []; e-- > 0;) t.push(0);
+						return t;
+					}(Math.min(this.m + 1, this.n)), this.U = function(e) {
+						return function e(t) {
+							if (t.length == 0) return 0;
+							for (var n = [], r = 0; r < t[0]; r++) n.push(e(t.slice(1)));
+							return n;
+						}(e);
+					}([this.m, t]), this.V = function(e) {
+						return function e(t) {
+							if (t.length == 0) return 0;
+							for (var n = [], r = 0; r < t[0]; r++) n.push(e(t.slice(1)));
+							return n;
+						}(e);
+					}([this.n, this.n]);
+					for (var n = function(e) {
+						for (var t = []; e-- > 0;) t.push(0);
+						return t;
+					}(this.n), i = function(e) {
+						for (var t = []; e-- > 0;) t.push(0);
+						return t;
+					}(this.m), a = !0, o = !0, s = Math.min(this.m - 1, this.n), c = Math.max(0, Math.min(this.n - 2, this.m)), l = 0; l < Math.max(s, c); l++) {
+						if (l < s) {
+							this.s[l] = 0;
+							for (var u = l; u < this.m; u++) this.s[l] = r.hypot(this.s[l], e[u][l]);
+							if (this.s[l] !== 0) {
+								e[l][l] < 0 && (this.s[l] = -this.s[l]);
+								for (var d = l; d < this.m; d++) e[d][l] /= this.s[l];
+								e[l][l] += 1;
+							}
+							this.s[l] = -this.s[l];
+						}
+						for (var f = l + 1; f < this.n; f++) {
+							if (function(e, t) {
+								return e && t;
+							}(l < s, this.s[l] !== 0)) {
+								for (var p = 0, m = l; m < this.m; m++) p += e[m][l] * e[m][f];
+								p = -p / e[l][l];
+								for (var h = l; h < this.m; h++) e[h][f] += p * e[h][l];
+							}
+							n[f] = e[l][f];
+						}
+						if (function(e, t) {
+							return e && t;
+						}(a, l < s)) for (var g = l; g < this.m; g++) this.U[g][l] = e[g][l];
+						if (l < c) {
+							n[l] = 0;
+							for (var _ = l + 1; _ < this.n; _++) n[l] = r.hypot(n[l], n[_]);
+							if (n[l] !== 0) {
+								n[l + 1] < 0 && (n[l] = -n[l]);
+								for (var v = l + 1; v < this.n; v++) n[v] /= n[l];
+								n[l + 1] += 1;
+							}
+							if (n[l] = -n[l], function(e, t) {
+								return e && t;
+							}(l + 1 < this.m, n[l] !== 0)) {
+								for (var y = l + 1; y < this.m; y++) i[y] = 0;
+								for (var b = l + 1; b < this.n; b++) for (var x = l + 1; x < this.m; x++) i[x] += n[b] * e[x][b];
+								for (var S = l + 1; S < this.n; S++) for (var C = -n[S] / n[l + 1], w = l + 1; w < this.m; w++) e[w][S] += C * i[w];
+							}
+							if (o) for (var T = l + 1; T < this.n; T++) this.V[T][l] = n[T];
+						}
+					}
+					var E = Math.min(this.n, this.m + 1);
+					if (s < this.n && (this.s[s] = e[s][s]), this.m < E && (this.s[E - 1] = 0), c + 1 < E && (n[c] = e[c][E - 1]), n[E - 1] = 0, a) {
+						for (var D = s; D < t; D++) {
+							for (var O = 0; O < this.m; O++) this.U[O][D] = 0;
+							this.U[D][D] = 1;
+						}
+						for (var k = s - 1; k >= 0; k--) if (this.s[k] !== 0) {
+							for (var A = k + 1; A < t; A++) {
+								for (var j = 0, M = k; M < this.m; M++) j += this.U[M][k] * this.U[M][A];
+								j = -j / this.U[k][k];
+								for (var N = k; N < this.m; N++) this.U[N][A] += j * this.U[N][k];
+							}
+							for (var ee = k; ee < this.m; ee++) this.U[ee][k] = -this.U[ee][k];
+							this.U[k][k] = 1 + this.U[k][k];
+							for (var te = 0; te < k - 1; te++) this.U[te][k] = 0;
+						} else {
+							for (var ne = 0; ne < this.m; ne++) this.U[ne][k] = 0;
+							this.U[k][k] = 1;
+						}
+					}
+					if (o) for (var P = this.n - 1; P >= 0; P--) {
+						if (function(e, t) {
+							return e && t;
+						}(P < c, n[P] !== 0)) for (var re = P + 1; re < t; re++) {
+							for (var ie = 0, ae = P + 1; ae < this.n; ae++) ie += this.V[ae][P] * this.V[ae][re];
+							ie = -ie / this.V[P + 1][P];
+							for (var oe = P + 1; oe < this.n; oe++) this.V[oe][re] += ie * this.V[oe][P];
+						}
+						for (var se = 0; se < this.n; se++) this.V[se][P] = 0;
+						this.V[P][P] = 1;
+					}
+					for (var ce = E - 1, le = 0, ue = 2 ** -52, de = 2 ** -966; E > 0;) {
+						var F = void 0, I = void 0;
+						for (F = E - 2; F >= -1 && F !== -1; F--) if (Math.abs(n[F]) <= de + ue * (Math.abs(this.s[F]) + Math.abs(this.s[F + 1]))) {
+							n[F] = 0;
+							break;
+						}
+						if (F === E - 2) I = 4;
+						else {
+							var L = void 0;
+							for (L = E - 1; L >= F && L !== F; L--) {
+								var fe = (L === E ? 0 : Math.abs(n[L])) + (L === F + 1 ? 0 : Math.abs(n[L - 1]));
+								if (Math.abs(this.s[L]) <= de + ue * fe) {
+									this.s[L] = 0;
+									break;
+								}
+							}
+							L === F ? I = 3 : L === E - 1 ? I = 1 : (I = 2, F = L);
+						}
+						switch (F++, I) {
+							case 1:
+								var pe = n[E - 2];
+								n[E - 2] = 0;
+								for (var R = E - 2; R >= F; R--) {
+									var me = r.hypot(this.s[R], pe), he = this.s[R] / me, ge = pe / me;
+									if (this.s[R] = me, R !== F && (pe = -ge * n[R - 1], n[R - 1] = he * n[R - 1]), o) for (var z = 0; z < this.n; z++) me = he * this.V[z][R] + ge * this.V[z][E - 1], this.V[z][E - 1] = -ge * this.V[z][R] + he * this.V[z][E - 1], this.V[z][R] = me;
+								}
+								break;
+							case 2:
+								var _e = n[F - 1];
+								n[F - 1] = 0;
+								for (var B = F; B < E; B++) {
+									var ve = r.hypot(this.s[B], _e), ye = this.s[B] / ve, be = _e / ve;
+									if (this.s[B] = ve, _e = -be * n[B], n[B] = ye * n[B], a) for (var V = 0; V < this.m; V++) ve = ye * this.U[V][B] + be * this.U[V][F - 1], this.U[V][F - 1] = -be * this.U[V][B] + ye * this.U[V][F - 1], this.U[V][B] = ve;
+								}
+								break;
+							case 3:
+								var xe = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[E - 1]), Math.abs(this.s[E - 2])), Math.abs(n[E - 2])), Math.abs(this.s[F])), Math.abs(n[F])), H = this.s[E - 1] / xe, Se = this.s[E - 2] / xe, Ce = n[E - 2] / xe, we = this.s[F] / xe, Te = n[F] / xe, Ee = ((Se + H) * (Se - H) + Ce * Ce) / 2, De = H * Ce * (H * Ce), U = 0;
+								(function(e, t) {
+									return e || t;
+								})(Ee !== 0, De !== 0) && (U = Math.sqrt(Ee * Ee + De), Ee < 0 && (U = -U), U = De / (Ee + U));
+								for (var W = (we + H) * (we - H) + U, G = we * Te, K = F; K < E - 1; K++) {
+									var q = r.hypot(W, G), J = W / q, Y = G / q;
+									if (K !== F && (n[K - 1] = q), W = J * this.s[K] + Y * n[K], n[K] = J * n[K] - Y * this.s[K], G = Y * this.s[K + 1], this.s[K + 1] = J * this.s[K + 1], o) for (var X = 0; X < this.n; X++) q = J * this.V[X][K] + Y * this.V[X][K + 1], this.V[X][K + 1] = -Y * this.V[X][K] + J * this.V[X][K + 1], this.V[X][K] = q;
+									if (q = r.hypot(W, G), J = W / q, Y = G / q, this.s[K] = q, W = J * n[K] + Y * this.s[K + 1], this.s[K + 1] = -Y * n[K] + J * this.s[K + 1], G = Y * n[K + 1], n[K + 1] = J * n[K + 1], a && K < this.m - 1) for (var Z = 0; Z < this.m; Z++) q = J * this.U[Z][K] + Y * this.U[Z][K + 1], this.U[Z][K + 1] = -Y * this.U[Z][K] + J * this.U[Z][K + 1], this.U[Z][K] = q;
+								}
+								n[E - 2] = W, le += 1;
+								break;
+							case 4:
+								if (this.s[F] <= 0 && (this.s[F] = this.s[F] < 0 ? -this.s[F] : 0, o)) for (var Oe = 0; Oe <= ce; Oe++) this.V[Oe][F] = -this.V[Oe][F];
+								for (; F < ce && !(this.s[F] >= this.s[F + 1]);) {
+									var ke = this.s[F];
+									if (this.s[F] = this.s[F + 1], this.s[F + 1] = ke, o && F < this.n - 1) for (var Q = 0; Q < this.n; Q++) ke = this.V[Q][F + 1], this.V[Q][F + 1] = this.V[Q][F], this.V[Q][F] = ke;
+									if (a && F < this.m - 1) for (var $ = 0; $ < this.m; $++) ke = this.U[$][F + 1], this.U[$][F + 1] = this.U[$][F], this.U[$][F] = ke;
+									F++;
+								}
+								le = 0, E--;
+								break;
+						}
+					}
+					return {
+						U: this.U,
+						V: this.V,
+						S: this.s
+					};
+				}, r.hypot = function(e, t) {
+					var n = void 0;
+					return Math.abs(e) > Math.abs(t) ? (n = t / e, n = Math.abs(e) * Math.sqrt(1 + n * n)) : t == 0 ? n = 0 : (n = e / t, n = Math.abs(t) * Math.sqrt(1 + n * n)), n;
+				}, e.exports = r;
+			}),
+			(function(e, t, n) {
+				var r = function() {
+					function e(e, t) {
+						for (var n = 0; n < t.length; n++) {
+							var r = t[n];
+							r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r);
+						}
+					}
+					return function(t, n, r) {
+						return n && e(t.prototype, n), r && e(t, r), t;
+					};
+				}();
+				function i(e, t) {
+					if (!(e instanceof t)) throw TypeError("Cannot call a class as a function");
+				}
+				e.exports = function() {
+					function e(t, n) {
+						var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, a = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : -1, o = arguments.length > 4 && arguments[4] !== void 0 ? arguments[4] : -1;
+						i(this, e), this.sequence1 = t, this.sequence2 = n, this.match_score = r, this.mismatch_penalty = a, this.gap_penalty = o, this.iMax = t.length + 1, this.jMax = n.length + 1, this.grid = Array(this.iMax);
+						for (var s = 0; s < this.iMax; s++) {
+							this.grid[s] = Array(this.jMax);
+							for (var c = 0; c < this.jMax; c++) this.grid[s][c] = 0;
+						}
+						this.tracebackGrid = Array(this.iMax);
+						for (var l = 0; l < this.iMax; l++) {
+							this.tracebackGrid[l] = Array(this.jMax);
+							for (var u = 0; u < this.jMax; u++) this.tracebackGrid[l][u] = [
+								null,
+								null,
+								null
+							];
+						}
+						this.alignments = [], this.score = -1, this.computeGrids();
+					}
+					return r(e, [
+						{
+							key: "getScore",
+							value: function() {
+								return this.score;
+							}
+						},
+						{
+							key: "getAlignments",
+							value: function() {
+								return this.alignments;
+							}
+						},
+						{
+							key: "computeGrids",
+							value: function() {
+								for (var e = 1; e < this.jMax; e++) this.grid[0][e] = this.grid[0][e - 1] + this.gap_penalty, this.tracebackGrid[0][e] = [
+									!1,
+									!1,
+									!0
+								];
+								for (var t = 1; t < this.iMax; t++) this.grid[t][0] = this.grid[t - 1][0] + this.gap_penalty, this.tracebackGrid[t][0] = [
+									!1,
+									!0,
+									!1
+								];
+								for (var n = 1; n < this.iMax; n++) for (var r = 1; r < this.jMax; r++) {
+									var i = void 0;
+									i = this.sequence1[n - 1] === this.sequence2[r - 1] ? this.grid[n - 1][r - 1] + this.match_score : this.grid[n - 1][r - 1] + this.mismatch_penalty;
+									var a = this.grid[n - 1][r] + this.gap_penalty, o = this.grid[n][r - 1] + this.gap_penalty, s = [
+										i,
+										a,
+										o
+									], c = this.arrayAllMaxIndexes(s);
+									this.grid[n][r] = s[c[0]], this.tracebackGrid[n][r] = [
+										c.includes(0),
+										c.includes(1),
+										c.includes(2)
+									];
+								}
+								this.score = this.grid[this.iMax - 1][this.jMax - 1];
+							}
+						},
+						{
+							key: "alignmentTraceback",
+							value: function() {
+								var e = [];
+								for (e.push({
+									pos: [this.sequence1.length, this.sequence2.length],
+									seq1: "",
+									seq2: ""
+								}); e[0];) {
+									var t = e[0], n = this.tracebackGrid[t.pos[0]][t.pos[1]];
+									n[0] && e.push({
+										pos: [t.pos[0] - 1, t.pos[1] - 1],
+										seq1: this.sequence1[t.pos[0] - 1] + t.seq1,
+										seq2: this.sequence2[t.pos[1] - 1] + t.seq2
+									}), n[1] && e.push({
+										pos: [t.pos[0] - 1, t.pos[1]],
+										seq1: this.sequence1[t.pos[0] - 1] + t.seq1,
+										seq2: "-" + t.seq2
+									}), n[2] && e.push({
+										pos: [t.pos[0], t.pos[1] - 1],
+										seq1: "-" + t.seq1,
+										seq2: this.sequence2[t.pos[1] - 1] + t.seq2
+									}), t.pos[0] === 0 && t.pos[1] === 0 && this.alignments.push({
+										sequence1: t.seq1,
+										sequence2: t.seq2
+									}), e.shift();
+								}
+								return this.alignments;
+							}
+						},
+						{
+							key: "getAllIndexes",
+							value: function(e, t) {
+								for (var n = [], r = -1; (r = e.indexOf(t, r + 1)) !== -1;) n.push(r);
+								return n;
+							}
+						},
+						{
+							key: "arrayAllMaxIndexes",
+							value: function(e) {
+								return this.getAllIndexes(e, Math.max.apply(null, e));
+							}
+						}
+					]), e;
+				}();
+			}),
+			(function(e, t, n) {
+				var r = function() {};
+				r.FDLayout = n(18), r.FDLayoutConstants = n(4), r.FDLayoutEdge = n(19), r.FDLayoutNode = n(20), r.DimensionD = n(21), r.HashMap = n(22), r.HashSet = n(23), r.IGeometry = n(8), r.IMath = n(9), r.Integer = n(10), r.Point = n(12), r.PointD = n(5), r.RandomSeed = n(16), r.RectangleD = n(13), r.Transform = n(17), r.UniqueIDGeneretor = n(14), r.Quicksort = n(25), r.LinkedList = n(11), r.LGraphObject = n(2), r.LGraph = n(6), r.LEdge = n(1), r.LGraphManager = n(7), r.LNode = n(3), r.Layout = n(15), r.LayoutConstants = n(0), r.NeedlemanWunsch = n(27), r.Matrix = n(24), r.SVD = n(26), e.exports = r;
+			}),
+			(function(e, t, n) {
+				function r() {
+					this.listeners = [];
+				}
+				var i = r.prototype;
+				i.addListener = function(e, t) {
+					this.listeners.push({
+						event: e,
+						callback: t
+					});
+				}, i.removeListener = function(e, t) {
+					for (var n = this.listeners.length; n >= 0; n--) {
+						var r = this.listeners[n];
+						r.event === e && r.callback === t && this.listeners.splice(n, 1);
+					}
+				}, i.emit = function(e, t) {
+					for (var n = 0; n < this.listeners.length; n++) {
+						var r = this.listeners[n];
+						e === r.event && r.callback(t);
+					}
+				}, e.exports = r;
+			})
+		]);
+	});
+}));
+export default require_layout_base();
+export { require_layout_base };