@dpuse/dpuse-tool-d3-visualiser 0.0.37 → 0.0.45

package/dist/{erdDiagram-Ds-nrw7Q.js → erdDiagram-Ds1hsQDD.js}

@@ -12,10 +12,8 @@ var t = Object.defineProperty, n = (e, n, r) => n in e ? t(e, n, {
 	});
 }, i = (e, t, r) => n(e, typeof t == "symbol" ? t : t + "", r), a = {};
 r(a, {
-	Graph: () => c,
-	alg: () => b,
-	json: () => h,
-	version: () => m
+	Graph: () => E,
+	alg: () => v
 });
 var o = Object.defineProperty, s = (e, t) => {
 	for (var n in t) o(e, n, {
@@ -116,14 +114,14 @@ var o = Object.defineProperty, s = (e, t) => {
 	neighbors(e) {
 		let t = this.predecessors(e);
 		if (t) {
-			let n = new Set(t);
-			for (let t of this.successors(e)) n.add(t);
+			let n = new Set(t), r = this.successors(e);
+			if (r) for (let e of r) n.add(e);
 			return Array.from(n.values());
 		}
 	}
 	isLeaf(e) {
 		let t;
-		return t = this.isDirected() ? this.successors(e) : this.neighbors(e), t.length === 0;
+		return t = this.isDirected() ? this.successors(e) : this.neighbors(e), (t?.length ?? 0) === 0;
 	}
 	filterNodes(e) {
 		let t = new this.constructor({
@@ -138,7 +136,7 @@ var o = Object.defineProperty, s = (e, t) => {
 		});
 		let n = {}, r = (e) => {
 			let i = this.parent(e);
-			return !i || t.hasNode(i) ? (n[e] = i ?? void 0, i ?? void 0) : i in n ? n[i] : r(i);
+			return !i || t.hasNode(i) ? (n[e] = i, i) : i in n ? n[i] : r(i);
 		};
 		return this._isCompound && t.nodes().forEach((e) => t.setParent(e, r(e))), t;
 	}
@@ -170,7 +168,7 @@ var o = Object.defineProperty, s = (e, t) => {
 	}
 	edgeAsObj(e, t, n) {
 		let r = arguments.length === 1 ? this.edge(e) : this.edge(e, t, n);
-		return typeof r == "object" ? r : { label: r };
+		return typeof r != "object" || !r ? { label: r } : r;
 	}
 	hasEdge(e, t, n) {
 		return (arguments.length === 1 ? p(this._isDirected, e) : d(this._isDirected, e, t, n)) in this._edgeLabels;
@@ -233,30 +231,29 @@ function f(e, t, n, r) {
 function p(e, t) {
 	return d(e, t.v, t.w, t.name);
 }
-var m = "4.0.1", h = {};
-s(h, {
-	read: () => y,
-	write: () => g
+s({}, {
+	read: () => _,
+	write: () => m
 });
-function g(e) {
+function m(e) {
 	let t = {
 		options: {
 			directed: e.isDirected(),
 			multigraph: e.isMultigraph(),
 			compound: e.isCompound()
 		},
-		nodes: _(e),
-		edges: v(e)
+		nodes: h(e),
+		edges: g(e)
 	}, n = e.graph();
 	return n !== void 0 && (t.value = structuredClone(n)), t;
 }
-function _(e) {
+function h(e) {
 	return e.nodes().map((t) => {
 		let 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 v(e) {
+function g(e) {
 	return e.edges().map((t) => {
 		let n = e.edge(t), r = {
 			v: t.v,
@@ -265,7 +262,7 @@ function v(e) {
 		return t.name !== void 0 && (r.name = t.name), n !== void 0 && (r.value = n), r;
 	});
 }
-function y(e) {
+function _(e) {
 	let t = new c(e.options);
 	return e.value !== void 0 && t.setGraph(e.value), e.nodes.forEach((e) => {
 		t.setNode(e.v, e.value), e.parent && t.setParent(e.v, e.parent);
@@ -277,34 +274,36 @@ function y(e) {
 		}, e.value);
 	}), t;
 }
-var b = {};
-s(b, {
-	CycleException: () => C,
-	bellmanFord: () => x,
-	components: () => ne,
+var v = {};
+s(v, {
+	CycleException: () => w,
+	bellmanFord: () => b,
+	components: () => te,
 	dijkstra: () => S,
-	dijkstraAll: () => oe,
-	findCycles: () => ce,
-	floydWarshall: () => ue,
-	isAcyclic: () => fe,
-	postorder: () => ge,
-	preorder: () => _e,
-	prim: () => ve,
-	shortestPaths: () => ye,
-	tarjan: () => se,
-	topsort: () => w
+	dijkstraAll: () => ie,
+	findCycles: () => ae,
+	floydWarshall: () => se,
+	isAcyclic: () => ue,
+	postorder: () => pe,
+	preorder: () => me,
+	prim: () => he,
+	shortestPaths: () => ge,
+	tarjan: () => C,
+	topsort: () => le
 });
-var ee = () => 1;
-function x(e, t, n, r) {
-	return te(e, String(t), n || ee, r || function(t) {
-		return e.outEdges(t);
+var y = () => 1;
+function b(e, t, n, r) {
+	return ee(e, String(t), n || y, r || function(t) {
+		return e.outEdges(t) ?? [];
 	});
 }
-function te(e, t, n, r) {
+function ee(e, t, n, r) {
 	let i = {}, a, o = 0, s = e.nodes(), c = function(e) {
-		let t = n(e);
-		i[e.v].distance + t < i[e.w].distance && (i[e.w] = {
-			distance: i[e.v].distance + t,
+		let t = i[e.v], r = i[e.w];
+		if (!t || !r) return;
+		let o = n(e);
+		t.distance + o < r.distance && (i[e.w] = {
+			distance: t.distance + o,
 			predecessor: e.v
 		}, a = !0);
 	}, l = function() {
@@ -329,16 +328,17 @@ function te(e, t, n, r) {
 	if (o === u - 1 && (a = !1, l(), a)) throw Error("The graph contains a negative weight cycle");
 	return i;
 }
-function ne(e) {
+function te(e) {
 	let t = {}, n = [], r;
 	function i(n) {
-		n in t || (t[n] = !0, r.push(n), e.successors(n).forEach(i), e.predecessors(n).forEach(i));
+		var a, o;
+		n in t || (t[n] = !0, r.push(n), (a = e.successors(n)) == null || a.forEach(i), (o = e.predecessors(n)) == null || o.forEach(i));
 	}
 	return e.nodes().forEach(function(e) {
 		r = [], i(e), r.length && n.push(r);
 	}), n;
 }
-var re = class {
+var x = class {
 	constructor() {
 		this._arr = [], this._keyIndices = {};
 	}
@@ -371,6 +371,7 @@ var re = class {
 		return !1;
 	}
 	removeMin() {
+		if (this.size() === 0) throw Error("Queue underflow");
 		this._swap(0, this._arr.length - 1);
 		let e = this._arr.pop();
 		return delete this._keyIndices[e.key], this._heapify(0), e.key;
@@ -394,15 +395,17 @@ var re = class {
 		let 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;
 	}
-}, ie = () => 1;
+}, ne = () => 1;
 function S(e, t, n, r) {
-	return ae(e, String(t), n || ie, r || function(t) {
-		return e.outEdges(t);
+	return re(e, String(t), n || ne, r || function(t) {
+		return e.outEdges(t) ?? [];
 	});
 }
-function ae(e, t, n, r) {
-	let i = {}, a = new re(), o, s, c = function(e) {
-		let t = e.v === o ? e.w : e.v, r = i[t], c = n(e), l = s.distance + c;
+function re(e, t, n, r) {
+	let i = {}, a = new x(), o, s, c = function(e) {
+		let t = e.v === o ? e.w : e.v, r = i[t];
+		if (!r) return;
+		let c = n(e), l = s.distance + c;
 		if (c < 0) throw Error("dijkstra does not allow negative edge weights. Bad edge: " + e + " Weight: " + c);
 		l < r.distance && (r.distance = l, r.predecessor = o, a.decrease(t, l));
 	};
@@ -412,29 +415,44 @@ function ae(e, t, n, r) {
 			distance: n,
 			predecessor: ""
 		}, a.add(e, n);
-	}); a.size() > 0 && (o = a.removeMin(), s = i[o], s.distance !== Infinity);) r(o).forEach(c);
+	}); a.size() > 0;) {
+		o = a.removeMin();
+		let e = i[o];
+		if (!e || e.distance === Infinity) break;
+		s = e, r(o).forEach(c);
+	}
 	return i;
 }
-function oe(e, t, n) {
+function ie(e, t, n) {
 	return e.nodes().reduce(function(r, i) {
 		return r[i] = S(e, i, t, n), r;
 	}, {});
 }
-function se(e) {
+function C(e) {
 	let t = 0, n = [], r = {}, i = [];
 	function a(o) {
-		let s = r[o] = {
+		var s;
+		let c = r[o] = {
 			onStack: !0,
 			lowlink: t,
 			index: t++
 		};
-		if (n.push(o), e.successors(o).forEach(function(e) {
-			e in r ? r[e].onStack && (s.lowlink = Math.min(s.lowlink, r[e].index)) : (a(e), s.lowlink = Math.min(s.lowlink, r[e].lowlink));
-		}), s.lowlink === s.index) {
+		if (n.push(o), (s = e.successors(o)) == null || s.forEach(function(e) {
+			if (e in r) {
+				let t = r[e];
+				t != null && t.onStack && (c.lowlink = Math.min(c.lowlink, t.index));
+			} else {
+				a(e);
+				let t = r[e];
+				t && (c.lowlink = Math.min(c.lowlink, t.lowlink));
+			}
+		}), c.lowlink === c.index) {
 			let e = [], t;
-			do
-				t = n.pop(), r[t].onStack = !1, e.push(t);
-			while (o !== t);
+			do {
+				t = n.pop();
+				let i = r[t];
+				i && (i.onStack = !1), e.push(t);
+			} while (o !== t);
 			i.push(e);
 		}
 	}
@@ -442,143 +460,157 @@ function se(e) {
 		e in r || a(e);
 	}), i;
 }
-function ce(e) {
-	return se(e).filter(function(t) {
-		return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
+function ae(e) {
+	return C(e).filter(function(t) {
+		let n = t[0];
+		return n ? t.length > 1 || t.length === 1 && (e.outEdges(n, n) ?? []).length > 0 : !1;
 	});
 }
-var le = () => 1;
-function ue(e, t, n) {
-	return de(e, t || le, n || function(t) {
-		return e.outEdges(t);
+var oe = () => 1;
+function se(e, t, n) {
+	return ce(e, t || oe, n || function(t) {
+		return e.outEdges(t) ?? [];
 	});
 }
-function de(e, t, n) {
+function ce(e, t, n) {
 	let r = {}, i = e.nodes();
 	return i.forEach(function(e) {
-		r[e] = {}, r[e][e] = {
+		let a = {};
+		r[e] = a, a[e] = {
 			distance: 0,
 			predecessor: ""
 		}, i.forEach(function(t) {
-			e !== t && (r[e][t] = {
+			e !== t && (a[t] = {
 				distance: Infinity,
 				predecessor: ""
 			});
 		}), n(e).forEach(function(n) {
-			let i = n.v === e ? n.w : n.v, a = t(n);
-			r[e][i] = {
-				distance: a,
+			let r = n.v === e ? n.w : n.v, i = t(n);
+			a[r] = {
+				distance: i,
 				predecessor: e
 			};
 		});
 	}), i.forEach(function(e) {
 		let t = r[e];
-		i.forEach(function(n) {
+		t && i.forEach(function(n) {
 			let a = r[n];
-			i.forEach(function(n) {
-				let r = a[e], i = t[n], o = a[n], s = r.distance + i.distance;
-				s < o.distance && (o.distance = s, o.predecessor = i.predecessor);
+			a && i.forEach(function(n) {
+				let r = a[e], i = t[n], o = a[n];
+				if (r && i && o) {
+					let e = r.distance + i.distance;
+					e < o.distance && (o.distance = e, o.predecessor = i.predecessor);
+				}
 			});
 		});
 	}), r;
 }
-var C = class extends Error {
-	constructor(...e) {
-		super(...e);
+var w = class extends Error {
+	constructor(e) {
+		super(e), this.name = "CycleException";
 	}
 };
-function w(e) {
+function le(e) {
 	let t = {}, n = {}, r = [];
 	function i(a) {
-		if (a in n) throw new C();
-		a in t || (n[a] = !0, t[a] = !0, e.predecessors(a).forEach(i), delete n[a], r.push(a));
+		var o;
+		if (a in n) throw new w();
+		a in t || (n[a] = !0, t[a] = !0, (o = e.predecessors(a)) == null || o.forEach(i), delete n[a], r.push(a));
 	}
-	if (e.sinks().forEach(i), Object.keys(t).length !== e.nodeCount()) throw new C();
+	if (e.sinks().forEach(i), Object.keys(t).length !== e.nodeCount()) throw new w();
 	return r;
 }
-function fe(e) {
+function ue(e) {
 	try {
-		w(e);
+		le(e);
 	} catch (e) {
-		if (e instanceof C) return !1;
+		if (e instanceof w) return !1;
 		throw e;
 	}
 	return !0;
 }
-function pe(e, t, n, r, i) {
+function de(e, t, n, r, i) {
 	Array.isArray(t) || (t = [t]);
 	let a = ((t) => (e.isDirected() ? e.successors(t) : e.neighbors(t)) ?? []), o = {};
 	return t.forEach(function(t) {
 		if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
-		i = me(e, t, n === "post", o, a, r, i);
+		i = fe(e, t, n === "post", o, a, r, i);
 	}), i;
 }
-function me(e, t, n, r, i, a, o) {
+function fe(e, t, n, r, i, a, o) {
 	return t in r || (r[t] = !0, n || (o = a(o, t)), i(t).forEach(function(t) {
-		o = me(e, t, n, r, i, a, o);
+		o = fe(e, t, n, r, i, a, o);
 	}), n && (o = a(o, t))), o;
 }
-function he(e, t, n) {
-	return pe(e, t, n, function(e, t) {
+function T(e, t, n) {
+	return de(e, t, n, function(e, t) {
 		return e.push(t), e;
 	}, []);
 }
-function ge(e, t) {
-	return he(e, t, "post");
+function pe(e, t) {
+	return T(e, t, "post");
 }
-function _e(e, t) {
-	return he(e, t, "pre");
+function me(e, t) {
+	return T(e, t, "pre");
 }
-function ve(e, t) {
-	let n = new c(), r = {}, i = new re(), a;
-	function o(e) {
-		let n = e.v === a ? e.w : e.v, o = i.priority(n);
-		if (o !== void 0) {
+function he(e, t) {
+	var n;
+	let r = new c(), i = {}, a = new x(), o;
+	function s(e) {
+		let n = e.v === o ? e.w : e.v, r = a.priority(n);
+		if (r !== void 0) {
 			let s = t(e);
-			s < o && (r[n] = a, i.decrease(n, s));
+			s < r && (i[n] = o, a.decrease(n, s));
 		}
 	}
-	if (e.nodeCount() === 0) return n;
+	if (e.nodeCount() === 0) return r;
 	e.nodes().forEach(function(e) {
-		i.add(e, Infinity), n.setNode(e);
-	}), i.decrease(e.nodes()[0], 0);
-	let s = !1;
-	for (; i.size() > 0;) {
-		if (a = i.removeMin(), a in r) n.setEdge(a, r[a]);
+		a.add(e, Infinity), r.setNode(e);
+	});
+	let l = e.nodes()[0];
+	l !== void 0 && a.decrease(l, 0);
+	let u = !1;
+	for (; a.size() > 0;) {
+		if (o = a.removeMin(), o in i) r.setEdge(o, i[o]);
 		else {
-			if (s) throw Error("Input graph is not connected: " + e);
-			s = !0;
+			if (u) throw Error("Input graph is not connected: " + e);
+			u = !0;
 		}
-		e.nodeEdges(a).forEach(o);
+		(n = e.nodeEdges(o)) == null || n.forEach(s);
 	}
-	return n;
+	return r;
 }
-function ye(e, t, n, r) {
-	return be(e, t, n, r ?? ((t) => e.outEdges(t) ?? []));
+function ge(e, t, n, r) {
+	return _e(e, t, n, r ?? ((t) => e.outEdges(t) ?? []));
 }
-function be(e, t, n, r) {
+function _e(e, t, n, r) {
 	if (n === void 0) return S(e, t, n, r);
 	let i = !1, a = e.nodes();
 	for (let o = 0; o < a.length; o++) {
-		let s = r(a[o]);
-		for (let e = 0; e < s.length; e++) {
-			let t = s[e], r = t.v === a[o] ? t.v : t.w;
+		let s = a[o];
+		if (s === void 0) continue;
+		let c = r(s);
+		for (let e = 0; e < c.length; e++) {
+			let t = c[e];
+			if (!t) continue;
+			let r = t.v === s ? t.v : t.w;
 			n({
 				v: r,
 				w: r === t.v ? t.w : t.v
 			}) < 0 && (i = !0);
 		}
-		if (i) return x(e, t, n, r);
+		if (i) return b(e, t, n, r);
 	}
 	return S(e, t, n, r);
 }
-function T(e, t, n, r) {
+var E = c;
+function D(e, t, n, r) {
 	let i = r;
-	for (; e.hasNode(i);) i = A(r);
+	for (; e.hasNode(i);) i = M(r);
 	return n.dummy = t, e.setNode(i, n), i;
 }
-function xe(e) {
-	let t = new c().setGraph(e.graph());
+function ve(e) {
+	let t = new E().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,
@@ -590,15 +622,15 @@ function xe(e) {
 		});
 	}), t;
 }
-function E(e) {
-	let t = new c({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+function ye(e) {
+	let t = new E({ 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 D(e, t) {
+function O(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;
@@ -607,25 +639,25 @@ function D(e, t) {
 		y: r + l
 	};
 }
-function O(e) {
-	let t = j(De(e) + 1).map(() => []);
+function k(e) {
+	let t = N(j(e) + 1).map(() => []);
 	return e.nodes().forEach((n) => {
 		let r = e.node(n), i = r.rank;
 		i !== void 0 && (t[i] || (t[i] = []), t[i][r.order] = n);
 	}), t;
 }
-function Se(e) {
+function be(e) {
 	let t = e.nodes().map((t) => {
 		let n = e.node(t).rank;
 		return n === void 0 ? Number.MAX_VALUE : n;
-	}), n = k(Math.min, t);
+	}), n = A(Math.min, t);
 	e.nodes().forEach((t) => {
 		let r = e.node(t);
 		Object.hasOwn(r, "rank") && (r.rank -= n);
 	});
 }
-function Ce(e) {
-	let t = e.nodes().map((t) => e.node(t).rank).filter((e) => e !== void 0), n = k(Math.min, t), r = [];
+function xe(e) {
+	let t = e.nodes().map((t) => e.node(t).rank).filter((e) => e !== void 0), n = A(Math.min, t), r = [];
 	e.nodes().forEach((t) => {
 		let i = e.node(t).rank - n;
 		r[i] || (r[i] = []), r[i].push(t);
@@ -635,14 +667,14 @@ function Ce(e) {
 		t === void 0 && n % a !== 0 ? --i : t !== void 0 && i && t.forEach((t) => e.node(t).rank += i);
 	});
 }
-function we(e, t, n, r) {
+function Se(e, t, n, r) {
 	let i = {
 		width: 0,
 		height: 0
 	};
-	return arguments.length >= 4 && (i.rank = n, i.order = r), T(e, "border", i, t);
+	return arguments.length >= 4 && (i.rank = n, i.order = r), D(e, "border", i, t);
 }
-function Te(e, t = Ee) {
+function Ce(e, t = we) {
 	let n = [];
 	for (let r = 0; r < e.length; r += t) {
 		let i = e.slice(r, r + t);
@@ -650,18 +682,18 @@ function Te(e, t = Ee) {
 	}
 	return n;
 }
-var Ee = 65535;
-function k(e, t) {
-	return t.length > Ee ? e(...Te(t).map((t) => e(...t))) : e(...t);
+var we = 65535;
+function A(e, t) {
+	return t.length > we ? e(...Ce(t).map((t) => e(...t))) : e(...t);
 }
-function De(e) {
+function j(e) {
 	let t = e.nodes().map((t) => {
 		let n = e.node(t).rank;
 		return n === void 0 ? Number.MIN_VALUE : n;
 	});
-	return k(Math.max, t);
+	return A(Math.max, t);
 }
-function Oe(e, t) {
+function Te(e, t) {
 	let n = {
 		lhs: [],
 		rhs: []
@@ -670,14 +702,14 @@ function Oe(e, t) {
 		t(e) ? n.lhs.push(e) : n.rhs.push(e);
 	}), n;
 }
-function ke(e, t) {
+function Ee(e, t) {
 	return t();
 }
-var Ae = 0;
-function A(e) {
-	return e + ("" + ++Ae);
+var De = 0;
+function M(e) {
+	return e + ("" + ++De);
 }
-function j(e, t, n = 1) {
+function N(e, t, n = 1) {
 	t ?? (t = e, e = 0);
 	let r = (e) => e < t;
 	n < 0 && (r = (e) => t < e);
@@ -685,20 +717,20 @@ function j(e, t, n = 1) {
 	for (let t = e; r(t); t += n) i.push(t);
 	return i;
 }
-function M(e, t) {
+function P(e, t) {
 	let n = {};
 	for (let r of t) e[r] !== void 0 && (n[r] = e[r]);
 	return n;
 }
-function N(e, t) {
+function F(e, t) {
 	let n;
 	return n = typeof t == "string" ? (e) => e[t] : t, Object.entries(e).reduce((e, [t, r]) => (e[t] = n(r, t), e), {});
 }
-function je(e, t) {
+function Oe(e, t) {
 	return e.reduce((e, n, r) => (e[n] = t[r], e), {});
 }
-var P = "\0";
-function Me(e, t, n) {
+var I = "\0";
+function ke(e, t, n) {
 	if (!(e && t && n && t.dummy === "edge" && n.dummy === "edge" && t.edgeObj && n.edgeObj && e[t.edgeObj.v] && e[n.edgeObj.v] && e[t.edgeObj.w] && e[n.edgeObj.w])) return 0;
 	let r = !0;
 	t.edgeObj.w === n.edgeObj.w && (r = !1);
@@ -707,7 +739,7 @@ function Me(e, t, n) {
 	let s = a[1].order ?? NaN, c = o[1].order ?? NaN;
 	return isNaN(s - c) ? 0 : s - c;
 }
-var Ne = class {
+var Ae = class {
 	constructor() {
 		i(this, "_sentinel");
 		let e = {};
@@ -715,59 +747,59 @@ var Ne = class {
 	}
 	dequeue() {
 		let e = this._sentinel, t = e._prev;
-		if (t !== e) return Pe(t), t;
+		if (t !== e) return je(t), t;
 	}
 	enqueue(e) {
 		let t = this._sentinel;
-		e._prev && e._next && Pe(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+		e._prev && e._next && je(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, Fe)), n = n._prev;
+		for (; n !== t;) e.push(JSON.stringify(n, Me)), n = n._prev;
 		return "[" + e.join(", ") + "]";
 	}
 };
-function Pe(e) {
+function je(e) {
 	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function Fe(e, t) {
+function Me(e, t) {
 	if (e !== "_next" && e !== "_prev") return t;
 }
-var Ie = Ne, Le = () => 1;
-function Re(e, t) {
+var Ne = Ae, Pe = () => 1;
+function Fe(e, t) {
 	if (e.nodeCount() <= 1) return [];
-	let n = Be(e, t || Le);
-	return ze(n.graph, n.buckets, n.zeroIdx).flatMap((t) => e.outEdges(t.v, t.w) || []);
+	let n = Le(e, t || Pe);
+	return Ie(n.graph, n.buckets, n.zeroIdx).flatMap((t) => e.outEdges(t.v, t.w) || []);
 }
-function ze(e, t, n) {
+function Ie(e, t, n) {
 	let r = [], i = t[t.length - 1], a = t[0], o;
 	for (; e.nodeCount();) {
-		for (; o = a.dequeue();) F(e, t, n, o);
-		for (; o = i.dequeue();) F(e, t, n, o);
+		for (; o = a.dequeue();) L(e, t, n, o);
+		for (; o = i.dequeue();) L(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(F(e, t, n, o, !0) || []);
+				r = r.concat(L(e, t, n, o, !0) || []);
 				break;
 			}
 		}
 	}
 	return r;
 }
-function F(e, t, n, r, i) {
+function L(e, t, n, r, i) {
 	let a = [], o = i ? a : 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, I(t, n, s);
+		}), s.out -= o, R(t, n, s);
 	}), (e.outEdges(r.v) || []).forEach((r) => {
 		let i = e.edge(r), a = r.w, o = e.node(a);
-		o.in -= i, I(t, n, o);
+		o.in -= i, R(t, n, o);
 	}), e.removeNode(r.v), o;
 }
-function Be(e, t) {
-	let n = new c(), r = 0, i = 0;
+function Le(e, t) {
+	let n = new E(), r = 0, i = 0;
 	e.nodes().forEach((e) => {
 		n.setNode(e, {
 			v: e,
@@ -780,34 +812,34 @@ function Be(e, t) {
 		let c = n.node(e.v), l = n.node(e.w);
 		i = Math.max(i, c.out += o), r = Math.max(r, l.in += o);
 	});
-	let a = Ve(i + r + 3).map(() => new Ie()), o = r + 1;
+	let a = Re(i + r + 3).map(() => new Ne()), o = r + 1;
 	return n.nodes().forEach((e) => {
-		I(a, o, n.node(e));
+		R(a, o, n.node(e));
 	}), {
 		graph: n,
 		buckets: a,
 		zeroIdx: o
 	};
 }
-function I(e, t, n) {
+function R(e, t, n) {
 	var r, i, a;
 	n.out ? n.in ? (a = e[n.out - n.in + t]) == null || a.enqueue(n) : (i = e[e.length - 1]) == null || i.enqueue(n) : (r = e[0]) == null || r.enqueue(n);
 }
-function Ve(e) {
+function Re(e) {
 	let t = [];
 	for (let n = 0; n < e; n++) t.push(n);
 	return t;
 }
-function He(e, t) {
-	(e.graph().acyclicer === "greedy" ? Re(e, n(e)) : Ue(e, t ?? null)).forEach((t) => {
+function ze(e, t) {
+	(e.graph().acyclicer === "greedy" ? Fe(e, n(e)) : Be(e, t ?? null)).forEach((t) => {
 		let n = e.edge(t);
-		e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, A("rev"));
+		e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, M("rev"));
 	});
 	function n(e) {
 		return (t) => e.edge(t).weight;
 	}
 }
-function Ue(e, t) {
+function Be(e, t) {
 	let n = [], r = {}, i = {};
 	function a(t) {
 		Object.hasOwn(i, t) || (i[t] = !0, r[t] = !0, e.outEdges(t).forEach((e) => {
@@ -817,13 +849,13 @@ function Ue(e, t) {
 	function o(a) {
 		var s;
 		Object.hasOwn(i, a) || (i[a] = !0, r[a] = !0, (s = e.outEdges(a)) == null || s.forEach((i) => {
-			Object.hasOwn(r, i.w) || t.node(a)?.rank > t.node(i.w)?.rank && Ge(e, i.w, i) ? n.push(i) : o(i.w);
+			Object.hasOwn(r, i.w) || t.node(a)?.rank > t.node(i.w)?.rank && He(e, i.w, i) ? n.push(i) : o(i.w);
 		}), delete r[a]);
 	}
 	let s = a;
 	return t && typeof t.node == "function" && (s = o), e.sources().forEach(s), e.nodes().forEach(s), n;
 }
-function We(e) {
+function Ve(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		if (n.reversed) {
@@ -833,7 +865,7 @@ function We(e) {
 		}
 	});
 }
-function Ge(e, t, n) {
+function He(e, t, n) {
 	let r = /* @__PURE__ */ new Set();
 	function i(t) {
 		if (e.sources().includes(t)) return !0;
@@ -843,10 +875,10 @@ function Ge(e, t, n) {
 	}
 	return i(t);
 }
-function Ke(e) {
-	e.graph().dummyChains = [], e.edges().forEach((t) => qe(e, t));
+function Ue(e) {
+	e.graph().dummyChains = [], e.edges().forEach((t) => We(e, t));
 }
-function qe(e, t) {
+function We(e, t) {
 	let 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) return;
 	e.removeEdge(t);
@@ -857,10 +889,10 @@ function qe(e, t) {
 		edgeLabel: s,
 		edgeObj: t,
 		rank: r
-	}, l = T(e, "edge", u, "_d"), r === c && (u.width = s.width, u.height = s.height, u.dummy = "edge-label", u.labelpos = s.labelpos), e.setEdge(n, l, { weight: s.weight }, o), d === 0 && e.graph().dummyChains.push(l), n = l;
+	}, l = D(e, "edge", u, "_d"), r === c && (u.width = s.width, u.height = s.height, u.dummy = "edge-label", u.labelpos = s.labelpos), e.setEdge(n, l, { weight: s.weight }, o), d === 0 && e.graph().dummyChains.push(l), n = l;
 	e.setEdge(n, i, { weight: s.weight }, o);
 }
-function Je(e) {
+function Ge(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({
@@ -869,67 +901,67 @@ function Je(e) {
 		}), 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);
 	});
 }
-function L(e) {
+function z(e) {
 	let t = {};
 	function n(r) {
 		let i = e.node(r);
 		if (Object.hasOwn(t, r)) return i.rank;
 		t[r] = !0;
-		let a = e.outEdges(r), o = a ? a.map((t) => t == null ? Infinity : n(t.w) - e.edge(t).minlen) : [], s = k(Math.min, o);
+		let a = e.outEdges(r), o = a ? a.map((t) => t == null ? Infinity : n(t.w) - e.edge(t).minlen) : [], s = A(Math.min, o);
 		return s === Infinity && (s = 0), i.rank = s;
 	}
 	e.sources().forEach(n);
 }
-function R(e, t) {
+function B(e, t) {
 	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var z = Ye;
-function Ye(e) {
-	let t = new c({ directed: !1 }), n = e.nodes();
+var V = Ke;
+function Ke(e) {
+	let t = new E({ directed: !1 }), n = e.nodes();
 	if (n.length === 0) throw Error("Graph must have at least one node");
 	let r = n[0], i = e.nodeCount();
 	t.setNode(r, {});
 	let a, o;
-	for (; Xe(t, e) < i && (a = Ze(t, e), a);) o = t.hasNode(a.v) ? R(e, a) : -R(e, a), Qe(t, e, o);
+	for (; qe(t, e) < i && (a = Je(t, e), a);) o = t.hasNode(a.v) ? B(e, a) : -B(e, a), Ye(t, e, o);
 	return t;
 }
-function Xe(e, t) {
+function qe(e, t) {
 	function n(r) {
 		let i = t.nodeEdges(r);
 		i && i.forEach((i) => {
 			let a = i.v, o = r === a ? i.w : a;
-			!e.hasNode(o) && !R(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
+			!e.hasNode(o) && !B(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
 		});
 	}
 	return e.nodes().forEach(n), e.nodeCount();
 }
-function Ze(e, t) {
+function Je(e, t) {
 	return t.edges().reduce((n, r) => {
 		let i = Infinity;
-		return e.hasNode(r.v) !== e.hasNode(r.w) && (i = R(t, r)), i < n[0] ? [i, r] : n;
+		return e.hasNode(r.v) !== e.hasNode(r.w) && (i = B(t, r)), i < n[0] ? [i, r] : n;
 	}, [Infinity, null])[1];
 }
-function Qe(e, t, n) {
+function Ye(e, t, n) {
 	e.nodes().forEach((e) => t.node(e).rank += n);
 }
-var { preorder: $e, postorder: et } = b, tt = B;
-B.initLowLimValues = U, B.initCutValues = V, B.calcCutValue = H, B.leaveEdge = G, B.enterEdge = K, B.exchangeEdges = rt;
-function B(e) {
-	e = xe(e), L(e);
-	let t = z(e);
-	U(t), V(t, e);
+var { preorder: Xe, postorder: Ze } = v, Qe = H;
+H.initLowLimValues = G, H.initCutValues = U, H.calcCutValue = W, H.leaveEdge = q, H.enterEdge = J, H.exchangeEdges = et;
+function H(e) {
+	e = ve(e), z(e);
+	let t = V(e);
+	G(t), U(t, e);
 	let n, r;
-	for (; n = G(t);) r = K(t, e, n), rt(t, e, n, r);
+	for (; n = q(t);) r = J(t, e, n), et(t, e, n, r);
 }
-function V(e, t) {
-	let n = et(e, e.nodes());
-	n = n.slice(0, n.length - 1), n.forEach((n) => nt(e, t, n));
+function U(e, t) {
+	let n = Ze(e, e.nodes());
+	n = n.slice(0, n.length - 1), n.forEach((n) => $e(e, t, n));
 }
-function nt(e, t, n) {
+function $e(e, t, n) {
 	let r = e.node(n).parent, i = e.edge(n, r);
-	i.cutvalue = H(e, t, n);
+	i.cutvalue = W(e, t, n);
 }
-function H(e, t, n) {
+function W(e, t, n) {
 	let r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
 	a ||= (i = !1, t.edge(r, n)), o = a.weight;
 	let s = t.nodeEdges(n);
@@ -937,82 +969,82 @@ function H(e, t, n) {
 		let s = a.v === n, c = s ? a.w : a.v;
 		if (c !== r) {
 			let r = s === i, l = t.edge(a).weight;
-			if (o += r ? l : -l, at(e, n, c)) {
+			if (o += r ? l : -l, nt(e, n, c)) {
 				let t = e.edge(n, c).cutvalue;
 				o += r ? -t : t;
 			}
 		}
 	}), o;
 }
-function U(e, t) {
-	arguments.length < 2 && (t = e.nodes()[0]), W(e, {}, 1, t);
+function G(e, t) {
+	arguments.length < 2 && (t = e.nodes()[0]), K(e, {}, 1, t);
 }
-function W(e, t, n, r, i) {
+function K(e, t, n, r, i) {
 	let a = n, o = e.node(r);
 	t[r] = !0;
 	let s = e.neighbors(r);
 	return s && s.forEach((i) => {
-		Object.hasOwn(t, i) || (n = W(e, t, n, i, r));
+		Object.hasOwn(t, i) || (n = K(e, t, n, i, r));
 	}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
 }
-function G(e) {
+function q(e) {
 	return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function K(e, t, n) {
+function J(e, t, n) {
 	let r = n.v, i = n.w;
 	t.hasEdge(r, i) || (r = n.w, i = n.v);
 	let a = e.node(r), o = e.node(i), s = a, c = !1;
-	return a.lim > o.lim && (s = o, c = !0), t.edges().filter((t) => c === q(e, e.node(t.v), s) && c !== q(e, e.node(t.w), s)).reduce((e, n) => R(t, n) < R(t, e) ? n : e);
+	return a.lim > o.lim && (s = o, c = !0), t.edges().filter((t) => c === rt(e, e.node(t.v), s) && c !== rt(e, e.node(t.w), s)).reduce((e, n) => B(t, n) < B(t, e) ? n : e);
 }
-function rt(e, t, n, r) {
+function et(e, t, n, r) {
 	let i = n.v, a = n.w;
-	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), U(e), V(e, t), it(e, t);
+	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), G(e), U(e, t), tt(e, t);
 }
-function it(e, t) {
+function tt(e, t) {
 	let n = e.nodes().find((t) => !e.node(t).parent);
 	if (!n) return;
-	let r = $e(e, [n]);
+	let r = Xe(e, [n]);
 	r = r.slice(1), r.forEach((n) => {
 		let 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 at(e, t, n) {
+function nt(e, t, n) {
 	return e.hasEdge(t, n);
 }
-function q(e, t, n) {
+function rt(e, t, n) {
 	return n.low <= t.lim && t.lim <= n.lim;
 }
-var ot = st;
-function st(e) {
+var it = at;
+function at(e) {
 	let t = e.graph().ranker;
 	if (typeof t == "function") return t(e);
 	switch (t) {
 		case "network-simplex":
-			ut(e);
+			Y(e);
 			break;
 		case "tight-tree":
-			lt(e);
+			st(e);
 			break;
 		case "longest-path":
-			ct(e);
+			ot(e);
 			break;
 		case "none": break;
-		default: ut(e);
+		default: Y(e);
 	}
 }
-var ct = L;
-function lt(e) {
-	L(e), z(e);
+var ot = z;
+function st(e) {
+	z(e), V(e);
 }
-function ut(e) {
-	tt(e);
+function Y(e) {
+	Qe(e);
 }
-var dt = ft;
-function ft(e) {
-	let t = mt(e), n = e.graph();
+var ct = lt;
+function lt(e) {
+	let t = dt(e), n = e.graph();
 	Array.isArray(n.dummyChains) && n.dummyChains.forEach((n) => {
-		let r = e.node(n), i = r.edgeObj, a = pt(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0;
+		let r = e.node(n), i = r.edgeObj, a = ut(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++;
@@ -1026,7 +1058,7 @@ function ft(e) {
 		}
 	});
 }
-function pt(e, t, n, r) {
+function ut(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;
 	c = n;
 	do
@@ -1039,7 +1071,7 @@ function pt(e, t, n, r) {
 		lca: l
 	};
 }
-function mt(e) {
+function dt(e) {
 	let t = {}, n = 0;
 	function r(i) {
 		let a = n;
@@ -1048,17 +1080,17 @@ function mt(e) {
 			lim: n++
 		};
 	}
-	return e.children(P).forEach(r), t;
+	return e.children(I).forEach(r), t;
 }
-function ht(e) {
-	let t = T(e, "root", {}, "_root"), n = _t(e), r = Object.values(n), i = k(Math.max, r) - 1, a = 2 * i + 1;
+function ft(e) {
+	let t = D(e, "root", {}, "_root"), n = mt(e), r = Object.values(n), i = A(Math.max, r) - 1, a = 2 * i + 1;
 	e.graph().nestingRoot = t, e.edges().forEach((t) => e.edge(t).minlen *= a);
-	let o = vt(e) + 1;
-	e.children(P).forEach((r) => {
-		gt(e, t, a, o, i, n, r);
+	let o = ht(e) + 1;
+	e.children(I).forEach((r) => {
+		pt(e, t, a, o, i, n, r);
 	}), e.graph().nodeRankFactor = a;
 }
-function gt(e, t, n, r, i, a, o) {
+function pt(e, t, n, r, i, a, o) {
 	let s = e.children(o);
 	if (!s.length) {
 		o !== t && e.setEdge(t, o, {
@@ -1067,9 +1099,9 @@ function gt(e, t, n, r, i, a, o) {
 		});
 		return;
 	}
-	let c = we(e, "_bt"), l = we(e, "_bb"), u = e.node(o);
+	let c = Se(e, "_bt"), l = Se(e, "_bb"), u = e.node(o);
 	e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, s.forEach((s) => {
-		gt(e, t, n, r, i, a, s);
+		pt(e, t, n, r, i, a, s);
 		let 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] ?? 0) + 1 : 1;
 		e.setEdge(c, d, {
 			weight: p,
@@ -1085,81 +1117,81 @@ function gt(e, t, n, r, i, a, o) {
 		minlen: i + (a[o] ?? 0)
 	});
 }
-function _t(e) {
+function mt(e) {
 	let t = {};
 	function n(r, i) {
 		let a = e.children(r);
 		a && a.length && a.forEach((e) => n(e, i + 1)), t[r] = i;
 	}
-	return e.children(P).forEach((e) => n(e, 1)), t;
+	return e.children(I).forEach((e) => n(e, 1)), t;
 }
-function vt(e) {
+function ht(e) {
 	return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
 }
-function yt(e) {
+function gt(e) {
 	let t = e.graph();
 	e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((t) => {
 		e.edge(t).nestingEdge && e.removeEdge(t);
 	});
 }
-var bt = xt;
-function xt(e) {
+var _t = vt;
+function vt(e) {
 	function t(n) {
 		let r = e.children(n), i = e.node(n);
 		if (r.length && r.forEach(t), i && Object.hasOwn(i, "minRank")) {
 			i.borderLeft = [], i.borderRight = [];
-			for (let t = i.minRank, r = i.maxRank + 1; t < r; ++t) St(e, "borderLeft", "_bl", n, i, t), St(e, "borderRight", "_br", n, i, t);
+			for (let t = i.minRank, r = i.maxRank + 1; t < r; ++t) yt(e, "borderLeft", "_bl", n, i, t), yt(e, "borderRight", "_br", n, i, t);
 		}
 	}
-	e.children(P).forEach(t);
+	e.children(I).forEach(t);
 }
-function St(e, t, n, r, i, a) {
+function yt(e, t, n, r, i, a) {
 	let o = {
 		width: 0,
 		height: 0,
 		rank: a,
 		borderType: t
-	}, s = i[t][a - 1], c = T(e, "border", o, n);
+	}, s = i[t][a - 1], c = D(e, "border", o, n);
 	i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
 }
-function Ct(e) {
+function bt(e) {
 	let t = e.graph().rankdir?.toLowerCase();
-	(t === "lr" || t === "rl") && Tt(e);
+	(t === "lr" || t === "rl") && St(e);
 }
-function wt(e) {
+function xt(e) {
 	let t = e.graph().rankdir?.toLowerCase();
-	(t === "bt" || t === "rl") && Dt(e), (t === "lr" || t === "rl") && (Ot(e), Tt(e));
+	(t === "bt" || t === "rl") && wt(e), (t === "lr" || t === "rl") && (Tt(e), St(e));
 }
-function Tt(e) {
-	e.nodes().forEach((t) => Et(e.node(t))), e.edges().forEach((t) => Et(e.edge(t)));
+function St(e) {
+	e.nodes().forEach((t) => Ct(e.node(t))), e.edges().forEach((t) => Ct(e.edge(t)));
 }
-function Et(e) {
+function Ct(e) {
 	let t = e.width;
 	e.width = e.height, e.height = t;
 }
-function Dt(e) {
-	e.nodes().forEach((t) => J(e.node(t))), e.edges().forEach((t) => {
+function wt(e) {
+	e.nodes().forEach((t) => X(e.node(t))), e.edges().forEach((t) => {
 		var n;
 		let r = e.edge(t);
-		(n = r.points) == null || n.forEach(J), Object.hasOwn(r, "y") && J(r);
+		(n = r.points) == null || n.forEach(X), Object.hasOwn(r, "y") && X(r);
 	});
 }
-function J(e) {
+function X(e) {
 	e.y = -e.y;
 }
-function Ot(e) {
-	e.nodes().forEach((t) => Y(e.node(t))), e.edges().forEach((t) => {
+function Tt(e) {
+	e.nodes().forEach((t) => Z(e.node(t))), e.edges().forEach((t) => {
 		var n;
 		let r = e.edge(t);
-		(n = r.points) == null || n.forEach(Y), Object.hasOwn(r, "x") && Y(r);
+		(n = r.points) == null || n.forEach(Z), Object.hasOwn(r, "x") && Z(r);
 	});
 }
-function Y(e) {
+function Z(e) {
 	let t = e.x;
 	e.x = e.y, e.y = t;
 }
-function kt(e, t = null) {
-	let n = {}, r = e.nodes().filter((t) => !e.children(t).length), i = r.map((t) => e.node(t).rank), a = j(k(Math.max, i) + 1).map(() => []);
+function Et(e, t = null) {
+	let n = {}, r = e.nodes().filter((t) => !e.children(t).length), i = r.map((t) => e.node(t).rank), a = N(A(Math.max, i) + 1).map(() => []);
 	function o(t) {
 		if (n[t]) return;
 		n[t] = !0;
@@ -1170,17 +1202,17 @@ function kt(e, t = null) {
 	}
 	r.sort((t, n) => e.node(t).rank - e.node(n).rank).forEach(o);
 	function s(n, r) {
-		return Me(t, e.node(n), e.node(r));
+		return ke(t, e.node(n), e.node(r));
 	}
 	return a;
 }
-function At(e, t) {
+function Dt(e, t) {
 	let n = 0;
-	for (let r = 1; r < t.length; ++r) n += jt(e, t[r - 1], t[r]);
+	for (let r = 1; r < t.length; ++r) n += Ot(e, t[r - 1], t[r]);
 	return n;
 }
-function jt(e, t, n) {
-	let r = je(n, n.map((e, t) => t)), i = t.flatMap((t) => {
+function Ot(e, t, n) {
+	let r = Oe(n, n.map((e, t) => t)), i = t.flatMap((t) => {
 		let n = e.outEdges(t);
 		return n ? n.map((t) => ({
 			pos: r[t.w],
@@ -1199,7 +1231,7 @@ function jt(e, t, n) {
 		c += e.weight * n;
 	}), c;
 }
-function Mt(e, t = []) {
+function kt(e, t = []) {
 	return t.map((t) => {
 		let n = e.inEdges(t);
 		if (!n || !n.length) return { v: t };
@@ -1222,7 +1254,7 @@ function Mt(e, t = []) {
 		}
 	});
 }
-function Nt(e, t) {
+function At(e, t) {
 	let n = {};
 	return e.forEach((e, t) => {
 		let r = {
@@ -1236,13 +1268,13 @@ function Nt(e, t) {
 	}), t.edges().forEach((e) => {
 		let t = n[e.v], r = n[e.w];
 		t !== void 0 && r !== void 0 && (r.indegree++, t.out.push(r));
-	}), Pt(Object.values(n).filter((e) => !e.indegree));
+	}), jt(Object.values(n).filter((e) => !e.indegree));
 }
-function Pt(e) {
+function jt(e) {
 	let t = [];
 	function n(e) {
 		return (t) => {
-			t.merged || (t.barycenter === void 0 || e.barycenter === void 0 || t.barycenter >= e.barycenter) && Ft(e, t);
+			t.merged || (t.barycenter === void 0 || e.barycenter === void 0 || t.barycenter >= e.barycenter) && Mt(e, t);
 		};
 	}
 	function r(t) {
@@ -1254,63 +1286,63 @@ function Pt(e) {
 		let i = e.pop();
 		t.push(i), i.in.reverse().forEach(n(i)), i.out.forEach(r(i));
 	}
-	return t.filter((e) => !e.merged).map((e) => M(e, [
+	return t.filter((e) => !e.merged).map((e) => P(e, [
 		"vs",
 		"i",
 		"barycenter",
 		"weight"
 	]));
 }
-function Ft(e, t) {
+function Mt(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;
 }
-function It(e, t, n, r, i) {
+function Nt(e, t, n, r, i) {
 	let a = {}, o = null, s = null, c = i;
 	typeof t == "boolean" ? (c = t, a = {}) : t && (a = t, o = n ?? null, s = r ?? null);
-	let l = Oe(e, (e) => Object.hasOwn(e, "barycenter")), u = l.lhs, d = l.rhs.sort((e, t) => t.i - e.i), f = [], p = 0, m = 0, h = 0;
-	u.sort(Rt(s, o, !!c));
+	let l = Te(e, (e) => Object.hasOwn(e, "barycenter")), u = l.lhs, d = l.rhs.sort((e, t) => t.i - e.i), f = [], p = 0, m = 0, h = 0;
+	u.sort(Ft(s, o, !!c));
 	for (let [e, t] of Object.entries(a)) {
 		let n = u.findIndex((t) => t.vs[0] === e);
 		u.splice(n + 1, 0, t);
 	}
-	h = Lt(f, d, h), u.forEach((e) => {
-		h += e.vs.length, f.push(e.vs), p += e.barycenter * e.weight, m += e.weight, h = Lt(f, d, h);
+	h = Pt(f, d, h), u.forEach((e) => {
+		h += e.vs.length, f.push(e.vs), p += e.barycenter * e.weight, m += e.weight, h = Pt(f, d, h);
 	});
 	let g = { vs: f.flat(1) };
 	return m && (g.barycenter = p / m, g.weight = m), g;
 }
-function Lt(e, t, n) {
+function Pt(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 Rt(e, t, n) {
+function Ft(e, t, n) {
 	return (r, i) => {
 		if (r.barycenter < i.barycenter) return -1;
 		if (r.barycenter > i.barycenter) return 1;
 		if (e && (typeof r.vs[0] == "string" || typeof i.vs[0] == "string")) {
-			let n = Me(t, e.node(r.vs[0]), e.node(i.vs[0]));
+			let n = ke(t, e.node(r.vs[0]), e.node(i.vs[0]));
 			if (n !== 0) return n;
 		}
 		return n ? i.i - r.i : r.i - i.i;
 	};
 }
-function zt(e, t, n, r, i) {
+function It(e, t, n, r, i) {
 	var a, o;
 	let s = null, c = i;
 	typeof r == "boolean" ? (c = r, s = null) : r !== void 0 && (s = r);
 	let l = e.children(t), u = e.node(t), d = u ? u.borderLeft : void 0, f = u ? u.borderRight : void 0, p = {};
 	d && (l = l.filter((e) => e !== d && e !== f));
-	let m = Mt(e, l);
+	let m = kt(e, l);
 	m.forEach((t) => {
 		if (e.children(t.v).length) {
-			let { result: r } = zt(e, t.v, n, s, c);
-			p[t.v] = r, Object.hasOwn(r, "barycenter") && Vt(t, r);
+			let { result: r } = It(e, t.v, n, s, c);
+			p[t.v] = r, Object.hasOwn(r, "barycenter") && Rt(t, r);
 		}
 	});
-	let h = Nt(m, n);
-	Bt(h, p);
+	let h = At(m, n);
+	Lt(h, p);
 	let g = {}, _ = !1;
 	for (let t = 0; t < h.length; t++) for (let n = t + 1; n < h.length; n++) if (!(!h[t] || !h[n] || !((a = h[t]) != null && a.barycenter) || !((o = h[n]) != null && o.barycenter)) && h[t]?.barycenter === h[n].barycenter) {
 		let r = h[t]?.vs[0] ?? "", i = h[n]?.vs[0] ?? "", a = e.node(r), o = e.node(i);
@@ -1320,7 +1352,7 @@ function zt(e, t, n, r, i) {
 		} else g[r] = h[n], h.splice(n, 1), n--;
 		else _ = !0;
 	}
-	let v = It(h, g, s, e, c);
+	let v = Nt(h, g, s, e, c);
 	if (d && f) {
 		v.vs = [
 			d,
@@ -1345,17 +1377,17 @@ function zt(e, t, n, r, i) {
 		writable: !0
 	}), v;
 }
-function Bt(e, t) {
+function Lt(e, t) {
 	e.forEach((e) => {
 		e.vs = e.vs.flatMap((e) => t[e] ? t[e].vs : e);
 	});
 }
-function Vt(e, t) {
+function Rt(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);
 }
-function Ht(e, t, n, r) {
+function zt(e, t, n, r) {
 	r ||= e.nodes();
-	let i = Ut(e), a = new c({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel((t) => e.node(t));
+	let i = Bt(e), a = new E({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel((t) => e.node(t));
 	return r.forEach((r) => {
 		let o = e.node(r), s = e.parent(r);
 		if (o.rank === t || o.minRank <= t && t <= o.maxRank) {
@@ -1371,12 +1403,12 @@ function Ht(e, t, n, r) {
 		}
 	}), a;
 }
-function Ut(e) {
+function Bt(e) {
 	let t;
-	for (; e.hasNode(t = A("_root")););
+	for (; e.hasNode(t = M("_root")););
 	return t;
 }
-function Wt(e, t, n) {
+function Vt(e, t, n) {
 	let r = {}, i;
 	n.forEach((n) => {
 		let a = e.parent(n), o, s;
@@ -1389,22 +1421,22 @@ function Wt(e, t, n) {
 		}
 	});
 }
-function Gt(e, t = {}, n = null) {
+function Ht(e, t = {}, n = null) {
 	if (typeof t.customOrder == "function") {
-		t.customOrder(e, Gt);
+		t.customOrder(e, Ht);
 		return;
 	}
-	let r = De(e), i = Kt(e, j(1, r + 1), "inEdges"), a = Kt(e, j(r - 1, -1, -1), "outEdges"), o = kt(e, n);
-	if (Jt(e, o), t.disableOptimalOrderHeuristic) return;
+	let r = j(e), i = Ut(e, N(1, r + 1), "inEdges"), a = Ut(e, N(r - 1, -1, -1), "outEdges"), o = Et(e, n);
+	if (Gt(e, o), t.disableOptimalOrderHeuristic) return;
 	let s = Infinity, c, l = t.constraints || [];
 	for (let t = 0, r = 0; r < 4; ++t, ++r) {
-		qt(t % 2 ? i : a, t % 4 >= 2, l, n), o = O(e);
-		let u = At(e, o);
+		Wt(t % 2 ? i : a, t % 4 >= 2, l, n), o = k(e);
+		let u = Dt(e, o);
 		u < s ? (r = 0, c = Object.assign({}, o), s = u) : u === s && (c = structuredClone(o));
 	}
-	Jt(e, c);
+	Gt(e, c);
 }
-function Kt(e, t, n) {
+function Ut(e, t, n) {
 	let r = /* @__PURE__ */ new Map(), i = (e, t) => {
 		r.has(e) || r.set(e, []), r.get(e).push(t);
 	};
@@ -1413,48 +1445,48 @@ function Kt(e, t, n) {
 		if (typeof n.rank == "number" && i(n.rank, t), typeof n.minRank == "number" && typeof n.maxRank == "number") for (let e = n.minRank; e <= n.maxRank; e++) e !== n.rank && i(e, t);
 	}
 	return t.map(function(t) {
-		return Ht(e, t, n, r.get(t) || []);
+		return zt(e, t, n, r.get(t) || []);
 	});
 }
-function qt(e, t, n, r) {
-	let i = !0, a = new c();
+function Wt(e, t, n, r) {
+	let i = !0, a = new E();
 	e.forEach(function(e) {
 		n.forEach((e) => a.setEdge(e.left, e.right));
-		let o = e.graph().root, { result: s, usedBias: c } = zt(e, o, a, r, i);
-		t && c && (i = !i), s.vs.forEach((t, n) => e.node(t).order = n), Wt(e, a, s.vs);
+		let o = e.graph().root, { result: s, usedBias: c } = It(e, o, a, r, i);
+		t && c && (i = !i), s.vs.forEach((t, n) => e.node(t).order = n), Vt(e, a, s.vs);
 	});
 }
-function Jt(e, t) {
+function Gt(e, t) {
 	Object.values(t).forEach((t) => t.forEach((t, n) => e.node(t).order = n));
 }
-function Yt(e, t) {
+function Kt(e, t) {
 	let n = {};
 	function r(t, r) {
 		let i = 0, a = 0, o = t.length, s = r[r.length - 1];
 		return r.forEach((t, c) => {
-			let l = Zt(e, t), u = l ? e.node(l).order : o;
+			let l = Jt(e, t), u = l ? e.node(l).order : o;
 			(l || t === s) && (r.slice(a, c + 1).forEach((t) => {
 				let r = e.predecessors(t);
 				r && r.forEach((r) => {
 					let a = e.node(r), o = a.order;
-					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && Qt(n, r, t);
+					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && Yt(n, r, t);
 				});
 			}), a = c + 1, i = u);
 		}), r;
 	}
 	return t.length && t.reduce(r), n;
 }
-function Xt(e, t) {
+function qt(e, t) {
 	let n = {};
 	function r(t, r, i, a, o) {
-		j(r, i).forEach((r) => {
+		N(r, i).forEach((r) => {
 			let i = t[r];
 			if (i !== void 0 && e.node(i).dummy) {
 				let t = e.predecessors(i);
 				t && t.forEach((t) => {
 					if (t === void 0) return;
 					let r = e.node(t);
-					r.dummy && (r.order < a || r.order > o) && Qt(n, t, i);
+					r.dummy && (r.order < a || r.order > o) && Yt(n, t, i);
 				});
 			}
 		});
@@ -1475,13 +1507,13 @@ function Xt(e, t) {
 	}
 	return t.length && t.reduce(i), n;
 }
-function Zt(e, t) {
+function Jt(e, t) {
 	if (e.node(t).dummy) {
 		let n = e.predecessors(t);
 		if (n) return n.find((t) => e.node(t).dummy);
 	}
 }
-function Qt(e, t, n) {
+function Yt(e, t, n) {
 	if (t > n) {
 		let e = t;
 		t = n, n = e;
@@ -1489,7 +1521,7 @@ function Qt(e, t, n) {
 	let r = e[t];
 	r || (e[t] = r = {}), r[n] = !0;
 }
-function $t(e, t, n) {
+function Xt(e, t, n) {
 	if (t > n) {
 		let e = t;
 		t = n, n = e;
@@ -1497,14 +1529,14 @@ function $t(e, t, n) {
 	let r = e[t];
 	return r !== void 0 && Object.hasOwn(r, n);
 }
-function en(e, t, n, r, i) {
+function Zt(e, t, n, r, i) {
 	let a = {}, o = {}, s = {};
 	return t.forEach((e) => {
 		e.forEach((e, t) => {
 			a[e] = e, o[e] = e, s[e] = t;
 		});
 	}), t.forEach((t) => {
-		let c = -1, l = -1, u = !1, d = t, f = t.findIndex((t) => i?.includes(t) || un(t, e, i));
+		let c = -1, l = -1, u = !1, d = t, f = t.findIndex((t) => i?.includes(t) || sn(t, e, i));
 		f > 0 && (d = [
 			t[f],
 			...t.slice(0, f),
@@ -1512,7 +1544,7 @@ function en(e, t, n, r, i) {
 		], u = !0), d.forEach((t) => {
 			let d = r(t);
 			if (d && d.length) {
-				i != null && i.includes(t) && (d = d.filter((t) => un(t, e, i)));
+				i != null && i.includes(t) && (d = d.filter((t) => sn(t, e, i)));
 				let r = d.sort((e, t) => {
 					let n = s[e], r = s[t];
 					return (n === void 0 ? 0 : n) - (r === void 0 ? 0 : r);
@@ -1521,7 +1553,7 @@ function en(e, t, n, r, i) {
 					let i = r[e];
 					if (i === void 0) continue;
 					let d = s[i];
-					if (d !== void 0 && o[t] === t && c < d && s[i] !== l && !$t(n, t, i)) {
+					if (d !== void 0 && o[t] === t && c < d && s[i] !== l && !Xt(n, t, i)) {
 						let e = a[i];
 						e !== void 0 && (o[i] = t, o[t] = a[t] = e, c = d, u &&= (c = -1, l = s[i] ?? -1, !1));
 					}
@@ -1533,8 +1565,8 @@ function en(e, t, n, r, i) {
 		align: o
 	};
 }
-function tn(e, t, n, r, i = !1) {
-	let a = {}, o = nn(e, t, n, i), s = i ? "borderLeft" : "borderRight";
+function Qt(e, t, n, r, i = !1) {
+	let a = {}, o = $t(e, t, n, i), s = i ? "borderLeft" : "borderRight";
 	function c(e, t) {
 		let n = o.nodes().slice(), r = {}, i = n.pop();
 		for (; i;) {
@@ -1573,8 +1605,8 @@ function tn(e, t, n, r, i = !1) {
 		t !== void 0 && (a[e] = a[t] ?? 0);
 	}), a;
 }
-function nn(e, t, n, r) {
-	let i = new c(), a = e.graph(), o = cn(a.nodesep, a.edgesep, r);
+function $t(e, t, n, r) {
+	let i = new E(), a = e.graph(), o = an(a.nodesep, a.edgesep, r);
 	return t.forEach((t) => {
 		let r;
 		t.forEach((t) => {
@@ -1592,31 +1624,31 @@ function nn(e, t, n, r) {
 		});
 	}), i;
 }
-function rn(e, t) {
+function en(e, t) {
 	return Object.values(t).reduce((t, n) => {
 		let r = -Infinity, i = Infinity;
 		Object.entries(n).forEach(([t, n]) => {
-			let a = ln(e, t) / 2;
+			let a = on(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 an(e, t) {
-	let n = Object.values(t), r = k(Math.min, n), i = k(Math.max, n);
+function tn(e, t) {
+	let n = Object.values(t), r = A(Math.min, n), i = A(Math.max, n);
 	["u", "d"].forEach((n) => {
 		["l", "r"].forEach((a) => {
 			let o = n + a, s = e[o];
 			if (!s || s === t) return;
-			let c = Object.values(s), l = r - k(Math.min, c);
-			a !== "l" && (l = i - k(Math.max, c)), l && (e[o] = N(s, (e) => e + l));
+			let c = Object.values(s), l = r - A(Math.min, c);
+			a !== "l" && (l = i - A(Math.max, c)), l && (e[o] = F(s, (e) => e + l));
 		});
 	});
 }
-function on(e, t = void 0) {
+function nn(e, t = void 0) {
 	let n = e.ul;
-	return n ? N(n, (n, r) => {
+	return n ? F(n, (n, r) => {
 		if (t) {
 			let n = e[t.toLowerCase()];
 			if (n && n[r] !== void 0) return n[r];
@@ -1628,17 +1660,17 @@ function on(e, t = void 0) {
 		return ((i[1] ?? 0) + (i[2] ?? 0)) / 2;
 	}) : {};
 }
-function sn(e, t) {
-	let n = O(e), r = Object.assign(Yt(e, n), Xt(e, n)), i = {}, a;
+function rn(e, t) {
+	let n = k(e), r = Object.assign(Kt(e, n), qt(e, n)), i = {}, a;
 	return ["u", "d"].forEach((o) => {
 		a = o === "u" ? n : Object.values(n).reverse(), ["l", "r"].forEach((n) => {
 			n === "r" && (a = a.map((e) => Object.values(e).reverse()));
-			let s = en(e, a, r, (t) => (o === "u" ? e.predecessors(t) : e.successors(t)) || [], t), c = tn(e, a, s.root, s.align, n === "r");
-			n === "r" && (c = N(c, (e) => -e)), i[o + n] = c;
+			let s = Zt(e, a, r, (t) => (o === "u" ? e.predecessors(t) : e.successors(t)) || [], t), c = Qt(e, a, s.root, s.align, n === "r");
+			n === "r" && (c = F(c, (e) => -e)), i[o + n] = c;
 		});
-	}), an(i, rn(e, i)), on(i, e.graph().align);
+	}), tn(i, en(e, i)), nn(i, e.graph().align);
 }
-function cn(e, t, n) {
+function an(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()) {
@@ -1660,21 +1692,21 @@ function cn(e, t, n) {
 		return l && (c += n ? l : -l), c;
 	};
 }
-function ln(e, t) {
+function on(e, t) {
 	return e.node(t).width;
 }
-function un(e, t, n) {
+function sn(e, t, n) {
 	if (!n) return !1;
 	let r = t.node(e)?.edgeObj;
 	if (!r || t.node(e).edgeLabel.reversed) return !1;
 	let i = n.indexOf(r?.v), a = n.indexOf(r?.w);
 	return i !== -1 && a !== -1 && i === (a + 1) % n.length || i === (a - 1) % n.length;
 }
-function dn(e, t) {
-	e = E(e), fn(e), Object.entries(sn(e, t)).forEach(([t, n]) => e.node(t).x = n);
+function cn(e, t) {
+	e = ye(e), ln(e), Object.entries(rn(e, t)).forEach(([t, n]) => e.node(t).x = n);
 }
-function fn(e) {
-	let t = O(e), n = e.graph(), r = n.ranksep, i = n.rankalign, a = 0;
+function ln(e) {
+	let t = k(e), n = e.graph(), r = n.ranksep, i = n.rankalign, a = 0;
 	t.forEach((t) => {
 		let n = t.reduce((t, n) => {
 			let r = e.node(n).height ?? 0;
@@ -1686,11 +1718,11 @@ function fn(e) {
 		}), a += n + r;
 	});
 }
-var X = null, Z = null;
-function pn(e, t = {}) {
-	return hn(e, ke, t), e;
+var un = /* @__PURE__ */ new WeakMap();
+function dn(e, t = {}) {
+	return pn(e, Ee, t), e;
 }
-function mn(e, t, n) {
+function fn(e, t, n) {
 	let r = t;
 	for (; r !== void 0;) {
 		let t = e.parent(r);
@@ -1698,12 +1730,12 @@ function mn(e, t, n) {
 		r = t;
 	}
 }
-function hn(e, t, n) {
+function pn(e, t, n) {
 	let r = e.nodes().filter((t) => e.children(t).length), i = {};
 	r.forEach((r) => {
 		let a = e.node(r);
 		if (a && a.rankdir) {
-			let o = new c({
+			let o = new E({
 				multigraph: !0,
 				compound: !0
 			});
@@ -1715,32 +1747,32 @@ function hn(e, t, n) {
 				let i = e.parent(t);
 				i && i !== r && s.includes(i) && o.setParent(t, i);
 			});
-			let l = /* @__PURE__ */ new Set();
+			let c = /* @__PURE__ */ new Set();
 			e.edges().forEach((t) => {
-				let n = mn(e, t.v, r), i = mn(e, t.w, r);
+				let n = fn(e, t.v, r), i = fn(e, t.w, r);
 				if (n && i && n !== i) {
 					let r = `${n}\0${i}`;
-					l.has(r) || (l.add(r), o.setEdge(n, i, { ...e.edge(t) }));
+					c.has(r) || (c.add(r), o.setEdge(n, i, { ...e.edge(t) }));
 				}
-			}), hn(o, t, n);
-			let u = En(o);
-			gn(u, t, n), _n(o, u);
-			let d = Infinity, f = Infinity, p = -Infinity, m = -Infinity;
+			}), pn(o, t, n);
+			let l = wn(o);
+			mn(l, t, n, null), hn(o, l);
+			let u = Infinity, d = Infinity, f = -Infinity, p = -Infinity;
 			o.nodes().forEach((e) => {
 				if (e === r) return;
 				let t = o.node(e);
-				t && typeof t.x == "number" && typeof t.y == "number" && typeof t.width == "number" && typeof t.height == "number" && (d = Math.min(d, t.x - t.width / 2), p = Math.max(p, t.x + t.width / 2), f = Math.min(f, t.y - t.height / 2), m = Math.max(m, t.y + t.height / 2));
-			}), (!isFinite(d) || !isFinite(f) || !isFinite(p) || !isFinite(m)) && (d = f = 0, p = m = 0);
-			let h = p - d, g = m - f;
+				t && typeof t.x == "number" && typeof t.y == "number" && typeof t.width == "number" && typeof t.height == "number" && (u = Math.min(u, t.x - t.width / 2), f = Math.max(f, t.x + t.width / 2), d = Math.min(d, t.y - t.height / 2), p = Math.max(p, t.y + t.height / 2));
+			}), (!isFinite(u) || !isFinite(d) || !isFinite(f) || !isFinite(p)) && (u = d = 0, f = p = 0);
+			let m = f - u, h = p - d;
 			i[r] = {
-				minX: d,
-				minY: f,
-				maxX: p,
-				maxY: m,
-				width: h,
-				height: g,
-				offsetX: d,
-				offsetY: f
+				minX: u,
+				minY: d,
+				maxX: f,
+				maxY: p,
+				width: m,
+				height: h,
+				offsetX: u,
+				offsetY: d
 			}, a._dagreClusterSubgraph = o;
 		}
 	});
@@ -1756,35 +1788,35 @@ function hn(e, t, n) {
 		let n = e.node(t);
 		n && n.rankdir && i[t] && s.set(t, (e.children(t) || []).filter((e) => e !== t));
 	});
-	let l = new Set([...s.values()].flat()), u = /* @__PURE__ */ new Map();
+	let c = new Set([...s.values()].flat()), l = /* @__PURE__ */ new Map();
 	s.forEach((e, t) => {
-		l.has(t) || u.set(t, o(t));
+		c.has(t) || l.set(t, o(t));
 	});
-	let d = new Set([...u.values()].flat()), f = (e) => {
-		for (let [t, n] of u) if (n.includes(e)) return t;
+	let u = new Set([...l.values()].flat()), d = (e) => {
+		for (let [t, n] of l) if (n.includes(e)) return t;
 		return e;
-	}, p = [];
+	}, f = [];
 	e.edges().forEach((t) => {
-		(d.has(t.v) || d.has(t.w)) && p.push({
+		(u.has(t.v) || u.has(t.w)) && f.push({
 			edge: t,
 			label: e.edge(t)
 		});
 	});
-	let m = /* @__PURE__ */ new Map();
-	d.forEach((t) => {
+	let p = /* @__PURE__ */ new Map();
+	u.forEach((t) => {
 		let n = e.parent(t);
-		m.set(t, typeof n == "string" ? n : void 0);
-	}), u.forEach((t, n) => {
+		p.set(t, typeof n == "string" ? n : void 0);
+	}), l.forEach((t, n) => {
 		let r = e.node(n), o = [];
 		t.forEach((t) => {
 			let n = e.node(t);
 			n && (o.push({
 				id: t,
 				node: n,
-				parent: m.get(t)
+				parent: p.get(t)
 			}), e.removeNode(t));
 		});
-		let s = p.filter(({ edge: e }) => t.includes(e.v) || t.includes(e.w)), c = i[n];
+		let s = f.filter(({ edge: e }) => t.includes(e.v) || t.includes(e.w)), c = i[n];
 		r && (a.push({
 			clusterId: n,
 			subgraph: r._dagreClusterSubgraph,
@@ -1794,20 +1826,20 @@ function hn(e, t, n) {
 			removedEdges: s
 		}), r.width = c.width, r.height = c.height);
 	});
-	let h = /* @__PURE__ */ new Set();
-	p.forEach(({ edge: t, label: n }) => {
-		let r = f(t.v), i = f(t.w);
+	let m = /* @__PURE__ */ new Set();
+	f.forEach(({ edge: t, label: n }) => {
+		let r = d(t.v), i = d(t.w);
 		if (r !== i && e.hasNode(r) && e.hasNode(i)) {
 			let t = `${r}\0${i}`;
-			h.has(t) || (h.add(t), e.setEdge(r, i, {
+			m.has(t) || (m.add(t), e.setEdge(r, i, {
 				...n,
 				width: 0,
 				height: 0
 			}));
 		}
 	});
-	let g = En(e);
-	gn(g, t, n), _n(e, g), h.forEach((t) => {
+	let h = wn(e), g = mn(h, t, n, un.get(e) ?? null);
+	un.set(e, g), hn(e, h), m.forEach((t) => {
 		let n = t.indexOf("\0"), r = t.slice(0, n), i = t.slice(n + 1);
 		e.hasEdge(r, i) && e.removeEdge(r, i);
 	}), a.forEach(({ clusterId: t, subgraph: n, bounds: r, removedNodes: i, removedEdges: a }) => {
@@ -1836,10 +1868,17 @@ function hn(e, t, n) {
 		}
 	});
 }
-function gn(e, t, n) {
-	n?.useDynamic === !1 && (X = null, Z = null), t("    makeSpaceForEdgeLabels", () => Dn(e)), t("    removeSelfEdges", () => In(e)), t("    acyclic", () => He(e, X)), t("    nestingGraph.run", () => ht(e)), t("    rank", () => ot(E(e))), t("    injectEdgeLabelProxies", () => On(e)), t("    removeEmptyRanks", () => Ce(e)), t("    nestingGraph.cleanup", () => yt(e)), t("    normalizeRanks", () => Se(e)), t("    assignRankMinMax", () => kn(e)), t("    removeEdgeLabelProxies", () => An(e)), t("    normalize.run", () => Ke(e)), t("    parentDummyChains", () => dt(e)), t("    addBorderSegments", () => bt(e)), t("    order", () => Gt(e, n, Z)), t("    insertSelfEdges", () => Ln(e)), t("    adjustCoordinateSystem", () => Ct(e)), t("    position", () => dn(e, n.corePath)), t("    positionSelfEdges", () => Rn(e)), Z = JSON.parse(JSON.stringify(e._nodes)), t("    removeBorderNodes", () => Fn(e)), t("    normalize.undo", () => Je(e)), t("    fixupEdgeLabelCoords", () => Nn(e)), t("    undoCoordinateSystem", () => wt(e)), t("    translateGraph", () => jn(e)), t("    assignNodeIntersects", () => Mn(e)), t("    reversePoints", () => Pn(e)), t("    acyclic.undo", () => We(e)), X = e;
+function mn(e, t, n, r = null) {
+	var i, a;
+	let o = n?.useDynamic !== !1, s = o && (i = r?.graph) != null ? i : null, c = o && (a = r?.rawNodes) != null ? a : null;
+	t("    makeSpaceForEdgeLabels", () => Tn(e)), t("    removeSelfEdges", () => Pn(e)), t("    acyclic", () => ze(e, s)), t("    nestingGraph.run", () => ft(e)), t("    rank", () => it(ye(e))), t("    injectEdgeLabelProxies", () => En(e)), t("    removeEmptyRanks", () => xe(e)), t("    nestingGraph.cleanup", () => gt(e)), t("    normalizeRanks", () => be(e)), t("    assignRankMinMax", () => Dn(e)), t("    removeEdgeLabelProxies", () => On(e)), t("    normalize.run", () => Ue(e)), t("    parentDummyChains", () => ct(e)), t("    addBorderSegments", () => _t(e)), t("    order", () => Ht(e, n, c)), t("    insertSelfEdges", () => Fn(e)), t("    adjustCoordinateSystem", () => bt(e)), t("    position", () => cn(e, n.corePath)), t("    positionSelfEdges", () => In(e));
+	let l = JSON.parse(JSON.stringify(e._nodes));
+	return t("    removeBorderNodes", () => Nn(e)), t("    normalize.undo", () => Ge(e)), t("    fixupEdgeLabelCoords", () => jn(e)), t("    undoCoordinateSystem", () => xt(e)), t("    translateGraph", () => kn(e)), t("    assignNodeIntersects", () => An(e)), t("    reversePoints", () => Mn(e)), t("    acyclic.undo", () => Ve(e)), {
+		graph: e,
+		rawNodes: l
+	};
 }
-function _n(e, t) {
+function hn(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.order = i.order, r.rank = i.rank, t.children(n).length && (r.width = i.width, r.height = i.height));
@@ -1848,89 +1887,89 @@ function _n(e, t) {
 		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 vn = [
+var gn = [
 	"nodesep",
 	"edgesep",
 	"ranksep",
 	"marginx",
 	"marginy"
-], yn = {
+], _n = {
 	ranksep: 50,
 	edgesep: 20,
 	nodesep: 50,
 	rankdir: "TB",
 	rankalign: "center"
-}, bn = [
+}, vn = [
 	"acyclicer",
 	"ranker",
 	"rankdir",
 	"align",
 	"rankalign"
-], xn = [
+], yn = [
 	"width",
 	"height",
 	"rank"
-], Sn = {
+], bn = {
 	width: 0,
 	height: 0
-}, Cn = [
+}, xn = [
 	"minlen",
 	"weight",
 	"width",
 	"height",
 	"labeloffset"
-], wn = {
+], Sn = {
 	minlen: 1,
 	weight: 1,
 	width: 0,
 	height: 0,
 	labeloffset: 10,
 	labelpos: "r"
-}, Tn = ["labelpos"];
-function En(e) {
-	let t = new c({
+}, Cn = ["labelpos"];
+function wn(e) {
+	let t = new E({
 		multigraph: !0,
 		compound: !0
 	}), n = $(e.graph());
-	return t.setGraph(Object.assign({}, yn, Q(n, vn), M(n, bn))), e.nodes().forEach((n) => {
-		let r = Q($(e.node(n)), xn);
-		Object.keys(Sn).forEach((e) => {
-			r[e] === void 0 && (r[e] = Sn[e]);
+	return t.setGraph(Object.assign({}, _n, Q(n, gn), P(n, vn))), e.nodes().forEach((n) => {
+		let r = Q($(e.node(n)), yn);
+		Object.keys(bn).forEach((e) => {
+			r[e] === void 0 && (r[e] = bn[e]);
 		}), t.setNode(n, r);
 		let i = e.parent(n);
 		i !== void 0 && t.setParent(n, i);
 	}), e.edges().forEach((n) => {
 		let r = $(e.edge(n));
-		t.setEdge(n, Object.assign({}, wn, Q(r, Cn), M(r, Tn)));
+		t.setEdge(n, Object.assign({}, Sn, Q(r, xn), P(r, Cn)));
 	}), t;
 }
-function Dn(e) {
+function Tn(e) {
 	let t = e.graph();
 	t.ranksep /= 2, e.edges().forEach((n) => {
 		let r = e.edge(n);
 		r.minlen *= 2, (r.labelpos ?? "r").toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
 	});
 }
-function On(e) {
+function En(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		if (n.width && n.height) {
 			let n = e.node(t.v);
-			T(e, "edge-proxy", {
+			D(e, "edge-proxy", {
 				rank: (e.node(t.w).rank - n.rank) / 2 + n.rank,
 				e: t
 			}, "_ep");
 		}
 	});
 }
-function kn(e) {
+function Dn(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 An(e) {
+function On(e) {
 	e.nodes().forEach((t) => {
 		let n = e.node(t);
 		if (n.dummy === "edge-proxy") {
@@ -1939,7 +1978,7 @@ function An(e) {
 		}
 	});
 }
-function jn(e) {
+function kn(e) {
 	let t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
 	function c(e) {
 		let a = e.x, o = e.y, s = e.width, c = e.height;
@@ -1958,14 +1997,14 @@ function jn(e) {
 		}), 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 Mn(e) {
+function An(e) {
 	e.edges().forEach((t) => {
 		if (t.v === t.w) return;
 		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(D(r, a)), n.points.push(D(i, o));
+		n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(O(r, a)), n.points.push(O(i, o));
 	});
 }
-function Nn(e) {
+function jn(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) {
@@ -1978,13 +2017,13 @@ function Nn(e) {
 		}
 	});
 }
-function Pn(e) {
+function Mn(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		n.reversed && n.points.reverse();
 	});
 }
-function Fn(e) {
+function Nn(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]);
@@ -1994,7 +2033,7 @@ function Fn(e) {
 		e.node(t).dummy === "border" && e.removeNode(t);
 	});
 }
-function In(e) {
+function Pn(e) {
 	e.edges().forEach((t) => {
 		if (t.v === t.w) {
 			let n = e.node(t.v);
@@ -2005,13 +2044,13 @@ function In(e) {
 		}
 	});
 }
-function Ln(e) {
-	O(e).forEach((t) => {
+function Fn(e) {
+	k(e).forEach((t) => {
 		let n = 0;
 		t.forEach((t, r) => {
 			let i = e.node(t);
 			typeof i.rank != "number" && (i.rank = 0), i.order = r + n, (i.selfEdges || []).forEach((t) => {
-				T(e, "selfedge", {
+				D(e, "selfedge", {
 					width: t.label.width,
 					height: t.label.height,
 					rank: i.rank,
@@ -2052,7 +2091,7 @@ function Ln(e) {
 		});
 	});
 }
-function Rn(e) {
+function In(e) {
 	e.nodes().forEach((t) => {
 		let n = e.node(t), r = (e) => typeof e == "number" && isFinite(e);
 		if (n.dummy === "selfedge") {
@@ -2125,7 +2164,7 @@ function Rn(e) {
 	});
 }
 function Q(e, t) {
-	return N(M(e, t), Number);
+	return F(P(e, t), Number);
 }
 function $(e) {
 	let t = {};
@@ -2135,7 +2174,7 @@ function $(e) {
 }
 //#endregion
 //#region src/erdDiagram.ts
-var zn = 160, Bn = 50, Vn = 8, Hn = 24, Un = 6, Wn = {
+var Ln = 160, Rn = 50, zn = 8, Bn = 24, Vn = 6, Hn = {
 	external: {
 		fill: "#f0f0f0",
 		stroke: "#b0b0b0"
@@ -2149,9 +2188,9 @@ var zn = 160, Bn = 50, Vn = 8, Hn = 24, Un = 6, Wn = {
 		stroke: "#c3d9f2",
 		strokeDasharray: "4 3"
 	}
-}, Gn = "#c0c0c0", Kn = "dpuse-tool-d3-erd-arrow";
-function qn(t, n, r = {}) {
-	let i = r.nodeWidth ?? zn, o = r.nodeHeight ?? Bn, s = r.padding ?? Vn, c = r.selfEdgeSize ?? Hn, l = r.cornerRadius ?? Un, u = r.nodeColors ?? Wn, d = r.edgeColor ?? Gn, f = r.orderConstraints ?? [];
+}, Un = "#c0c0c0", Wn = "dpuse-tool-d3-erd-arrow";
+function Gn(t, n, r = {}) {
+	let i = r.nodeWidth ?? Ln, o = r.nodeHeight ?? Rn, s = r.padding ?? zn, c = r.selfEdgeSize ?? Bn, l = r.cornerRadius ?? Vn, u = r.nodeColors ?? Hn, d = r.edgeColor ?? Un, f = r.orderConstraints ?? [];
 	function p() {
 		e(n).selectAll("svg").remove();
 		let r = new a.Graph();
@@ -2167,9 +2206,9 @@ function qn(t, n, r = {}) {
 			typeId: e.typeId
 		});
 		for (let e of t.edges) e.source !== e.target && r.setEdge(e.source, e.target);
-		pn(r, { constraints: f });
+		dn(r, { constraints: f });
 		let { width: p = 0, height: m = 0 } = r.graph(), h = p + s * 2, g = m + s * 2, _ = e(n).append("svg").attr("viewBox", `0 0 ${String(h)} ${String(g)}`).attr("width", h).attr("height", g), v = _.append("g").attr("transform", `translate(${String(s)}, ${String(s)})`);
-		_.append("defs").append("marker").attr("id", Kn).attr("viewBox", "0 0 10 10").attr("refX", 9).attr("refY", 5).attr("markerWidth", 6).attr("markerHeight", 6).attr("orient", "auto-start-reverse").append("path").attr("d", "M 0 0 L 10 5 L 0 10 z").attr("fill", d), v.append("g").attr("fill", "none").attr("stroke", d).attr("stroke-width", 1.25).selectAll("path").data(t.edges).join("path").attr("marker-end", `url(#${Kn})`).attr("d", (e) => e.source === e.target ? Yn(r.node(e.source), c) : Jn(r.node(e.source), r.node(e.target), l));
+		_.append("defs").append("marker").attr("id", Wn).attr("viewBox", "0 0 10 10").attr("refX", 9).attr("refY", 5).attr("markerWidth", 6).attr("markerHeight", 6).attr("orient", "auto-start-reverse").append("path").attr("d", "M 0 0 L 10 5 L 0 10 z").attr("fill", d), v.append("g").attr("fill", "none").attr("stroke", d).attr("stroke-width", 1.25).selectAll("path").data(t.edges).join("path").attr("marker-end", `url(#${Wn})`).attr("d", (e) => e.source === e.target ? qn(r.node(e.source), c) : Kn(r.node(e.source), r.node(e.target), l));
 		let y = v.append("g").selectAll("g").data(r.nodes()).join("g").attr("transform", (e) => {
 			let t = r.node(e);
 			return `translate(${String((t.x ?? 0) - t.width / 2)}, ${String((t.y ?? 0) - t.height / 2)})`;
@@ -2189,7 +2228,7 @@ function qn(t, n, r = {}) {
 		}
 	};
 }
-function Jn(e, t, n) {
+function Kn(e, t, n) {
 	let r = e.x ?? 0, i = (e.y ?? 0) + e.height / 2, a = t.x ?? 0, o = (t.y ?? 0) - t.height / 2;
 	if (r === a) return `M ${String(r)} ${String(i)} L ${String(a)} ${String(o)}`;
 	let s = (i + o) / 2, c = Math.sign(a - r), l = Math.max(0, Math.min(n, s - i, o - s, Math.abs(a - r) / 2));
@@ -2202,11 +2241,11 @@ function Jn(e, t, n) {
 		`L ${String(a)} ${String(o)}`
 	].join(" ");
 }
-function Yn(e, t) {
+function qn(e, t) {
 	let n = (e.x ?? 0) + e.width / 2, r = n + t, i = (e.y ?? 0) - e.height / 4, a = (e.y ?? 0) + e.height / 4;
 	return `M ${String(n)} ${String(i)} C ${String(r)} ${String(i)}, ${String(r)} ${String(a)}, ${String(n)} ${String(a)}`;
 }
 //#endregion
-export { qn as renderErdDiagram };
+export { Gn as renderErdDiagram };
 
-//# sourceMappingURL=erdDiagram-Ds-nrw7Q.js.map
+//# sourceMappingURL=erdDiagram-Ds1hsQDD.js.map