likec4 1.56.0 → 1.58.0

package/__app__/src/chunks/libs/@dagrejs/dagre.mjs

@@ -0,0 +1,1894 @@
+import { t as e } from "../../rolldown-runtime.mjs";
+//#region ../../node_modules/.pnpm/@dagrejs+graphlib@2.2.4/node_modules/@dagrejs/graphlib/lib/graph.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	var n = "\0", r = "\0", i = "
", Graph = class {
+		_isDirected = !0;
+		_isMultigraph = !1;
+		_isCompound = !1;
+		_label;
+		_defaultNodeLabelFn = () => void 0;
+		_defaultEdgeLabelFn = () => void 0;
+		_nodes = {};
+		_in = {};
+		_preds = {};
+		_out = {};
+		_sucs = {};
+		_edgeObjs = {};
+		_edgeLabels = {};
+		_nodeCount = 0;
+		_edgeCount = 0;
+		_parent;
+		_children;
+		constructor(e) {
+			e && (this._isDirected = Object.hasOwn(e, "directed") ? e.directed : !0, this._isMultigraph = Object.hasOwn(e, "multigraph") ? e.multigraph : !1, this._isCompound = Object.hasOwn(e, "compound") ? e.compound : !1), this._isCompound && (this._parent = {}, this._children = {}, this._children[r] = {});
+		}
+		isDirected() {
+			return this._isDirected;
+		}
+		isMultigraph() {
+			return this._isMultigraph;
+		}
+		isCompound() {
+			return this._isCompound;
+		}
+		setGraph(e) {
+			return this._label = e, this;
+		}
+		graph() {
+			return this._label;
+		}
+		setDefaultNodeLabel(e) {
+			return this._defaultNodeLabelFn = e, typeof e != "function" && (this._defaultNodeLabelFn = () => e), this;
+		}
+		nodeCount() {
+			return this._nodeCount;
+		}
+		nodes() {
+			return Object.keys(this._nodes);
+		}
+		sources() {
+			var e = this;
+			return this.nodes().filter((t) => Object.keys(e._in[t]).length === 0);
+		}
+		sinks() {
+			var e = this;
+			return this.nodes().filter((t) => Object.keys(e._out[t]).length === 0);
+		}
+		setNodes(e, t) {
+			var n = arguments, r = this;
+			return e.forEach(function(e) {
+				n.length > 1 ? r.setNode(e, t) : r.setNode(e);
+			}), this;
+		}
+		setNode(e, t) {
+			return Object.hasOwn(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = r, this._children[e] = {}, this._children[r][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+		}
+		node(e) {
+			return this._nodes[e];
+		}
+		hasNode(e) {
+			return Object.hasOwn(this._nodes, e);
+		}
+		removeNode(e) {
+			var t = this;
+			if (Object.hasOwn(this._nodes, e)) {
+				var removeEdge = (e) => t.removeEdge(t._edgeObjs[e]);
+				delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach(function(e) {
+					t.setParent(e);
+				}), delete this._children[e]), Object.keys(this._in[e]).forEach(removeEdge), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(removeEdge), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+			}
+			return this;
+		}
+		setParent(e, t) {
+			if (!this._isCompound) throw Error("Cannot set parent in a non-compound graph");
+			if (t === void 0) t = r;
+			else {
+				t += "";
+				for (var n = t; n !== void 0; n = this.parent(n)) if (n === e) throw Error("Setting " + t + " as parent of " + e + " would create a cycle");
+				this.setNode(t);
+			}
+			return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+		}
+		_removeFromParentsChildList(e) {
+			delete this._children[this._parent[e]][e];
+		}
+		parent(e) {
+			if (this._isCompound) {
+				var t = this._parent[e];
+				if (t !== r) return t;
+			}
+		}
+		children(e = r) {
+			if (this._isCompound) {
+				var t = this._children[e];
+				if (t) return Object.keys(t);
+			} else if (e === r) return this.nodes();
+			else if (this.hasNode(e)) return [];
+		}
+		predecessors(e) {
+			var t = this._preds[e];
+			if (t) return Object.keys(t);
+		}
+		successors(e) {
+			var t = this._sucs[e];
+			if (t) return Object.keys(t);
+		}
+		neighbors(e) {
+			var t = this.predecessors(e);
+			if (t) {
+				let r = new Set(t);
+				for (var n of this.successors(e)) r.add(n);
+				return Array.from(r.values());
+			}
+		}
+		isLeaf(e) {
+			return (this.isDirected() ? this.successors(e) : this.neighbors(e)).length === 0;
+		}
+		filterNodes(e) {
+			var t = new this.constructor({
+				directed: this._isDirected,
+				multigraph: this._isMultigraph,
+				compound: this._isCompound
+			});
+			t.setGraph(this.graph());
+			var n = this;
+			Object.entries(this._nodes).forEach(function([n, r]) {
+				e(n) && t.setNode(n, r);
+			}), Object.values(this._edgeObjs).forEach(function(e) {
+				t.hasNode(e.v) && t.hasNode(e.w) && t.setEdge(e, n.edge(e));
+			});
+			var r = {};
+			function findParent(e) {
+				var i = n.parent(e);
+				return i === void 0 || t.hasNode(i) ? (r[e] = i, i) : i in r ? r[i] : findParent(i);
+			}
+			return this._isCompound && t.nodes().forEach((e) => t.setParent(e, findParent(e))), t;
+		}
+		setDefaultEdgeLabel(e) {
+			return this._defaultEdgeLabelFn = e, typeof e != "function" && (this._defaultEdgeLabelFn = () => e), this;
+		}
+		edgeCount() {
+			return this._edgeCount;
+		}
+		edges() {
+			return Object.values(this._edgeObjs);
+		}
+		setPath(e, t) {
+			var n = this, r = arguments;
+			return e.reduce(function(e, i) {
+				return r.length > 1 ? n.setEdge(e, i, t) : n.setEdge(e, i), i;
+			}), this;
+		}
+		setEdge() {
+			var e, t, n, r, i = !1, a = arguments[0];
+			typeof a == "object" && a && "v" in a ? (e = a.v, t = a.w, n = a.name, arguments.length === 2 && (r = arguments[1], i = !0)) : (e = a, t = arguments[1], n = arguments[3], arguments.length > 2 && (r = arguments[2], i = !0)), e = "" + e, t = "" + t, n !== void 0 && (n = "" + n);
+			var o = edgeArgsToId(this._isDirected, e, t, n);
+			if (Object.hasOwn(this._edgeLabels, o)) return i && (this._edgeLabels[o] = r), this;
+			if (n !== void 0 && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
+			this.setNode(e), this.setNode(t), this._edgeLabels[o] = i ? r : this._defaultEdgeLabelFn(e, t, n);
+			var s = edgeArgsToObj(this._isDirected, e, t, n);
+			return e = s.v, t = s.w, Object.freeze(s), this._edgeObjs[o] = s, incrementOrInitEntry(this._preds[t], e), incrementOrInitEntry(this._sucs[e], t), this._in[t][o] = s, this._out[e][o] = s, this._edgeCount++, this;
+		}
+		edge(e, t, n) {
+			var r = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, t, n);
+			return this._edgeLabels[r];
+		}
+		edgeAsObj() {
+			let e = this.edge(...arguments);
+			return typeof e == "object" ? e : { label: e };
+		}
+		hasEdge(e, t, n) {
+			var r = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, t, n);
+			return Object.hasOwn(this._edgeLabels, r);
+		}
+		removeEdge(e, t, n) {
+			var r = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, t, n), i = this._edgeObjs[r];
+			return i && (e = i.v, t = i.w, delete this._edgeLabels[r], delete this._edgeObjs[r], decrementOrRemoveEntry(this._preds[t], e), decrementOrRemoveEntry(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+		}
+		inEdges(e, t) {
+			var n = this._in[e];
+			if (n) {
+				var r = Object.values(n);
+				return t ? r.filter((e) => e.v === t) : r;
+			}
+		}
+		outEdges(e, t) {
+			var n = this._out[e];
+			if (n) {
+				var r = Object.values(n);
+				return t ? r.filter((e) => e.w === t) : r;
+			}
+		}
+		nodeEdges(e, t) {
+			var n = this.inEdges(e, t);
+			if (n) return n.concat(this.outEdges(e, t));
+		}
+	};
+	function incrementOrInitEntry(e, t) {
+		e[t] ? e[t]++ : e[t] = 1;
+	}
+	function decrementOrRemoveEntry(e, t) {
+		--e[t] || delete e[t];
+	}
+	function edgeArgsToId(e, t, r, a) {
+		var o = "" + t, s = "" + r;
+		if (!e && o > s) {
+			var c = o;
+			o = s, s = c;
+		}
+		return o + i + s + i + (a === void 0 ? n : a);
+	}
+	function edgeArgsToObj(e, t, n, r) {
+		var i = "" + t, a = "" + n;
+		if (!e && i > a) {
+			var o = i;
+			i = a, a = o;
+		}
+		var s = {
+			v: i,
+			w: a
+		};
+		return r && (s.name = r), s;
+	}
+	function edgeObjToId(e, t) {
+		return edgeArgsToId(e, t.v, t.w, t.name);
+	}
+	t.exports = Graph;
+})), n = /* @__PURE__ */ e(((e, t) => {
+	t.exports = "2.2.4";
+})), r = /* @__PURE__ */ e(((e, r) => {
+	r.exports = {
+		Graph: t(),
+		version: n()
+	};
+})), i = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	n.exports = {
+		write,
+		read
+	};
+	function write(e) {
+		var t = {
+			options: {
+				directed: e.isDirected(),
+				multigraph: e.isMultigraph(),
+				compound: e.isCompound()
+			},
+			nodes: writeNodes(e),
+			edges: writeEdges(e)
+		};
+		return e.graph() !== void 0 && (t.value = structuredClone(e.graph())), t;
+	}
+	function writeNodes(e) {
+		return e.nodes().map(function(t) {
+			var n = e.node(t), r = e.parent(t), i = { v: t };
+			return n !== void 0 && (i.value = n), r !== void 0 && (i.parent = r), i;
+		});
+	}
+	function writeEdges(e) {
+		return e.edges().map(function(t) {
+			var n = e.edge(t), r = {
+				v: t.v,
+				w: t.w
+			};
+			return t.name !== void 0 && (r.name = t.name), n !== void 0 && (r.value = n), r;
+		});
+	}
+	function read(e) {
+		var t = new r(e.options).setGraph(e.value);
+		return e.nodes.forEach(function(e) {
+			t.setNode(e.v, e.value), e.parent && t.setParent(e.v, e.parent);
+		}), e.edges.forEach(function(e) {
+			t.setEdge({
+				v: e.v,
+				w: e.w,
+				name: e.name
+			}, e.value);
+		}), t;
+	}
+})), a = /* @__PURE__ */ e(((e, t) => {
+	t.exports = components;
+	function components(e) {
+		var t = {}, n = [], r;
+		function dfs(n) {
+			Object.hasOwn(t, n) || (t[n] = !0, r.push(n), e.successors(n).forEach(dfs), e.predecessors(n).forEach(dfs));
+		}
+		return e.nodes().forEach(function(e) {
+			r = [], dfs(e), r.length && n.push(r);
+		}), n;
+	}
+})), o = /* @__PURE__ */ e(((e, t) => {
+	var PriorityQueue = class {
+		_arr = [];
+		_keyIndices = {};
+		size() {
+			return this._arr.length;
+		}
+		keys() {
+			return this._arr.map(function(e) {
+				return e.key;
+			});
+		}
+		has(e) {
+			return Object.hasOwn(this._keyIndices, e);
+		}
+		priority(e) {
+			var t = this._keyIndices[e];
+			if (t !== void 0) return this._arr[t].priority;
+		}
+		min() {
+			if (this.size() === 0) throw Error("Queue underflow");
+			return this._arr[0].key;
+		}
+		add(e, t) {
+			var n = this._keyIndices;
+			if (e = String(e), !Object.hasOwn(n, e)) {
+				var r = this._arr, i = r.length;
+				return n[e] = i, r.push({
+					key: e,
+					priority: t
+				}), this._decrease(i), !0;
+			}
+			return !1;
+		}
+		removeMin() {
+			this._swap(0, this._arr.length - 1);
+			var e = this._arr.pop();
+			return delete this._keyIndices[e.key], this._heapify(0), e.key;
+		}
+		decrease(e, t) {
+			var n = this._keyIndices[e];
+			if (t > this._arr[n].priority) throw Error("New priority is greater than current priority. Key: " + e + " Old: " + this._arr[n].priority + " New: " + t);
+			this._arr[n].priority = t, this._decrease(n);
+		}
+		_heapify(e) {
+			var t = this._arr, n = 2 * e, r = n + 1, i = e;
+			n < t.length && (i = t[n].priority < t[i].priority ? n : i, r < t.length && (i = t[r].priority < t[i].priority ? r : i), i !== e && (this._swap(e, i), this._heapify(i)));
+		}
+		_decrease(e) {
+			for (var t = this._arr, n = t[e].priority, r; e !== 0 && (r = e >> 1, !(t[r].priority < n));) this._swap(e, r), e = r;
+		}
+		_swap(e, t) {
+			var n = this._arr, r = this._keyIndices, i = n[e], a = n[t];
+			n[e] = a, n[t] = i, r[a.key] = e, r[i.key] = t;
+		}
+	};
+	t.exports = PriorityQueue;
+})), s = /* @__PURE__ */ e(((e, t) => {
+	var n = o();
+	t.exports = dijkstra;
+	var DEFAULT_WEIGHT_FUNC = () => 1;
+	function dijkstra(e, t, n, r) {
+		return runDijkstra(e, String(t), n || DEFAULT_WEIGHT_FUNC, r || function(t) {
+			return e.outEdges(t);
+		});
+	}
+	function runDijkstra(e, t, r, i) {
+		var a = {}, o = new n(), s, c, updateNeighbors = function(e) {
+			var t = e.v === s ? e.w : e.v, n = a[t], i = r(e), l = c.distance + i;
+			if (i < 0) throw Error("dijkstra does not allow negative edge weights. Bad edge: " + e + " Weight: " + i);
+			l < n.distance && (n.distance = l, n.predecessor = s, o.decrease(t, l));
+		};
+		for (e.nodes().forEach(function(e) {
+			var n = e === t ? 0 : Infinity;
+			a[e] = { distance: n }, o.add(e, n);
+		}); o.size() > 0 && (s = o.removeMin(), c = a[s], c.distance !== Infinity);) i(s).forEach(updateNeighbors);
+		return a;
+	}
+})), c = /* @__PURE__ */ e(((e, t) => {
+	var n = s();
+	t.exports = dijkstraAll;
+	function dijkstraAll(e, t, r) {
+		return e.nodes().reduce(function(i, a) {
+			return i[a] = n(e, a, t, r), i;
+		}, {});
+	}
+})), l = /* @__PURE__ */ e(((e, t) => {
+	t.exports = tarjan;
+	function tarjan(e) {
+		var t = 0, n = [], r = {}, i = [];
+		function dfs(a) {
+			var o = r[a] = {
+				onStack: !0,
+				lowlink: t,
+				index: t++
+			};
+			if (n.push(a), e.successors(a).forEach(function(e) {
+				Object.hasOwn(r, e) ? r[e].onStack && (o.lowlink = Math.min(o.lowlink, r[e].index)) : (dfs(e), o.lowlink = Math.min(o.lowlink, r[e].lowlink));
+			}), o.lowlink === o.index) {
+				var s = [], c;
+				do
+					c = n.pop(), r[c].onStack = !1, s.push(c);
+				while (a !== c);
+				i.push(s);
+			}
+		}
+		return e.nodes().forEach(function(e) {
+			Object.hasOwn(r, e) || dfs(e);
+		}), i;
+	}
+})), u = /* @__PURE__ */ e(((e, t) => {
+	var n = l();
+	t.exports = findCycles;
+	function findCycles(e) {
+		return n(e).filter(function(t) {
+			return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
+		});
+	}
+})), d = /* @__PURE__ */ e(((e, t) => {
+	t.exports = floydWarshall;
+	var DEFAULT_WEIGHT_FUNC = () => 1;
+	function floydWarshall(e, t, n) {
+		return runFloydWarshall(e, t || DEFAULT_WEIGHT_FUNC, n || function(t) {
+			return e.outEdges(t);
+		});
+	}
+	function runFloydWarshall(e, t, n) {
+		var r = {}, i = e.nodes();
+		return i.forEach(function(e) {
+			r[e] = {}, r[e][e] = { distance: 0 }, i.forEach(function(t) {
+				e !== t && (r[e][t] = { distance: Infinity });
+			}), n(e).forEach(function(n) {
+				var i = n.v === e ? n.w : n.v, a = t(n);
+				r[e][i] = {
+					distance: a,
+					predecessor: e
+				};
+			});
+		}), i.forEach(function(e) {
+			var t = r[e];
+			i.forEach(function(n) {
+				var a = r[n];
+				i.forEach(function(n) {
+					var r = a[e], i = t[n], o = a[n], s = r.distance + i.distance;
+					s < o.distance && (o.distance = s, o.predecessor = i.predecessor);
+				});
+			});
+		}), r;
+	}
+})), f = /* @__PURE__ */ e(((e, t) => {
+	function topsort(e) {
+		var t = {}, n = {}, r = [];
+		function visit(i) {
+			if (Object.hasOwn(n, i)) throw new CycleException();
+			Object.hasOwn(t, i) || (n[i] = !0, t[i] = !0, e.predecessors(i).forEach(visit), delete n[i], r.push(i));
+		}
+		if (e.sinks().forEach(visit), Object.keys(t).length !== e.nodeCount()) throw new CycleException();
+		return r;
+	}
+	var CycleException = class extends Error {
+		constructor() {
+			super(...arguments);
+		}
+	};
+	t.exports = topsort, topsort.CycleException = CycleException;
+})), p = /* @__PURE__ */ e(((e, t) => {
+	var n = f();
+	t.exports = isAcyclic;
+	function isAcyclic(e) {
+		try {
+			n(e);
+		} catch (e) {
+			if (e instanceof n.CycleException) return !1;
+			throw e;
+		}
+		return !0;
+	}
+})), m = /* @__PURE__ */ e(((e, t) => {
+	t.exports = dfs;
+	function dfs(e, t, n) {
+		Array.isArray(t) || (t = [t]);
+		var r = e.isDirected() ? (t) => e.successors(t) : (t) => e.neighbors(t), i = n === "post" ? postOrderDfs : preOrderDfs, a = [], o = {};
+		return t.forEach((t) => {
+			if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
+			i(t, r, o, a);
+		}), a;
+	}
+	function postOrderDfs(e, t, n, r) {
+		for (var i = [[e, !1]]; i.length > 0;) {
+			var a = i.pop();
+			a[1] ? r.push(a[0]) : Object.hasOwn(n, a[0]) || (n[a[0]] = !0, i.push([a[0], !0]), forEachRight(t(a[0]), (e) => i.push([e, !1])));
+		}
+	}
+	function preOrderDfs(e, t, n, r) {
+		for (var i = [e]; i.length > 0;) {
+			var a = i.pop();
+			Object.hasOwn(n, a) || (n[a] = !0, r.push(a), forEachRight(t(a), (e) => i.push(e)));
+		}
+	}
+	function forEachRight(e, t) {
+		for (var n = e.length; n--;) t(e[n], n, e);
+		return e;
+	}
+})), h = /* @__PURE__ */ e(((e, t) => {
+	var n = m();
+	t.exports = postorder;
+	function postorder(e, t) {
+		return n(e, t, "post");
+	}
+})), g = /* @__PURE__ */ e(((e, t) => {
+	var n = m();
+	t.exports = preorder;
+	function preorder(e, t) {
+		return n(e, t, "pre");
+	}
+})), _ = /* @__PURE__ */ e(((e, n) => {
+	var r = t(), i = o();
+	n.exports = prim;
+	function prim(e, t) {
+		var n = new r(), a = {}, o = new i(), s;
+		function updateNeighbors(e) {
+			var n = e.v === s ? e.w : e.v, r = o.priority(n);
+			if (r !== void 0) {
+				var i = t(e);
+				i < r && (a[n] = s, o.decrease(n, i));
+			}
+		}
+		if (e.nodeCount() === 0) return n;
+		e.nodes().forEach(function(e) {
+			o.add(e, Infinity), n.setNode(e);
+		}), o.decrease(e.nodes()[0], 0);
+		for (var c = !1; o.size() > 0;) {
+			if (s = o.removeMin(), Object.hasOwn(a, s)) n.setEdge(s, a[s]);
+			else if (c) throw Error("Input graph is not connected: " + e);
+			else c = !0;
+			e.nodeEdges(s).forEach(updateNeighbors);
+		}
+		return n;
+	}
+})), v = /* @__PURE__ */ e(((e, t) => {
+	t.exports = {
+		components: a(),
+		dijkstra: s(),
+		dijkstraAll: c(),
+		findCycles: u(),
+		floydWarshall: d(),
+		isAcyclic: p(),
+		postorder: h(),
+		preorder: g(),
+		prim: _(),
+		tarjan: l(),
+		topsort: f()
+	};
+})), y = /* @__PURE__ */ e(((e, t) => {
+	var n = r();
+	t.exports = {
+		Graph: n.Graph,
+		json: i(),
+		alg: v(),
+		version: n.version
+	};
+})), b = /* @__PURE__ */ e(((e, t) => {
+	var List = class {
+		constructor() {
+			let e = {};
+			e._next = e._prev = e, this._sentinel = e;
+		}
+		dequeue() {
+			let e = this._sentinel, t = e._prev;
+			if (t !== e) return unlink(t), t;
+		}
+		enqueue(e) {
+			let t = this._sentinel;
+			e._prev && e._next && unlink(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+		}
+		toString() {
+			let e = [], t = this._sentinel, n = t._prev;
+			for (; n !== t;) e.push(JSON.stringify(n, filterOutLinks)), n = n._prev;
+			return "[" + e.join(", ") + "]";
+		}
+	};
+	function unlink(e) {
+		e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+	}
+	function filterOutLinks(e, t) {
+		if (e !== "_next" && e !== "_prev") return t;
+	}
+	t.exports = List;
+})), x = /* @__PURE__ */ e(((e, t) => {
+	var n = y().Graph, r = b();
+	t.exports = greedyFAS;
+	var DEFAULT_WEIGHT_FN = () => 1;
+	function greedyFAS(e, t) {
+		if (e.nodeCount() <= 1) return [];
+		let n = buildState(e, t || DEFAULT_WEIGHT_FN);
+		return doGreedyFAS(n.graph, n.buckets, n.zeroIdx).flatMap((t) => e.outEdges(t.v, t.w));
+	}
+	function doGreedyFAS(e, t, n) {
+		let r = [], i = t[t.length - 1], a = t[0], o;
+		for (; e.nodeCount();) {
+			for (; o = a.dequeue();) removeNode(e, t, n, o);
+			for (; o = i.dequeue();) removeNode(e, t, n, o);
+			if (e.nodeCount()) {
+				for (let i = t.length - 2; i > 0; --i) if (o = t[i].dequeue(), o) {
+					r = r.concat(removeNode(e, t, n, o, !0));
+					break;
+				}
+			}
+		}
+		return r;
+	}
+	function removeNode(e, t, n, r, i) {
+		let a = i ? [] : void 0;
+		return e.inEdges(r.v).forEach((r) => {
+			let o = e.edge(r), s = e.node(r.v);
+			i && a.push({
+				v: r.v,
+				w: r.w
+			}), s.out -= o, assignBucket(t, n, s);
+		}), e.outEdges(r.v).forEach((r) => {
+			let i = e.edge(r), a = r.w, o = e.node(a);
+			o.in -= i, assignBucket(t, n, o);
+		}), e.removeNode(r.v), a;
+	}
+	function buildState(e, t) {
+		let i = new n(), a = 0, o = 0;
+		e.nodes().forEach((e) => {
+			i.setNode(e, {
+				v: e,
+				in: 0,
+				out: 0
+			});
+		}), e.edges().forEach((e) => {
+			let n = i.edge(e.v, e.w) || 0, r = t(e), s = n + r;
+			i.setEdge(e.v, e.w, s), o = Math.max(o, i.node(e.v).out += r), a = Math.max(a, i.node(e.w).in += r);
+		});
+		let s = range(o + a + 3).map(() => new r()), c = a + 1;
+		return i.nodes().forEach((e) => {
+			assignBucket(s, c, i.node(e));
+		}), {
+			graph: i,
+			buckets: s,
+			zeroIdx: c
+		};
+	}
+	function assignBucket(e, t, n) {
+		n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
+	}
+	function range(e) {
+		let t = [];
+		for (let n = 0; n < e; n++) t.push(n);
+		return t;
+	}
+})), S = /* @__PURE__ */ e(((e, t) => {
+	var n = y().Graph;
+	t.exports = {
+		addBorderNode,
+		addDummyNode,
+		applyWithChunking,
+		asNonCompoundGraph,
+		buildLayerMatrix,
+		intersectRect,
+		mapValues,
+		maxRank,
+		normalizeRanks,
+		notime,
+		partition,
+		pick,
+		predecessorWeights,
+		range,
+		removeEmptyRanks,
+		simplify,
+		successorWeights,
+		time,
+		uniqueId,
+		zipObject
+	};
+	function addDummyNode(e, t, n, r) {
+		for (var i = r; e.hasNode(i);) i = uniqueId(r);
+		return n.dummy = t, e.setNode(i, n), i;
+	}
+	function simplify(e) {
+		let t = new n().setGraph(e.graph());
+		return e.nodes().forEach((n) => t.setNode(n, e.node(n))), e.edges().forEach((n) => {
+			let r = t.edge(n.v, n.w) || {
+				weight: 0,
+				minlen: 1
+			}, i = e.edge(n);
+			t.setEdge(n.v, n.w, {
+				weight: r.weight + i.weight,
+				minlen: Math.max(r.minlen, i.minlen)
+			});
+		}), t;
+	}
+	function asNonCompoundGraph(e) {
+		let t = new n({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+		return e.nodes().forEach((n) => {
+			e.children(n).length || t.setNode(n, e.node(n));
+		}), e.edges().forEach((n) => {
+			t.setEdge(n, e.edge(n));
+		}), t;
+	}
+	function successorWeights(e) {
+		let t = e.nodes().map((t) => {
+			let n = {};
+			return e.outEdges(t).forEach((t) => {
+				n[t.w] = (n[t.w] || 0) + e.edge(t).weight;
+			}), n;
+		});
+		return zipObject(e.nodes(), t);
+	}
+	function predecessorWeights(e) {
+		let t = e.nodes().map((t) => {
+			let n = {};
+			return e.inEdges(t).forEach((t) => {
+				n[t.v] = (n[t.v] || 0) + e.edge(t).weight;
+			}), n;
+		});
+		return zipObject(e.nodes(), t);
+	}
+	function intersectRect(e, t) {
+		let n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
+		if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
+		let c, l;
+		return Math.abs(a) * o > Math.abs(i) * s ? (a < 0 && (s = -s), c = s * i / a, l = s) : (i < 0 && (o = -o), c = o, l = o * a / i), {
+			x: n + c,
+			y: r + l
+		};
+	}
+	function buildLayerMatrix(e) {
+		let t = range(maxRank(e) + 1).map(() => []);
+		return e.nodes().forEach((n) => {
+			let r = e.node(n), i = r.rank;
+			i !== void 0 && (t[i][r.order] = n);
+		}), t;
+	}
+	function normalizeRanks(e) {
+		let t = e.nodes().map((t) => {
+			let n = e.node(t).rank;
+			return n === void 0 ? Number.MAX_VALUE : n;
+		}), n = applyWithChunking(Math.min, t);
+		e.nodes().forEach((t) => {
+			let r = e.node(t);
+			Object.hasOwn(r, "rank") && (r.rank -= n);
+		});
+	}
+	function removeEmptyRanks(e) {
+		let t = e.nodes().map((t) => e.node(t).rank), n = applyWithChunking(Math.min, t), r = [];
+		e.nodes().forEach((t) => {
+			let i = e.node(t).rank - n;
+			r[i] || (r[i] = []), r[i].push(t);
+		});
+		let i = 0, a = e.graph().nodeRankFactor;
+		Array.from(r).forEach((t, n) => {
+			t === void 0 && n % a !== 0 ? --i : t !== void 0 && i && t.forEach((t) => e.node(t).rank += i);
+		});
+	}
+	function addBorderNode(e, t, n, r) {
+		let i = {
+			width: 0,
+			height: 0
+		};
+		return arguments.length >= 4 && (i.rank = n, i.order = r), addDummyNode(e, "border", i, t);
+	}
+	function splitToChunks(e, t = r) {
+		let n = [];
+		for (let r = 0; r < e.length; r += t) {
+			let i = e.slice(r, r + t);
+			n.push(i);
+		}
+		return n;
+	}
+	var r = 65535;
+	function applyWithChunking(e, t) {
+		if (t.length > r) {
+			let n = splitToChunks(t);
+			return e.apply(null, n.map((t) => e.apply(null, t)));
+		} else return e.apply(null, t);
+	}
+	function maxRank(e) {
+		let t = e.nodes().map((t) => {
+			let n = e.node(t).rank;
+			return n === void 0 ? Number.MIN_VALUE : n;
+		});
+		return applyWithChunking(Math.max, t);
+	}
+	function partition(e, t) {
+		let n = {
+			lhs: [],
+			rhs: []
+		};
+		return e.forEach((e) => {
+			t(e) ? n.lhs.push(e) : n.rhs.push(e);
+		}), n;
+	}
+	function time(e, t) {
+		let n = Date.now();
+		try {
+			return t();
+		} finally {
+			console.log(e + " time: " + (Date.now() - n) + "ms");
+		}
+	}
+	function notime(e, t) {
+		return t();
+	}
+	var i = 0;
+	function uniqueId(e) {
+		return e + ("" + ++i);
+	}
+	function range(e, t, n = 1) {
+		t ?? (t = e, e = 0);
+		let endCon = (e) => e < t;
+		n < 0 && (endCon = (e) => t < e);
+		let r = [];
+		for (let t = e; endCon(t); t += n) r.push(t);
+		return r;
+	}
+	function pick(e, t) {
+		let n = {};
+		for (let r of t) e[r] !== void 0 && (n[r] = e[r]);
+		return n;
+	}
+	function mapValues(e, t) {
+		let func = t;
+		return typeof t == "string" && (func = (e) => e[t]), Object.entries(e).reduce((e, [t, n]) => (e[t] = func(n, t), e), {});
+	}
+	function zipObject(e, t) {
+		return e.reduce((e, n, r) => (e[n] = t[r], e), {});
+	}
+})), C = /* @__PURE__ */ e(((e, t) => {
+	var n = x(), r = S().uniqueId;
+	t.exports = {
+		run,
+		undo
+	};
+	function run(e) {
+		(e.graph().acyclicer === "greedy" ? n(e, weightFn(e)) : dfsFAS(e)).forEach((t) => {
+			let n = e.edge(t);
+			e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, r("rev"));
+		});
+		function weightFn(e) {
+			return (t) => e.edge(t).weight;
+		}
+	}
+	function dfsFAS(e) {
+		let t = [], n = {}, r = {};
+		function dfs(i) {
+			Object.hasOwn(r, i) || (r[i] = !0, n[i] = !0, e.outEdges(i).forEach((e) => {
+				Object.hasOwn(n, e.w) ? t.push(e) : dfs(e.w);
+			}), delete n[i]);
+		}
+		return e.nodes().forEach(dfs), t;
+	}
+	function undo(e) {
+		e.edges().forEach((t) => {
+			let n = e.edge(t);
+			if (n.reversed) {
+				e.removeEdge(t);
+				let r = n.forwardName;
+				delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
+			}
+		});
+	}
+})), w = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = {
+		run,
+		undo
+	};
+	function run(e) {
+		e.graph().dummyChains = [], e.edges().forEach((t) => normalizeEdge(e, t));
+	}
+	function normalizeEdge(e, t) {
+		let r = t.v, i = e.node(r).rank, a = t.w, o = e.node(a).rank, s = t.name, c = e.edge(t), l = c.labelRank;
+		if (o === i + 1) return;
+		e.removeEdge(t);
+		let u, d, f;
+		for (f = 0, ++i; i < o; ++f, ++i) c.points = [], d = {
+			width: 0,
+			height: 0,
+			edgeLabel: c,
+			edgeObj: t,
+			rank: i
+		}, u = n.addDummyNode(e, "edge", d, "_d"), i === l && (d.width = c.width, d.height = c.height, d.dummy = "edge-label", d.labelpos = c.labelpos), e.setEdge(r, u, { weight: c.weight }, s), f === 0 && e.graph().dummyChains.push(u), r = u;
+		e.setEdge(r, a, { weight: c.weight }, s);
+	}
+	function undo(e) {
+		e.graph().dummyChains.forEach((t) => {
+			let n = e.node(t), r = n.edgeLabel, i;
+			for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
+				x: n.x,
+				y: n.y
+			}), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), t = i, n = e.node(t);
+		});
+	}
+})), T = /* @__PURE__ */ e(((e, t) => {
+	var { applyWithChunking: n } = S();
+	t.exports = {
+		longestPath,
+		slack
+	};
+	function longestPath(e) {
+		var t = {};
+		function dfs(r) {
+			var i = e.node(r);
+			if (Object.hasOwn(t, r)) return i.rank;
+			t[r] = !0;
+			let a = e.outEdges(r).map((t) => t == null ? Infinity : dfs(t.w) - e.edge(t).minlen);
+			var o = n(Math.min, a);
+			return o === Infinity && (o = 0), i.rank = o;
+		}
+		e.sources().forEach(dfs);
+	}
+	function slack(e, t) {
+		return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+	}
+})), E = /* @__PURE__ */ e(((e, t) => {
+	var n = y().Graph, r = T().slack;
+	t.exports = feasibleTree;
+	function feasibleTree(e) {
+		var t = new n({ directed: !1 }), i = e.nodes()[0], a = e.nodeCount();
+		t.setNode(i, {});
+		for (var o, s; tightTree(t, e) < a;) o = findMinSlackEdge(t, e), s = t.hasNode(o.v) ? r(e, o) : -r(e, o), shiftRanks(t, e, s);
+		return t;
+	}
+	function tightTree(e, t) {
+		function dfs(n) {
+			t.nodeEdges(n).forEach((i) => {
+				var a = i.v, o = n === a ? i.w : a;
+				!e.hasNode(o) && !r(t, i) && (e.setNode(o, {}), e.setEdge(n, o, {}), dfs(o));
+			});
+		}
+		return e.nodes().forEach(dfs), e.nodeCount();
+	}
+	function findMinSlackEdge(e, t) {
+		return t.edges().reduce((n, i) => {
+			let a = Infinity;
+			return e.hasNode(i.v) !== e.hasNode(i.w) && (a = r(t, i)), a < n[0] ? [a, i] : n;
+		}, [Infinity, null])[1];
+	}
+	function shiftRanks(e, t, n) {
+		e.nodes().forEach((e) => t.node(e).rank += n);
+	}
+})), D = /* @__PURE__ */ e(((e, t) => {
+	var n = E(), r = T().slack, i = T().longestPath, a = y().alg.preorder, o = y().alg.postorder, s = S().simplify;
+	t.exports = networkSimplex, networkSimplex.initLowLimValues = initLowLimValues, networkSimplex.initCutValues = initCutValues, networkSimplex.calcCutValue = calcCutValue, networkSimplex.leaveEdge = leaveEdge, networkSimplex.enterEdge = enterEdge, networkSimplex.exchangeEdges = exchangeEdges;
+	function networkSimplex(e) {
+		e = s(e), i(e);
+		var t = n(e);
+		initLowLimValues(t), initCutValues(t, e);
+		for (var r, a; r = leaveEdge(t);) a = enterEdge(t, e, r), exchangeEdges(t, e, r, a);
+	}
+	function initCutValues(e, t) {
+		var n = o(e, e.nodes());
+		n = n.slice(0, n.length - 1), n.forEach((n) => assignCutValue(e, t, n));
+	}
+	function assignCutValue(e, t, n) {
+		var r = e.node(n).parent;
+		e.edge(n, r).cutvalue = calcCutValue(e, t, n);
+	}
+	function calcCutValue(e, t, n) {
+		var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
+		return a ||= (i = !1, t.edge(r, n)), o = a.weight, t.nodeEdges(n).forEach((a) => {
+			var s = a.v === n, c = s ? a.w : a.v;
+			if (c !== r) {
+				var l = s === i, u = t.edge(a).weight;
+				if (o += l ? u : -u, isTreeEdge(e, n, c)) {
+					var d = e.edge(n, c).cutvalue;
+					o += l ? -d : d;
+				}
+			}
+		}), o;
+	}
+	function initLowLimValues(e, t) {
+		arguments.length < 2 && (t = e.nodes()[0]), dfsAssignLowLim(e, {}, 1, t);
+	}
+	function dfsAssignLowLim(e, t, n, r, i) {
+		var a = n, o = e.node(r);
+		return t[r] = !0, e.neighbors(r).forEach((i) => {
+			Object.hasOwn(t, i) || (n = dfsAssignLowLim(e, t, n, i, r));
+		}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
+	}
+	function leaveEdge(e) {
+		return e.edges().find((t) => e.edge(t).cutvalue < 0);
+	}
+	function enterEdge(e, t, n) {
+		var i = n.v, a = n.w;
+		t.hasEdge(i, a) || (i = n.w, a = n.v);
+		var o = e.node(i), s = e.node(a), c = o, l = !1;
+		return o.lim > s.lim && (c = s, l = !0), t.edges().filter((t) => l === isDescendant(e, e.node(t.v), c) && l !== isDescendant(e, e.node(t.w), c)).reduce((e, n) => r(t, n) < r(t, e) ? n : e);
+	}
+	function exchangeEdges(e, t, n, r) {
+		var i = n.v, a = n.w;
+		e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), initLowLimValues(e), initCutValues(e, t), updateRanks(e, t);
+	}
+	function updateRanks(e, t) {
+		var n = a(e, e.nodes().find((e) => !t.node(e).parent));
+		n = n.slice(1), n.forEach((n) => {
+			var r = e.node(n).parent, i = t.edge(n, r), a = !1;
+			i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
+		});
+	}
+	function isTreeEdge(e, t, n) {
+		return e.hasEdge(t, n);
+	}
+	function isDescendant(e, t, n) {
+		return n.low <= t.lim && t.lim <= n.lim;
+	}
+})), O = /* @__PURE__ */ e(((e, t) => {
+	var n = T().longestPath, r = E(), i = D();
+	t.exports = rank;
+	function rank(e) {
+		var t = e.graph().ranker;
+		if (t instanceof Function) return t(e);
+		switch (e.graph().ranker) {
+			case "network-simplex":
+				networkSimplexRanker(e);
+				break;
+			case "tight-tree":
+				tightTreeRanker(e);
+				break;
+			case "longest-path":
+				a(e);
+				break;
+			case "none": break;
+			default: networkSimplexRanker(e);
+		}
+	}
+	var a = n;
+	function tightTreeRanker(e) {
+		n(e), r(e);
+	}
+	function networkSimplexRanker(e) {
+		i(e);
+	}
+})), k = /* @__PURE__ */ e(((e, t) => {
+	t.exports = parentDummyChains;
+	function parentDummyChains(e) {
+		let t = postorder(e);
+		e.graph().dummyChains.forEach((n) => {
+			let r = e.node(n), i = r.edgeObj, a = findPath(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0;
+			for (; n !== i.w;) {
+				if (r = e.node(n), u) {
+					for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
+					l === s && (u = !1);
+				}
+				if (!u) {
+					for (; c < o.length - 1 && e.node(l = o[c + 1]).minRank <= r.rank;) c++;
+					l = o[c];
+				}
+				e.setParent(n, l), n = e.successors(n)[0];
+			}
+		});
+	}
+	function findPath(e, t, n, r) {
+		let i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c, l;
+		c = n;
+		do
+			c = e.parent(c), i.push(c);
+		while (c && (t[c].low > o || s > t[c].lim));
+		for (l = c, c = r; (c = e.parent(c)) !== l;) a.push(c);
+		return {
+			path: i.concat(a.reverse()),
+			lca: l
+		};
+	}
+	function postorder(e) {
+		let t = {}, n = 0;
+		function dfs(r) {
+			let i = n;
+			e.children(r).forEach(dfs), t[r] = {
+				low: i,
+				lim: n++
+			};
+		}
+		return e.children().forEach(dfs), t;
+	}
+})), A = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = {
+		run,
+		cleanup
+	};
+	function run(e) {
+		let t = n.addDummyNode(e, "root", {}, "_root"), r = treeDepths(e), i = Object.values(r), a = n.applyWithChunking(Math.max, i) - 1, o = 2 * a + 1;
+		e.graph().nestingRoot = t, e.edges().forEach((t) => e.edge(t).minlen *= o);
+		let s = sumWeights(e) + 1;
+		e.children().forEach((n) => dfs(e, t, o, s, a, r, n)), e.graph().nodeRankFactor = o;
+	}
+	function dfs(e, t, r, i, a, o, s) {
+		let c = e.children(s);
+		if (!c.length) {
+			s !== t && e.setEdge(t, s, {
+				weight: 0,
+				minlen: r
+			});
+			return;
+		}
+		let l = n.addBorderNode(e, "_bt"), u = n.addBorderNode(e, "_bb"), d = e.node(s);
+		e.setParent(l, s), d.borderTop = l, e.setParent(u, s), d.borderBottom = u, c.forEach((n) => {
+			dfs(e, t, r, i, a, o, n);
+			let c = e.node(n), d = c.borderTop ? c.borderTop : n, f = c.borderBottom ? c.borderBottom : n, p = c.borderTop ? i : 2 * i, m = d === f ? a - o[s] + 1 : 1;
+			e.setEdge(l, d, {
+				weight: p,
+				minlen: m,
+				nestingEdge: !0
+			}), e.setEdge(f, u, {
+				weight: p,
+				minlen: m,
+				nestingEdge: !0
+			});
+		}), e.parent(s) || e.setEdge(t, l, {
+			weight: 0,
+			minlen: a + o[s]
+		});
+	}
+	function treeDepths(e) {
+		var t = {};
+		function dfs(n, r) {
+			var i = e.children(n);
+			i && i.length && i.forEach((e) => dfs(e, r + 1)), t[n] = r;
+		}
+		return e.children().forEach((e) => dfs(e, 1)), t;
+	}
+	function sumWeights(e) {
+		return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
+	}
+	function cleanup(e) {
+		var t = e.graph();
+		e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((t) => {
+			e.edge(t).nestingEdge && e.removeEdge(t);
+		});
+	}
+})), j = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = addBorderSegments;
+	function addBorderSegments(e) {
+		function dfs(t) {
+			let n = e.children(t), r = e.node(t);
+			if (n.length && n.forEach(dfs), Object.hasOwn(r, "minRank")) {
+				r.borderLeft = [], r.borderRight = [];
+				for (let n = r.minRank, i = r.maxRank + 1; n < i; ++n) addBorderNode(e, "borderLeft", "_bl", t, r, n), addBorderNode(e, "borderRight", "_br", t, r, n);
+			}
+		}
+		e.children().forEach(dfs);
+	}
+	function addBorderNode(e, t, r, i, a, o) {
+		let s = {
+			width: 0,
+			height: 0,
+			rank: o,
+			borderType: t
+		}, c = a[t][o - 1], l = n.addDummyNode(e, "border", s, r);
+		a[t][o] = l, e.setParent(l, i), c && e.setEdge(c, l, { weight: 1 });
+	}
+})), M = /* @__PURE__ */ e(((e, t) => {
+	t.exports = {
+		adjust,
+		undo
+	};
+	function adjust(e) {
+		let t = e.graph().rankdir.toLowerCase();
+		(t === "lr" || t === "rl") && swapWidthHeight(e);
+	}
+	function undo(e) {
+		let t = e.graph().rankdir.toLowerCase();
+		(t === "bt" || t === "rl") && reverseY(e), (t === "lr" || t === "rl") && (swapXY(e), swapWidthHeight(e));
+	}
+	function swapWidthHeight(e) {
+		e.nodes().forEach((t) => swapWidthHeightOne(e.node(t))), e.edges().forEach((t) => swapWidthHeightOne(e.edge(t)));
+	}
+	function swapWidthHeightOne(e) {
+		let t = e.width;
+		e.width = e.height, e.height = t;
+	}
+	function reverseY(e) {
+		e.nodes().forEach((t) => reverseYOne(e.node(t))), e.edges().forEach((t) => {
+			let n = e.edge(t);
+			n.points.forEach(reverseYOne), Object.hasOwn(n, "y") && reverseYOne(n);
+		});
+	}
+	function reverseYOne(e) {
+		e.y = -e.y;
+	}
+	function swapXY(e) {
+		e.nodes().forEach((t) => swapXYOne(e.node(t))), e.edges().forEach((t) => {
+			let n = e.edge(t);
+			n.points.forEach(swapXYOne), Object.hasOwn(n, "x") && swapXYOne(n);
+		});
+	}
+	function swapXYOne(e) {
+		let t = e.x;
+		e.x = e.y, e.y = t;
+	}
+})), N = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = initOrder;
+	function initOrder(e) {
+		let t = {}, r = e.nodes().filter((t) => !e.children(t).length), i = r.map((t) => e.node(t).rank), a = n.applyWithChunking(Math.max, i), o = n.range(a + 1).map(() => []);
+		function dfs(n) {
+			t[n] || (t[n] = !0, o[e.node(n).rank].push(n), e.successors(n).forEach(dfs));
+		}
+		return r.sort((t, n) => e.node(t).rank - e.node(n).rank).forEach(dfs), o;
+	}
+})), P = /* @__PURE__ */ e(((e, t) => {
+	var n = S().zipObject;
+	t.exports = crossCount;
+	function crossCount(e, t) {
+		let n = 0;
+		for (let r = 1; r < t.length; ++r) n += twoLayerCrossCount(e, t[r - 1], t[r]);
+		return n;
+	}
+	function twoLayerCrossCount(e, t, r) {
+		let i = n(r, r.map((e, t) => t)), a = t.flatMap((t) => e.outEdges(t).map((t) => ({
+			pos: i[t.w],
+			weight: e.edge(t).weight
+		})).sort((e, t) => e.pos - t.pos)), o = 1;
+		for (; o < r.length;) o <<= 1;
+		let s = 2 * o - 1;
+		--o;
+		let c = Array(s).fill(0), l = 0;
+		return a.forEach((e) => {
+			let t = e.pos + o;
+			c[t] += e.weight;
+			let n = 0;
+			for (; t > 0;) t % 2 && (n += c[t + 1]), t = t - 1 >> 1, c[t] += e.weight;
+			l += e.weight * n;
+		}), l;
+	}
+})), F = /* @__PURE__ */ e(((e, t) => {
+	t.exports = barycenter;
+	function barycenter(e, t = []) {
+		return t.map((t) => {
+			let n = e.inEdges(t);
+			if (n.length) {
+				let r = n.reduce((t, n) => {
+					let r = e.edge(n), i = e.node(n.v);
+					return {
+						sum: t.sum + r.weight * i.order,
+						weight: t.weight + r.weight
+					};
+				}, {
+					sum: 0,
+					weight: 0
+				});
+				return {
+					v: t,
+					barycenter: r.sum / r.weight,
+					weight: r.weight
+				};
+			} else return { v: t };
+		});
+	}
+})), I = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = resolveConflicts;
+	function resolveConflicts(e, t) {
+		let n = {};
+		return e.forEach((e, t) => {
+			let r = n[e.v] = {
+				indegree: 0,
+				in: [],
+				out: [],
+				vs: [e.v],
+				i: t
+			};
+			e.barycenter !== void 0 && (r.barycenter = e.barycenter, r.weight = e.weight);
+		}), t.edges().forEach((e) => {
+			let t = n[e.v], r = n[e.w];
+			t !== void 0 && r !== void 0 && (r.indegree++, t.out.push(n[e.w]));
+		}), doResolveConflicts(Object.values(n).filter((e) => !e.indegree));
+	}
+	function doResolveConflicts(e) {
+		let t = [];
+		function handleIn(e) {
+			return (t) => {
+				t.merged || (t.barycenter === void 0 || e.barycenter === void 0 || t.barycenter >= e.barycenter) && mergeEntries(e, t);
+			};
+		}
+		function handleOut(t) {
+			return (n) => {
+				n.in.push(t), --n.indegree === 0 && e.push(n);
+			};
+		}
+		for (; e.length;) {
+			let n = e.pop();
+			t.push(n), n.in.reverse().forEach(handleIn(n)), n.out.forEach(handleOut(n));
+		}
+		return t.filter((e) => !e.merged).map((e) => n.pick(e, [
+			"vs",
+			"i",
+			"barycenter",
+			"weight"
+		]));
+	}
+	function mergeEntries(e, t) {
+		let n = 0, r = 0;
+		e.weight && (n += e.barycenter * e.weight, r += e.weight), t.weight && (n += t.barycenter * t.weight, r += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = n / r, e.weight = r, e.i = Math.min(t.i, e.i), t.merged = !0;
+	}
+})), L = /* @__PURE__ */ e(((e, t) => {
+	var n = S();
+	t.exports = sort;
+	function sort(e, t) {
+		let r = n.partition(e, (e) => Object.hasOwn(e, "barycenter")), i = r.lhs, a = r.rhs.sort((e, t) => t.i - e.i), o = [], s = 0, c = 0, l = 0;
+		i.sort(compareWithBias(!!t)), l = consumeUnsortable(o, a, l), i.forEach((e) => {
+			l += e.vs.length, o.push(e.vs), s += e.barycenter * e.weight, c += e.weight, l = consumeUnsortable(o, a, l);
+		});
+		let u = { vs: o.flat(!0) };
+		return c && (u.barycenter = s / c, u.weight = c), u;
+	}
+	function consumeUnsortable(e, t, n) {
+		let r;
+		for (; t.length && (r = t[t.length - 1]).i <= n;) t.pop(), e.push(r.vs), n++;
+		return n;
+	}
+	function compareWithBias(e) {
+		return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
+	}
+})), R = /* @__PURE__ */ e(((e, t) => {
+	var n = F(), r = I(), i = L();
+	t.exports = sortSubgraph;
+	function sortSubgraph(e, t, a, o) {
+		let s = e.children(t), c = e.node(t), l = c ? c.borderLeft : void 0, u = c ? c.borderRight : void 0, d = {};
+		l && (s = s.filter((e) => e !== l && e !== u));
+		let f = n(e, s);
+		f.forEach((t) => {
+			if (e.children(t.v).length) {
+				let n = sortSubgraph(e, t.v, a, o);
+				d[t.v] = n, Object.hasOwn(n, "barycenter") && mergeBarycenters(t, n);
+			}
+		});
+		let p = r(f, a);
+		expandSubgraphs(p, d);
+		let m = i(p, o);
+		if (l && (m.vs = [
+			l,
+			m.vs,
+			u
+		].flat(!0), e.predecessors(l).length)) {
+			let t = e.node(e.predecessors(l)[0]), n = e.node(e.predecessors(u)[0]);
+			Object.hasOwn(m, "barycenter") || (m.barycenter = 0, m.weight = 0), m.barycenter = (m.barycenter * m.weight + t.order + n.order) / (m.weight + 2), m.weight += 2;
+		}
+		return m;
+	}
+	function expandSubgraphs(e, t) {
+		e.forEach((e) => {
+			e.vs = e.vs.flatMap((e) => t[e] ? t[e].vs : e);
+		});
+	}
+	function mergeBarycenters(e, t) {
+		e.barycenter === void 0 ? (e.barycenter = t.barycenter, e.weight = t.weight) : (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight);
+	}
+})), z = /* @__PURE__ */ e(((e, t) => {
+	var n = y().Graph, r = S();
+	t.exports = buildLayerGraph;
+	function buildLayerGraph(e, t, r, i) {
+		i ||= e.nodes();
+		let a = createRootNode(e), o = new n({ compound: !0 }).setGraph({ root: a }).setDefaultNodeLabel((t) => e.node(t));
+		return i.forEach((n) => {
+			let i = e.node(n), s = e.parent(n);
+			(i.rank === t || i.minRank <= t && t <= i.maxRank) && (o.setNode(n), o.setParent(n, s || a), e[r](n).forEach((t) => {
+				let r = t.v === n ? t.w : t.v, i = o.edge(r, n), a = i === void 0 ? 0 : i.weight;
+				o.setEdge(r, n, { weight: e.edge(t).weight + a });
+			}), Object.hasOwn(i, "minRank") && o.setNode(n, {
+				borderLeft: i.borderLeft[t],
+				borderRight: i.borderRight[t]
+			}));
+		}), o;
+	}
+	function createRootNode(e) {
+		for (var t; e.hasNode(t = r.uniqueId("_root")););
+		return t;
+	}
+})), B = /* @__PURE__ */ e(((e, t) => {
+	t.exports = addSubgraphConstraints;
+	function addSubgraphConstraints(e, t, n) {
+		let r = {}, i;
+		n.forEach((n) => {
+			let a = e.parent(n), o, s;
+			for (; a;) {
+				if (o = e.parent(a), o ? (s = r[o], r[o] = a) : (s = i, i = a), s && s !== a) {
+					t.setEdge(s, a);
+					return;
+				}
+				a = o;
+			}
+		});
+	}
+})), V = /* @__PURE__ */ e(((e, t) => {
+	var n = N(), r = P(), i = R(), a = z(), o = B(), s = y().Graph, c = S();
+	t.exports = order;
+	function order(e, t) {
+		if (t && typeof t.customOrder == "function") {
+			t.customOrder(e, order);
+			return;
+		}
+		let i = c.maxRank(e), a = buildLayerGraphs(e, c.range(1, i + 1), "inEdges"), o = buildLayerGraphs(e, c.range(i - 1, -1, -1), "outEdges"), s = n(e);
+		if (assignOrder(e, s), t && t.disableOptimalOrderHeuristic) return;
+		let l = Infinity, u;
+		for (let t = 0, n = 0; n < 4; ++t, ++n) {
+			sweepLayerGraphs(t % 2 ? a : o, t % 4 >= 2), s = c.buildLayerMatrix(e);
+			let i = r(e, s);
+			i < l && (n = 0, u = Object.assign({}, s), l = i);
+		}
+		assignOrder(e, u);
+	}
+	function buildLayerGraphs(e, t, n) {
+		let r = /* @__PURE__ */ new Map(), addNodeToRank = (e, t) => {
+			r.has(e) || r.set(e, []), r.get(e).push(t);
+		};
+		for (let t of e.nodes()) {
+			let n = e.node(t);
+			if (typeof n.rank == "number" && addNodeToRank(n.rank, t), typeof n.minRank == "number" && typeof n.maxRank == "number") for (let e = n.minRank; e <= n.maxRank; e++) e !== n.rank && addNodeToRank(e, t);
+		}
+		return t.map(function(t) {
+			return a(e, t, n, r.get(t) || []);
+		});
+	}
+	function sweepLayerGraphs(e, t) {
+		let n = new s();
+		e.forEach(function(e) {
+			let r = e.graph().root, a = i(e, r, n, t);
+			a.vs.forEach((t, n) => e.node(t).order = n), o(e, n, a.vs);
+		});
+	}
+	function assignOrder(e, t) {
+		Object.values(t).forEach((t) => t.forEach((t, n) => e.node(t).order = n));
+	}
+})), H = /* @__PURE__ */ e(((e, t) => {
+	var n = y().Graph, r = S();
+	t.exports = {
+		positionX,
+		findType1Conflicts,
+		findType2Conflicts,
+		addConflict,
+		hasConflict,
+		verticalAlignment,
+		horizontalCompaction,
+		alignCoordinates,
+		findSmallestWidthAlignment,
+		balance
+	};
+	function findType1Conflicts(e, t) {
+		let n = {};
+		function visitLayer(t, r) {
+			let i = 0, a = 0, o = t.length, s = r[r.length - 1];
+			return r.forEach((t, c) => {
+				let l = findOtherInnerSegmentNode(e, t), u = l ? e.node(l).order : o;
+				(l || t === s) && (r.slice(a, c + 1).forEach((t) => {
+					e.predecessors(t).forEach((r) => {
+						let a = e.node(r), o = a.order;
+						(o < i || u < o) && !(a.dummy && e.node(t).dummy) && addConflict(n, r, t);
+					});
+				}), a = c + 1, i = u);
+			}), r;
+		}
+		return t.length && t.reduce(visitLayer), n;
+	}
+	function findType2Conflicts(e, t) {
+		let n = {};
+		function scan(t, i, a, o, s) {
+			let c;
+			r.range(i, a).forEach((r) => {
+				c = t[r], e.node(c).dummy && e.predecessors(c).forEach((t) => {
+					let r = e.node(t);
+					r.dummy && (r.order < o || r.order > s) && addConflict(n, t, c);
+				});
+			});
+		}
+		function visitLayer(t, n) {
+			let r = -1, i, a = 0;
+			return n.forEach((o, s) => {
+				if (e.node(o).dummy === "border") {
+					let t = e.predecessors(o);
+					t.length && (i = e.node(t[0]).order, scan(n, a, s, r, i), a = s, r = i);
+				}
+				scan(n, a, n.length, i, t.length);
+			}), n;
+		}
+		return t.length && t.reduce(visitLayer), n;
+	}
+	function findOtherInnerSegmentNode(e, t) {
+		if (e.node(t).dummy) return e.predecessors(t).find((t) => e.node(t).dummy);
+	}
+	function addConflict(e, t, n) {
+		if (t > n) {
+			let e = t;
+			t = n, n = e;
+		}
+		let r = e[t];
+		r || (e[t] = r = {}), r[n] = !0;
+	}
+	function hasConflict(e, t, n) {
+		if (t > n) {
+			let e = t;
+			t = n, n = e;
+		}
+		return !!e[t] && Object.hasOwn(e[t], n);
+	}
+	function verticalAlignment(e, t, n, r) {
+		let i = {}, a = {}, o = {};
+		return t.forEach((e) => {
+			e.forEach((e, t) => {
+				i[e] = e, a[e] = e, o[e] = t;
+			});
+		}), t.forEach((e) => {
+			let t = -1;
+			e.forEach((e) => {
+				let s = r(e);
+				if (s.length) {
+					s = s.sort((e, t) => o[e] - o[t]);
+					let r = (s.length - 1) / 2;
+					for (let c = Math.floor(r), l = Math.ceil(r); c <= l; ++c) {
+						let r = s[c];
+						a[e] === e && t < o[r] && !hasConflict(n, e, r) && (a[r] = e, a[e] = i[e] = i[r], t = o[r]);
+					}
+				}
+			});
+		}), {
+			root: i,
+			align: a
+		};
+	}
+	function horizontalCompaction(e, t, n, r, i) {
+		let a = {}, o = buildBlockGraph(e, t, n, i), s = i ? "borderLeft" : "borderRight";
+		function iterate(e, t) {
+			let n = o.nodes(), r = n.pop(), i = {};
+			for (; r;) i[r] ? e(r) : (i[r] = !0, n.push(r), n = n.concat(t(r))), r = n.pop();
+		}
+		function pass1(e) {
+			a[e] = o.inEdges(e).reduce((e, t) => Math.max(e, a[t.v] + o.edge(t)), 0);
+		}
+		function pass2(t) {
+			let n = o.outEdges(t).reduce((e, t) => Math.min(e, a[t.w] - o.edge(t)), Infinity), r = e.node(t);
+			n !== Infinity && r.borderType !== s && (a[t] = Math.max(a[t], n));
+		}
+		return iterate(pass1, o.predecessors.bind(o)), iterate(pass2, o.successors.bind(o)), Object.keys(r).forEach((e) => a[e] = a[n[e]]), a;
+	}
+	function buildBlockGraph(e, t, r, i) {
+		let a = new n(), o = e.graph(), s = sep(o.nodesep, o.edgesep, i);
+		return t.forEach((t) => {
+			let n;
+			t.forEach((t) => {
+				let i = r[t];
+				if (a.setNode(i), n) {
+					var o = r[n], c = a.edge(o, i);
+					a.setEdge(o, i, Math.max(s(e, t, n), c || 0));
+				}
+				n = t;
+			});
+		}), a;
+	}
+	function findSmallestWidthAlignment(e, t) {
+		return Object.values(t).reduce((t, n) => {
+			let r = -Infinity, i = Infinity;
+			Object.entries(n).forEach(([t, n]) => {
+				let a = width(e, t) / 2;
+				r = Math.max(n + a, r), i = Math.min(n - a, i);
+			});
+			let a = r - i;
+			return a < t[0] && (t = [a, n]), t;
+		}, [Infinity, null])[1];
+	}
+	function alignCoordinates(e, t) {
+		let n = Object.values(t), i = r.applyWithChunking(Math.min, n), a = r.applyWithChunking(Math.max, n);
+		["u", "d"].forEach((n) => {
+			["l", "r"].forEach((o) => {
+				let s = n + o, c = e[s];
+				if (c === t) return;
+				let l = Object.values(c), u = i - r.applyWithChunking(Math.min, l);
+				o !== "l" && (u = a - r.applyWithChunking(Math.max, l)), u && (e[s] = r.mapValues(c, (e) => e + u));
+			});
+		});
+	}
+	function balance(e, t) {
+		return r.mapValues(e.ul, (n, r) => {
+			if (t) return e[t.toLowerCase()][r];
+			{
+				let t = Object.values(e).map((e) => e[r]).sort((e, t) => e - t);
+				return (t[1] + t[2]) / 2;
+			}
+		});
+	}
+	function positionX(e) {
+		let t = r.buildLayerMatrix(e), n = Object.assign(findType1Conflicts(e, t), findType2Conflicts(e, t)), i = {}, a;
+		return ["u", "d"].forEach((o) => {
+			a = o === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((t) => {
+				t === "r" && (a = a.map((e) => Object.values(e).reverse()));
+				let s = (o === "u" ? e.predecessors : e.successors).bind(e), c = verticalAlignment(e, a, n, s), l = horizontalCompaction(e, a, c.root, c.align, t === "r");
+				t === "r" && (l = r.mapValues(l, (e) => -e)), i[o + t] = l;
+			});
+		}), alignCoordinates(i, findSmallestWidthAlignment(e, i)), balance(i, e.graph().align);
+	}
+	function sep(e, t, n) {
+		return (r, i, a) => {
+			let o = r.node(i), s = r.node(a), c = 0, l;
+			if (c += o.width / 2, Object.hasOwn(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
+				case "l":
+					l = -o.width / 2;
+					break;
+				case "r":
+					l = o.width / 2;
+					break;
+			}
+			if (l && (c += n ? l : -l), l = 0, c += (o.dummy ? t : e) / 2, c += (s.dummy ? t : e) / 2, c += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
+				case "l":
+					l = s.width / 2;
+					break;
+				case "r":
+					l = -s.width / 2;
+					break;
+			}
+			return l && (c += n ? l : -l), l = 0, c;
+		};
+	}
+	function width(e, t) {
+		return e.node(t).width;
+	}
+})), U = /* @__PURE__ */ e(((e, t) => {
+	var n = S(), r = H().positionX;
+	t.exports = position;
+	function position(e) {
+		e = n.asNonCompoundGraph(e), positionY(e), Object.entries(r(e)).forEach(([t, n]) => e.node(t).x = n);
+	}
+	function positionY(e) {
+		let t = n.buildLayerMatrix(e), r = e.graph().ranksep, i = 0;
+		t.forEach((t) => {
+			let n = t.reduce((t, n) => {
+				let r = e.node(n).height;
+				return t > r ? t : r;
+			}, 0);
+			t.forEach((t) => e.node(t).y = i + n / 2), i += n + r;
+		});
+	}
+})), W = /* @__PURE__ */ e(((e, t) => {
+	var n = C(), r = w(), i = O(), a = S().normalizeRanks, o = k(), s = S().removeEmptyRanks, c = A(), l = j(), u = M(), d = V(), f = U(), p = S(), m = y().Graph;
+	t.exports = layout;
+	function layout(e, t) {
+		let n = t && t.debugTiming ? p.time : p.notime;
+		n("layout", () => {
+			let r = n("  buildLayoutGraph", () => buildLayoutGraph(e));
+			n("  runLayout", () => runLayout(r, n, t)), n("  updateInputGraph", () => updateInputGraph(e, r));
+		});
+	}
+	function runLayout(e, t, m) {
+		t("    makeSpaceForEdgeLabels", () => makeSpaceForEdgeLabels(e)), t("    removeSelfEdges", () => removeSelfEdges(e)), t("    acyclic", () => n.run(e)), t("    nestingGraph.run", () => c.run(e)), t("    rank", () => i(p.asNonCompoundGraph(e))), t("    injectEdgeLabelProxies", () => injectEdgeLabelProxies(e)), t("    removeEmptyRanks", () => s(e)), t("    nestingGraph.cleanup", () => c.cleanup(e)), t("    normalizeRanks", () => a(e)), t("    assignRankMinMax", () => assignRankMinMax(e)), t("    removeEdgeLabelProxies", () => removeEdgeLabelProxies(e)), t("    normalize.run", () => r.run(e)), t("    parentDummyChains", () => o(e)), t("    addBorderSegments", () => l(e)), t("    order", () => d(e, m)), t("    insertSelfEdges", () => insertSelfEdges(e)), t("    adjustCoordinateSystem", () => u.adjust(e)), t("    position", () => f(e)), t("    positionSelfEdges", () => positionSelfEdges(e)), t("    removeBorderNodes", () => removeBorderNodes(e)), t("    normalize.undo", () => r.undo(e)), t("    fixupEdgeLabelCoords", () => fixupEdgeLabelCoords(e)), t("    undoCoordinateSystem", () => u.undo(e)), t("    translateGraph", () => translateGraph(e)), t("    assignNodeIntersects", () => assignNodeIntersects(e)), t("    reversePoints", () => reversePointsForReversedEdges(e)), t("    acyclic.undo", () => n.undo(e));
+	}
+	function updateInputGraph(e, t) {
+		e.nodes().forEach((n) => {
+			let r = e.node(n), i = t.node(n);
+			r && (r.x = i.x, r.y = i.y, r.rank = i.rank, t.children(n).length && (r.width = i.width, r.height = i.height));
+		}), e.edges().forEach((n) => {
+			let r = e.edge(n), i = t.edge(n);
+			r.points = i.points, Object.hasOwn(i, "x") && (r.x = i.x, r.y = i.y);
+		}), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
+	}
+	var h = [
+		"nodesep",
+		"edgesep",
+		"ranksep",
+		"marginx",
+		"marginy"
+	], g = {
+		ranksep: 50,
+		edgesep: 20,
+		nodesep: 50,
+		rankdir: "tb"
+	}, _ = [
+		"acyclicer",
+		"ranker",
+		"rankdir",
+		"align"
+	], v = [
+		"width",
+		"height",
+		"rank"
+	], b = {
+		width: 0,
+		height: 0
+	}, x = [
+		"minlen",
+		"weight",
+		"width",
+		"height",
+		"labeloffset"
+	], T = {
+		minlen: 1,
+		weight: 1,
+		width: 0,
+		height: 0,
+		labeloffset: 10,
+		labelpos: "r"
+	}, E = ["labelpos"];
+	function buildLayoutGraph(e) {
+		let t = new m({
+			multigraph: !0,
+			compound: !0
+		}), n = canonicalize(e.graph());
+		return t.setGraph(Object.assign({}, g, selectNumberAttrs(n, h), p.pick(n, _))), e.nodes().forEach((n) => {
+			let r = selectNumberAttrs(canonicalize(e.node(n)), v);
+			Object.keys(b).forEach((e) => {
+				r[e] === void 0 && (r[e] = b[e]);
+			}), t.setNode(n, r), t.setParent(n, e.parent(n));
+		}), e.edges().forEach((n) => {
+			let r = canonicalize(e.edge(n));
+			t.setEdge(n, Object.assign({}, T, selectNumberAttrs(r, x), p.pick(r, E)));
+		}), t;
+	}
+	function makeSpaceForEdgeLabels(e) {
+		let t = e.graph();
+		t.ranksep /= 2, e.edges().forEach((n) => {
+			let r = e.edge(n);
+			r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
+		});
+	}
+	function injectEdgeLabelProxies(e) {
+		e.edges().forEach((t) => {
+			let n = e.edge(t);
+			if (n.width && n.height) {
+				let n = e.node(t.v), r = {
+					rank: (e.node(t.w).rank - n.rank) / 2 + n.rank,
+					e: t
+				};
+				p.addDummyNode(e, "edge-proxy", r, "_ep");
+			}
+		});
+	}
+	function assignRankMinMax(e) {
+		let t = 0;
+		e.nodes().forEach((n) => {
+			let r = e.node(n);
+			r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = Math.max(t, r.maxRank));
+		}), e.graph().maxRank = t;
+	}
+	function removeEdgeLabelProxies(e) {
+		e.nodes().forEach((t) => {
+			let n = e.node(t);
+			n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
+		});
+	}
+	function translateGraph(e) {
+		let t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
+		function getExtremes(e) {
+			let a = e.x, o = e.y, s = e.width, c = e.height;
+			t = Math.min(t, a - s / 2), n = Math.max(n, a + s / 2), r = Math.min(r, o - c / 2), i = Math.max(i, o + c / 2);
+		}
+		e.nodes().forEach((t) => getExtremes(e.node(t))), e.edges().forEach((t) => {
+			let n = e.edge(t);
+			Object.hasOwn(n, "x") && getExtremes(n);
+		}), t -= o, r -= s, e.nodes().forEach((n) => {
+			let i = e.node(n);
+			i.x -= t, i.y -= r;
+		}), e.edges().forEach((n) => {
+			let i = e.edge(n);
+			i.points.forEach((e) => {
+				e.x -= t, e.y -= r;
+			}), Object.hasOwn(i, "x") && (i.x -= t), Object.hasOwn(i, "y") && (i.y -= r);
+		}), a.width = n - t + o, a.height = i - r + s;
+	}
+	function assignNodeIntersects(e) {
+		e.edges().forEach((t) => {
+			let n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
+			n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(p.intersectRect(r, a)), n.points.push(p.intersectRect(i, o));
+		});
+	}
+	function fixupEdgeLabelCoords(e) {
+		e.edges().forEach((t) => {
+			let n = e.edge(t);
+			if (Object.hasOwn(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
+				case "l":
+					n.x -= n.width / 2 + n.labeloffset;
+					break;
+				case "r":
+					n.x += n.width / 2 + n.labeloffset;
+					break;
+			}
+		});
+	}
+	function reversePointsForReversedEdges(e) {
+		e.edges().forEach((t) => {
+			let n = e.edge(t);
+			n.reversed && n.points.reverse();
+		});
+	}
+	function removeBorderNodes(e) {
+		e.nodes().forEach((t) => {
+			if (e.children(t).length) {
+				let n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(n.borderLeft[n.borderLeft.length - 1]), o = e.node(n.borderRight[n.borderRight.length - 1]);
+				n.width = Math.abs(o.x - a.x), n.height = Math.abs(i.y - r.y), n.x = a.x + n.width / 2, n.y = r.y + n.height / 2;
+			}
+		}), e.nodes().forEach((t) => {
+			e.node(t).dummy === "border" && e.removeNode(t);
+		});
+	}
+	function removeSelfEdges(e) {
+		e.edges().forEach((t) => {
+			if (t.v === t.w) {
+				var n = e.node(t.v);
+				n.selfEdges ||= [], n.selfEdges.push({
+					e: t,
+					label: e.edge(t)
+				}), e.removeEdge(t);
+			}
+		});
+	}
+	function insertSelfEdges(e) {
+		p.buildLayerMatrix(e).forEach((t) => {
+			var n = 0;
+			t.forEach((t, r) => {
+				var i = e.node(t);
+				i.order = r + n, (i.selfEdges || []).forEach((t) => {
+					p.addDummyNode(e, "selfedge", {
+						width: t.label.width,
+						height: t.label.height,
+						rank: i.rank,
+						order: r + ++n,
+						e: t.e,
+						label: t.label
+					}, "_se");
+				}), delete i.selfEdges;
+			});
+		});
+	}
+	function positionSelfEdges(e) {
+		e.nodes().forEach((t) => {
+			var n = e.node(t);
+			if (n.dummy === "selfedge") {
+				var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
+				e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
+					{
+						x: i + 2 * o / 3,
+						y: a - s
+					},
+					{
+						x: i + 5 * o / 6,
+						y: a - s
+					},
+					{
+						x: i + o,
+						y: a
+					},
+					{
+						x: i + 5 * o / 6,
+						y: a + s
+					},
+					{
+						x: i + 2 * o / 3,
+						y: a + s
+					}
+				], n.label.x = n.x, n.label.y = n.y;
+			}
+		});
+	}
+	function selectNumberAttrs(e, t) {
+		return p.mapValues(p.pick(e, t), Number);
+	}
+	function canonicalize(e) {
+		var t = {};
+		return e && Object.entries(e).forEach(([e, n]) => {
+			typeof e == "string" && (e = e.toLowerCase()), t[e] = n;
+		}), t;
+	}
+})), G = /* @__PURE__ */ e(((e, t) => {
+	var n = S(), r = y().Graph;
+	t.exports = { debugOrdering };
+	/* istanbul ignore next */
+	function debugOrdering(e) {
+		let t = n.buildLayerMatrix(e), i = new r({
+			compound: !0,
+			multigraph: !0
+		}).setGraph({});
+		return e.nodes().forEach((t) => {
+			i.setNode(t, { label: t }), i.setParent(t, "layer" + e.node(t).rank);
+		}), e.edges().forEach((e) => i.setEdge(e.v, e.w, {}, e.name)), t.forEach((e, t) => {
+			let n = "layer" + t;
+			i.setNode(n, { rank: "same" }), e.reduce((e, t) => (i.setEdge(e, t, { style: "invis" }), t));
+		}), i;
+	}
+})), K = /* @__PURE__ */ e(((e, t) => {
+	t.exports = "1.1.8";
+})), q = /* @__PURE__ */ e(((e, t) => {
+	t.exports = {
+		graphlib: y(),
+		layout: W(),
+		debug: G(),
+		util: {
+			time: S().time,
+			notime: S().notime
+		},
+		version: K()
+	};
+}));
+//#endregion
+export { q as t };