@dpuse/dpuse-tool-d3-visualiser 0.0.21 → 0.0.22

package/dist/{erdDiagram-CWFK8bsD.js → erdDiagram-C-wRJWHp.js}

@@ -1,21 +1,21 @@
 import { t as e } from "./select-BIuoFcZG.js";
-import { a as t, c as n, i as r, n as i, r as a, s as o } from "./bump-znhpCF6A.js";
-import { t as s } from "./linear-J4iYa1Bf.js";
+import { a as t, n, o as r, r as i, t as a } from "./point-BwTGxj8U.js";
+import { t as o } from "./linear-J4iYa1Bf.js";
 //#region node_modules/d3-shape/src/line.js
-function c(e, i) {
-	var c = n(!0), l = null, u = s, d = null, f = o(p);
-	e = typeof e == "function" ? e : e === void 0 ? a : n(e), i = typeof i == "function" ? i : i === void 0 ? r : n(i);
-	function p(n) {
-		var r, a = (n = t(n)).length, o, s = !1, p;
-		for (l ?? (d = u(p = f())), r = 0; r <= a; ++r) !(r < a && c(o = n[r], r, n)) === s && ((s = !s) ? d.lineStart() : d.lineEnd()), s && d.point(+e(o, r, n), +i(o, r, n));
+function s(e, s) {
+	var c = r(!0), l = null, u = o, d = null, f = t(p);
+	e = typeof e == "function" ? e : e === void 0 ? a : r(e), s = typeof s == "function" ? s : s === void 0 ? n : r(s);
+	function p(t) {
+		var n, r = (t = i(t)).length, a, o = !1, p;
+		for (l ?? (d = u(p = f())), n = 0; n <= r; ++n) !(n < r && c(a = t[n], n, t)) === o && ((o = !o) ? d.lineStart() : d.lineEnd()), o && d.point(+e(a, n, t), +s(a, n, t));
 		if (p) return d = null, p + "" || null;
 	}
 	return p.x = function(t) {
-		return arguments.length ? (e = typeof t == "function" ? t : n(+t), p) : e;
+		return arguments.length ? (e = typeof t == "function" ? t : r(+t), p) : e;
 	}, p.y = function(e) {
-		return arguments.length ? (i = typeof e == "function" ? e : n(+e), p) : i;
+		return arguments.length ? (s = typeof e == "function" ? e : r(+e), p) : s;
 	}, p.defined = function(e) {
-		return arguments.length ? (c = typeof e == "function" ? e : n(!!e), p) : c;
+		return arguments.length ? (c = typeof e == "function" ? e : r(!!e), p) : c;
 	}, p.curve = function(e) {
 		return arguments.length ? (u = e, l != null && (d = u(l)), p) : u;
 	}, p.context = function(e) {
@@ -24,29 +24,29 @@ function c(e, i) {
 }
 //#endregion
 //#region node_modules/@dagrejs/dagre/dist/dagre.esm.js
-var l = Object.defineProperty, u = (e, t, n) => t in e ? l(e, t, {
+var c = Object.defineProperty, l = (e, t, n) => t in e ? c(e, t, {
 	enumerable: !0,
 	configurable: !0,
 	writable: !0,
 	value: n
-}) : e[t] = n, d = (e, t) => {
-	for (var n in t) l(e, n, {
+}) : e[t] = n, u = (e, t) => {
+	for (var n in t) c(e, n, {
 		get: t[n],
 		enumerable: !0
 	});
-}, f = (e, t, n) => u(e, typeof t == "symbol" ? t : t + "", n), p = {};
-d(p, {
-	Graph: () => g,
+}, d = (e, t, n) => l(e, typeof t == "symbol" ? t : t + "", n), f = {};
+u(f, {
+	Graph: () => h,
 	alg: () => S,
-	json: () => te,
-	version: () => ee
+	json: () => ee,
+	version: () => x
 });
-var m = Object.defineProperty, h = (e, t) => {
-	for (var n in t) m(e, n, {
+var p = Object.defineProperty, m = (e, t) => {
+	for (var n in t) p(e, n, {
 		get: t[n],
 		enumerable: !0
 	});
-}, g = class {
+}, h = class {
 	constructor(e) {
 		this._isDirected = !0, this._isMultigraph = !1, this._isCompound = !1, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {}, this._defaultEdgeLabelFn = () => {}, e && (this._isDirected = "directed" in e ? e.directed : !0, this._isMultigraph = "multigraph" in e && e.multigraph, this._isCompound = "compound" in e && e.compound), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
 	}
@@ -181,15 +181,15 @@ var m = Object.defineProperty, h = (e, t) => {
 	setEdge(e, t, n, r) {
 		let i, a, o, s, c = !1;
 		typeof e == "object" && e && "v" in e ? (i = e.v, a = e.w, o = e.name, arguments.length === 2 && (s = t, c = !0)) : (i = e, a = t, o = r, arguments.length > 2 && (s = n, c = !0)), i = "" + i, a = "" + a, o !== void 0 && (o = "" + o);
-		let l = y(this._isDirected, i, a, o);
+		let l = v(this._isDirected, i, a, o);
 		if (l in this._edgeLabels) return c && (this._edgeLabels[l] = s), this;
 		if (o !== void 0 && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
 		this.setNode(i), this.setNode(a), this._edgeLabels[l] = c ? s : this._defaultEdgeLabelFn(i, a, o);
-		let u = b(this._isDirected, i, a, o);
-		return i = u.v, a = u.w, Object.freeze(u), this._edgeObjs[l] = u, _(this._preds[a], i), _(this._sucs[i], a), this._in[a][l] = u, this._out[i][l] = u, this._edgeCount++, this;
+		let u = y(this._isDirected, i, a, o);
+		return i = u.v, a = u.w, Object.freeze(u), this._edgeObjs[l] = u, g(this._preds[a], i), g(this._sucs[i], a), this._in[a][l] = u, this._out[i][l] = u, this._edgeCount++, this;
 	}
 	edge(e, t, n) {
-		let r = arguments.length === 1 ? x(this._isDirected, e) : y(this._isDirected, e, t, n);
+		let r = arguments.length === 1 ? b(this._isDirected, e) : v(this._isDirected, e, t, n);
 		return this._edgeLabels[r];
 	}
 	edgeAsObj(e, t, n) {
@@ -197,13 +197,13 @@ var m = Object.defineProperty, h = (e, t) => {
 		return typeof r == "object" ? r : { label: r };
 	}
 	hasEdge(e, t, n) {
-		return (arguments.length === 1 ? x(this._isDirected, e) : y(this._isDirected, e, t, n)) in this._edgeLabels;
+		return (arguments.length === 1 ? b(this._isDirected, e) : v(this._isDirected, e, t, n)) in this._edgeLabels;
 	}
 	removeEdge(e, t, n) {
-		let r = arguments.length === 1 ? x(this._isDirected, e) : y(this._isDirected, e, t, n), i = this._edgeObjs[r];
+		let r = arguments.length === 1 ? b(this._isDirected, e) : v(this._isDirected, e, t, n), i = this._edgeObjs[r];
 		if (i) {
 			let e = i.v, t = i.w;
-			delete this._edgeLabels[r], delete this._edgeObjs[r], v(this._preds[t], e), v(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--;
+			delete this._edgeLabels[r], delete this._edgeObjs[r], _(this._preds[t], e), _(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--;
 		}
 		return this;
 	}
@@ -228,13 +228,13 @@ var m = Object.defineProperty, h = (e, t) => {
 		return n ? r.filter((e) => e.v === t && e.w === n || e.v === n && e.w === t) : r;
 	}
 };
-function _(e, t) {
+function g(e, t) {
 	e[t] ? e[t]++ : e[t] = 1;
 }
-function v(e, t) {
+function _(e, t) {
 	e[t] !== void 0 && !--e[t] && delete e[t];
 }
-function y(e, t, n, r) {
+function v(e, t, n, r) {
 	let i = "" + t, a = "" + n;
 	if (!e && i > a) {
 		let e = i;
@@ -242,7 +242,7 @@ function y(e, t, n, r) {
 	}
 	return i + "
" + a + "
" + (r === void 0 ? "\0" : r);
 }
-function b(e, t, n, r) {
+function y(e, t, n, r) {
 	let i = "" + t, a = "" + n;
 	if (!e && i > a) {
 		let e = i;
@@ -254,33 +254,33 @@ function b(e, t, n, r) {
 	};
 	return r && (o.name = r), o;
 }
-function x(e, t) {
-	return y(e, t.v, t.w, t.name);
+function b(e, t) {
+	return v(e, t.v, t.w, t.name);
 }
-var ee = "4.0.1", te = {};
-h(te, {
-	read: () => ae,
-	write: () => ne
+var x = "4.0.1", ee = {};
+m(ee, {
+	read: () => ie,
+	write: () => te
 });
-function ne(e) {
+function te(e) {
 	let t = {
 		options: {
 			directed: e.isDirected(),
 			multigraph: e.isMultigraph(),
 			compound: e.isCompound()
 		},
-		nodes: re(e),
-		edges: ie(e)
+		nodes: ne(e),
+		edges: re(e)
 	}, n = e.graph();
 	return n !== void 0 && (t.value = structuredClone(n)), t;
 }
-function re(e) {
+function ne(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 ie(e) {
+function re(e) {
 	return e.edges().map((t) => {
 		let n = e.edge(t), r = {
 			v: t.v,
@@ -289,8 +289,8 @@ function ie(e) {
 		return t.name !== void 0 && (r.name = t.name), n !== void 0 && (r.value = n), r;
 	});
 }
-function ae(e) {
-	let t = new g(e.options);
+function ie(e) {
+	let t = new h(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);
 	}), e.edges.forEach((e) => {
@@ -302,29 +302,29 @@ function ae(e) {
 	}), t;
 }
 var S = {};
-h(S, {
+m(S, {
 	CycleException: () => T,
 	bellmanFord: () => C,
-	components: () => ce,
+	components: () => se,
 	dijkstra: () => w,
-	dijkstraAll: () => fe,
-	findCycles: () => me,
-	floydWarshall: () => ge,
-	isAcyclic: () => ye,
-	postorder: () => Ce,
-	preorder: () => we,
-	prim: () => Te,
-	shortestPaths: () => Ee,
-	tarjan: () => pe,
-	topsort: () => ve
+	dijkstraAll: () => de,
+	findCycles: () => pe,
+	floydWarshall: () => he,
+	isAcyclic: () => ve,
+	postorder: () => Se,
+	preorder: () => Ce,
+	prim: () => we,
+	shortestPaths: () => Te,
+	tarjan: () => fe,
+	topsort: () => _e
 });
-var oe = () => 1;
+var ae = () => 1;
 function C(e, t, n, r) {
-	return se(e, String(t), n || oe, r || function(t) {
+	return oe(e, String(t), n || ae, r || function(t) {
 		return e.outEdges(t);
 	});
 }
-function se(e, t, n, r) {
+function oe(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] = {
@@ -353,7 +353,7 @@ function se(e, t, n, r) {
 	if (o === u - 1 && (a = !1, l(), a)) throw Error("The graph contains a negative weight cycle");
 	return i;
 }
-function ce(e) {
+function se(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));
@@ -362,7 +362,7 @@ function ce(e) {
 		r = [], i(e), r.length && n.push(r);
 	}), n;
 }
-var le = class {
+var ce = class {
 	constructor() {
 		this._arr = [], this._keyIndices = {};
 	}
@@ -418,14 +418,14 @@ var le = 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;
 	}
-}, ue = () => 1;
+}, le = () => 1;
 function w(e, t, n, r) {
-	return de(e, String(t), n || ue, r || function(t) {
+	return ue(e, String(t), n || le, r || function(t) {
 		return e.outEdges(t);
 	});
 }
-function de(e, t, n, r) {
-	let i = {}, a = new le(), o, s, c = function(e) {
+function ue(e, t, n, r) {
+	let i = {}, a = new ce(), o, s, c = function(e) {
 		let t = e.v === o ? e.w : e.v, r = i[t], 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));
@@ -439,12 +439,12 @@ function de(e, t, n, r) {
 	}); a.size() > 0 && (o = a.removeMin(), s = i[o], s.distance !== Infinity);) r(o).forEach(c);
 	return i;
 }
-function fe(e, t, n) {
+function de(e, t, n) {
 	return e.nodes().reduce(function(r, i) {
 		return r[i] = w(e, i, t, n), r;
 	}, {});
 }
-function pe(e) {
+function fe(e) {
 	let t = 0, n = [], r = {}, i = [];
 	function a(o) {
 		let s = r[o] = {
@@ -466,18 +466,18 @@ function pe(e) {
 		e in r || a(e);
 	}), i;
 }
-function me(e) {
-	return pe(e).filter(function(t) {
+function pe(e) {
+	return fe(e).filter(function(t) {
 		return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
 	});
 }
-var he = () => 1;
-function ge(e, t, n) {
-	return _e(e, t || he, n || function(t) {
+var me = () => 1;
+function he(e, t, n) {
+	return ge(e, t || me, n || function(t) {
 		return e.outEdges(t);
 	});
 }
-function _e(e, t, n) {
+function ge(e, t, n) {
 	let r = {}, i = e.nodes();
 	return i.forEach(function(e) {
 		r[e] = {}, r[e][e] = {
@@ -511,7 +511,7 @@ var T = class extends Error {
 		super(...e);
 	}
 };
-function ve(e) {
+function _e(e) {
 	let t = {}, n = {}, r = [];
 	function i(a) {
 		if (a in n) throw new T();
@@ -520,41 +520,41 @@ function ve(e) {
 	if (e.sinks().forEach(i), Object.keys(t).length !== e.nodeCount()) throw new T();
 	return r;
 }
-function ye(e) {
+function ve(e) {
 	try {
-		ve(e);
+		_e(e);
 	} catch (e) {
 		if (e instanceof T) return !1;
 		throw e;
 	}
 	return !0;
 }
-function be(e, t, n, r, i) {
+function ye(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 = xe(e, t, n === "post", o, a, r, i);
+		i = be(e, t, n === "post", o, a, r, i);
 	}), i;
 }
-function xe(e, t, n, r, i, a, o) {
+function be(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 = xe(e, t, n, r, i, a, o);
+		o = be(e, t, n, r, i, a, o);
 	}), n && (o = a(o, t))), o;
 }
-function Se(e, t, n) {
-	return be(e, t, n, function(e, t) {
+function xe(e, t, n) {
+	return ye(e, t, n, function(e, t) {
 		return e.push(t), e;
 	}, []);
 }
+function Se(e, t) {
+	return xe(e, t, "post");
+}
 function Ce(e, t) {
-	return Se(e, t, "post");
+	return xe(e, t, "pre");
 }
 function we(e, t) {
-	return Se(e, t, "pre");
-}
-function Te(e, t) {
-	let n = new g(), r = {}, i = new le(), a;
+	let n = new h(), r = {}, i = new ce(), a;
 	function o(e) {
 		let n = e.v === a ? e.w : e.v, o = i.priority(n);
 		if (o !== void 0) {
@@ -577,10 +577,10 @@ function Te(e, t) {
 	}
 	return n;
 }
-function Ee(e, t, n, r) {
-	return De(e, t, n, r ?? ((t) => e.outEdges(t) ?? []));
+function Te(e, t, n, r) {
+	return Ee(e, t, n, r ?? ((t) => e.outEdges(t) ?? []));
 }
-function De(e, t, n, r) {
+function Ee(e, t, n, r) {
 	if (n === void 0) return w(e, t, n, r);
 	let i = !1, a = e.nodes();
 	for (let o = 0; o < a.length; o++) {
@@ -601,8 +601,8 @@ function E(e, t, n, r) {
 	for (; e.hasNode(i);) i = P(r);
 	return n.dummy = t, e.setNode(i, n), i;
 }
-function Oe(e) {
-	let t = new g().setGraph(e.graph());
+function De(e) {
+	let t = new h().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,
@@ -615,7 +615,7 @@ function Oe(e) {
 	}), t;
 }
 function D(e) {
-	let t = new g({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+	let t = new h({ 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) => {
@@ -638,7 +638,7 @@ function k(e) {
 		i !== void 0 && (t[i] || (t[i] = []), t[i][r.order] = n);
 	}), t;
 }
-function ke(e) {
+function Oe(e) {
 	let t = e.nodes().map((t) => {
 		let n = e.node(t).rank;
 		return n === void 0 ? Number.MAX_VALUE : n;
@@ -648,7 +648,7 @@ function ke(e) {
 		Object.hasOwn(r, "rank") && (r.rank -= n);
 	});
 }
-function Ae(e) {
+function ke(e) {
 	let t = e.nodes().map((t) => e.node(t).rank).filter((e) => e !== void 0), n = M(Math.min, t), r = [];
 	e.nodes().forEach((t) => {
 		let i = e.node(t).rank - n;
@@ -666,7 +666,7 @@ function A(e, t, n, r) {
 	};
 	return arguments.length >= 4 && (i.rank = n, i.order = r), E(e, "border", i, t);
 }
-function je(e, t = j) {
+function Ae(e, t = j) {
 	let n = [];
 	for (let r = 0; r < e.length; r += t) {
 		let i = e.slice(r, r + t);
@@ -676,7 +676,7 @@ function je(e, t = j) {
 }
 var j = 65535;
 function M(e, t) {
-	return t.length > j ? e(...je(t).map((t) => e(...t))) : e(...t);
+	return t.length > j ? e(...Ae(t).map((t) => e(...t))) : e(...t);
 }
 function N(e) {
 	let t = e.nodes().map((t) => {
@@ -685,7 +685,7 @@ function N(e) {
 	});
 	return M(Math.max, t);
 }
-function Me(e, t) {
+function je(e, t) {
 	let n = {
 		lhs: [],
 		rhs: []
@@ -694,12 +694,12 @@ function Me(e, t) {
 		t(e) ? n.lhs.push(e) : n.rhs.push(e);
 	}), n;
 }
-function Ne(e, t) {
+function Me(e, t) {
 	return t();
 }
-var Pe = 0;
+var Ne = 0;
 function P(e) {
-	return e + ("" + ++Pe);
+	return e + ("" + ++Ne);
 }
 function F(e, t, n = 1) {
 	t ?? (t = e, e = 0);
@@ -718,7 +718,7 @@ function L(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 Fe(e, t) {
+function Pe(e, t) {
 	return e.reduce((e, n, r) => (e[n] = t[r], e), {});
 }
 var R = "\0";
@@ -731,39 +731,39 @@ function z(e, t, n) {
 	let s = a[1].order ?? NaN, c = o[1].order ?? NaN;
 	return isNaN(s - c) ? 0 : s - c;
 }
-var Ie = class {
+var Fe = class {
 	constructor() {
-		f(this, "_sentinel");
+		d(this, "_sentinel");
 		let e = {};
 		e._next = e._prev = e, this._sentinel = e;
 	}
 	dequeue() {
 		let e = this._sentinel, t = e._prev;
-		if (t !== e) return Le(t), t;
+		if (t !== e) return Ie(t), t;
 	}
 	enqueue(e) {
 		let t = this._sentinel;
-		e._prev && e._next && Le(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+		e._prev && e._next && Ie(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, Re)), n = n._prev;
+		for (; n !== t;) e.push(JSON.stringify(n, Le)), n = n._prev;
 		return "[" + e.join(", ") + "]";
 	}
 };
-function Le(e) {
+function Ie(e) {
 	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function Re(e, t) {
+function Le(e, t) {
 	if (e !== "_next" && e !== "_prev") return t;
 }
-var ze = Ie, Be = () => 1;
-function Ve(e, t) {
+var Re = Fe, ze = () => 1;
+function Be(e, t) {
 	if (e.nodeCount() <= 1) return [];
-	let n = Ue(e, t || Be);
-	return He(n.graph, n.buckets, n.zeroIdx).flatMap((t) => e.outEdges(t.v, t.w) || []);
+	let n = He(e, t || ze);
+	return Ve(n.graph, n.buckets, n.zeroIdx).flatMap((t) => e.outEdges(t.v, t.w) || []);
 }
-function He(e, t, n) {
+function Ve(e, t, n) {
 	let r = [], i = t[t.length - 1], a = t[0], o;
 	for (; e.nodeCount();) {
 		for (; o = a.dequeue();) B(e, t, n, o);
@@ -790,8 +790,8 @@ function B(e, t, n, r, i) {
 		o.in -= i, V(t, n, o);
 	}), e.removeNode(r.v), o;
 }
-function Ue(e, t) {
-	let n = new g(), r = 0, i = 0;
+function He(e, t) {
+	let n = new h(), r = 0, i = 0;
 	e.nodes().forEach((e) => {
 		n.setNode(e, {
 			v: e,
@@ -804,7 +804,7 @@ function Ue(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 = We(i + r + 3).map(() => new ze()), o = r + 1;
+	let a = Ue(i + r + 3).map(() => new Re()), o = r + 1;
 	return n.nodes().forEach((e) => {
 		V(a, o, n.node(e));
 	}), {
@@ -817,13 +817,13 @@ function V(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 We(e) {
+function Ue(e) {
 	let t = [];
 	for (let n = 0; n < e; n++) t.push(n);
 	return t;
 }
-function Ge(e, t) {
-	(e.graph().acyclicer === "greedy" ? Ve(e, n(e)) : Ke(e, t ?? null)).forEach((t) => {
+function We(e, t) {
+	(e.graph().acyclicer === "greedy" ? Be(e, n(e)) : Ge(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, P("rev"));
 	});
@@ -831,7 +831,7 @@ function Ge(e, t) {
 		return (t) => e.edge(t).weight;
 	}
 }
-function Ke(e, t) {
+function Ge(e, t) {
 	let n = [], r = {}, i = {};
 	function a(t) {
 		Object.hasOwn(i, t) || (i[t] = !0, r[t] = !0, e.outEdges(t).forEach((e) => {
@@ -841,13 +841,13 @@ function Ke(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 && Je(e, i.w, i) ? n.push(i) : o(i.w);
+			Object.hasOwn(r, i.w) || t.node(a)?.rank > t.node(i.w)?.rank && qe(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 qe(e) {
+function Ke(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		if (n.reversed) {
@@ -857,7 +857,7 @@ function qe(e) {
 		}
 	});
 }
-function Je(e, t, n) {
+function qe(e, t, n) {
 	let r = /* @__PURE__ */ new Set();
 	function i(t) {
 		if (e.sources().includes(t)) return !0;
@@ -867,10 +867,10 @@ function Je(e, t, n) {
 	}
 	return i(t);
 }
-function Ye(e) {
-	e.graph().dummyChains = [], e.edges().forEach((t) => Xe(e, t));
+function Je(e) {
+	e.graph().dummyChains = [], e.edges().forEach((t) => Ye(e, t));
 }
-function Xe(e, t) {
+function Ye(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);
@@ -884,7 +884,7 @@ function Xe(e, t) {
 	}, l = E(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 Ze(e) {
+function Xe(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({
@@ -907,17 +907,17 @@ function H(e) {
 function U(e, t) {
 	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var Qe = $e;
-function $e(e) {
-	let t = new g({ directed: !1 }), n = e.nodes();
+var Ze = Qe;
+function Qe(e) {
+	let t = new h({ 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 (; et(t, e) < i && (a = tt(t, e), a);) o = t.hasNode(a.v) ? U(e, a) : -U(e, a), nt(t, e, o);
+	for (; $e(t, e) < i && (a = et(t, e), a);) o = t.hasNode(a.v) ? U(e, a) : -U(e, a), tt(t, e, o);
 	return t;
 }
-function et(e, t) {
+function $e(e, t) {
 	function n(r) {
 		let i = t.nodeEdges(r);
 		i && i.forEach((i) => {
@@ -927,33 +927,33 @@ function et(e, t) {
 	}
 	return e.nodes().forEach(n), e.nodeCount();
 }
-function tt(e, t) {
+function et(e, t) {
 	return t.edges().reduce((n, r) => {
 		let i = Infinity;
 		return e.hasNode(r.v) !== e.hasNode(r.w) && (i = U(t, r)), i < n[0] ? [i, r] : n;
 	}, [Infinity, null])[1];
 }
-function nt(e, t, n) {
+function tt(e, t, n) {
 	e.nodes().forEach((e) => t.node(e).rank += n);
 }
-var { preorder: rt, postorder: it } = S, at = W;
-W.initLowLimValues = K, W.initCutValues = G, W.calcCutValue = st, W.leaveEdge = lt, W.enterEdge = ut, W.exchangeEdges = dt;
+var { preorder: nt, postorder: rt } = S, it = W;
+W.initLowLimValues = K, W.initCutValues = G, W.calcCutValue = ot, W.leaveEdge = ct, W.enterEdge = lt, W.exchangeEdges = ut;
 function W(e) {
-	e = Oe(e), H(e);
-	let t = Qe(e);
+	e = De(e), H(e);
+	let t = Ze(e);
 	K(t), G(t, e);
 	let n, r;
-	for (; n = lt(t);) r = ut(t, e, n), dt(t, e, n, r);
+	for (; n = ct(t);) r = lt(t, e, n), ut(t, e, n, r);
 }
 function G(e, t) {
-	let n = it(e, e.nodes());
-	n = n.slice(0, n.length - 1), n.forEach((n) => ot(e, t, n));
+	let n = rt(e, e.nodes());
+	n = n.slice(0, n.length - 1), n.forEach((n) => at(e, t, n));
 }
-function ot(e, t, n) {
+function at(e, t, n) {
 	let r = e.node(n).parent, i = e.edge(n, r);
-	i.cutvalue = st(e, t, n);
+	i.cutvalue = ot(e, t, n);
 }
-function st(e, t, n) {
+function ot(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);
@@ -961,7 +961,7 @@ function st(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, pt(e, n, c)) {
+			if (o += r ? l : -l, ft(e, n, c)) {
 				let t = e.edge(n, c).cutvalue;
 				o += r ? -t : t;
 			}
@@ -969,68 +969,68 @@ function st(e, t, n) {
 	}), o;
 }
 function K(e, t) {
-	arguments.length < 2 && (t = e.nodes()[0]), ct(e, {}, 1, t);
+	arguments.length < 2 && (t = e.nodes()[0]), st(e, {}, 1, t);
 }
-function ct(e, t, n, r, i) {
+function st(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 = ct(e, t, n, i, r));
+		Object.hasOwn(t, i) || (n = st(e, t, n, i, r));
 	}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
 }
-function lt(e) {
+function ct(e) {
 	return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function ut(e, t, n) {
+function lt(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 === mt(e, e.node(t.v), s) && c !== mt(e, e.node(t.w), s)).reduce((e, n) => U(t, n) < U(t, e) ? n : e);
+	return a.lim > o.lim && (s = o, c = !0), t.edges().filter((t) => c === pt(e, e.node(t.v), s) && c !== pt(e, e.node(t.w), s)).reduce((e, n) => U(t, n) < U(t, e) ? n : e);
 }
-function dt(e, t, n, r) {
+function ut(e, t, n, r) {
 	let i = n.v, a = n.w;
-	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), K(e), G(e, t), ft(e, t);
+	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), K(e), G(e, t), dt(e, t);
 }
-function ft(e, t) {
+function dt(e, t) {
 	let n = e.nodes().find((t) => !e.node(t).parent);
 	if (!n) return;
-	let r = rt(e, [n]);
+	let r = nt(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 pt(e, t, n) {
+function ft(e, t, n) {
 	return e.hasEdge(t, n);
 }
-function mt(e, t, n) {
+function pt(e, t, n) {
 	return n.low <= t.lim && t.lim <= n.lim;
 }
-var ht = gt;
-function gt(e) {
+var mt = ht;
+function ht(e) {
 	let t = e.graph().ranker;
 	if (typeof t == "function") return t(e);
 	switch (t) {
 		case "network-simplex":
-			q(e);
+			vt(e);
 			break;
 		case "tight-tree":
-			vt(e);
+			_t(e);
 			break;
 		case "longest-path":
-			_t(e);
+			gt(e);
 			break;
 		case "none": break;
-		default: q(e);
+		default: vt(e);
 	}
 }
-var _t = H;
-function vt(e) {
-	H(e), Qe(e);
+var gt = H;
+function _t(e) {
+	H(e), Ze(e);
 }
-function q(e) {
-	at(e);
+function vt(e) {
+	it(e);
 }
 var yt = bt;
 function bt(e) {
@@ -1075,14 +1075,14 @@ function St(e) {
 	return e.children(R).forEach(r), t;
 }
 function Ct(e) {
-	let t = E(e, "root", {}, "_root"), n = Tt(e), r = Object.values(n), i = M(Math.max, r) - 1, a = 2 * i + 1;
+	let t = E(e, "root", {}, "_root"), n = wt(e), r = Object.values(n), i = M(Math.max, r) - 1, a = 2 * i + 1;
 	e.graph().nestingRoot = t, e.edges().forEach((t) => e.edge(t).minlen *= a);
-	let o = Et(e) + 1;
+	let o = Tt(e) + 1;
 	e.children(R).forEach((r) => {
-		wt(e, t, a, o, i, n, r);
+		q(e, t, a, o, i, n, r);
 	}), e.graph().nodeRankFactor = a;
 }
-function wt(e, t, n, r, i, a, o) {
+function q(e, t, n, r, i, a, o) {
 	let s = e.children(o);
 	if (!s.length) {
 		o !== t && e.setEdge(t, o, {
@@ -1093,7 +1093,7 @@ function wt(e, t, n, r, i, a, o) {
 	}
 	let c = A(e, "_bt"), l = A(e, "_bb"), u = e.node(o);
 	e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, s.forEach((s) => {
-		wt(e, t, n, r, i, a, s);
+		q(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,
@@ -1109,7 +1109,7 @@ function wt(e, t, n, r, i, a, o) {
 		minlen: i + (a[o] ?? 0)
 	});
 }
-function Tt(e) {
+function wt(e) {
 	let t = {};
 	function n(r, i) {
 		let a = e.children(r);
@@ -1117,27 +1117,27 @@ function Tt(e) {
 	}
 	return e.children(R).forEach((e) => n(e, 1)), t;
 }
-function Et(e) {
+function Tt(e) {
 	return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
 }
-function Dt(e) {
+function Et(e) {
 	let t = e.graph();
 	e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((t) => {
 		e.edge(t).nestingEdge && e.removeEdge(t);
 	});
 }
-var Ot = kt;
-function kt(e) {
+var Dt = Ot;
+function Ot(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) At(e, "borderLeft", "_bl", n, i, t), At(e, "borderRight", "_br", n, i, t);
+			for (let t = i.minRank, r = i.maxRank + 1; t < r; ++t) kt(e, "borderLeft", "_bl", n, i, t), kt(e, "borderRight", "_br", n, i, t);
 		}
 	}
 	e.children(R).forEach(t);
 }
-function At(e, t, n, r, i, a) {
+function kt(e, t, n, r, i, a) {
 	let o = {
 		width: 0,
 		height: 0,
@@ -1146,22 +1146,22 @@ function At(e, t, n, r, i, a) {
 	}, s = i[t][a - 1], c = E(e, "border", o, n);
 	i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
 }
+function At(e) {
+	let t = e.graph().rankdir?.toLowerCase();
+	(t === "lr" || t === "rl") && Mt(e);
+}
 function jt(e) {
 	let t = e.graph().rankdir?.toLowerCase();
-	(t === "lr" || t === "rl") && Nt(e);
+	(t === "bt" || t === "rl") && Pt(e), (t === "lr" || t === "rl") && (Ft(e), Mt(e));
 }
 function Mt(e) {
-	let t = e.graph().rankdir?.toLowerCase();
-	(t === "bt" || t === "rl") && Ft(e), (t === "lr" || t === "rl") && (It(e), Nt(e));
+	e.nodes().forEach((t) => Nt(e.node(t))), e.edges().forEach((t) => Nt(e.edge(t)));
 }
 function Nt(e) {
-	e.nodes().forEach((t) => Pt(e.node(t))), e.edges().forEach((t) => Pt(e.edge(t)));
-}
-function Pt(e) {
 	let t = e.width;
 	e.width = e.height, e.height = t;
 }
-function Ft(e) {
+function Pt(e) {
 	e.nodes().forEach((t) => J(e.node(t))), e.edges().forEach((t) => {
 		var n;
 		let r = e.edge(t);
@@ -1171,7 +1171,7 @@ function Ft(e) {
 function J(e) {
 	e.y = -e.y;
 }
-function It(e) {
+function Ft(e) {
 	e.nodes().forEach((t) => Y(e.node(t))), e.edges().forEach((t) => {
 		var n;
 		let r = e.edge(t);
@@ -1182,7 +1182,7 @@ function Y(e) {
 	let t = e.x;
 	e.x = e.y, e.y = t;
 }
-function Lt(e, t = null) {
+function It(e, t = null) {
 	let n = {}, r = e.nodes().filter((t) => !e.children(t).length), i = r.map((t) => e.node(t).rank), a = F(M(Math.max, i) + 1).map(() => []);
 	function o(t) {
 		if (n[t]) return;
@@ -1198,13 +1198,13 @@ function Lt(e, t = null) {
 	}
 	return a;
 }
-function Rt(e, t) {
+function Lt(e, t) {
 	let n = 0;
-	for (let r = 1; r < t.length; ++r) n += zt(e, t[r - 1], t[r]);
+	for (let r = 1; r < t.length; ++r) n += Rt(e, t[r - 1], t[r]);
 	return n;
 }
-function zt(e, t, n) {
-	let r = Fe(n, n.map((e, t) => t)), i = t.flatMap((t) => {
+function Rt(e, t, n) {
+	let r = Pe(n, n.map((e, t) => t)), i = t.flatMap((t) => {
 		let n = e.outEdges(t);
 		return n ? n.map((t) => ({
 			pos: r[t.w],
@@ -1223,7 +1223,7 @@ function zt(e, t, n) {
 		c += e.weight * n;
 	}), c;
 }
-function Bt(e, t = []) {
+function zt(e, t = []) {
 	return t.map((t) => {
 		let n = e.inEdges(t);
 		if (!n || !n.length) return { v: t };
@@ -1246,7 +1246,7 @@ function Bt(e, t = []) {
 		}
 	});
 }
-function Vt(e, t) {
+function Bt(e, t) {
 	let n = {};
 	return e.forEach((e, t) => {
 		let r = {
@@ -1260,13 +1260,13 @@ function Vt(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));
-	}), Ht(Object.values(n).filter((e) => !e.indegree));
+	}), Vt(Object.values(n).filter((e) => !e.indegree));
 }
-function Ht(e) {
+function Vt(e) {
 	let t = [];
 	function n(e) {
 		return (t) => {
-			t.merged || (t.barycenter === void 0 || e.barycenter === void 0 || t.barycenter >= e.barycenter) && Ut(e, t);
+			t.merged || (t.barycenter === void 0 || e.barycenter === void 0 || t.barycenter >= e.barycenter) && Ht(e, t);
 		};
 	}
 	function r(t) {
@@ -1285,31 +1285,31 @@ function Ht(e) {
 		"weight"
 	]));
 }
-function Ut(e, t) {
+function Ht(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 Wt(e, t, n, r, i) {
+function Ut(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 = Me(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(Kt(s, o, !!c));
+	let l = je(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(Gt(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 = Gt(f, d, h), u.forEach((e) => {
-		h += e.vs.length, f.push(e.vs), p += e.barycenter * e.weight, m += e.weight, h = Gt(f, d, h);
+	h = Wt(f, d, h), u.forEach((e) => {
+		h += e.vs.length, f.push(e.vs), p += e.barycenter * e.weight, m += e.weight, h = Wt(f, d, h);
 	});
 	let g = { vs: f.flat(1) };
 	return m && (g.barycenter = p / m, g.weight = m), g;
 }
-function Gt(e, t, n) {
+function Wt(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 Kt(e, t, n) {
+function Gt(e, t, n) {
 	return (r, i) => {
 		if (r.barycenter < i.barycenter) return -1;
 		if (r.barycenter > i.barycenter) return 1;
@@ -1320,21 +1320,21 @@ function Kt(e, t, n) {
 		return n ? i.i - r.i : r.i - i.i;
 	};
 }
-function qt(e, t, n, r, i) {
+function Kt(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 = Bt(e, l);
+	let m = zt(e, l);
 	m.forEach((t) => {
 		if (e.children(t.v).length) {
-			let { result: r } = qt(e, t.v, n, s, c);
-			p[t.v] = r, Object.hasOwn(r, "barycenter") && Yt(t, r);
+			let { result: r } = Kt(e, t.v, n, s, c);
+			p[t.v] = r, Object.hasOwn(r, "barycenter") && Jt(t, r);
 		}
 	});
-	let h = Vt(m, n);
-	Jt(h, p);
+	let h = Bt(m, n);
+	qt(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);
@@ -1344,7 +1344,7 @@ function qt(e, t, n, r, i) {
 		} else g[r] = h[n], h.splice(n, 1), n--;
 		else _ = !0;
 	}
-	let v = Wt(h, g, s, e, c);
+	let v = Ut(h, g, s, e, c);
 	if (d && f) {
 		v.vs = [
 			d,
@@ -1369,17 +1369,17 @@ function qt(e, t, n, r, i) {
 		writable: !0
 	}), v;
 }
-function Jt(e, t) {
+function qt(e, t) {
 	e.forEach((e) => {
 		e.vs = e.vs.flatMap((e) => t[e] ? t[e].vs : e);
 	});
 }
-function Yt(e, t) {
+function Jt(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 Xt(e, t, n, r) {
+function Yt(e, t, n, r) {
 	r ||= e.nodes();
-	let i = Zt(e), a = new g({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel((t) => e.node(t));
+	let i = Xt(e), a = new h({ 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) {
@@ -1395,12 +1395,12 @@ function Xt(e, t, n, r) {
 		}
 	}), a;
 }
-function Zt(e) {
+function Xt(e) {
 	let t;
 	for (; e.hasNode(t = P("_root")););
 	return t;
 }
-function Qt(e, t, n) {
+function Zt(e, t, n) {
 	let r = {}, i;
 	n.forEach((n) => {
 		let a = e.parent(n), o, s;
@@ -1413,22 +1413,22 @@ function Qt(e, t, n) {
 		}
 	});
 }
-function $t(e, t = {}, n = null) {
+function Qt(e, t = {}, n = null) {
 	if (typeof t.customOrder == "function") {
-		t.customOrder(e, $t);
+		t.customOrder(e, Qt);
 		return;
 	}
-	let r = N(e), i = en(e, F(1, r + 1), "inEdges"), a = en(e, F(r - 1, -1, -1), "outEdges"), o = Lt(e, n);
-	if (nn(e, o), t.disableOptimalOrderHeuristic) return;
+	let r = N(e), i = $t(e, F(1, r + 1), "inEdges"), a = $t(e, F(r - 1, -1, -1), "outEdges"), o = It(e, n);
+	if (tn(e, o), t.disableOptimalOrderHeuristic) return;
 	let s = Infinity, c, l = t.constraints || [];
 	for (let t = 0, r = 0; r < 4; ++t, ++r) {
-		tn(t % 2 ? i : a, t % 4 >= 2, l, n), o = k(e);
-		let u = Rt(e, o);
+		en(t % 2 ? i : a, t % 4 >= 2, l, n), o = k(e);
+		let u = Lt(e, o);
 		u < s ? (r = 0, c = Object.assign({}, o), s = u) : u === s && (c = structuredClone(o));
 	}
-	nn(e, c);
+	tn(e, c);
 }
-function en(e, t, n) {
+function $t(e, t, n) {
 	let r = /* @__PURE__ */ new Map(), i = (e, t) => {
 		r.has(e) || r.set(e, []), r.get(e).push(t);
 	};
@@ -1437,38 +1437,38 @@ function en(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 Xt(e, t, n, r.get(t) || []);
+		return Yt(e, t, n, r.get(t) || []);
 	});
 }
-function tn(e, t, n, r) {
-	let i = !0, a = new g();
+function en(e, t, n, r) {
+	let i = !0, a = new h();
 	e.forEach(function(e) {
 		n.forEach((e) => a.setEdge(e.left, e.right));
-		let o = e.graph().root, { result: s, usedBias: c } = qt(e, o, a, r, i);
-		t && c && (i = !i), s.vs.forEach((t, n) => e.node(t).order = n), Qt(e, a, s.vs);
+		let o = e.graph().root, { result: s, usedBias: c } = Kt(e, o, a, r, i);
+		t && c && (i = !i), s.vs.forEach((t, n) => e.node(t).order = n), Zt(e, a, s.vs);
 	});
 }
-function nn(e, t) {
+function tn(e, t) {
 	Object.values(t).forEach((t) => t.forEach((t, n) => e.node(t).order = n));
 }
-function rn(e, t) {
+function nn(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 = on(e, t), u = l ? e.node(l).order : o;
+			let l = an(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) && sn(n, r, t);
+					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && on(n, r, t);
 				});
 			}), a = c + 1, i = u);
 		}), r;
 	}
 	return t.length && t.reduce(r), n;
 }
-function an(e, t) {
+function rn(e, t) {
 	let n = {};
 	function r(t, r, i, a, o) {
 		F(r, i).forEach((r) => {
@@ -1478,7 +1478,7 @@ function an(e, t) {
 				t && t.forEach((t) => {
 					if (t === void 0) return;
 					let r = e.node(t);
-					r.dummy && (r.order < a || r.order > o) && sn(n, t, i);
+					r.dummy && (r.order < a || r.order > o) && on(n, t, i);
 				});
 			}
 		});
@@ -1499,13 +1499,13 @@ function an(e, t) {
 	}
 	return t.length && t.reduce(i), n;
 }
-function on(e, t) {
+function an(e, t) {
 	if (e.node(t).dummy) {
 		let n = e.predecessors(t);
 		if (n) return n.find((t) => e.node(t).dummy);
 	}
 }
-function sn(e, t, n) {
+function on(e, t, n) {
 	if (t > n) {
 		let e = t;
 		t = n, n = e;
@@ -1513,7 +1513,7 @@ function sn(e, t, n) {
 	let r = e[t];
 	r || (e[t] = r = {}), r[n] = !0;
 }
-function cn(e, t, n) {
+function sn(e, t, n) {
 	if (t > n) {
 		let e = t;
 		t = n, n = e;
@@ -1521,14 +1521,14 @@ function cn(e, t, n) {
 	let r = e[t];
 	return r !== void 0 && Object.hasOwn(r, n);
 }
-function ln(e, t, n, r, i) {
+function cn(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) || vn(t, e, i));
+		let c = -1, l = -1, u = !1, d = t, f = t.findIndex((t) => i?.includes(t) || _n(t, e, i));
 		f > 0 && (d = [
 			t[f],
 			...t.slice(0, f),
@@ -1536,7 +1536,7 @@ function ln(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) => vn(t, e, i)));
+				i != null && i.includes(t) && (d = d.filter((t) => _n(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);
@@ -1545,7 +1545,7 @@ function ln(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 && !cn(n, t, i)) {
+					if (d !== void 0 && o[t] === t && c < d && s[i] !== l && !sn(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));
 					}
@@ -1557,8 +1557,8 @@ function ln(e, t, n, r, i) {
 		align: o
 	};
 }
-function un(e, t, n, r, i = !1) {
-	let a = {}, o = dn(e, t, n, i), s = i ? "borderLeft" : "borderRight";
+function ln(e, t, n, r, i = !1) {
+	let a = {}, o = un(e, t, n, i), s = i ? "borderLeft" : "borderRight";
 	function c(e, t) {
 		let n = o.nodes().slice(), r = {}, i = n.pop();
 		for (; i;) {
@@ -1597,8 +1597,8 @@ function un(e, t, n, r, i = !1) {
 		t !== void 0 && (a[e] = a[t] ?? 0);
 	}), a;
 }
-function dn(e, t, n, r) {
-	let i = new g(), a = e.graph(), o = gn(a.nodesep, a.edgesep, r);
+function un(e, t, n, r) {
+	let i = new h(), a = e.graph(), o = hn(a.nodesep, a.edgesep, r);
 	return t.forEach((t) => {
 		let r;
 		t.forEach((t) => {
@@ -1616,18 +1616,18 @@ function dn(e, t, n, r) {
 		});
 	}), i;
 }
-function fn(e, t) {
+function dn(e, t) {
 	return Object.values(t).reduce((t, n) => {
 		let r = -Infinity, i = Infinity;
 		Object.entries(n).forEach(([t, n]) => {
-			let a = _n(e, t) / 2;
+			let a = gn(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 pn(e, t) {
+function fn(e, t) {
 	let n = Object.values(t), r = M(Math.min, n), i = M(Math.max, n);
 	["u", "d"].forEach((n) => {
 		["l", "r"].forEach((a) => {
@@ -1638,7 +1638,7 @@ function pn(e, t) {
 		});
 	});
 }
-function mn(e, t = void 0) {
+function pn(e, t = void 0) {
 	let n = e.ul;
 	return n ? L(n, (n, r) => {
 		if (t) {
@@ -1652,17 +1652,17 @@ function mn(e, t = void 0) {
 		return ((i[1] ?? 0) + (i[2] ?? 0)) / 2;
 	}) : {};
 }
-function hn(e, t) {
-	let n = k(e), r = Object.assign(rn(e, n), an(e, n)), i = {}, a;
+function mn(e, t) {
+	let n = k(e), r = Object.assign(nn(e, n), rn(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 = ln(e, a, r, (t) => (o === "u" ? e.predecessors(t) : e.successors(t)) || [], t), c = un(e, a, s.root, s.align, n === "r");
+			let s = cn(e, a, r, (t) => (o === "u" ? e.predecessors(t) : e.successors(t)) || [], t), c = ln(e, a, s.root, s.align, n === "r");
 			n === "r" && (c = L(c, (e) => -e)), i[o + n] = c;
 		});
-	}), pn(i, fn(e, i)), mn(i, e.graph().align);
+	}), fn(i, dn(e, i)), pn(i, e.graph().align);
 }
-function gn(e, t, n) {
+function hn(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()) {
@@ -1684,20 +1684,20 @@ function gn(e, t, n) {
 		return l && (c += n ? l : -l), c;
 	};
 }
-function _n(e, t) {
+function gn(e, t) {
 	return e.node(t).width;
 }
-function vn(e, t, n) {
+function _n(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 yn(e, t) {
-	e = D(e), bn(e), Object.entries(hn(e, t)).forEach(([t, n]) => e.node(t).x = n);
+function vn(e, t) {
+	e = D(e), yn(e), Object.entries(mn(e, t)).forEach(([t, n]) => e.node(t).x = n);
 }
-function bn(e) {
+function yn(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) => {
@@ -1711,10 +1711,10 @@ function bn(e) {
 	});
 }
 var X = null, Z = null;
-function xn(e, t = {}) {
-	return Cn(e, Ne, t), e;
+function bn(e, t = {}) {
+	return Sn(e, Me, t), e;
 }
-function Sn(e, t, n) {
+function xn(e, t, n) {
 	let r = t;
 	for (; r !== void 0;) {
 		let t = e.parent(r);
@@ -1722,12 +1722,12 @@ function Sn(e, t, n) {
 		r = t;
 	}
 }
-function Cn(e, t, n) {
+function Sn(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 g({
+			let o = new h({
 				multigraph: !0,
 				compound: !0
 			});
@@ -1741,28 +1741,28 @@ function Cn(e, t, n) {
 			});
 			let c = /* @__PURE__ */ new Set();
 			e.edges().forEach((t) => {
-				let n = Sn(e, t.v, r), i = Sn(e, t.w, r);
+				let n = xn(e, t.v, r), i = xn(e, t.w, r);
 				if (n && i && n !== i) {
 					let r = `${n}\0${i}`;
 					c.has(r) || (c.add(r), o.setEdge(n, i, { ...e.edge(t) }));
 				}
-			}), Cn(o, t, n);
-			let l = Pn(o);
-			wn(l, t, n), Tn(o, l);
+			}), Sn(o, t, n);
+			let l = Nn(o);
+			Cn(l, t, n), wn(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" && (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;
+			let m = f - u, g = p - d;
 			i[r] = {
 				minX: u,
 				minY: d,
 				maxX: f,
 				maxY: p,
 				width: m,
-				height: h,
+				height: g,
 				offsetX: u,
 				offsetY: d
 			}, a._dagreClusterSubgraph = o;
@@ -1830,8 +1830,8 @@ function Cn(e, t, n) {
 			}));
 		}
 	});
-	let h = Pn(e);
-	wn(h, t, n), Tn(e, h), m.forEach((t) => {
+	let g = Nn(e);
+	Cn(g, t, n), wn(e, g), 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 }) => {
@@ -1860,10 +1860,10 @@ function Cn(e, t, n) {
 		}
 	});
 }
-function wn(e, t, n) {
-	n?.useDynamic === !1 && (X = null, Z = null), t("    makeSpaceForEdgeLabels", () => Fn(e)), t("    removeSelfEdges", () => Wn(e)), t("    acyclic", () => Ge(e, X)), t("    nestingGraph.run", () => Ct(e)), t("    rank", () => ht(D(e))), t("    injectEdgeLabelProxies", () => In(e)), t("    removeEmptyRanks", () => Ae(e)), t("    nestingGraph.cleanup", () => Dt(e)), t("    normalizeRanks", () => ke(e)), t("    assignRankMinMax", () => Ln(e)), t("    removeEdgeLabelProxies", () => Rn(e)), t("    normalize.run", () => Ye(e)), t("    parentDummyChains", () => yt(e)), t("    addBorderSegments", () => Ot(e)), t("    order", () => $t(e, n, Z)), t("    insertSelfEdges", () => Gn(e)), t("    adjustCoordinateSystem", () => jt(e)), t("    position", () => yn(e, n.corePath)), t("    positionSelfEdges", () => Kn(e)), Z = JSON.parse(JSON.stringify(e._nodes)), t("    removeBorderNodes", () => Un(e)), t("    normalize.undo", () => Ze(e)), t("    fixupEdgeLabelCoords", () => Vn(e)), t("    undoCoordinateSystem", () => Mt(e)), t("    translateGraph", () => zn(e)), t("    assignNodeIntersects", () => Bn(e)), t("    reversePoints", () => Hn(e)), t("    acyclic.undo", () => qe(e)), X = e;
+function Cn(e, t, n) {
+	n?.useDynamic === !1 && (X = null, Z = null), t("    makeSpaceForEdgeLabels", () => Pn(e)), t("    removeSelfEdges", () => Un(e)), t("    acyclic", () => We(e, X)), t("    nestingGraph.run", () => Ct(e)), t("    rank", () => mt(D(e))), t("    injectEdgeLabelProxies", () => Fn(e)), t("    removeEmptyRanks", () => ke(e)), t("    nestingGraph.cleanup", () => Et(e)), t("    normalizeRanks", () => Oe(e)), t("    assignRankMinMax", () => In(e)), t("    removeEdgeLabelProxies", () => Ln(e)), t("    normalize.run", () => Je(e)), t("    parentDummyChains", () => yt(e)), t("    addBorderSegments", () => Dt(e)), t("    order", () => Qt(e, n, Z)), t("    insertSelfEdges", () => Wn(e)), t("    adjustCoordinateSystem", () => At(e)), t("    position", () => vn(e, n.corePath)), t("    positionSelfEdges", () => Gn(e)), Z = JSON.parse(JSON.stringify(e._nodes)), t("    removeBorderNodes", () => Hn(e)), t("    normalize.undo", () => Xe(e)), t("    fixupEdgeLabelCoords", () => Bn(e)), t("    undoCoordinateSystem", () => jt(e)), t("    translateGraph", () => Rn(e)), t("    assignNodeIntersects", () => zn(e)), t("    reversePoints", () => Vn(e)), t("    acyclic.undo", () => Ke(e)), X = e;
 }
-function Tn(e, t) {
+function wn(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));
@@ -1872,70 +1872,70 @@ function Tn(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 En = [
+var Tn = [
 	"nodesep",
 	"edgesep",
 	"ranksep",
 	"marginx",
 	"marginy"
-], Dn = {
+], En = {
 	ranksep: 50,
 	edgesep: 20,
 	nodesep: 50,
 	rankdir: "TB",
 	rankalign: "center"
-}, On = [
+}, Dn = [
 	"acyclicer",
 	"ranker",
 	"rankdir",
 	"align",
 	"rankalign"
-], kn = [
+], On = [
 	"width",
 	"height",
 	"rank"
-], An = {
+], kn = {
 	width: 0,
 	height: 0
-}, jn = [
+}, An = [
 	"minlen",
 	"weight",
 	"width",
 	"height",
 	"labeloffset"
-], Mn = {
+], jn = {
 	minlen: 1,
 	weight: 1,
 	width: 0,
 	height: 0,
 	labeloffset: 10,
 	labelpos: "r"
-}, Nn = ["labelpos"];
-function Pn(e) {
-	let t = new g({
+}, Mn = ["labelpos"];
+function Nn(e) {
+	let t = new h({
 		multigraph: !0,
 		compound: !0
 	}), n = $(e.graph());
-	return t.setGraph(Object.assign({}, Dn, Q(n, En), I(n, On))), e.nodes().forEach((n) => {
-		let r = Q($(e.node(n)), kn);
-		Object.keys(An).forEach((e) => {
-			r[e] === void 0 && (r[e] = An[e]);
+	return t.setGraph(Object.assign({}, En, Q(n, Tn), I(n, Dn))), e.nodes().forEach((n) => {
+		let r = Q($(e.node(n)), On);
+		Object.keys(kn).forEach((e) => {
+			r[e] === void 0 && (r[e] = kn[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({}, Mn, Q(r, jn), I(r, Nn)));
+		t.setEdge(n, Object.assign({}, jn, Q(r, An), I(r, Mn)));
 	}), t;
 }
-function Fn(e) {
+function Pn(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 In(e) {
+function Fn(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		if (n.width && n.height) {
@@ -1947,14 +1947,14 @@ function In(e) {
 		}
 	});
 }
-function Ln(e) {
+function In(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 Rn(e) {
+function Ln(e) {
 	e.nodes().forEach((t) => {
 		let n = e.node(t);
 		if (n.dummy === "edge-proxy") {
@@ -1963,7 +1963,7 @@ function Rn(e) {
 		}
 	});
 }
-function zn(e) {
+function Rn(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;
@@ -1982,14 +1982,14 @@ function zn(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 Bn(e) {
+function zn(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(O(r, a)), n.points.push(O(i, o));
 	});
 }
-function Vn(e) {
+function Bn(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) {
@@ -2002,13 +2002,13 @@ function Vn(e) {
 		}
 	});
 }
-function Hn(e) {
+function Vn(e) {
 	e.edges().forEach((t) => {
 		let n = e.edge(t);
 		n.reversed && n.points.reverse();
 	});
 }
-function Un(e) {
+function Hn(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]);
@@ -2018,7 +2018,7 @@ function Un(e) {
 		e.node(t).dummy === "border" && e.removeNode(t);
 	});
 }
-function Wn(e) {
+function Un(e) {
 	e.edges().forEach((t) => {
 		if (t.v === t.w) {
 			let n = e.node(t.v);
@@ -2029,7 +2029,7 @@ function Wn(e) {
 		}
 	});
 }
-function Gn(e) {
+function Wn(e) {
 	k(e).forEach((t) => {
 		let n = 0;
 		t.forEach((t, r) => {
@@ -2076,7 +2076,7 @@ function Gn(e) {
 		});
 	});
 }
-function Kn(e) {
+function Gn(e) {
 	e.nodes().forEach((t) => {
 		let n = e.node(t), r = (e) => typeof e == "number" && isFinite(e);
 		if (n.dummy === "selfedge") {
@@ -2159,7 +2159,7 @@ function $(e) {
 }
 //#endregion
 //#region src/erdDiagram.ts
-var qn = 160, Jn = 50, Yn = 8, Xn = 24, Zn = {
+var Kn = 160, qn = 50, Jn = 8, Yn = 24, Xn = {
 	child: {
 		fill: "#dae8fc",
 		stroke: "#6c8ebf"
@@ -2168,20 +2168,20 @@ var qn = 160, Jn = 50, Yn = 8, Xn = 24, Zn = {
 		fill: "#d5e8d4",
 		stroke: "#82b366"
 	}
-}, Qn = "dpuse-tool-d3-erd-arrow";
-function $n(t, n, r = {}) {
-	let a = r.nodeWidth ?? qn, o = r.nodeHeight ?? Jn, s = r.padding ?? Yn, l = r.selfEdgeSize ?? Xn, u = r.nodeColors ?? Zn, d = r.orderConstraints ?? [];
-	function f() {
+}, Zn = "dpuse-tool-d3-erd-arrow";
+function Qn(t, n, r = {}) {
+	let i = r.nodeWidth ?? Kn, a = r.nodeHeight ?? qn, c = r.padding ?? Jn, l = r.selfEdgeSize ?? Yn, u = r.nodeColors ?? Xn, d = r.orderConstraints ?? [];
+	function p() {
 		e(n).selectAll("svg").remove();
-		let r = new p.Graph();
+		let r = new f.Graph();
 		r.setGraph({
 			rankdir: "TB",
 			nodesep: 40,
 			ranksep: 60
 		}), r.setDefaultEdgeLabel(() => ({}));
 		for (let e of t.nodes) r.setNode(e.id, {
-			width: a,
-			height: o,
+			width: i,
+			height: a,
 			label: e.label,
 			typeId: e.typeId
 		});
@@ -2189,11 +2189,11 @@ function $n(t, n, r = {}) {
 			width: l,
 			height: l
 		}) : r.setEdge(e.source, e.target);
-		xn(r, { constraints: d });
-		let { width: f = 0, height: m = 0 } = r.graph(), h = f + 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", Qn).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", "#6c8ebf");
-		let y = c().x((e) => e.x).y((e) => e.y).curve(i);
-		v.append("g").attr("fill", "none").attr("stroke", "#6c8ebf").attr("stroke-width", 1.5).selectAll("path").data(r.edges()).join("path").attr("marker-end", `url(#${Qn})`).attr("d", (e) => e.v === e.w ? er(r.node(e.v), l) : y(r.edge(e).points ?? []) ?? "");
+		bn(r, { constraints: d });
+		let { width: p = 0, height: m = 0 } = r.graph(), h = p + c * 2, g = m + c * 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(c)}, ${String(c)})`);
+		_.append("defs").append("marker").attr("id", Zn).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", "#6c8ebf");
+		let y = s().x((e) => e.x).y((e) => e.y).curve(o);
+		v.append("g").attr("fill", "none").attr("stroke", "#6c8ebf").attr("stroke-width", 1.5).selectAll("path").data(r.edges()).join("path").attr("marker-end", `url(#${Zn})`).attr("d", (e) => e.v === e.w ? $n(r.node(e.v), l) : y(r.edge(e).points ?? []) ?? "");
 		let b = 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)})`;
@@ -2203,21 +2203,21 @@ function $n(t, n, r = {}) {
 		if (x == null) throw Error("Failed to create ERD diagram SVG element.");
 		return x;
 	}
-	let m = f();
+	let m = p();
 	return {
 		resize: () => {
-			m = f();
+			m = p();
 		},
 		get svg() {
 			return m;
 		}
 	};
 }
-function er(e, t) {
+function $n(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 { $n as renderErdDiagram };
+export { Qn as renderErdDiagram };
 
-//# sourceMappingURL=erdDiagram-CWFK8bsD.js.map
+//# sourceMappingURL=erdDiagram-C-wRJWHp.js.map