@nxgt/material-vue 0.21.0 → 0.23.0

package/dist/dagre-6A5THRUB-CCigPI-W.js

@@ -0,0 +1,2059 @@
+import { _ as e, a as t, g as n, h as r, i, m as a, n as o, r as s, u as c, v as l, x as u, y as d } from "./get-CTzJAwfc.js";
+import { a as f, i as p, n as m, o as h, r as ee, s as g } from "./isArrayLikeObject-Bs4bzQBR.js";
+import { a as te, m as ne, p as re } from "./_baseIsEqual-BUD8VQJE.js";
+import { c as ie, l as ae, o as oe } from "./_initCloneObject-D3WSYU-D.js";
+import { a as _, c as se, d as ce, f as le, h as ue, i as v, l as de, m as fe, n as y, o as b, p as pe, r as x, s as me, t as S, u as C } from "./graphlib-DQVPat8q.js";
+import { d as w, p as he, s as ge } from "./_Uint8Array-2hFHkjYD.js";
+import { n as T, t as E } from "./merge-BzRhCAF6.js";
+import { t as _e } from "./cloneDeep-Cv9TF8j3.js";
+import { n as D } from "./chunk-Y2CYZVJY-BAad7w_K.js";
+import { m as O } from "./src-Pe71xVTz.js";
+import { x as ve } from "./chunk-O7XYJQB3-BDucxjeL.js";
+import "./chunk-ZIGJFQKS-JoSqKBE3.js";
+import "./chunk-742MDFTN-Bh_u1X2k.js";
+import "./chunk-MBY4JIJT-ODeZ1ugd.js";
+import "./chunk-7PRAP22T-CZmOrCLD.js";
+import { c as ye } from "./chunk-7INBJB4K-OheKRjIZ.js";
+import { a as be, i as xe, n as Se } from "./chunk-5DYCD2WN-4BDKWc4g.js";
+import { a as Ce, i as we, l as Te } from "./chunk-Z7XXMR3K-DdnrI6vA.js";
+import { r as Ee } from "./chunk-UA2S7LBM-DN55-gzN.js";
+import { c as k, i as De, n as A, o as Oe, r as ke, s as Ae, t as je } from "./chunk-3FUC2YCW-Bw4AJEzl.js";
+//#region ../../node_modules/lodash-es/_trimmedEndIndex.js
+var Me = /\s/;
+function Ne(e) {
+	for (var t = e.length; t-- && Me.test(e.charAt(t)););
+	return t;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseTrim.js
+var Pe = /^\s+/;
+function Fe(e) {
+	return e && e.slice(0, Ne(e) + 1).replace(Pe, "");
+}
+//#endregion
+//#region ../../node_modules/lodash-es/toNumber.js
+var Ie = NaN, Le = /^[-+]0x[0-9a-f]+$/i, Re = /^0b[01]+$/i, ze = /^0o[0-7]+$/i, Be = parseInt;
+function Ve(t) {
+	if (typeof t == "number") return t;
+	if (e(t)) return Ie;
+	if (a(t)) {
+		var n = typeof t.valueOf == "function" ? t.valueOf() : t;
+		t = a(n) ? n + "" : n;
+	}
+	if (typeof t != "string") return t === 0 ? t : +t;
+	t = Fe(t);
+	var r = Re.test(t);
+	return r || ze.test(t) ? Be(t.slice(2), r ? 2 : 8) : Le.test(t) ? Ie : +t;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/toFinite.js
+var He = Infinity, Ue = 17976931348623157e292;
+function j(e) {
+	return e ? (e = Ve(e), e === He || e === -He ? (e < 0 ? -1 : 1) * Ue : e === e ? e : 0) : e === 0 ? e : 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/toInteger.js
+function We(e) {
+	var t = j(e), n = t % 1;
+	return t === t ? n ? t - n : t : 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/flatten.js
+function M(e) {
+	return e != null && e.length ? fe(e, 1) : [];
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_flatRest.js
+function Ge(e) {
+	return f(p(e, void 0, M), e + "");
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_hasUnicode.js
+var Ke = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
+function qe(e) {
+	return Ke.test(e);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/now.js
+var Je = function() {
+	return u.Date.now();
+}, Ye = Object.prototype, Xe = Ye.hasOwnProperty, Ze = ee(function(e, t) {
+	e = Object(e);
+	var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
+	for (i && T(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = oe(a), s = -1, l = o.length; ++s < l;) {
+		var u = o[s], d = e[u];
+		(d === void 0 || c(d, Ye[u]) && !Xe.call(e, u)) && (e[u] = a[u]);
+	}
+	return e;
+});
+//#endregion
+//#region ../../node_modules/lodash-es/last.js
+function N(e) {
+	var t = e == null ? 0 : e.length;
+	return t ? e[t - 1] : void 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_createFind.js
+function Qe(e) {
+	return function(t, n, r) {
+		var i = Object(t);
+		if (!w(t)) {
+			var a = C(n, 3);
+			t = re(t), n = function(e) {
+				return a(i[e], e, i);
+			};
+		}
+		var o = e(t, n, r);
+		return o > -1 ? i[a ? t[o] : o] : void 0;
+	};
+}
+//#endregion
+//#region ../../node_modules/lodash-es/findIndex.js
+var $e = Math.max;
+function et(e, t, n) {
+	var r = e == null ? 0 : e.length;
+	if (!r) return -1;
+	var i = n == null ? 0 : We(n);
+	return i < 0 && (i = $e(r + i, 0)), ue(e, C(t, 3), i);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/find.js
+var tt = Qe(et);
+//#endregion
+//#region ../../node_modules/lodash-es/_baseMap.js
+function nt(e, t) {
+	var n = -1, r = w(e) ? Array(e.length) : [];
+	return se(e, function(e, i, a) {
+		r[++n] = t(e, i, a);
+	}), r;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/map.js
+function P(e, t) {
+	return (r(e) ? n : nt)(e, C(t, 3));
+}
+//#endregion
+//#region ../../node_modules/lodash-es/forIn.js
+function rt(e, t) {
+	return e == null ? e : m(e, me(t), oe);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/forOwn.js
+function it(e, t) {
+	return e && de(e, me(t));
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseGt.js
+function at(e, t) {
+	return e > t;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseHas.js
+var ot = Object.prototype.hasOwnProperty;
+function st(e, t) {
+	return e != null && ot.call(e, t);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/has.js
+function ct(e, t) {
+	return e != null && pe(e, t, st);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/isString.js
+var lt = "[object String]";
+function ut(e) {
+	return typeof e == "string" || !r(e) && l(e) && d(e) == lt;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseLt.js
+function dt(e, t) {
+	return e < t;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/mapValues.js
+function F(e, t) {
+	var n = {};
+	return t = C(t, 3), de(e, function(e, r, i) {
+		ae(n, r, t(e, r, i));
+	}), n;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseExtremum.js
+function I(t, n, r) {
+	for (var i = -1, a = t.length; ++i < a;) {
+		var o = t[i], s = n(o);
+		if (s != null && (c === void 0 ? s === s && !e(s) : r(s, c))) var c = s, l = o;
+	}
+	return l;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/max.js
+function L(e) {
+	return e && e.length ? I(e, g, at) : void 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/min.js
+function R(e) {
+	return e && e.length ? I(e, g, dt) : void 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/minBy.js
+function z(e, t) {
+	return e && e.length ? I(e, C(t, 2), dt) : void 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseSet.js
+function ft(e, t, n, r) {
+	if (!a(e)) return e;
+	t = i(t, e);
+	for (var o = -1, c = t.length, l = c - 1, u = e; u != null && ++o < c;) {
+		var d = s(t[o]), f = n;
+		if (d === "__proto__" || d === "constructor" || d === "prototype") return e;
+		if (o != l) {
+			var p = u[d];
+			f = r ? r(p, d, u) : void 0, f === void 0 && (f = a(p) ? p : he(t[o + 1]) ? [] : {});
+		}
+		ie(u, d, f), u = u[d];
+	}
+	return e;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_basePickBy.js
+function pt(e, t, n) {
+	for (var r = -1, a = t.length, s = {}; ++r < a;) {
+		var c = t[r], l = o(e, c);
+		n(l, c) && ft(s, i(c, e), l);
+	}
+	return s;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseSortBy.js
+function mt(e, t) {
+	var n = e.length;
+	for (e.sort(t); n--;) e[n] = e[n].value;
+	return e;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_compareAscending.js
+function ht(t, n) {
+	if (t !== n) {
+		var r = t !== void 0, i = t === null, a = t === t, o = e(t), s = n !== void 0, c = n === null, l = n === n, u = e(n);
+		if (!c && !u && !o && t > n || o && s && l && !c && !u || i && s && l || !r && l || !a) return 1;
+		if (!i && !o && !u && t < n || u && r && a && !i && !o || c && r && a || !s && a || !l) return -1;
+	}
+	return 0;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_compareMultiple.js
+function gt(e, t, n) {
+	for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
+		var c = ht(i[r], a[r]);
+		if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
+	}
+	return e.index - t.index;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseOrderBy.js
+function _t(e, t, i) {
+	t = t.length ? n(t, function(e) {
+		return r(e) ? function(t) {
+			return o(t, e.length === 1 ? e[0] : e);
+		} : e;
+	}) : [g];
+	var a = -1;
+	return t = n(t, ge(C)), mt(nt(e, function(e, r, i) {
+		return {
+			criteria: n(t, function(t) {
+				return t(e);
+			}),
+			index: ++a,
+			value: e
+		};
+	}), function(e, t) {
+		return gt(e, t, i);
+	});
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_asciiSize.js
+var vt = ce("length"), yt = "\\ud800-\\udfff", bt = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", xt = "\\ufe0e\\ufe0f", St = "[" + yt + "]", B = "[" + bt + "]", V = "\\ud83c[\\udffb-\\udfff]", Ct = "(?:" + B + "|" + V + ")", wt = "[^" + yt + "]", Tt = "(?:\\ud83c[\\udde6-\\uddff]){2}", Et = "[\\ud800-\\udbff][\\udc00-\\udfff]", Dt = "\\u200d", Ot = Ct + "?", kt = "[" + xt + "]?", At = "(?:" + Dt + "(?:" + [
+	wt,
+	Tt,
+	Et
+].join("|") + ")" + kt + Ot + ")*", jt = kt + Ot + At, Mt = "(?:" + [
+	wt + B + "?",
+	B,
+	Tt,
+	Et,
+	St
+].join("|") + ")", Nt = RegExp(V + "(?=" + V + ")|" + Mt + jt, "g");
+function Pt(e) {
+	for (var t = Nt.lastIndex = 0; Nt.test(e);) ++t;
+	return t;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_stringSize.js
+function Ft(e) {
+	return qe(e) ? Pt(e) : vt(e);
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_basePick.js
+function It(e, t) {
+	return pt(e, t, function(t, n) {
+		return le(e, n);
+	});
+}
+//#endregion
+//#region ../../node_modules/lodash-es/pick.js
+var H = Ge(function(e, t) {
+	return e == null ? {} : It(e, t);
+}), Lt = Math.ceil, Rt = Math.max;
+function zt(e, t, n, r) {
+	for (var i = -1, a = Rt(Lt((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
+	return o;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_createRange.js
+function Bt(e) {
+	return function(t, n, r) {
+		return r && typeof r != "number" && T(t, n, r) && (n = r = void 0), t = j(t), n === void 0 ? (n = t, t = 0) : n = j(n), r = r === void 0 ? t < n ? 1 : -1 : j(r), zt(t, n, r, e);
+	};
+}
+//#endregion
+//#region ../../node_modules/lodash-es/range.js
+var U = Bt(), Vt = "[object Map]", Ht = "[object Set]";
+function Ut(e) {
+	if (e == null) return 0;
+	if (w(e)) return ut(e) ? Ft(e) : e.length;
+	var t = te(e);
+	return t == Vt || t == Ht ? e.size : ne(e).length;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/sortBy.js
+var W = ee(function(e, t) {
+	if (e == null) return [];
+	var n = t.length;
+	return n > 1 && T(e, t[0], t[1]) ? t = [] : n > 2 && T(t[0], t[1], t[2]) && (t = [t[0]]), _t(e, fe(t, 1), []);
+}), Wt = 0;
+function G(e) {
+	var n = ++Wt;
+	return t(e) + n;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/_baseZipObject.js
+function Gt(e, t, n) {
+	for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
+		var s = r < a ? t[r] : void 0;
+		n(o, e[r], s);
+	}
+	return o;
+}
+//#endregion
+//#region ../../node_modules/lodash-es/zipObject.js
+function Kt(e, t) {
+	return Gt(e || [], t || [], ie);
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/data/list.js
+var qt = class {
+	constructor() {
+		var e = {};
+		e._next = e._prev = e, this._sentinel = e;
+	}
+	dequeue() {
+		var e = this._sentinel, t = e._prev;
+		if (t !== e) return Jt(t), t;
+	}
+	enqueue(e) {
+		var t = this._sentinel;
+		e._prev && e._next && Jt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+	}
+	toString() {
+		for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, Yt)), n = n._prev;
+		return "[" + e.join(", ") + "]";
+	}
+};
+function Jt(e) {
+	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function Yt(e, t) {
+	if (e !== "_next" && e !== "_prev") return t;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/greedy-fas.js
+var Xt = h(1);
+function Zt(e, t) {
+	if (e.nodeCount() <= 1) return [];
+	var n = $t(e, t || Xt);
+	return M(P(Qt(n.graph, n.buckets, n.zeroIdx), function(t) {
+		return e.outEdges(t.v, t.w);
+	}));
+}
+function Qt(e, t, n) {
+	for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
+		for (; o = a.dequeue();) K(e, t, n, o);
+		for (; o = i.dequeue();) K(e, t, n, o);
+		if (e.nodeCount()) {
+			for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
+				r = r.concat(K(e, t, n, o, !0));
+				break;
+			}
+		}
+	}
+	return r;
+}
+function K(e, t, n, r, i) {
+	var a = i ? [] : void 0;
+	return b(e.inEdges(r.v), function(r) {
+		var o = e.edge(r), s = e.node(r.v);
+		i && a.push({
+			v: r.v,
+			w: r.w
+		}), s.out -= o, q(t, n, s);
+	}), b(e.outEdges(r.v), function(r) {
+		var i = e.edge(r), a = r.w, o = e.node(a);
+		o.in -= i, q(t, n, o);
+	}), e.removeNode(r.v), a;
+}
+function $t(e, t) {
+	var n = new S(), r = 0, i = 0;
+	b(e.nodes(), function(e) {
+		n.setNode(e, {
+			v: e,
+			in: 0,
+			out: 0
+		});
+	}), b(e.edges(), function(e) {
+		var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
+		n.setEdge(e.v, e.w, s), i = Math.max(i, n.node(e.v).out += o), r = Math.max(r, n.node(e.w).in += o);
+	});
+	var a = U(i + r + 3).map(function() {
+		return new qt();
+	}), o = r + 1;
+	return b(n.nodes(), function(e) {
+		q(a, o, n.node(e));
+	}), {
+		graph: n,
+		buckets: a,
+		zeroIdx: o
+	};
+}
+function q(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);
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/acyclic.js
+function en(e) {
+	b(e.graph().acyclicer === "greedy" ? Zt(e, t(e)) : tn(e), function(t) {
+		var n = e.edge(t);
+		e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, G("rev"));
+	});
+	function t(e) {
+		return function(t) {
+			return e.edge(t).weight;
+		};
+	}
+}
+function tn(e) {
+	var t = [], n = {}, r = {};
+	function i(a) {
+		Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, b(e.outEdges(a), function(e) {
+			Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
+		}), delete n[a]);
+	}
+	return b(e.nodes(), i), t;
+}
+function nn(e) {
+	b(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (n.reversed) {
+			e.removeEdge(t);
+			var r = n.forwardName;
+			delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
+		}
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/util.js
+function J(e, t, n, r) {
+	var i;
+	do
+		i = G(r);
+	while (e.hasNode(i));
+	return n.dummy = t, e.setNode(i, n), i;
+}
+function rn(e) {
+	var t = new S().setGraph(e.graph());
+	return b(e.nodes(), function(n) {
+		t.setNode(n, e.node(n));
+	}), b(e.edges(), function(n) {
+		var 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 an(e) {
+	var t = new S({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+	return b(e.nodes(), function(n) {
+		e.children(n).length || t.setNode(n, e.node(n));
+	}), b(e.edges(), function(n) {
+		t.setEdge(n, e.edge(n));
+	}), t;
+}
+function on(e, t) {
+	var 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");
+	var 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 Y(e) {
+	var t = P(U(un(e) + 1), function() {
+		return [];
+	});
+	return b(e.nodes(), function(n) {
+		var r = e.node(n), i = r.rank;
+		x(i) || (t[i][r.order] = n);
+	}), t;
+}
+function sn(e) {
+	var t = R(P(e.nodes(), function(t) {
+		return e.node(t).rank;
+	}));
+	b(e.nodes(), function(n) {
+		var r = e.node(n);
+		ct(r, "rank") && (r.rank -= t);
+	});
+}
+function cn(e) {
+	var t = R(P(e.nodes(), function(t) {
+		return e.node(t).rank;
+	})), n = [];
+	b(e.nodes(), function(r) {
+		var i = e.node(r).rank - t;
+		n[i] || (n[i] = []), n[i].push(r);
+	});
+	var r = 0, i = e.graph().nodeRankFactor;
+	b(n, function(t, n) {
+		x(t) && n % i !== 0 ? --r : r && b(t, function(t) {
+			e.node(t).rank += r;
+		});
+	});
+}
+function ln(e, t, n, r) {
+	var i = {
+		width: 0,
+		height: 0
+	};
+	return arguments.length >= 4 && (i.rank = n, i.order = r), J(e, "border", i, t);
+}
+function un(e) {
+	return L(P(e.nodes(), function(t) {
+		var n = e.node(t).rank;
+		if (!x(n)) return n;
+	}));
+}
+function dn(e, t) {
+	var n = {
+		lhs: [],
+		rhs: []
+	};
+	return b(e, function(e) {
+		t(e) ? n.lhs.push(e) : n.rhs.push(e);
+	}), n;
+}
+function fn(e, t) {
+	var n = Je();
+	try {
+		return t();
+	} finally {
+		console.log(e + " time: " + (Je() - n) + "ms");
+	}
+}
+function pn(e, t) {
+	return t();
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/add-border-segments.js
+function mn(e) {
+	function t(n) {
+		var r = e.children(n), i = e.node(n);
+		if (r.length && b(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
+			i.borderLeft = [], i.borderRight = [];
+			for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) hn(e, "borderLeft", "_bl", n, i, a), hn(e, "borderRight", "_br", n, i, a);
+		}
+	}
+	b(e.children(), t);
+}
+function hn(e, t, n, r, i, a) {
+	var o = {
+		width: 0,
+		height: 0,
+		rank: a,
+		borderType: t
+	}, s = i[t][a - 1], c = J(e, "border", o, n);
+	i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/coordinate-system.js
+function gn(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "lr" || t === "rl") && vn(e);
+}
+function _n(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "bt" || t === "rl") && bn(e), (t === "lr" || t === "rl") && (xn(e), vn(e));
+}
+function vn(e) {
+	b(e.nodes(), function(t) {
+		yn(e.node(t));
+	}), b(e.edges(), function(t) {
+		yn(e.edge(t));
+	});
+}
+function yn(e) {
+	var t = e.width;
+	e.width = e.height, e.height = t;
+}
+function bn(e) {
+	b(e.nodes(), function(t) {
+		X(e.node(t));
+	}), b(e.edges(), function(t) {
+		var n = e.edge(t);
+		b(n.points, X), Object.prototype.hasOwnProperty.call(n, "y") && X(n);
+	});
+}
+function X(e) {
+	e.y = -e.y;
+}
+function xn(e) {
+	b(e.nodes(), function(t) {
+		Sn(e.node(t));
+	}), b(e.edges(), function(t) {
+		var n = e.edge(t);
+		b(n.points, Sn), Object.prototype.hasOwnProperty.call(n, "x") && Sn(n);
+	});
+}
+function Sn(e) {
+	var t = e.x;
+	e.x = e.y, e.y = t;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/normalize.js
+function Cn(e) {
+	e.graph().dummyChains = [], b(e.edges(), function(t) {
+		wn(e, t);
+	});
+}
+function wn(e, t) {
+	var n = t.v, r = e.node(n).rank, i = t.w, a = e.node(i).rank, o = t.name, s = e.edge(t), c = s.labelRank;
+	if (a !== r + 1) {
+		e.removeEdge(t);
+		var l = void 0, u, d;
+		for (d = 0, ++r; r < a; ++d, ++r) s.points = [], l = {
+			width: 0,
+			height: 0,
+			edgeLabel: s,
+			edgeObj: t,
+			rank: r
+		}, u = J(e, "edge", l, "_d"), r === c && (l.width = s.width, l.height = s.height, l.dummy = "edge-label", l.labelpos = s.labelpos), e.setEdge(n, u, { weight: s.weight }, o), d === 0 && e.graph().dummyChains.push(u), n = u;
+		e.setEdge(n, i, { weight: s.weight }, o);
+	}
+}
+function Tn(e) {
+	b(e.graph().dummyChains, function(t) {
+		var 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);
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/rank/util.js
+function En(e) {
+	var t = {};
+	function n(r) {
+		var i = e.node(r);
+		if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
+		t[r] = !0;
+		var a = R(P(e.outEdges(r), function(t) {
+			return n(t.w) - e.edge(t).minlen;
+		}));
+		return (a === Infinity || a == null) && (a = 0), i.rank = a;
+	}
+	b(e.sources(), n);
+}
+function Z(e, t) {
+	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
+function Dn(e) {
+	var t = new S({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
+	t.setNode(n, {});
+	for (var i, a; On(t, e) < r;) i = kn(t, e), a = t.hasNode(i.v) ? Z(e, i) : -Z(e, i), An(t, e, a);
+	return t;
+}
+function On(e, t) {
+	function n(r) {
+		b(t.nodeEdges(r), function(i) {
+			var a = i.v, o = r === a ? i.w : a;
+			!e.hasNode(o) && !Z(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
+		});
+	}
+	return b(e.nodes(), n), e.nodeCount();
+}
+function kn(e, t) {
+	return z(t.edges(), function(n) {
+		if (e.hasNode(n.v) !== e.hasNode(n.w)) return Z(t, n);
+	});
+}
+function An(e, t, n) {
+	b(e.nodes(), function(e) {
+		t.node(e).rank += n;
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
+h(1), h(1), jn.CycleException = Q;
+function jn(e) {
+	var t = {}, n = {}, r = [];
+	function i(a) {
+		if (Object.prototype.hasOwnProperty.call(n, a)) throw new Q();
+		Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, b(e.predecessors(a), i), delete n[a], r.push(a));
+	}
+	if (b(e.sinks(), i), Ut(t) !== e.nodeCount()) throw new Q();
+	return r;
+}
+function Q() {}
+Q.prototype = /* @__PURE__ */ Error();
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
+function Mn(e, t, n) {
+	r(t) || (t = [t]);
+	var i = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], o = {};
+	return b(t, function(t) {
+		if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
+		Nn(e, t, n === "post", o, i, a);
+	}), a;
+}
+function Nn(e, t, n, r, i, a) {
+	Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), b(i(t), function(t) {
+		Nn(e, t, n, r, i, a);
+	}), n && a.push(t));
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
+function Pn(e, t) {
+	return Mn(e, t, "post");
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
+function Fn(e, t) {
+	return Mn(e, t, "pre");
+}
+$.initLowLimValues = zn, $.initCutValues = In, $.calcCutValue = Rn, $.leaveEdge = Vn, $.enterEdge = Hn, $.exchangeEdges = Un;
+function $(e) {
+	e = rn(e), En(e);
+	var t = Dn(e);
+	zn(t), In(t, e);
+	for (var n, r; n = Vn(t);) r = Hn(t, e, n), Un(t, e, n, r);
+}
+function In(e, t) {
+	var n = Pn(e, e.nodes());
+	n = n.slice(0, n.length - 1), b(n, function(n) {
+		Ln(e, t, n);
+	});
+}
+function Ln(e, t, n) {
+	var r = e.node(n).parent;
+	e.edge(n, r).cutvalue = Rn(e, t, n);
+}
+function Rn(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, b(t.nodeEdges(n), function(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, Gn(e, n, c)) {
+				var d = e.edge(n, c).cutvalue;
+				o += l ? -d : d;
+			}
+		}
+	}), o;
+}
+function zn(e, t) {
+	arguments.length < 2 && (t = e.nodes()[0]), Bn(e, {}, 1, t);
+}
+function Bn(e, t, n, r, i) {
+	var a = n, o = e.node(r);
+	return t[r] = !0, b(e.neighbors(r), function(i) {
+		Object.prototype.hasOwnProperty.call(t, i) || (n = Bn(e, t, n, i, r));
+	}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
+}
+function Vn(e) {
+	return tt(e.edges(), function(t) {
+		return e.edge(t).cutvalue < 0;
+	});
+}
+function Hn(e, t, n) {
+	var r = n.v, i = n.w;
+	t.hasEdge(r, i) || (r = n.w, i = n.v);
+	var a = e.node(r), o = e.node(i), s = a, c = !1;
+	return a.lim > o.lim && (s = o, c = !0), z(_(t.edges(), function(t) {
+		return c === Kn(e, e.node(t.v), s) && c !== Kn(e, e.node(t.w), s);
+	}), function(e) {
+		return Z(t, e);
+	});
+}
+function Un(e, t, n, r) {
+	var i = n.v, a = n.w;
+	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), zn(e), In(e, t), Wn(e, t);
+}
+function Wn(e, t) {
+	var n = Fn(e, tt(e.nodes(), function(e) {
+		return !t.node(e).parent;
+	}));
+	n = n.slice(1), b(n, function(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 Gn(e, t, n) {
+	return e.hasEdge(t, n);
+}
+function Kn(e, t, n) {
+	return n.low <= t.lim && t.lim <= n.lim;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/rank/index.js
+function qn(e) {
+	switch (e.graph().ranker) {
+		case "network-simplex":
+			Xn(e);
+			break;
+		case "tight-tree":
+			Yn(e);
+			break;
+		case "longest-path":
+			Jn(e);
+			break;
+		default: Xn(e);
+	}
+}
+var Jn = En;
+function Yn(e) {
+	En(e), Dn(e);
+}
+function Xn(e) {
+	$(e);
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/nesting-graph.js
+function Zn(e) {
+	var t = J(e, "root", {}, "_root"), n = $n(e), r = L(v(n)) - 1, i = 2 * r + 1;
+	e.graph().nestingRoot = t, b(e.edges(), function(t) {
+		e.edge(t).minlen *= i;
+	});
+	var a = er(e) + 1;
+	b(e.children(), function(o) {
+		Qn(e, t, i, a, r, n, o);
+	}), e.graph().nodeRankFactor = i;
+}
+function Qn(e, t, n, r, i, a, o) {
+	var s = e.children(o);
+	if (!s.length) {
+		o !== t && e.setEdge(t, o, {
+			weight: 0,
+			minlen: n
+		});
+		return;
+	}
+	var c = ln(e, "_bt"), l = ln(e, "_bb"), u = e.node(o);
+	e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, b(s, function(s) {
+		Qn(e, t, n, r, i, a, s);
+		var u = e.node(s), d = u.borderTop ? u.borderTop : s, f = u.borderBottom ? u.borderBottom : s, p = u.borderTop ? r : 2 * r, m = d === f ? i - a[o] + 1 : 1;
+		e.setEdge(c, d, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		}), e.setEdge(f, l, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		});
+	}), e.parent(o) || e.setEdge(t, c, {
+		weight: 0,
+		minlen: i + a[o]
+	});
+}
+function $n(e) {
+	var t = {};
+	function n(r, i) {
+		var a = e.children(r);
+		a && a.length && b(a, function(e) {
+			n(e, i + 1);
+		}), t[r] = i;
+	}
+	return b(e.children(), function(e) {
+		n(e, 1);
+	}), t;
+}
+function er(e) {
+	return y(e.edges(), function(t, n) {
+		return t + e.edge(n).weight;
+	}, 0);
+}
+function tr(e) {
+	var t = e.graph();
+	e.removeNode(t.nestingRoot), delete t.nestingRoot, b(e.edges(), function(t) {
+		e.edge(t).nestingEdge && e.removeEdge(t);
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
+function nr(e, t, n) {
+	var r = {}, i;
+	b(n, function(n) {
+		for (var a = e.parent(n), o, s; 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;
+		}
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
+function rr(e, t, n) {
+	var r = ir(e), i = new S({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
+		return e.node(t);
+	});
+	return b(e.nodes(), function(a) {
+		var o = e.node(a), s = e.parent(a);
+		(o.rank === t || o.minRank <= t && t <= o.maxRank) && (i.setNode(a), i.setParent(a, s || r), b(e[n](a), function(t) {
+			var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = x(r) ? 0 : r.weight;
+			i.setEdge(n, a, { weight: e.edge(t).weight + o });
+		}), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
+			borderLeft: o.borderLeft[t],
+			borderRight: o.borderRight[t]
+		}));
+	}), i;
+}
+function ir(e) {
+	for (var t; e.hasNode(t = G("_root")););
+	return t;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/cross-count.js
+function ar(e, t) {
+	for (var n = 0, r = 1; r < t.length; ++r) n += or(e, t[r - 1], t[r]);
+	return n;
+}
+function or(e, t, n) {
+	for (var r = Kt(n, P(n, function(e, t) {
+		return t;
+	})), i = M(P(t, function(t) {
+		return W(P(e.outEdges(t), function(t) {
+			return {
+				pos: r[t.w],
+				weight: e.edge(t).weight
+			};
+		}), "pos");
+	})), a = 1; a < n.length;) a <<= 1;
+	var o = 2 * a - 1;
+	--a;
+	var s = P(Array(o), function() {
+		return 0;
+	}), c = 0;
+	return b(i.forEach(function(e) {
+		var t = e.pos + a;
+		s[t] += e.weight;
+		for (var n = 0; t > 0;) t % 2 && (n += s[t + 1]), t = t - 1 >> 1, s[t] += e.weight;
+		c += e.weight * n;
+	})), c;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/init-order.js
+function sr(e) {
+	var t = {}, n = _(e.nodes(), function(t) {
+		return !e.children(t).length;
+	}), r = P(U(L(P(n, function(t) {
+		return e.node(t).rank;
+	})) + 1), function() {
+		return [];
+	});
+	function i(n) {
+		ct(t, n) || (t[n] = !0, r[e.node(n).rank].push(n), b(e.successors(n), i));
+	}
+	return b(W(n, function(t) {
+		return e.node(t).rank;
+	}), i), r;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/barycenter.js
+function cr(e, t) {
+	return P(t, function(t) {
+		var n = e.inEdges(t);
+		if (n.length) {
+			var r = y(n, function(t, n) {
+				var 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 };
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
+function lr(e, t) {
+	var n = {};
+	return b(e, function(e, t) {
+		var r = n[e.v] = {
+			indegree: 0,
+			in: [],
+			out: [],
+			vs: [e.v],
+			i: t
+		};
+		x(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
+	}), b(t.edges(), function(e) {
+		var t = n[e.v], r = n[e.w];
+		!x(t) && !x(r) && (r.indegree++, t.out.push(n[e.w]));
+	}), ur(_(n, function(e) {
+		return !e.indegree;
+	}));
+}
+function ur(e) {
+	var t = [];
+	function n(e) {
+		return function(t) {
+			t.merged || (x(t.barycenter) || x(e.barycenter) || t.barycenter >= e.barycenter) && dr(e, t);
+		};
+	}
+	function r(t) {
+		return function(n) {
+			n.in.push(t), --n.indegree === 0 && e.push(n);
+		};
+	}
+	for (; e.length;) {
+		var i = e.pop();
+		t.push(i), b(i.in.reverse(), n(i)), b(i.out, r(i));
+	}
+	return P(_(t, function(e) {
+		return !e.merged;
+	}), function(e) {
+		return H(e, [
+			"vs",
+			"i",
+			"barycenter",
+			"weight"
+		]);
+	});
+}
+function dr(e, t) {
+	var 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;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/sort.js
+function fr(e, t) {
+	var n = dn(e, function(e) {
+		return Object.prototype.hasOwnProperty.call(e, "barycenter");
+	}), r = n.lhs, i = W(n.rhs, function(e) {
+		return -e.i;
+	}), a = [], o = 0, s = 0, c = 0;
+	r.sort(mr(!!t)), c = pr(a, i, c), b(r, function(e) {
+		c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = pr(a, i, c);
+	});
+	var l = { vs: M(a) };
+	return s && (l.barycenter = o / s, l.weight = s), l;
+}
+function pr(e, t, n) {
+	for (var r; t.length && (r = N(t)).i <= n;) t.pop(), e.push(r.vs), n++;
+	return n;
+}
+function mr(e) {
+	return function(t, n) {
+		return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
+	};
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
+function hr(e, t, n, r) {
+	var i = e.children(t), a = e.node(t), o = a ? a.borderLeft : void 0, s = a ? a.borderRight : void 0, c = {};
+	o && (i = _(i, function(e) {
+		return e !== o && e !== s;
+	}));
+	var l = cr(e, i);
+	b(l, function(t) {
+		if (e.children(t.v).length) {
+			var i = hr(e, t.v, n, r);
+			c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && _r(t, i);
+		}
+	});
+	var u = lr(l, n);
+	gr(u, c);
+	var d = fr(u, r);
+	if (o && (d.vs = M([
+		o,
+		d.vs,
+		s
+	]), e.predecessors(o).length)) {
+		var f = e.node(e.predecessors(o)[0]), p = e.node(e.predecessors(s)[0]);
+		Object.prototype.hasOwnProperty.call(d, "barycenter") || (d.barycenter = 0, d.weight = 0), d.barycenter = (d.barycenter * d.weight + f.order + p.order) / (d.weight + 2), d.weight += 2;
+	}
+	return d;
+}
+function gr(e, t) {
+	b(e, function(e) {
+		e.vs = M(e.vs.map(function(e) {
+			return t[e] ? t[e].vs : e;
+		}));
+	});
+}
+function _r(e, t) {
+	x(e.barycenter) ? (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);
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/order/index.js
+function vr(e) {
+	var t = un(e), n = yr(e, U(1, t + 1), "inEdges"), r = yr(e, U(t - 1, -1, -1), "outEdges"), i = sr(e);
+	xr(e, i);
+	for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
+		br(s % 2 ? n : r, s % 4 >= 2), i = Y(e);
+		var l = ar(e, i);
+		l < a && (c = 0, o = _e(i), a = l);
+	}
+	xr(e, o);
+}
+function yr(e, t, n) {
+	return P(t, function(t) {
+		return rr(e, t, n);
+	});
+}
+function br(e, t) {
+	var n = new S();
+	b(e, function(e) {
+		var r = e.graph().root, i = hr(e, r, n, t);
+		b(i.vs, function(t, n) {
+			e.node(t).order = n;
+		}), nr(e, n, i.vs);
+	});
+}
+function xr(e, t) {
+	b(t, function(t) {
+		b(t, function(t, n) {
+			e.node(t).order = n;
+		});
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
+function Sr(e) {
+	var t = wr(e);
+	b(e.graph().dummyChains, function(n) {
+		for (var r = e.node(n), i = r.edgeObj, a = Cr(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; 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 Cr(e, t, n, r) {
+	var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
+	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 wr(e) {
+	var t = {}, n = 0;
+	function r(i) {
+		var a = n;
+		b(e.children(i), r), t[i] = {
+			low: a,
+			lim: n++
+		};
+	}
+	return b(e.children(), r), t;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/position/bk.js
+function Tr(e, t) {
+	var n = {};
+	function r(t, r) {
+		var i = 0, a = 0, o = t.length, s = N(r);
+		return b(r, function(t, c) {
+			var l = Dr(e, t), u = l ? e.node(l).order : o;
+			(l || t === s) && (b(r.slice(a, c + 1), function(t) {
+				b(e.predecessors(t), function(r) {
+					var a = e.node(r), o = a.order;
+					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && Or(n, r, t);
+				});
+			}), a = c + 1, i = u);
+		}), r;
+	}
+	return y(t, r), n;
+}
+function Er(e, t) {
+	var n = {};
+	function r(t, r, i, a, o) {
+		var s;
+		b(U(r, i), function(r) {
+			s = t[r], e.node(s).dummy && b(e.predecessors(s), function(t) {
+				var r = e.node(t);
+				r.dummy && (r.order < a || r.order > o) && Or(n, t, s);
+			});
+		});
+	}
+	function i(t, n) {
+		var i = -1, a, o = 0;
+		return b(n, function(s, c) {
+			if (e.node(s).dummy === "border") {
+				var l = e.predecessors(s);
+				l.length && (a = e.node(l[0]).order, r(n, o, c, i, a), o = c, i = a);
+			}
+			r(n, o, n.length, a, t.length);
+		}), n;
+	}
+	return y(t, i), n;
+}
+function Dr(e, t) {
+	if (e.node(t).dummy) return tt(e.predecessors(t), function(t) {
+		return e.node(t).dummy;
+	});
+}
+function Or(e, t, n) {
+	if (t > n) {
+		var r = t;
+		t = n, n = r;
+	}
+	Object.prototype.hasOwnProperty.call(e, t) || Object.defineProperty(e, t, {
+		enumerable: !0,
+		configurable: !0,
+		value: {},
+		writable: !0
+	});
+	var i = e[t];
+	Object.defineProperty(i, n, {
+		enumerable: !0,
+		configurable: !0,
+		value: !0,
+		writable: !0
+	});
+}
+function kr(e, t, n) {
+	if (t > n) {
+		var r = t;
+		t = n, n = r;
+	}
+	return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
+}
+function Ar(e, t, n, r) {
+	var i = {}, a = {}, o = {};
+	return b(t, function(e) {
+		b(e, function(e, t) {
+			i[e] = e, a[e] = e, o[e] = t;
+		});
+	}), b(t, function(e) {
+		var t = -1;
+		b(e, function(e) {
+			var s = r(e);
+			if (s.length) {
+				s = W(s, function(e) {
+					return o[e];
+				});
+				for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
+					var d = s[l];
+					a[e] === e && t < o[d] && !kr(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
+				}
+			}
+		});
+	}), {
+		root: i,
+		align: a
+	};
+}
+function jr(e, t, n, r, i) {
+	var a = {}, o = Mr(e, t, n, i), s = i ? "borderLeft" : "borderRight";
+	function c(e, t) {
+		for (var n = o.nodes(), r = n.pop(), i = {}; r;) i[r] ? e(r) : (i[r] = !0, n.push(r), n = n.concat(t(r))), r = n.pop();
+	}
+	function l(e) {
+		a[e] = o.inEdges(e).reduce(function(e, t) {
+			return Math.max(e, a[t.v] + o.edge(t));
+		}, 0);
+	}
+	function u(t) {
+		var n = o.outEdges(t).reduce(function(e, t) {
+			return 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 c(l, o.predecessors.bind(o)), c(u, o.successors.bind(o)), b(r, function(e) {
+		a[e] = a[n[e]];
+	}), a;
+}
+function Mr(e, t, n, r) {
+	var i = new S(), a = e.graph(), o = Lr(a.nodesep, a.edgesep, r);
+	return b(t, function(t) {
+		var r;
+		b(t, function(t) {
+			var a = n[t];
+			if (i.setNode(a), r) {
+				var s = n[r], c = i.edge(s, a);
+				i.setEdge(s, a, Math.max(o(e, t, r), c || 0));
+			}
+			r = t;
+		});
+	}), i;
+}
+function Nr(e, t) {
+	return z(v(t), function(t) {
+		var n = -Infinity, r = Infinity;
+		return rt(t, function(t, i) {
+			var a = Rr(e, i) / 2;
+			n = Math.max(t + a, n), r = Math.min(t - a, r);
+		}), n - r;
+	});
+}
+function Pr(e, t) {
+	var n = v(t), r = R(n), i = L(n);
+	b(["u", "d"], function(n) {
+		b(["l", "r"], function(a) {
+			var o = n + a, s = e[o], c;
+			if (s !== t) {
+				var l = v(s);
+				c = a === "l" ? r - R(l) : i - L(l), c && (e[o] = F(s, function(e) {
+					return e + c;
+				}));
+			}
+		});
+	});
+}
+function Fr(e, t) {
+	return F(e.ul, function(n, r) {
+		if (t) return e[t.toLowerCase()][r];
+		var i = W(P(e, r));
+		return (i[1] + i[2]) / 2;
+	});
+}
+function Ir(e) {
+	var t = Y(e), n = E(Tr(e, t), Er(e, t)), r = {}, i;
+	return b(["u", "d"], function(a) {
+		i = a === "u" ? t : v(t).reverse(), b(["l", "r"], function(t) {
+			t === "r" && (i = P(i, function(e) {
+				return v(e).reverse();
+			}));
+			var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = Ar(e, i, n, o), c = jr(e, i, s.root, s.align, t === "r");
+			t === "r" && (c = F(c, function(e) {
+				return -e;
+			})), r[a + t] = c;
+		});
+	}), Pr(r, Nr(e, r)), Fr(r, e.graph().align);
+}
+function Lr(e, t, n) {
+	return function(r, i, a) {
+		var o = r.node(i), s = r.node(a), c = 0, l;
+		if (c += o.width / 2, Object.prototype.hasOwnProperty.call(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.prototype.hasOwnProperty.call(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 Rr(e, t) {
+	return e.node(t).width;
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/position/index.js
+function zr(e) {
+	e = an(e), Br(e), it(Ir(e), function(t, n) {
+		e.node(n).x = t;
+	});
+}
+function Br(e) {
+	var t = Y(e), n = e.graph().ranksep, r = 0;
+	b(t, function(t) {
+		var i = L(P(t, function(t) {
+			return e.node(t).height;
+		}));
+		b(t, function(t) {
+			e.node(t).y = r + i / 2;
+		}), r += i + n;
+	});
+}
+//#endregion
+//#region ../../node_modules/dagre-d3-es/src/dagre/layout.js
+function Vr(e, t) {
+	var n = t && t.debugTiming ? fn : pn;
+	n("layout", () => {
+		var t = n("  buildLayoutGraph", () => Qr(e));
+		n("  runLayout", () => Hr(t, n)), n("  updateInputGraph", () => Ur(e, t));
+	});
+}
+function Hr(e, t) {
+	t("    makeSpaceForEdgeLabels", () => $r(e)), t("    removeSelfEdges", () => ci(e)), t("    acyclic", () => en(e)), t("    nestingGraph.run", () => Zn(e)), t("    rank", () => qn(an(e))), t("    injectEdgeLabelProxies", () => ei(e)), t("    removeEmptyRanks", () => cn(e)), t("    nestingGraph.cleanup", () => tr(e)), t("    normalizeRanks", () => sn(e)), t("    assignRankMinMax", () => ti(e)), t("    removeEdgeLabelProxies", () => ni(e)), t("    normalize.run", () => Cn(e)), t("    parentDummyChains", () => Sr(e)), t("    addBorderSegments", () => mn(e)), t("    order", () => vr(e)), t("    insertSelfEdges", () => li(e)), t("    adjustCoordinateSystem", () => gn(e)), t("    position", () => zr(e)), t("    positionSelfEdges", () => ui(e)), t("    removeBorderNodes", () => si(e)), t("    normalize.undo", () => Tn(e)), t("    fixupEdgeLabelCoords", () => ai(e)), t("    undoCoordinateSystem", () => _n(e)), t("    translateGraph", () => ri(e)), t("    assignNodeIntersects", () => ii(e)), t("    reversePoints", () => oi(e)), t("    acyclic.undo", () => nn(e));
+}
+function Ur(e, t) {
+	b(e.nodes(), function(n) {
+		var r = e.node(n), i = t.node(n);
+		r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
+	}), b(e.edges(), function(n) {
+		var r = e.edge(n), i = t.edge(n);
+		r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
+	}), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
+}
+var Wr = [
+	"nodesep",
+	"edgesep",
+	"ranksep",
+	"marginx",
+	"marginy"
+], Gr = {
+	ranksep: 50,
+	edgesep: 20,
+	nodesep: 50,
+	rankdir: "tb"
+}, Kr = [
+	"acyclicer",
+	"ranker",
+	"rankdir",
+	"align"
+], qr = ["width", "height"], Jr = {
+	width: 0,
+	height: 0
+}, Yr = [
+	"minlen",
+	"weight",
+	"width",
+	"height",
+	"labeloffset"
+], Xr = {
+	minlen: 1,
+	weight: 1,
+	width: 0,
+	height: 0,
+	labeloffset: 10,
+	labelpos: "r"
+}, Zr = ["labelpos"];
+function Qr(e) {
+	var t = new S({
+		multigraph: !0,
+		compound: !0
+	}), n = fi(e.graph());
+	return t.setGraph(E({}, Gr, di(n, Wr), H(n, Kr))), b(e.nodes(), function(n) {
+		var r = fi(e.node(n));
+		t.setNode(n, Ze(di(r, qr), Jr)), t.setParent(n, e.parent(n));
+	}), b(e.edges(), function(n) {
+		var r = fi(e.edge(n));
+		t.setEdge(n, E({}, Xr, di(r, Yr), H(r, Zr)));
+	}), t;
+}
+function $r(e) {
+	var t = e.graph();
+	t.ranksep /= 2, b(e.edges(), function(n) {
+		var 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 ei(e) {
+	b(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (n.width && n.height) {
+			var r = e.node(t.v);
+			J(e, "edge-proxy", {
+				rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
+				e: t
+			}, "_ep");
+		}
+	});
+}
+function ti(e) {
+	var t = 0;
+	b(e.nodes(), function(n) {
+		var r = e.node(n);
+		r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = L(t, r.maxRank));
+	}), e.graph().maxRank = t;
+}
+function ni(e) {
+	b(e.nodes(), function(t) {
+		var n = e.node(t);
+		n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
+	});
+}
+function ri(e) {
+	var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
+	function c(e) {
+		var 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);
+	}
+	b(e.nodes(), function(t) {
+		c(e.node(t));
+	}), b(e.edges(), function(t) {
+		var n = e.edge(t);
+		Object.prototype.hasOwnProperty.call(n, "x") && c(n);
+	}), t -= o, r -= s, b(e.nodes(), function(n) {
+		var i = e.node(n);
+		i.x -= t, i.y -= r;
+	}), b(e.edges(), function(n) {
+		var i = e.edge(n);
+		b(i.points, function(e) {
+			e.x -= t, e.y -= r;
+		}), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
+	}), a.width = n - t + o, a.height = i - r + s;
+}
+function ii(e) {
+	b(e.edges(), function(t) {
+		var 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(on(r, a)), n.points.push(on(i, o));
+	});
+}
+function ai(e) {
+	b(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (Object.prototype.hasOwnProperty.call(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 oi(e) {
+	b(e.edges(), function(t) {
+		var n = e.edge(t);
+		n.reversed && n.points.reverse();
+	});
+}
+function si(e) {
+	b(e.nodes(), function(t) {
+		if (e.children(t).length) {
+			var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(N(n.borderLeft)), o = e.node(N(n.borderRight));
+			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;
+		}
+	}), b(e.nodes(), function(t) {
+		e.node(t).dummy === "border" && e.removeNode(t);
+	});
+}
+function ci(e) {
+	b(e.edges(), function(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 li(e) {
+	b(Y(e), function(t) {
+		var n = 0;
+		b(t, function(t, r) {
+			var i = e.node(t);
+			i.order = r + n, b(i.selfEdges, function(t) {
+				J(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 ui(e) {
+	b(e.nodes(), function(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 di(e, t) {
+	return F(H(e, t), Number);
+}
+function fi(e) {
+	var t = {};
+	return b(e, function(e, n) {
+		t[n.toLowerCase()] = e;
+	}), t;
+}
+//#endregion
+//#region ../../node_modules/mermaid/dist/chunks/mermaid.core/dagre-6A5THRUB.mjs
+var pi = /* @__PURE__ */ D((e, t, n) => Math.max(t, Math.min(n, e)), "clamp"), mi = /* @__PURE__ */ D((e = "TB") => {
+	switch (e) {
+		case "BT": return "bottom";
+		case "LR": return "right";
+		case "RL": return "left";
+		default: return "top";
+	}
+}, "getDefaultSelfLoopSide"), hi = /* @__PURE__ */ D((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram" || e === "er" || e === "classDiagram", "shouldMergeSelfLoopSegments"), gi = [
+	"x",
+	"y",
+	"width",
+	"height",
+	"labelBBox",
+	"intersect",
+	"calcIntersect",
+	"diff",
+	"clusterNode"
+], _i = /* @__PURE__ */ D((e, t, n, r, i) => {
+	let a = [], o = /* @__PURE__ */ new Set();
+	if (n.forEach(({ start: e, end: t }) => {
+		e !== r && o.add(e), t !== r && o.add(t);
+	}), o.forEach((t) => {
+		let n = e.node(t);
+		typeof n?.x == "number" && typeof n?.y == "number" && a.push(n);
+	}), a.length === 0 && n.forEach(({ edge: e }) => {
+		(e.points ?? []).forEach((e) => {
+			typeof e?.x == "number" && typeof e?.y == "number" && a.push(e);
+		});
+	}), a.length === 0) return mi(i);
+	let s = a.reduce((e, t) => ({
+		x: e.x + t.x / a.length,
+		y: e.y + t.y / a.length
+	}), {
+		x: 0,
+		y: 0
+	}), c = s.x - t.x, l = s.y - t.y;
+	return Math.abs(c) > Math.abs(l) ? c > 0 ? "right" : "left" : Math.abs(l) > 0 ? l > 0 ? "bottom" : "top" : mi(i);
+}, "getSelfLoopSide"), vi = /* @__PURE__ */ D((e, t = "top", n = 0, r = 0) => {
+	let i = e.x, a = e.y - n, o = e.width / 2, s = e.height / 2, c = Math.max(36, Math.min(100, e.width * .8)), l = pi(Math.max(r, e.width * .35), 36, c), u = pi(Math.min(e.width, e.height) * .45, 24, 48);
+	switch (t) {
+		case "bottom": {
+			let e = a + s;
+			return [
+				{
+					x: i - l / 2,
+					y: e
+				},
+				{
+					x: i - l / 2,
+					y: e + u
+				},
+				{
+					x: i + l / 2,
+					y: e + u
+				},
+				{
+					x: i + l / 2,
+					y: e
+				}
+			];
+		}
+		case "right": {
+			let e = i + o;
+			return [
+				{
+					x: e,
+					y: a - l / 2
+				},
+				{
+					x: e + u,
+					y: a - l / 2
+				},
+				{
+					x: e + u,
+					y: a + l / 2
+				},
+				{
+					x: e,
+					y: a + l / 2
+				}
+			];
+		}
+		case "left": {
+			let e = i - o;
+			return [
+				{
+					x: e,
+					y: a - l / 2
+				},
+				{
+					x: e - u,
+					y: a - l / 2
+				},
+				{
+					x: e - u,
+					y: a + l / 2
+				},
+				{
+					x: e,
+					y: a + l / 2
+				}
+			];
+		}
+		default: {
+			let e = a - s;
+			return [
+				{
+					x: i - l / 2,
+					y: e
+				},
+				{
+					x: i - l / 2,
+					y: e - u
+				},
+				{
+					x: i + l / 2,
+					y: e - u
+				},
+				{
+					x: i + l / 2,
+					y: e
+				}
+			];
+		}
+	}
+}, "getSelfLoopPoints"), yi = /* @__PURE__ */ D((e, t, n = "top", r = 0, i = {}) => {
+	let a = e.x, o = e.y - r, s = i.width ?? 0, c = i.height ?? 0;
+	switch (n) {
+		case "bottom": return {
+			x: a,
+			y: Math.max(...t.map((e) => e.y)) + c / 2 + 4
+		};
+		case "right": return {
+			x: Math.max(...t.map((e) => e.x)) + s / 2 + 4,
+			y: o
+		};
+		case "left": return {
+			x: Math.min(...t.map((e) => e.x)) - s / 2 - 4,
+			y: o
+		};
+		default: return {
+			x: a,
+			y: Math.min(...t.map((e) => e.y)) - c / 2 - 4
+		};
+	}
+}, "getSelfLoopLabelPosition"), bi = /* @__PURE__ */ D((e, t = 0, { mergeSelfLoops: n = !0 } = {}) => {
+	let r = /* @__PURE__ */ new Map(), i = [], a = e.graph()?.rankdir;
+	return e.edges().forEach((t) => {
+		let a = e.edge(t);
+		if (n && a.selfLoop) {
+			let e = a.selfLoop.id;
+			r.has(e) || r.set(e, []), r.get(e).push({
+				edge: a,
+				start: t.v,
+				end: t.w
+			});
+		} else i.push({
+			edge: a,
+			start: t.v,
+			end: t.w
+		});
+	}), r.forEach((n) => {
+		if (n.length !== 3) {
+			n.forEach((e) => i.push(e));
+			return;
+		}
+		n.sort((e, t) => e.edge.selfLoop.order - t.edge.selfLoop.order);
+		let [r, o, s] = n, c = r.edge.originalEdge ?? o.edge.originalEdge ?? s.edge.originalEdge ?? o.edge, l = e.node(c.start);
+		if (!l) {
+			n.forEach((e) => i.push(e));
+			return;
+		}
+		let u = {
+			width: o.edge.width,
+			height: o.edge.height
+		}, d = _i(e, l, n, c.start, a), f = vi(l, d, t, u.width ?? 0), p = yi(l, f, d, t, u), m = {
+			...o.edge,
+			...c,
+			id: c.id,
+			points: f,
+			start: c.start,
+			end: c.end,
+			x: p.x,
+			y: p.y,
+			width: u.width,
+			height: u.height,
+			labelStyle: o.edge.labelStyle,
+			fromCluster: r.edge.fromCluster ?? o.edge.fromCluster ?? s.edge.fromCluster,
+			toCluster: r.edge.toCluster ?? o.edge.toCluster ?? s.edge.toCluster
+		};
+		delete m.selfLoop, delete m.originalEdge, i.push({
+			edge: m,
+			start: m.start,
+			end: m.end
+		});
+	}), i;
+}, "getEdgesToRender"), xi = /* @__PURE__ */ D(async ({ element: e, graph: t, diagramType: n, id: r, parentCluster: i, siteConfig: a }) => {
+	let o = t.graph().rankdir;
+	O.trace("Dir in recursive render - dir:", o);
+	let { clusters: s, edgePaths: c, edgeLabels: l, nodes: u, rootGroups: d } = De(e, { edgePathsClass: "edgePaths" });
+	t.nodes() ? O.info("Recursive render XXX", t.nodes()) : O.info("No nodes found for", t), t.edges().length > 0 && O.info("Recursive edges", t.edge(t.edges()[0]));
+	let f = hi(n);
+	await Promise.all(t.nodes().map(async function(e) {
+		let s = t.node(e);
+		if (i !== void 0) {
+			let n = JSON.parse(JSON.stringify(i.clusterData));
+			O.trace("Setting data for parent cluster XXX\n Node.id = ", e, "\n data=", n.height, "\nParent cluster", i.height), t.setNode(i.id, n), t.parent(e) || (O.trace("Setting parent", e, i.id), t.setParent(e, i.id, n));
+		}
+		if (O.info("(Insert) Node XXX" + e + ": " + JSON.stringify(t.node(e))), s?.clusterNode) {
+			O.info("Cluster identified XBX", e, s.width, t.node(e));
+			let { ranksep: i, nodesep: o } = t.graph();
+			s.graph.setGraph({
+				...s.graph.graph(),
+				ranksep: i + 25,
+				nodesep: o
+			});
+			let c = await Oi({
+				element: u,
+				graph: s.graph,
+				diagramType: n,
+				id: r,
+				parentCluster: t.node(e),
+				siteConfig: a
+			}), l = c.elem;
+			ye(s, l), s.diff = c.diff || 0, O.info("New compound node after recursive render XAX", e, "width", s.width, "height", s.height), be(l, s);
+		} else t.children(e).length > 0 ? (O.trace("Cluster - the non recursive path XBX", e, s.id, s, s.width, "Graph:", t), O.trace(Oe(s.id, t)), A.set(s.id, {
+			id: Oe(s.id, t),
+			node: s
+		})) : (O.trace("Node - the non recursive path XAX", e, u, t.node(e), o), await Ae(u, t.node(e), {
+			config: a,
+			dir: o
+		}));
+	})), await (/* @__PURE__ */ D(async () => {
+		let e = t.edges().map(async function(e) {
+			let n = t.edge(e.v, e.w, e.name);
+			if (O.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e)), O.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(t.edge(e))), O.info("Fix", A, "ids:", e.v, e.w, "Translating: ", A.get(e.v), A.get(e.w)), f && n.selfLoop) {
+				if (n.selfLoop.order !== 1) return;
+				let e = {
+					...n.originalEdge,
+					...n,
+					id: n.selfLoop.id,
+					startLabelLeft: n.originalEdge?.startLabelLeft ?? n.startLabelLeft,
+					startLabelRight: n.originalEdge?.startLabelRight ?? n.startLabelRight,
+					endLabelLeft: n.originalEdge?.endLabelLeft ?? n.endLabelLeft,
+					endLabelRight: n.originalEdge?.endLabelRight ?? n.endLabelRight
+				};
+				await Ce(l, e), n.width = e.width, n.height = e.height, n.labelStyle = e.labelStyle;
+				return;
+			}
+			await Ce(l, n);
+		});
+		await Promise.all(e);
+	}, "processEdges"))();
+	let { subGraphTitleTotalMargin: p } = Se(a);
+	return {
+		elem: d,
+		graph: t,
+		groups: {
+			clusters: s,
+			edgePaths: c,
+			edgeLabels: l,
+			nodes: u,
+			rootGroups: d
+		},
+		diagramType: n,
+		id: r,
+		mergeSelfLoops: f,
+		subGraphTitleTotalMargin: p
+	};
+}, "measureDagreGraph"), Si = /* @__PURE__ */ D((e) => {
+	O.info("############################################# XXX"), O.info("###                Layout                 ### XXX"), O.info("############################################# XXX"), Vr(e);
+}, "runDagreGraphLayout"), Ci = /* @__PURE__ */ D((e, t, n) => {
+	let r = e.node(t);
+	if (!r) return;
+	let i = { ...r };
+	return r?.clusterNode ? i.y = (r.y ?? 0) + n : e.children(t).length > 0 ? i.height = (r.height ?? 0) + n : i.y = (r.y ?? 0) + n / 2, i;
+}, "normalizeDagreNode"), wi = /* @__PURE__ */ D((e, t) => {
+	gi.forEach((n) => {
+		t[n] !== void 0 && (e[n] = t[n]);
+	});
+}, "applyDagreNodeLayout"), Ti = /* @__PURE__ */ D((e, t, n, r) => ({
+	...e,
+	start: e.start ?? t,
+	end: e.end ?? n,
+	points: (e.points ?? []).map((e) => ({
+		...e,
+		y: typeof e.y == "number" ? e.y + r : e.y
+	}))
+}), "normalizeDagreEdge"), Ei = /* @__PURE__ */ D((e, t) => {
+	let { graph: n, mergeSelfLoops: r, subGraphTitleTotalMargin: i = 0 } = t, a = new Map(e.nodes.map((e) => [e.id, e]));
+	k(n).forEach((e) => {
+		let t = Ci(n, e, i);
+		if (!t) return;
+		wi(n.node(e), t);
+		let r = a.get(e);
+		r && wi(r, t);
+	});
+	let o = i / 2;
+	return e.edges = bi(n, o, { mergeSelfLoops: r }).map(({ edge: e, start: t, end: n }) => Ti(e, t, n, o)), e;
+}, "applyDagreLayoutResult"), Di = /* @__PURE__ */ D(async ({ elem: e, graph: t, groups: { clusters: n, edgePaths: r }, diagramType: i, id: a, mergeSelfLoops: o, subGraphTitleTotalMargin: s }) => {
+	let c = 0;
+	await Promise.all(k(t).map(async function(e) {
+		let r = t.node(e);
+		if (O.info("Position XBX => " + e + ": (" + r.x, "," + r.y, ") width: ", r.width, " height: ", r.height), r?.clusterNode) r.y += s, O.info("A tainted cluster node XBX1", e, r.id, r.width, r.height, r.x, r.y, t.parent(e)), A.get(r.id).node = r, xe(r);
+		else if (t.children(e).length > 0) {
+			O.info("A pure cluster node XBX1", e, r.id, r.x, r.y, r.width, r.height, t.parent(e)), r.height += s, t.node(r.parentId);
+			let i = r?.padding / 2 || 0, a = r?.labelBBox?.height || 0, o = a - i || 0;
+			O.debug("OffsetY", o, "labelHeight", a, "halfPadding", i), await Ee(n, r), A.get(r.id).node = r;
+		} else {
+			let e = t.node(r.parentId);
+			r.y += s / 2, O.info("A regular node XBX1 - using the padding", r.id, "parent", r.parentId, r.width, r.height, r.x, r.y, "offsetY", r.offsetY, "parent", e, e?.offsetY, r), xe(r);
+		}
+	}));
+	let l = s / 2;
+	return bi(t, l, { mergeSelfLoops: o }).forEach(function({ edge: e, start: n, end: o }) {
+		O.info("Edge " + n + " -> " + o + ": " + JSON.stringify(e), e), e.points.forEach((e) => e.y += l), Te(e, we(r, e, A, i, t.node(n), t.node(o), a));
+	}), t.nodes().forEach(function(e) {
+		let n = t.node(e);
+		O.info(e, n.type, n.diff), n.isGroup && (c = n.diff);
+	}), O.warn("Returning from recursive render XAX", e, c), {
+		elem: e,
+		diff: c
+	};
+}, "paintDagreLayoutCore"), Oi = /* @__PURE__ */ D(async (e) => {
+	let t = await xi(e);
+	return Si(t.graph), await Di(t);
+}, "renderDagreSubgraph"), ki = /* @__PURE__ */ D((e) => {
+	let t = new S({
+		multigraph: !0,
+		compound: !0
+	}).setGraph({
+		rankdir: e.direction,
+		nodesep: e.config?.nodeSpacing || e.nodeSpacing || e.config?.flowchart?.nodeSpacing,
+		ranksep: e.config?.rankSpacing || e.rankSpacing || e.config?.flowchart?.rankSpacing,
+		marginx: 8,
+		marginy: 8
+	}).setDefaultEdgeLabel(function() {
+		return {};
+	});
+	return e.nodes.forEach((e) => {
+		t.setNode(e.id, { ...e }), e.parentId && t.setParent(e.id, e.parentId);
+	}), O.debug("Edges:", e.edges), e.edges.forEach((e) => {
+		if (e.start === e.end) {
+			let n = e.start, r = n + "---" + n + "---1", i = n + "---" + n + "---2", a = t.node(n);
+			t.setNode(r, {
+				domId: r,
+				id: r,
+				parentId: a.parentId,
+				labelStyle: "",
+				label: "",
+				padding: 0,
+				shape: "labelRect",
+				style: "",
+				width: 10,
+				height: 10
+			}), t.setParent(r, a.parentId), t.setNode(i, {
+				domId: i,
+				id: i,
+				parentId: a.parentId,
+				labelStyle: "",
+				padding: 0,
+				shape: "labelRect",
+				label: "",
+				style: "",
+				width: 10,
+				height: 10
+			}), t.setParent(i, a.parentId);
+			let o = structuredClone(e), s = structuredClone(e), c = structuredClone(e), l = structuredClone(e);
+			s.originalEdge = o, s.selfLoop = {
+				id: o.id,
+				order: 0
+			}, c.originalEdge = o, c.selfLoop = {
+				id: o.id,
+				order: 1
+			}, l.originalEdge = o, l.selfLoop = {
+				id: o.id,
+				order: 2
+			}, s.label = "", s.arrowTypeEnd = "none", s.endLabelLeft = "", s.endLabelRight = "", s.startLabelLeft = "", s.id = n + "-cyclic-special-1", c.startLabelRight = "", c.startLabelLeft = "", c.endLabelLeft = "", c.endLabelRight = "", c.arrowTypeStart = "none", c.arrowTypeEnd = "none", c.id = n + "-cyclic-special-mid", l.label = "", l.startLabelRight = "", l.startLabelLeft = "", l.arrowTypeStart = "none", a.isGroup && (s.fromCluster = n, l.toCluster = n), l.id = n + "-cyclic-special-2", l.arrowTypeStart = "none", t.setEdge(n, r, s, n + "-cyclic-special-0"), t.setEdge(r, i, c, n + "-cyclic-special-1"), t.setEdge(i, n, l, n + "-cyclic-special-2");
+		} else t.setEdge(e.start, e.end, { ...e }, e.id);
+	}), je(t), { graph: t };
+}, "prepareLayoutForDagre"), Ai = /* @__PURE__ */ D(async (e, { element: t, preparedLayout: n }) => {
+	let r = n ?? ki(e), i = ve(), a = await xi({
+		element: t,
+		graph: r.graph,
+		diagramType: e.type,
+		id: e.diagramId,
+		parentCluster: void 0,
+		siteConfig: i
+	});
+	return r.measuredLayout = a, a;
+}, "measureDagreLayout"), ji = /* @__PURE__ */ D((e, t) => {
+	let n = t.preparedLayout?.measuredLayout;
+	if (!n) throw Error("runDagreLayoutCore requires measureDagreLayout to run first");
+	return Si(n.graph), Ei(e, n), n;
+}, "runDagreLayoutCore"), Mi = ke({
+	prepareLayout: ki,
+	measureLayout: Ai,
+	runLayoutCore: ji,
+	paintOptions: {
+		clusterDb: A,
+		getNodes: /* @__PURE__ */ D((e, { measure: t }) => k(t.graph).map((e) => t.graph.node(e)).filter(Boolean), "getDagrePaintNodes"),
+		getEdgeNode: /* @__PURE__ */ D((e, t, { measure: n }) => e ? n.graph.node(e) : void 0, "getDagreEdgeNode"),
+		skipNode: /* @__PURE__ */ D((e, { measure: t }) => !t.graph.hasNode(e.id), "skipNode"),
+		isCluster: /* @__PURE__ */ D((e, { measure: t }) => t.graph.hasNode(e.id) && (t.graph.children(e.id) ?? []).length > 0, "isCluster")
+	}
+});
+//#endregion
+export { Ei as applyDagreLayoutResult, bi as getEdgesToRender, Ai as measureDagreLayout, ki as prepareLayoutForDagre, Mi as render, ji as runDagreLayoutCore };