@pi-outpost/embed 0.32.4 → 0.34.0

package/dist/{swimlanes-V6O3JKXN-BR7rwPmC.js → swimlanes-N4OXWK64-DipLcZla.js}

@@ -1,291 +1,78 @@
 import { n as e } from "./chunk-Y2CYZVJY-CwsV_8W4.js";
 import { m as t } from "./src-Dkp7vqs8.js";
-import "./chunk-DU6HZSFF-BW30DVuW.js";
-import "./chunk-75Z2AOVW-DoA8rENV.js";
-import "./chunk-PWAF6VOD-9dCi1q-p.js";
-import "./chunk-GMAD6QVW-DZ2r0pLj.js";
-import "./chunk-P2QGCYS3-BoMkrMIF.js";
-import "./chunk-4HAMMTFA-C2YXJpQw.js";
-import "./chunk-GVQU2GXP-BhLneNgJ.js";
-import { o as n } from "./chunk-OSK3NFVY-BUXOUgUl.js";
-import "./chunk-L3NEJ4N5-BaR_9rF3.js";
-import { createCommonLayoutRenderer as r } from "./mermaid.core-DI1iFk6G.js";
-//#region ../node_modules/mermaid/dist/chunks/mermaid.core/swimlanes-V6O3JKXN.mjs
-var i = 5, a = 1e-5, o = 1e-6;
-function s(e) {
-	let t = [];
-	for (let n = 0; n < e.length - 1; n++) t.push({
-		a: e[n],
-		b: e[n + 1]
-	});
-	return t;
-}
-e(s, "buildSegmentList");
-function c(e, t, n, r) {
-	let i = t.x - e.x, a = t.y - e.y, s = r.x - n.x, c = r.y - n.y, l = i * c - a * s;
-	if (l === 0) return null;
-	let u = n.x - e.x, d = n.y - e.y, f = (u * c - d * s) / l, p = (u * a - d * i) / l;
-	return f <= o || f >= 1 - o || p <= o || p >= 1 - o ? null : {
-		point: {
-			x: e.x + f * i,
-			y: e.y + f * a
-		},
-		tA: f,
-		tB: p
-	};
-}
-e(c, "segmentIntersection");
-function l(e) {
-	return Math.abs(e.b.x - e.a.x) >= Math.abs(e.b.y - e.a.y);
-}
-e(l, "isHorizontalSeg");
-function u(e) {
-	let t = [];
-	for (let n = 0; n < e.length; n++) {
-		let r = e[n], i = s(r.points);
-		for (let a = n + 1; a < e.length; a++) {
-			let n = e[a], o = s(n.points);
-			for (let [e, a] of i.entries()) for (let [i, s] of o.entries()) {
-				let o = c(a.a, a.b, s.a, s.b);
-				if (!o) continue;
-				let u = l(a);
-				u !== l(s) && u ? t.push({
-					jumpEdgeId: r.id,
-					otherEdgeId: n.id,
-					segIndex: e,
-					t: o.tA,
-					point: o.point
-				}) : t.push({
-					jumpEdgeId: n.id,
-					otherEdgeId: r.id,
-					segIndex: i,
-					t: o.tB,
-					point: o.point
-				});
-			}
-		}
-	}
-	return t;
-}
-e(u, "findEdgeIntersections");
-function d(e) {
-	return `${Math.round(e * 1e3) / 1e3}`;
-}
-e(d, "fmt");
-function f(e) {
-	return `${d(e.x)},${d(e.y)}`;
-}
-e(f, "pointToString");
-function p(e) {
-	let t = e.b.x - e.a.x, n = e.b.y - e.a.y;
-	return Math.abs(t) >= Math.abs(n) ? +(t >= 0) : +(n >= 0);
-}
-e(p, "getArcSweepFlag");
-var m = .001;
-function h(e, t) {
-	if (e.length < 2) return e.map((e) => ({ ...e }));
-	let r = e.map((e) => ({ ...e })), i = t.arrowTypeStart && n[t.arrowTypeStart];
-	if (i) {
-		let t = e[0], n = e[1], a = Math.atan2(n.y - t.y, n.x - t.x);
-		r[0].x = t.x + i * Math.cos(a), r[0].y = t.y + i * Math.sin(a);
-	}
-	let a = t.arrowTypeEnd && n[t.arrowTypeEnd];
-	if (a) {
-		let t = e.length, n = e[t - 2], i = e[t - 1], o = Math.atan2(i.y - n.y, i.x - n.x);
-		r[t - 1].x = i.x - a * Math.cos(o), r[t - 1].y = i.y - a * Math.sin(o);
-	}
-	return r;
-}
-e(h, "applyMarkerOffsets");
-function g(e, t, n, r, i) {
-	let a = e.point.x, o = e.point.y, s = {
-		x: a - t * e.r,
-		y: o - n * e.r
-	}, c = {
-		x: a + t * e.r,
-		y: o + n * e.r
-	}, l = [`L${f(s)}`];
-	return i === "arc" ? l.push(`A${d(e.r)},${d(e.r)} 0 0 ${r} ${f(c)}`) : l.push(`M${f(c)}`), l;
-}
-e(g, "emitJump");
-function _(e, t, n, r) {
-	let i = t.x - e.x, o = t.y - e.y, s = n.x - t.x, c = n.y - t.y, l = Math.hypot(i, o), u = Math.hypot(s, c);
-	if (l < a || u < a) return null;
-	let d = i / l, f = o / l, p = s / u, m = c / u, h = d * p + f * m, g = Math.acos(Math.max(-1, Math.min(1, h)));
-	if (g < a || Math.abs(Math.PI - g) < a) return null;
-	let _ = Math.min(r / Math.sin(g / 2), l / 2, u / 2);
-	return {
-		startX: t.x - d * _,
-		startY: t.y - f * _,
-		endX: t.x + p * _,
-		endY: t.y + m * _,
-		ctrlX: t.x,
-		ctrlY: t.y,
-		cutLen: _
-	};
-}
-e(_, "computeRoundedCorner");
-function v(e, t, n) {
-	let r = e.points;
-	if (r.length < 2) return "";
-	let a = h(r, e), o = e.curve === "rounded", c = s(a), l = /* @__PURE__ */ new Map();
-	for (let e of t) {
-		let t = c[e.segIndex];
-		if (!t) continue;
-		let r = Math.hypot(t.b.x - t.a.x, t.b.y - t.a.y), i = l.get(e.segIndex) ?? [];
-		i.push({
-			t: e.t,
-			point: e.point,
-			d: e.t * r,
-			r: n.jumpRadius
-		}), l.set(e.segIndex, i);
-	}
-	let u = [`M${f(a[0])}`];
-	for (let e = 0; e < c.length; e++) {
-		let t = c[e], r = Math.hypot(t.b.x - t.a.x, t.b.y - t.a.y), s = r === 0 ? 0 : (t.b.x - t.a.x) / r, h = r === 0 ? 0 : (t.b.y - t.a.y) / r, v = p(t), y = 0;
-		if (o && e > 0) {
-			let t = _(a[e - 1], a[e], a[e + 1] ?? a[e], i);
-			t && (y = t.cutLen);
-		}
-		let b = r, x = null;
-		o && e < c.length - 1 && (x = _(a[e], a[e + 1], a[e + 2] ?? a[e + 1], i), x && (b = r - x.cutLen));
-		let S = [...l.get(e) ?? []].sort((e, t) => e.t - t.t);
-		for (let e of S) e.r = Math.min(e.r, e.d - y, b - e.d);
-		for (let e = 0; e < S.length - 1; e++) {
-			let t = S[e + 1].d - S[e].d;
-			if (S[e].r + S[e + 1].r > t) {
-				let n = t / 2;
-				S[e].r = Math.min(S[e].r, n), S[e + 1].r = Math.min(S[e + 1].r, n);
-			}
-		}
-		for (let e of S) e.r < m || u.push(...g(e, s, h, v, n.jumpStyle));
-		o && x ? (u.push(`L${d(x.startX)},${d(x.startY)}`), u.push(`Q${d(x.ctrlX)},${d(x.ctrlY)} ${d(x.endX)},${d(x.endY)}`)) : u.push(`L${f(t.b)}`);
-	}
-	return u.join(" ");
-}
-e(v, "rewriteEdgePath");
-function y(e) {
-	return /^[\d\s+,.LMelm-]*$/.test(e);
-}
-e(y, "isStraightPath");
-function b(e) {
-	return !e || e === "linear" || e === "rounded" || e === "step" || e === "stepBefore" || e === "stepAfter";
-}
-e(b, "curveSupportsLineHops");
-function x(e) {
-	if (!e) return null;
-	try {
-		let t = typeof atob == "function" ? atob(e) : Buffer.from(e, "base64").toString(), n = JSON.parse(t);
-		if (!Array.isArray(n)) return null;
-		let r = [];
-		for (let e of n) e && typeof e.x == "number" && typeof e.y == "number" && r.push({
-			x: e.x,
-			y: e.y
-		});
-		return r.length >= 2 ? r : null;
-	} catch {
-		return null;
-	}
-}
-e(x, "decodeDataPoints");
-function S(e, t, n) {
-	if (!n.enabled) return;
-	let r = e.node();
-	if (!r) return;
-	let i = /* @__PURE__ */ new Map();
-	for (let e of t) i.set(e.id, e);
-	let a = [], o = /* @__PURE__ */ new Map();
-	for (let e of t) {
-		let t = typeof CSS < "u" && CSS.escape ? CSS.escape(e.id) : e.id, n = r.querySelector(`path[data-id="${t}"]`);
-		if (!n) continue;
-		o.set(e.id, n);
-		let i = x(n.getAttribute("data-points")) ?? e.points;
-		a.push({
-			...e,
-			points: i
-		});
-	}
-	let s = u(a);
-	if (s.length === 0) return;
-	let c = /* @__PURE__ */ new Map();
-	for (let e of s) {
-		let t = c.get(e.jumpEdgeId) ?? [];
-		t.push(e), c.set(e.jumpEdgeId, t);
-	}
-	for (let e of a) {
-		let t = c.get(e.id);
-		if (!t || t.length === 0) continue;
-		let r = i.get(e.id)?.curve;
-		if (r !== void 0 && !b(r)) continue;
-		let a = o.get(e.id);
-		if (!a || r === void 0 && !y(a.getAttribute("d") ?? "")) continue;
-		let s = a.getAttribute("style") ?? "", l = /stroke-dasharray\s*:\s*0\s+([\d.]+)\s+[\d.]+\s+([\d.]+)/.exec(s), u = l ? Number.parseFloat(l[1]) : null, d = l ? Number.parseFloat(l[2]) : null, f = v(e, t, n);
-		if (a.setAttribute("d", f), u !== null && d !== null && typeof a.getTotalLength == "function") {
-			let e = a.getTotalLength(), t = `0 ${u} ${Math.max(0, e - u - d)} ${d}`, n = s.replace(/stroke-dasharray\s*:[^;]*;?/g, `stroke-dasharray: ${t};`).replace(/;\s*;+/g, ";");
-			a.setAttribute("style", n);
-		}
-	}
-}
-e(S, "applyLineJumpsToSvg");
-function C(e, { measure: t }) {
+import "./chunk-VPRB5NB3-DJh7spRO.js";
+import "./chunk-3YJQHVM4-BNbfg-7y.js";
+import "./chunk-HJ2JQQFS-CgYTXthn.js";
+import "./chunk-E2ZNV5FY-Bu796yUY.js";
+import "./chunk-4EA7E6EY-B5P7n2an.js";
+import "./chunk-XC4XBNZT-CSiWBPH9.js";
+import "./chunk-DBDB3WZW-DpEOsLsQ.js";
+import "./chunk-2BW5OAIV-DWtmlmt_.js";
+import "./chunk-NTY3LDVX-CvRtOCpm.js";
+import { r as n } from "./chunk-FVRAUYC3-tiT7dtx-.js";
+import { t as r } from "./chunk-HTAEGDNF-D4u24-lD.js";
+//#region ../node_modules/mermaid/dist/chunks/mermaid.core/swimlanes-N4OXWK64.mjs
+function i(e, { measure: t }) {
 	let n = e.config?.swimlane?.lineHops;
 	if (n === !1) return;
-	let r = n === "gap" ? "gap" : "arc", i = e.edges.filter((e) => Array.isArray(e.points) && e.points.length >= 2).map((e) => ({
+	let i = n === "gap" ? "gap" : "arc", a = e.edges.filter((e) => Array.isArray(e.points) && e.points.length >= 2).map((e) => ({
 		id: e.id,
 		points: e.points,
 		curve: e.curve,
 		arrowTypeStart: e.arrowTypeStart,
 		arrowTypeEnd: e.arrowTypeEnd
 	}));
-	S(t.groups.edgePaths, i, {
+	r(t.groups.edgePaths, a, {
 		enabled: !0,
 		jumpRadius: 6,
-		jumpStyle: r
+		jumpStyle: i
 	});
 }
-e(C, "applySwimlaneLineJumps");
-var w = "__swimlane_default__", T = 21, E = 20;
-function D(e) {
-	return Math.max(e.padding ?? E, E);
+e(i, "applySwimlaneLineJumps");
+var a = "__swimlane_default__", o = 21, s = 20;
+function c(e) {
+	return Math.max(e.padding ?? s, s);
 }
-e(D, "topLaneHorizontalPadding");
-function O(e) {
+e(c, "topLaneHorizontalPadding");
+function l(e) {
 	let { x: t, y: n, width: r, height: i } = e, a = e.swimlaneContentTop;
 	if (typeof t != "number" || typeof n != "number" || typeof r != "number" || typeof i != "number" || typeof a != "number" || !Number.isFinite(t) || !Number.isFinite(n) || !Number.isFinite(r) || !Number.isFinite(i) || !Number.isFinite(a) || r <= 0 || i <= 0) {
 		delete e.groupTitleRect;
 		return;
 	}
-	let o = n - i / 2, s = Math.min(a, n + i / 2), c = o + Math.min(T, Math.max(0, s - o));
-	if (c <= o) {
+	let s = n - i / 2, c = Math.min(a, n + i / 2), l = s + Math.min(o, Math.max(0, c - s));
+	if (l <= s) {
 		delete e.groupTitleRect;
 		return;
 	}
 	e.groupTitleRect = {
 		left: t - r / 2,
 		right: t + r / 2,
-		top: o,
-		bottom: c
+		top: s,
+		bottom: l
 	};
 }
-e(O, "assignTopLaneTitleRect");
-function k(e) {
+e(l, "assignTopLaneTitleRect");
+function u(e) {
 	let t = e.direction, n = e.nodes ??= [];
 	for (let n of e.nodes ?? []) n.isGroup && !n.parentId && (n.shape = "swimlane", t && (n.direction = t));
 	let r = n.filter((e) => !e.isGroup && !e.parentId);
 	if (r.length === 0) return;
-	let i = n.find((e) => e.id === w);
+	let i = n.find((e) => e.id === a);
 	i ? i.isGroup && (i.shape = "swimlane", t && (i.direction = t)) : (i = {
-		id: w,
+		id: a,
 		label: "",
 		isGroup: !0,
 		shape: "swimlane",
 		padding: 20,
+		look: e.config?.look,
+		colorIndex: n.reduce((e, t) => Math.max(e, t.colorIndex ?? -1), -1) + 1,
 		...t ? { direction: t } : {}
 	}, n.push(i));
-	for (let e of r) e.parentId = w;
+	for (let e of r) e.parentId = a;
 }
-e(k, "prepareLayoutForSwimlanes");
-function A(e) {
+e(u, "prepareLayoutForSwimlanes");
+function d(e) {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e.nodes ?? []) t.set(n.id, n);
 	let n = [];
@@ -306,9 +93,9 @@ function A(e) {
 		nodeById: t
 	};
 }
-e(A, "toGraphView");
-function j(e, t, n, r) {
-	let { layout: i } = e, a = e.nodeById, o = r?.layerGap ?? 100, s = r?.nodeGap ?? 40, c = 0;
+e(d, "toGraphView");
+function f(e, t, n, r) {
+	let { layout: i } = e, a = e.nodeById, o = r?.layerGap ?? 100, s = r?.nodeGap ?? 40, u = 0;
 	for (let e of t.layers) {
 		let t = 0;
 		for (let r of e) {
@@ -317,25 +104,25 @@ function j(e, t, n, r) {
 				t++;
 				continue;
 			}
-			e.layer = c, e.order = t;
-			let i = n.x[r] ?? t * s, l = n.y[r] ?? c * o;
-			e.x = i, e.y = l, t++;
+			e.layer = u, e.order = t;
+			let i = n.x[r] ?? t * s, c = n.y[r] ?? u * o;
+			e.x = i, e.y = c, t++;
 		}
-		c++;
+		u++;
 	}
-	let l = i.nodes ?? [], u = /* @__PURE__ */ new Map(), d = [];
-	for (let e of l) {
+	let d = i.nodes ?? [], f = /* @__PURE__ */ new Map(), p = [];
+	for (let e of d) {
 		if (!e?.isGroup) continue;
-		e.parentId || d.push(e);
-		let t = l.filter((t) => t.parentId === e.id), r = Infinity, i = -Infinity, a = Infinity, o = -Infinity;
+		e.parentId || p.push(e);
+		let t = d.filter((t) => t.parentId === e.id), r = Infinity, i = -Infinity, a = Infinity, o = -Infinity;
 		for (let e of t) {
 			let t = e.x ?? n.x[e.id], s = e.y ?? n.y[e.id], c = e.width ?? 0, l = e.height ?? 0;
 			t != null && s != null && (r = Math.min(r, t - c / 2), i = Math.max(i, t + c / 2), a = Math.min(a, s - l / 2), o = Math.max(o, s + l / 2));
 		}
 		if (r === Infinity || a === Infinity) e.x = e.x ?? 0, e.y = e.y ?? 0, e.width = e.width ?? 0, e.height = e.height ?? 0;
 		else {
-			let t = e.padding ?? 20, n = e.parentId ? t : 2 * D(e), s = t, c = Math.max(0, i - r) + n, l = Math.max(0, o - a) + s, d = (r + i) / 2, f = (a + o) / 2;
-			e.x = d, e.y = f, e.width = c, e.height = l, u.set(e.id, {
+			let t = e.padding ?? 20, n = e.parentId ? t : 2 * c(e), s = t, l = Math.max(0, i - r) + n, u = Math.max(0, o - a) + s, d = (r + i) / 2, p = (a + o) / 2;
+			e.x = d, e.y = p, e.width = l, e.height = u, f.set(e.id, {
 				minX: r,
 				maxX: i,
 				minY: a,
@@ -343,64 +130,64 @@ function j(e, t, n, r) {
 			});
 		}
 	}
-	if (d.length > 0 && u.size > 0) {
+	if (p.length > 0 && f.size > 0) {
 		let e = Infinity, t = -Infinity, n = 0;
-		for (let r of d) {
+		for (let r of p) {
 			let i = r.padding ?? 20;
 			i > n && (n = i);
-			let a = u.get(r.id);
+			let a = f.get(r.id);
 			a && (e = Math.min(e, a.minY), t = Math.max(t, a.maxY));
 		}
 		if (e !== Infinity && t !== -Infinity) {
 			let r = Math.max(0, t - e) + 2 * Math.max(n, 36), i = (e + t) / 2;
-			for (let t of d) t.y = i, t.height = r, t.swimlaneContentTop = e;
-			let a = [...d].sort((e, t) => (e.x ?? 0) - (t.x ?? 0)), o = [], s = [], c = [];
+			for (let t of p) t.y = i, t.height = r, t.swimlaneContentTop = e;
+			let a = [...p].sort((e, t) => (e.x ?? 0) - (t.x ?? 0)), o = [], s = [], u = [];
 			for (let e of a) {
-				let t = u.get(e.id);
+				let t = f.get(e.id);
 				if (!t) continue;
-				let n = Math.max(0, t.maxX - t.minX) + 2 * D(e), r = (t.minX + t.maxX) / 2;
-				o.push(e.id), s.push(r), c.push(n);
+				let n = Math.max(0, t.maxX - t.minX) + 2 * c(e), r = (t.minX + t.maxX) / 2;
+				o.push(e.id), s.push(r), u.push(n);
 			}
-			let l = o.length;
-			if (l > 0) {
+			let d = o.length;
+			if (d > 0) {
 				let e = /* @__PURE__ */ new Map();
-				if (l === 1) e.set(o[0], c[0]);
+				if (d === 1) e.set(o[0], u[0]);
 				else {
 					let t = [];
-					for (let e = 0; e < l - 1; e++) t.push(s[e + 1] - s[e]);
-					let n = Array(l);
+					for (let e = 0; e < d - 1; e++) t.push(s[e + 1] - s[e]);
+					let n = Array(d);
 					n[0] = 0;
-					for (let e = 0; e < l - 1; e++) n[e + 1] = 2 * t[e] - n[e];
+					for (let e = 0; e < d - 1; e++) n[e + 1] = 2 * t[e] - n[e];
 					let r = 0, i = Infinity;
-					for (let e = 0; e < l; e++) {
-						let t = c[e];
+					for (let e = 0; e < d; e++) {
+						let t = u[e];
 						e % 2 == 0 ? r = Math.max(r, t - n[e]) : i = Math.min(i, n[e] - t);
 					}
 					let a = r;
 					a = r <= i ? (r + i) / 2 : r;
-					for (let t = 0; t < l; t++) {
-						let r = n[t] + (t % 2 == 0 ? a : -a), i = Math.max(c[t], r);
+					for (let t = 0; t < d; t++) {
+						let r = n[t] + (t % 2 == 0 ? a : -a), i = Math.max(u[t], r);
 						e.set(o[t], i);
 					}
 				}
-				for (let t of d) {
+				for (let t of p) {
 					let n = e.get(t.id);
-					n != null && (t.width = n), O(t);
+					n != null && (t.width = n), l(t);
 				}
 			}
 		}
 	}
 }
-e(j, "writeBackToLayoutData");
-var ee = "[EdgeLabelNodes]";
-function te(e) {
+e(f, "writeBackToLayoutData");
+var p = "[EdgeLabelNodes]";
+function m(e) {
 	let n = [], r = [], i = /* @__PURE__ */ new Map();
 	for (let t of e.nodes) i.set(t.id, t);
 	for (let a of e.edges) {
 		if (!a.label || a.label.length === 0 || a.isLayoutOnly || a.labelNodeId) continue;
 		let e = a.start ? i.get(a.start) : void 0, o = a.end ? i.get(a.end) : void 0;
 		if (!e || !o) {
-			t.warn(ee, `Edge ${a.id} has missing source or target node`);
+			t.warn(p, `Edge ${a.id} has missing source or target node`);
 			continue;
 		}
 		let s = `edge-label-${a.start}-${a.end}-${a.id}`, c = e.parentId === o.parentId ? e.parentId : o.parentId, l = {
@@ -441,20 +228,20 @@ function te(e) {
 		edges: o
 	};
 }
-e(te, "createEdgeLabelNodes");
-var M = .001;
-function ne(e) {
+e(m, "createEdgeLabelNodes");
+var h = .001;
+function g(e) {
 	let t = e.x ?? 0, n = e.y ?? 0, r = e.width ?? 0, i = e.height ?? 0;
 	return r > 0 && i > 0 ? {
 		cx: t,
 		cy: n,
-		rect: se(t, n, r, i)
+		rect: P(t, n, r, i)
 	} : void 0;
 }
-e(ne, "measuredNodeRect");
-function N(e) {
+e(g, "measuredNodeRect");
+function _(e) {
 	if (e.isGroup) return;
-	let t = ne(e);
+	let t = g(e);
 	if (t) return {
 		id: String(e.id ?? ""),
 		cx: t.cx,
@@ -462,39 +249,39 @@ function N(e) {
 		rect: t.rect
 	};
 }
-e(N, "nodeBoundsInfoFor");
-function P(e, t, n = M) {
+e(_, "nodeBoundsInfoFor");
+function v(e, t, n = h) {
 	return Math.abs(e.x - t.x) < n && Math.abs(e.y - t.y) < n;
 }
-e(P, "samePoint");
-function F(e, t, n = M) {
+e(v, "samePoint");
+function y(e, t, n = h) {
 	return Math.abs(e.x - t.x) < n;
 }
-e(F, "sameX");
-function I(e, t, n = M) {
+e(y, "sameX");
+function b(e, t, n = h) {
 	return Math.abs(e.y - t.y) < n;
 }
-e(I, "sameY");
-function L(e, t, n = M) {
-	return I(e, t, n) && Math.abs(e.x - t.x) > n;
+e(b, "sameY");
+function x(e, t, n = h) {
+	return b(e, t, n) && Math.abs(e.x - t.x) > n;
 }
-e(L, "isHorizontalSegment");
-function R(e, t, n = M) {
-	return F(e, t, n) && Math.abs(e.y - t.y) > n;
+e(x, "isHorizontalSegment");
+function S(e, t, n = h) {
+	return y(e, t, n) && Math.abs(e.y - t.y) > n;
 }
-e(R, "isVerticalSegment");
-function z(e, t, n, r) {
+e(S, "isVerticalSegment");
+function C(e, t, n, r) {
 	return Math.max(0, Math.min(Math.max(e, t), Math.max(n, r)) - Math.max(Math.min(e, t), Math.min(n, r)));
 }
-e(z, "overlapLength");
-function B(e, t, n = M) {
-	return e.horizontal && t.horizontal && I(e.a, t.a, n) ? z(e.a.x, e.b.x, t.a.x, t.b.x) : e.vertical && t.vertical && F(e.a, t.a, n) ? z(e.a.y, e.b.y, t.a.y, t.b.y) : 0;
+e(C, "overlapLength");
+function w(e, t, n = h) {
+	return e.horizontal && t.horizontal && b(e.a, t.a, n) ? C(e.a.x, e.b.x, t.a.x, t.b.x) : e.vertical && t.vertical && y(e.a, t.a, n) ? C(e.a.y, e.b.y, t.a.y, t.b.y) : 0;
 }
-e(B, "sameAxisSegmentOverlapLength");
-function re(e, t = M) {
+e(w, "sameAxisSegmentOverlapLength");
+function T(e, t = h) {
 	let n = [];
 	for (let r = 0; r < e.length - 1; r++) {
-		let i = e[r], a = e[r + 1], o = L(i, a, t), s = R(i, a, t);
+		let i = e[r], a = e[r + 1], o = x(i, a, t), s = S(i, a, t);
 		(o || s) && n.push({
 			index: r,
 			a: i,
@@ -505,35 +292,35 @@ function re(e, t = M) {
 	}
 	return n;
 }
-e(re, "orthogonalSegmentsForPoints");
-function V(e, t = M) {
-	let n = re(e, t), r = 0;
+e(T, "orthogonalSegmentsForPoints");
+function E(e, t = h) {
+	let n = T(e, t), r = 0;
 	for (let e = 1; e < n.length; e++) n[e - 1].horizontal !== n[e].horizontal && r++;
 	return r;
 }
-e(V, "countOrthogonalBends");
-function H(e, t = M) {
+e(E, "countOrthogonalBends");
+function D(e, t = h) {
 	let n = [];
 	for (let r of e) {
 		let e = n.length > 0 ? n[n.length - 1] : void 0;
-		(!e || !P(e, r, t)) && n.push({
+		(!e || !v(e, r, t)) && n.push({
 			x: r.x,
 			y: r.y
 		});
 	}
 	return n;
 }
-e(H, "dedupeConsecutivePoints");
-function ie(e, t = M) {
+e(D, "dedupeConsecutivePoints");
+function O(e, t = h) {
 	if (!e || e.length !== 4) return;
 	let [n, r, i, a] = e;
-	return L(n, r, t) && R(r, i, t) && L(i, a, t) ? {
+	return x(n, r, t) && S(r, i, t) && x(i, a, t) ? {
 		kind: "HVH",
 		p0: n,
 		p1: r,
 		p2: i,
 		p3: a
-	} : R(n, r, t) && L(r, i, t) && R(i, a, t) ? {
+	} : S(n, r, t) && x(r, i, t) && S(i, a, t) ? {
 		kind: "VHV",
 		p0: n,
 		p1: r,
@@ -541,25 +328,25 @@ function ie(e, t = M) {
 		p3: a
 	} : void 0;
 }
-e(ie, "classifyThreeSegmentRoute");
-function ae(e, t, n, r = 0) {
+e(O, "classifyThreeSegmentRoute");
+function k(e, t, n, r = 0) {
 	let i = Math.min(e.x, t.x), a = Math.max(e.x, t.x), o = Math.min(e.y, t.y), s = Math.max(e.y, t.y);
 	return a > n.left - r && i < n.right + r && s > n.top - r && o < n.bottom + r;
 }
-e(ae, "segmentBoundsOverlapRect");
-function U(e, t, n = 0) {
+e(k, "segmentBoundsOverlapRect");
+function A(e, t, n = 0) {
 	return e.x > t.left + n && e.x < t.right - n && e.y > t.top + n && e.y < t.bottom - n;
 }
-e(U, "pointInsideRect");
-function W(e, t) {
+e(A, "pointInsideRect");
+function j(e, t) {
 	return e.left <= t.left && e.right >= t.right && e.top <= t.top && e.bottom >= t.bottom;
 }
-e(W, "rectContainsRect");
-function G(e, t) {
+e(j, "rectContainsRect");
+function M(e, t) {
 	return e.left < t.right && e.right > t.left && e.top < t.bottom && e.bottom > t.top;
 }
-e(G, "rectsOverlap");
-function oe(e, t) {
+e(M, "rectsOverlap");
+function N(e, t) {
 	return {
 		left: e.left - t,
 		right: e.right + t,
@@ -567,8 +354,8 @@ function oe(e, t) {
 		bottom: e.bottom + t
 	};
 }
-e(oe, "inflateRect");
-function se(e, t, n, r) {
+e(N, "inflateRect");
+function P(e, t, n, r) {
 	return {
 		left: e - n / 2,
 		right: e + n / 2,
@@ -576,12 +363,12 @@ function se(e, t, n, r) {
 		bottom: t + r / 2
 	};
 }
-e(se, "rectFromCenterSize");
-function K(e) {
-	return ne(e)?.rect;
+e(P, "rectFromCenterSize");
+function F(e) {
+	return g(e)?.rect;
 }
-e(K, "rectOfNodeBounds");
-function ce(e, t) {
+e(F, "rectOfNodeBounds");
+function I(e, t) {
 	switch (t) {
 		case "top": return {
 			x: e.cx,
@@ -601,12 +388,12 @@ function ce(e, t) {
 		};
 	}
 }
-e(ce, "portForRectSide");
-function le(e, t, n, r, i, a = M) {
+e(I, "portForRectSide");
+function ee(e, t, n, r, i, a = h) {
 	let o = t === "left" || t === "right", s = r === "left" || r === "right";
 	if (o && s) {
 		if (t === "right" && r === "left" && e.x < n.x || t === "left" && r === "right" && e.x > n.x) {
-			if (I(e, n, a)) return [e, n];
+			if (b(e, n, a)) return [e, n];
 			let t = (e.x + n.x) / 2;
 			return [
 				e,
@@ -622,7 +409,7 @@ function le(e, t, n, r, i, a = M) {
 			];
 		}
 		if (t === r) {
-			if (I(e, n, a)) return;
+			if (b(e, n, a)) return;
 			let r = t === "left" ? Math.min(e.x, n.x) - i : Math.max(e.x, n.x) + i;
 			return [
 				e,
@@ -641,7 +428,7 @@ function le(e, t, n, r, i, a = M) {
 	}
 	if (!o && !s) {
 		if (t === r) {
-			if (F(e, n, a)) return;
+			if (y(e, n, a)) return;
 			let r = t === "top" ? Math.min(e.y, n.y) - i : Math.max(e.y, n.y) + i;
 			return [
 				e,
@@ -657,7 +444,7 @@ function le(e, t, n, r, i, a = M) {
 			];
 		}
 		if (!(t === "bottom" && r === "top" && e.y < n.y || t === "top" && r === "bottom" && e.y > n.y)) return;
-		if (F(e, n, a)) return [e, n];
+		if (y(e, n, a)) return [e, n];
 		let o = (e.y + n.y) / 2;
 		return [
 			e,
@@ -693,8 +480,8 @@ function le(e, t, n, r, i, a = M) {
 		n
 	] : void 0;
 }
-e(le, "buildOrthogonalPortPath");
-function ue(e, t, n, r) {
+e(ee, "buildOrthogonalPortPath");
+function L(e, t, n, r) {
 	return t === "left" || t === "right" ? [
 		e,
 		{
@@ -719,12 +506,12 @@ function ue(e, t, n, r) {
 		n
 	];
 }
-e(ue, "buildSameSideTrackPath");
-function de(e) {
+e(L, "buildSameSideTrackPath");
+function R(e) {
 	let t = /* @__PURE__ */ new Map(), n = [];
 	for (let r of e) {
 		if (r.isEdgeLabel) continue;
-		let e = N(r);
+		let e = _(r);
 		e && (t.set(e.id, e), n.push({
 			id: e.id,
 			rect: e.rect
@@ -735,11 +522,11 @@ function de(e) {
 		realNodeRects: n
 	};
 }
-e(de, "collectRealNodeBounds");
-function q(e) {
+e(R, "collectRealNodeBounds");
+function z(e) {
 	let t = [], n = [];
 	for (let r of e) {
-		let e = N(r);
+		let e = _(r);
 		if (!e) continue;
 		let i = {
 			id: e.id,
@@ -752,21 +539,21 @@ function q(e) {
 		labelNodeRects: n
 	};
 }
-e(q, "collectNodeRectEntries");
-function fe(e, { includeEdgeLabels: t = !0 } = {}) {
+e(z, "collectNodeRectEntries");
+function te(e, { includeEdgeLabels: t = !0 } = {}) {
 	let n = [];
 	for (let r of e) {
 		if (r.isGroup || !t && r.isEdgeLabel) continue;
 		let e = r.x ?? 0, i = r.y ?? 0, a = r.width ?? 0, o = r.height ?? 0;
 		n.push({
 			nodeId: r.id,
-			...se(e, i, a, o)
+			...P(e, i, a, o)
 		});
 	}
 	return n;
 }
-e(fe, "collectLayoutNodeRects");
-function pe(e, t, n = M) {
+e(te, "collectLayoutNodeRects");
+function ne(e, t, n = h) {
 	let r = e.start, i = e.end;
 	if (!r || !i) return;
 	let a = t.get(r), o = t.get(i);
@@ -779,14 +566,14 @@ function pe(e, t, n = M) {
 		collinearY: Math.abs(a.cy - o.cy) < n
 	};
 }
-e(pe, "getNodePairGeometry");
-function J(e, t, n, r = [], i = 0) {
-	for (let a of n) if (!r.includes(a.id) && ae(e, t, a.rect, -i)) return !0;
+e(ne, "getNodePairGeometry");
+function B(e, t, n, r = [], i = 0) {
+	for (let a of n) if (!r.includes(a.id) && k(e, t, a.rect, -i)) return !0;
 	return !1;
 }
-e(J, "segmentHitsAnyRect");
-function me(e, t, n, r, i = M, a = 1e-6) {
-	let o = I(e, t, i), s = F(e, t, i), c = I(n, r, i), l = F(n, r, i);
+e(B, "segmentHitsAnyRect");
+function re(e, t, n, r, i = h, a = 1e-6) {
+	let o = b(e, t, i), s = y(e, t, i), c = b(n, r, i), l = y(n, r, i);
 	if (o && c || s && l || !(o || s) || !(c || l)) return !1;
 	let u = o ? {
 		a: e,
@@ -800,31 +587,31 @@ function me(e, t, n, r, i = M, a = 1e-6) {
 	} : {
 		a: n,
 		b: r
-	}, f = u.a.y, p = Math.min(u.a.x, u.b.x), m = Math.max(u.a.x, u.b.x), h = d.a.x, g = Math.min(d.a.y, d.b.y), _ = Math.max(d.a.y, d.b.y);
-	if (h < p || h > m || f < g || f > _) return !1;
-	let v = Math.abs(h - u.a.x) < a && Math.abs(f - u.a.y) < a || Math.abs(h - u.b.x) < a && Math.abs(f - u.b.y) < a, y = Math.abs(h - d.a.x) < a && Math.abs(f - d.a.y) < a || Math.abs(h - d.b.x) < a && Math.abs(f - d.b.y) < a;
-	return !(v && y);
-}
-e(me, "orthogonalSegmentsCross");
-function he(e, t, n, r, i = M) {
-	let a = I(e, t, i), o = F(e, t, i), s = I(n, r, i), c = F(n, r, i);
-	return o && c && F(e, n, i) ? z(e.y, t.y, n.y, r.y) > i : a && s && I(e, n, i) ? z(e.x, t.x, n.x, r.x) > i : !1;
-}
-e(he, "sameAxisSegmentsOverlap");
-function ge(e, t, n, r, { epsilon: i = M, skipDegenerateOther: a = !1 } = {}) {
+	}, f = u.a.y, p = Math.min(u.a.x, u.b.x), m = Math.max(u.a.x, u.b.x), g = d.a.x, _ = Math.min(d.a.y, d.b.y), v = Math.max(d.a.y, d.b.y);
+	if (g < p || g > m || f < _ || f > v) return !1;
+	let x = Math.abs(g - u.a.x) < a && Math.abs(f - u.a.y) < a || Math.abs(g - u.b.x) < a && Math.abs(f - u.b.y) < a, S = Math.abs(g - d.a.x) < a && Math.abs(f - d.a.y) < a || Math.abs(g - d.b.x) < a && Math.abs(f - d.b.y) < a;
+	return !(x && S);
+}
+e(re, "orthogonalSegmentsCross");
+function ie(e, t, n, r, i = h) {
+	let a = b(e, t, i), o = y(e, t, i), s = b(n, r, i), c = y(n, r, i);
+	return o && c && y(e, n, i) ? C(e.y, t.y, n.y, r.y) > i : a && s && b(e, n, i) ? C(e.x, t.x, n.x, r.x) > i : !1;
+}
+e(ie, "sameAxisSegmentsOverlap");
+function ae(e, t, n, r, { epsilon: i = h, skipDegenerateOther: a = !1 } = {}) {
 	for (let o of n) {
 		if (o === r || o.isLayoutOnly) continue;
 		let n = o.points;
 		if (!(!n || n.length < 2)) for (let r = 0; r < n.length - 1; r++) {
 			let o = n[r], s = n[r + 1];
-			if (!(a && P(o, s, i)) && (me(e, t, o, s, i) || he(e, t, o, s, i))) return !0;
+			if (!(a && v(o, s, i)) && (re(e, t, o, s, i) || ie(e, t, o, s, i))) return !0;
 		}
 	}
 	return !1;
 }
-e(ge, "segmentConflictsWithAnyEdge");
-function _e(e, t, n, r, i = M) {
-	let a = I(e, t, i), o = F(e, t, i), s = I(n, r, i), c = F(n, r, i);
+e(ae, "segmentConflictsWithAnyEdge");
+function V(e, t, n, r, i = h) {
+	let a = b(e, t, i), o = y(e, t, i), s = b(n, r, i), c = y(n, r, i);
 	if (!(a && c || o && s)) return !1;
 	let l = a ? {
 		a: e,
@@ -838,29 +625,29 @@ function _e(e, t, n, r, i = M) {
 	} : {
 		a: e,
 		b: t
-	}, d = l.a.y, f = Math.min(l.a.x, l.b.x), p = Math.max(l.a.x, l.b.x), m = u.a.x, h = Math.min(u.a.y, u.b.y), g = Math.max(u.a.y, u.b.y);
-	return m > f + i && m < p - i && d > h + i && d < g - i;
+	}, d = l.a.y, f = Math.min(l.a.x, l.b.x), p = Math.max(l.a.x, l.b.x), m = u.a.x, g = Math.min(u.a.y, u.b.y), _ = Math.max(u.a.y, u.b.y);
+	return m > f + i && m < p - i && d > g + i && d < _ - i;
 }
-e(_e, "orthogonalSegmentsStrictlyCross");
-function ve(e, t, n) {
+e(V, "orthogonalSegmentsStrictlyCross");
+function oe(e, t, n) {
 	let r = Math.min(t, n), i = Math.max(t, n);
-	return e > r + M && e < i - M;
+	return e > r + h && e < i - h;
 }
-e(ve, "strictlyBetween");
-function ye(e, t, n) {
-	return F(e, t) && F(t, n) ? ve(t.y, e.y, n.y) : I(e, t) && I(t, n) ? ve(t.x, e.x, n.x) : !1;
+e(oe, "strictlyBetween");
+function H(e, t, n) {
+	return y(e, t) && y(t, n) ? oe(t.y, e.y, n.y) : b(e, t) && b(t, n) ? oe(t.x, e.x, n.x) : !1;
 }
-e(ye, "isCollinearIntermediate");
-function be(e) {
+e(H, "isCollinearIntermediate");
+function U(e) {
 	let t = !1, n = [];
 	for (let r = 0; r < e.length; r++) {
 		let i = n[n.length - 1], a = e[r], o = r + 1 < e.length ? e[r + 1] : void 0;
 		if (i && o) {
-			if (P(i, o)) {
+			if (v(i, o)) {
 				r++, t = !0;
 				continue;
 			}
-			if (ye(i, a, o)) {
+			if (H(i, a, o)) {
 				t = !0;
 				continue;
 			}
@@ -872,13 +659,13 @@ function be(e) {
 		changed: t
 	};
 }
-e(be, "simplifyPolylineOnce");
-function xe(e) {
+e(U, "simplifyPolylineOnce");
+function W(e) {
 	let t = [e[0]];
 	for (let n = 1; n < e.length; n++) {
 		let r = t[t.length - 1], i = e[n];
-		if (!F(r, i) && !I(r, i)) {
-			let e = t.length >= 2 ? t[t.length - 2] : void 0, n = e && F(e, r) ? {
+		if (!y(r, i) && !b(r, i)) {
+			let e = t.length >= 2 ? t[t.length - 2] : void 0, n = e && y(e, r) ? {
 				x: r.x,
 				y: i.y
 			} : {
@@ -892,40 +679,40 @@ function xe(e) {
 	let n = [];
 	for (let e of t) {
 		let t = n[n.length - 1];
-		(!t || !P(t, e)) && n.push(e);
+		(!t || !v(t, e)) && n.push(e);
 	}
 	return n;
 }
-e(xe, "orthogonalizePolyline");
-function Se(e) {
+e(W, "orthogonalizePolyline");
+function G(e) {
 	if (e.length < 3) return e;
 	let t = [...e];
 	for (let e = 0; e < 32; e++) {
-		let e = be(t);
+		let e = U(t);
 		if (t = e.points, !e.changed) break;
 	}
 	return t;
 }
-e(Se, "simplifyPolyline");
-var Y = .001, Ce = .5, we = 4;
-function Te(e, t, n) {
+e(G, "simplifyPolyline");
+var K = .001, se = .5, ce = 4;
+function le(e, t, n) {
 	let r = e;
 	if (r.isLayoutOnly || !r.points || r.points.length < n) return;
 	let i = r.start ? t.get(r.start) : void 0, a = r.end ? t.get(r.end) : void 0;
 	return {
 		edge: r,
 		points: r.points,
-		srcRect: i ? K(i) : void 0,
-		dstRect: a ? K(a) : void 0
+		srcRect: i ? F(i) : void 0,
+		dstRect: a ? F(a) : void 0
 	};
 }
-e(Te, "endpointContextFor");
-function Ee(e, t, n) {
-	if (I(e, t, Y)) return {
+e(le, "endpointContextFor");
+function ue(e, t, n) {
+	if (b(e, t, K)) return {
 		x: e.x < n.left ? n.left : n.right,
 		y: e.y
 	};
-	if (F(e, t, Y)) {
+	if (y(e, t, K)) {
 		let t = e.y < n.top ? n.top : n.bottom;
 		return {
 			x: e.x,
@@ -937,35 +724,35 @@ function Ee(e, t, n) {
 		y: Math.min(n.bottom, Math.max(n.top, e.y))
 	};
 }
-e(Ee, "segmentEnterPoint");
-function De(e, t, n) {
+e(ue, "segmentEnterPoint");
+function de(e, t, n) {
 	let r = n ? 1 : -1, i = n ? 0 : e.length - 1;
-	for (; i >= 0 && i < e.length && U(e[i], t, Ce);) i += r;
+	for (; i >= 0 && i < e.length && A(e[i], t, se);) i += r;
 	if (i < 0 || i >= e.length) return e;
 	let a = i - r;
 	if (a < 0 || a >= e.length) return e;
-	let o = Ee(e[i], e[a], t);
+	let o = ue(e[i], e[a], t);
 	return n ? [o, ...e.slice(i)] : [...e.slice(0, i + 1), o];
 }
-e(De, "clipEndpoint");
-function Oe(e, t) {
+e(de, "clipEndpoint");
+function q(e, t) {
 	for (let n of e) {
-		let e = Te(n, t, 2);
+		let e = le(n, t, 2);
 		if (!e) continue;
 		let r = [...e.points];
-		e.srcRect && (r = De(r, e.srcRect, !0)), e.dstRect && (r = De(r, e.dstRect, !1)), r = Se(xe(r)), r = ze(r, e.srcRect, e.dstRect), e.edge.points = Se(xe(r));
+		e.srcRect && (r = de(r, e.srcRect, !0)), e.dstRect && (r = de(r, e.dstRect, !1)), r = G(W(r)), r = xe(r, e.srcRect, e.dstRect), e.edge.points = G(W(r));
 	}
 }
-e(Oe, "clipEdgeEndpointsToNodeBoundaries");
-function ke(e, t, n, r = !1) {
-	if (I(e, t, Y)) {
-		if (t.y < n.top - Y || t.y > n.bottom + Y) return t;
+e(q, "clipEdgeEndpointsToNodeBoundaries");
+function J(e, t, n, r = !1) {
+	if (b(e, t, K)) {
+		if (t.y < n.top - K || t.y > n.bottom + K) return t;
 		if (r) {
-			if (e.x < n.left - Y) return {
+			if (e.x < n.left - K) return {
 				x: n.left,
 				y: e.y
 			};
-			if (e.x > n.right + Y) return {
+			if (e.x > n.right + K) return {
 				x: n.right,
 				y: e.y
 			};
@@ -975,14 +762,14 @@ function ke(e, t, n, r = !1) {
 			y: e.y
 		};
 	}
-	if (F(e, t, Y)) {
-		if (t.x < n.left - Y || t.x > n.right + Y) return t;
+	if (y(e, t, K)) {
+		if (t.x < n.left - K || t.x > n.right + K) return t;
 		if (r) {
-			if (e.y < n.top - Y) return {
+			if (e.y < n.top - K) return {
 				x: e.x,
 				y: n.top
 			};
-			if (e.y > n.bottom + Y) return {
+			if (e.y > n.bottom + K) return {
 				x: e.x,
 				y: n.bottom
 			};
@@ -995,18 +782,18 @@ function ke(e, t, n, r = !1) {
 	}
 	return t;
 }
-e(ke, "snapEndpointToBoundary");
-function Ae(e, t, n) {
+e(J, "snapEndpointToBoundary");
+function fe(e, t, n) {
 	let r = e[t];
 	for (let i = t + n; i >= 0 && i < e.length; i += n) {
 		let t = e[i];
-		if (!P(t, r, Y)) return t;
+		if (!v(t, r, K)) return t;
 	}
 	return e[t + n];
 }
-e(Ae, "firstDistinctAdjacent");
-function je(e, t) {
-	let n = e + we, r = t - we;
+e(fe, "firstDistinctAdjacent");
+function pe(e, t) {
+	let n = e + ce, r = t - ce;
 	return n <= r ? {
 		lo: n,
 		hi: r
@@ -1015,50 +802,50 @@ function je(e, t) {
 		hi: (e + t) / 2
 	};
 }
-e(je, "cornerClearanceRange");
-function Me(e, t, n) {
-	let { lo: r, hi: i } = je(t, n);
+e(pe, "cornerClearanceRange");
+function me(e, t, n) {
+	let { lo: r, hi: i } = pe(t, n);
 	return Math.min(i, Math.max(r, e));
 }
-e(Me, "clampToCornerClearance");
-function Ne(e) {
+e(me, "clampToCornerClearance");
+function he(e) {
 	let t = Math.max(...e.map((e) => e.lo)), n = Math.min(...e.map((e) => e.hi));
 	if (!(t > n)) return {
 		lo: t,
 		hi: n
 	};
 }
-e(Ne, "intersectRanges");
-function Pe(e, t) {
-	return t === "left" || t === "right" ? je(e.top, e.bottom) : je(e.left, e.right);
-}
-e(Pe, "clearanceRangeForSide");
-function Fe(e, t, n) {
-	let r = e.y >= n.top - Y && e.y <= n.bottom + Y, i = e.x >= n.left - Y && e.x <= n.right + Y;
-	if (I(e, t, Y) && r) {
-		if (Math.abs(e.x - n.left) < Y) return "left";
-		if (Math.abs(e.x - n.right) < Y) return "right";
+e(he, "intersectRanges");
+function ge(e, t) {
+	return t === "left" || t === "right" ? pe(e.top, e.bottom) : pe(e.left, e.right);
+}
+e(ge, "clearanceRangeForSide");
+function _e(e, t, n) {
+	let r = e.y >= n.top - K && e.y <= n.bottom + K, i = e.x >= n.left - K && e.x <= n.right + K;
+	if (b(e, t, K) && r) {
+		if (Math.abs(e.x - n.left) < K) return "left";
+		if (Math.abs(e.x - n.right) < K) return "right";
 	}
-	if (F(e, t, Y) && i) {
-		if (Math.abs(e.y - n.top) < Y) return "top";
-		if (Math.abs(e.y - n.bottom) < Y) return "bottom";
+	if (y(e, t, K) && i) {
+		if (Math.abs(e.y - n.top) < K) return "top";
+		if (Math.abs(e.y - n.bottom) < K) return "bottom";
 	}
 }
-e(Fe, "terminalSideForSegment");
-function Ie(e) {
+e(_e, "terminalSideForSegment");
+function ve(e) {
 	return e === "left" || e === "right";
 }
-e(Ie, "isHorizontalSide");
-function Le(e, t, n, r, i) {
-	let a = [], o = n ? Fe(e, t, n) : void 0, s = r ? Fe(t, e, r) : void 0;
-	return n && o && Ie(o) === i && a.push(Pe(n, o)), r && s && Ie(s) === i && a.push(Pe(r, s)), a.length > 0 ? Ne(a) : void 0;
+e(ve, "isHorizontalSide");
+function ye(e, t, n, r, i) {
+	let a = [], o = n ? _e(e, t, n) : void 0, s = r ? _e(t, e, r) : void 0;
+	return n && o && ve(o) === i && a.push(ge(n, o)), r && s && ve(s) === i && a.push(ge(r, s)), a.length > 0 ? he(a) : void 0;
 }
-e(Le, "straightClearanceRange");
-function Re(e, t, n, r, i) {
-	let a = Le(e, t, n, r, i);
+e(ye, "straightClearanceRange");
+function be(e, t, n, r, i) {
+	let a = ye(e, t, n, r, i);
 	if (!a) return;
 	let o = i ? e.y : e.x, s = Math.min(a.hi, Math.max(a.lo, o));
-	if (!(Math.abs(s - o) < Y)) return i ? [{
+	if (!(Math.abs(s - o) < K)) return i ? [{
 		x: e.x,
 		y: s
 	}, {
@@ -1072,97 +859,97 @@ function Re(e, t, n, r, i) {
 		y: t.y
 	}];
 }
-e(Re, "clearStraightEndpointCornerAxis");
-function ze(e, t, n) {
+e(be, "clearStraightEndpointCornerAxis");
+function xe(e, t, n) {
 	if (e.length !== 2) return e;
 	let [r, i] = e;
-	return I(r, i, Y) ? Re(r, i, t, n, !0) ?? e : F(r, i, Y) ? Re(r, i, t, n, !1) ?? e : e;
+	return b(r, i, K) ? be(r, i, t, n, !0) ?? e : y(r, i, K) ? be(r, i, t, n, !1) ?? e : e;
 }
-e(ze, "clearStraightEndpointCornerConnections");
-function Be(e, t, n) {
-	return Ie(n) ? {
+e(xe, "clearStraightEndpointCornerConnections");
+function Se(e, t, n) {
+	return ve(n) ? {
 		x: e.x,
-		y: Me(e.y, t.top, t.bottom)
+		y: me(e.y, t.top, t.bottom)
 	} : {
-		x: Me(e.x, t.left, t.right),
+		x: me(e.x, t.left, t.right),
 		y: e.y
 	};
 }
-e(Be, "cornerClearedEndpoint");
-function Ve(e, t, n, r, i, a) {
+e(Se, "cornerClearedEndpoint");
+function Ce(e, t, n, r, i, a) {
 	let o = e.map((e) => ({ ...e }));
 	for (let s = t; s >= 0 && s < e.length; s += n) {
 		let t = e[s];
-		if (a && !I(t, r, Y) || !a && !F(t, r, Y)) break;
+		if (a && !b(t, r, K) || !a && !y(t, r, K)) break;
 		a ? o[s].y = i.y : o[s].x = i.x;
 	}
 	return o;
 }
-e(Ve, "moveCollinearEndpointRun");
-function He(e, t, n) {
+e(Ce, "moveCollinearEndpointRun");
+function we(e, t, n) {
 	if (e.length < 2) return e;
-	let r = n ? 0 : e.length - 1, i = n ? 1 : -1, a = e[r], o = Ae(e, r, i);
+	let r = n ? 0 : e.length - 1, i = n ? 1 : -1, a = e[r], o = fe(e, r, i);
 	if (!o) return e;
-	let s = Fe(a, o, t);
+	let s = _e(a, o, t);
 	if (!s) return e;
-	let c = Ie(s), l = Be(a, t, s);
-	return P(a, l, Y) ? e : Ve(e, r, i, a, l, c);
-}
-e(He, "clearEndpointCornerConnection");
-function Ue(e, t, n) {
-	let r = Math.min(e.x, t.x) >= n.left - Y && Math.max(e.x, t.x) <= n.right + Y, i = Math.min(e.y, t.y) >= n.top - Y && Math.max(e.y, t.y) <= n.bottom + Y;
-	if (Math.abs(e.y - n.top) < Y && Math.abs(t.y - n.top) < Y && r) return "top";
-	if (Math.abs(e.y - n.bottom) < Y && Math.abs(t.y - n.bottom) < Y && r) return "bottom";
-	if (Math.abs(e.x - n.left) < Y && Math.abs(t.x - n.left) < Y && i) return "left";
-	if (Math.abs(e.x - n.right) < Y && Math.abs(t.x - n.right) < Y && i) return "right";
-}
-e(Ue, "borderSideForSegment");
-function We(e, t, n, r) {
+	let c = ve(s), l = Se(a, t, s);
+	return v(a, l, K) ? e : Ce(e, r, i, a, l, c);
+}
+e(we, "clearEndpointCornerConnection");
+function Te(e, t, n) {
+	let r = Math.min(e.x, t.x) >= n.left - K && Math.max(e.x, t.x) <= n.right + K, i = Math.min(e.y, t.y) >= n.top - K && Math.max(e.y, t.y) <= n.bottom + K;
+	if (Math.abs(e.y - n.top) < K && Math.abs(t.y - n.top) < K && r) return "top";
+	if (Math.abs(e.y - n.bottom) < K && Math.abs(t.y - n.bottom) < K && r) return "bottom";
+	if (Math.abs(e.x - n.left) < K && Math.abs(t.x - n.left) < K && i) return "left";
+	if (Math.abs(e.x - n.right) < K && Math.abs(t.x - n.right) < K && i) return "right";
+}
+e(Te, "borderSideForSegment");
+function Ee(e, t, n, r) {
 	switch (e) {
-		case "top": return F(t, n, Y) && n.y < r.top - Y;
-		case "bottom": return F(t, n, Y) && n.y > r.bottom + Y;
-		case "left": return I(t, n, Y) && n.x < r.left - Y;
-		case "right": return I(t, n, Y) && n.x > r.right + Y;
+		case "top": return y(t, n, K) && n.y < r.top - K;
+		case "bottom": return y(t, n, K) && n.y > r.bottom + K;
+		case "left": return b(t, n, K) && n.x < r.left - K;
+		case "right": return b(t, n, K) && n.x > r.right + K;
 	}
 }
-e(We, "leavesOutward");
-function Ge(e, t, n) {
+e(Ee, "leavesOutward");
+function De(e, t, n) {
 	if (e.length < 3) return e;
 	if (n) {
-		let n = Ue(e[0], e[1], t);
-		return n && We(n, e[1], e[2], t) ? e.slice(1) : e;
+		let n = Te(e[0], e[1], t);
+		return n && Ee(n, e[1], e[2], t) ? e.slice(1) : e;
 	}
-	let r = e.length - 1, i = Ue(e[r - 1], e[r], t);
-	return i && We(i, e[r - 1], e[r - 2], t) ? e.slice(0, r) : e;
+	let r = e.length - 1, i = Te(e[r - 1], e[r], t);
+	return i && Ee(i, e[r - 1], e[r - 2], t) ? e.slice(0, r) : e;
 }
-e(Ge, "collapseOwnBorderStub");
-function Ke(e, t, n) {
+e(De, "collapseOwnBorderStub");
+function Oe(e, t, n) {
 	let r = e;
 	if (t) {
-		let e = Ae(r, 0, 1);
+		let e = fe(r, 0, 1);
 		if (e) {
-			let n = ke(e, r[0], t);
+			let n = J(e, r[0], t);
 			n !== r[0] && (r = [n, ...r.slice(1)]);
 		}
-		r = Ge(r, t, !0);
+		r = De(r, t, !0);
 	}
 	if (n) {
-		let e = r.length - 1, t = Ae(r, e, -1);
+		let e = r.length - 1, t = fe(r, e, -1);
 		if (t) {
-			let i = ke(t, r[e], n, !0);
+			let i = J(t, r[e], n, !0);
 			i !== r[e] && (r = [...r.slice(0, e), i]);
 		}
-		r = Ge(r, n, !1);
+		r = De(r, n, !1);
 	}
-	let i = ze(r, t, n);
-	return i !== r || r.length === 2 ? i : (t && (r = He(r, t, !0)), n && (r = He(r, n, !1)), r);
+	let i = xe(r, t, n);
+	return i !== r || r.length === 2 ? i : (t && (r = we(r, t, !0)), n && (r = we(r, n, !1)), r);
 }
-e(Ke, "snapAndCollapseEndpoints");
-function qe(e, t) {
+e(Oe, "snapAndCollapseEndpoints");
+function ke(e, t) {
 	for (let n of e) {
-		let e = Te(n, t, 2);
+		let e = le(n, t, 2);
 		if (!e) continue;
-		let r = Ke(H(e.points, Y), e.srcRect, e.dstRect);
+		let r = Oe(D(e.points, K), e.srcRect, e.dstRect);
 		if (r.length < 3) {
 			e.edge.points = r;
 			continue;
@@ -1177,12 +964,12 @@ function qe(e, t) {
 		e.edge.points = i;
 	}
 }
-e(qe, "prepareEdgeEndpointsForRenderer");
-function Je(e) {
+e(ke, "prepareEdgeEndpointsForRenderer");
+function Ae(e) {
 	return new Map(e.map((e) => [e.id, e]));
 }
-e(Je, "buildNodeMap");
-function Ye(e, t) {
+e(Ae, "buildNodeMap");
+function je(e, t) {
 	let n = e.parentId, r = null;
 	for (; n;) {
 		let e = t.get(n);
@@ -1191,8 +978,8 @@ function Ye(e, t) {
 	}
 	return r;
 }
-e(Ye, "resolveTopLevelGroupId");
-function Xe(e, t) {
+e(je, "resolveTopLevelGroupId");
+function Me(e, t) {
 	let n = 0, r = e.parentId;
 	for (; r;) {
 		let e = t.get(r);
@@ -1201,8 +988,8 @@ function Xe(e, t) {
 	}
 	return n;
 }
-e(Xe, "groupDepth");
-function Ze(e) {
+e(Me, "groupDepth");
+function Ne(e) {
 	let t = Infinity, n = -Infinity, r = Infinity, i = -Infinity;
 	for (let a of e) {
 		let e = a.x, o = a.y;
@@ -1217,21 +1004,21 @@ function Ze(e) {
 		maxY: i
 	};
 }
-e(Ze, "boundsForChildren");
-function Qe(e, t) {
+e(Ne, "boundsForChildren");
+function Pe(e, t) {
 	let n = e.padding ?? 20;
 	e.x = (t.minX + t.maxX) / 2, e.y = (t.minY + t.maxY) / 2, e.width = Math.max(0, t.maxX - t.minX) + n, e.height = Math.max(0, t.maxY - t.minY) + n;
 }
-e(Qe, "applyGroupBounds");
-function $e(e) {
-	let t = Je(e), n = e.filter((e) => e.isGroup && e.parentId).sort((e, n) => Xe(n, t) - Xe(e, t));
+e(Pe, "applyGroupBounds");
+function Fe(e) {
+	let t = Ae(e), n = e.filter((e) => e.isGroup && e.parentId).sort((e, n) => Me(n, t) - Me(e, t));
 	for (let t of n) {
-		let n = Ze(e.filter((e) => e.parentId === t.id));
-		n && Qe(t, n);
+		let n = Ne(e.filter((e) => e.parentId === t.id));
+		n && Pe(t, n);
 	}
 }
-e($e, "recomputeNestedGroupBounds");
-function et(t, n) {
+e(Fe, "recomputeNestedGroupBounds");
+function Ie(t, n) {
 	let r = t.nodes ?? [], i = t.edges ?? [], a = r.filter((e) => !e.isGroup), o = Infinity, s = -Infinity;
 	for (let e of a) {
 		let t = e[n];
@@ -1256,12 +1043,12 @@ function et(t, n) {
 	for (let e of i) for (let t of e.points ?? []) t[n] = c(t[n]);
 	return !0;
 }
-e(et, "mirrorAxis");
-function tt(e) {
-	return !(e.nodes ?? []).some((e) => !e.isGroup) || et(e, "y");
+e(Ie, "mirrorAxis");
+function Le(e) {
+	return !(e.nodes ?? []).some((e) => !e.isGroup) || Ie(e, "y");
 }
-e(tt, "applyBtDirectionTransform");
-function nt(e, t = "LR") {
+e(Le, "applyBtDirectionTransform");
+function Re(e, t = "LR") {
 	let n = e.nodes ?? [], r = e.edges ?? [], i = n.filter((e) => !e.isGroup), a = Infinity, o = Infinity;
 	for (let e of i) {
 		let t = e.x ?? 0, n = e.y ?? 0;
@@ -1279,13 +1066,13 @@ function nt(e, t = "LR") {
 		let e = t.x, n = (t.y - o) * d + 36, r = e - a;
 		t.x = n, t.y = r;
 	}
-	$e(n);
+	Fe(n);
 	let f = n.filter((e) => e.isGroup && !e.parentId);
-	if (f.length === 0) return t === "RL" && et(e, "x"), !0;
-	let p = Je(n), m = /* @__PURE__ */ new Map();
+	if (f.length === 0) return t === "RL" && Ie(e, "x"), !0;
+	let p = Ae(n), m = /* @__PURE__ */ new Map();
 	for (let e of n) {
 		if (e.isGroup) continue;
-		let t = Ye(e, p);
+		let t = je(e, p);
 		if (!t) continue;
 		let n = m.get(t) ?? [];
 		n.push(e), m.set(t, n);
@@ -1297,7 +1084,7 @@ function nt(e, t = "LR") {
 	}
 	let g = [], _ = Infinity, v = -Infinity;
 	for (let e of f) {
-		let t = Ze(m.get(e.id) ?? []);
+		let t = Ne(m.get(e.id) ?? []);
 		t && (_ = Math.min(_, t.minX), v = Math.max(v, t.maxX), g.push({
 			lane: e,
 			contentTop: t.minY,
@@ -1323,34 +1110,34 @@ function nt(e, t = "LR") {
 			bottom: r
 		};
 	}
-	return t === "RL" && et(e, "x"), !0;
+	return t === "RL" && Ie(e, "x"), !0;
 }
-e(nt, "applyLrDirectionTransform");
-var rt = 1e-6, it = 8, at = [
+e(Re, "applyLrDirectionTransform");
+var ze = 1e-6, Be = 8, Ve = [
 	0,
-	it,
-	-it,
-	2 * it,
-	-2 * it
+	Be,
+	-Be,
+	2 * Be,
+	-2 * Be
 ];
-function ot(e, t) {
-	let { nodeInfoById: n, realNodeRects: r } = de(t);
+function He(e, t) {
+	let { nodeInfoById: n, realNodeRects: r } = R(t);
 	for (let t of e) {
 		if (t.isLayoutOnly) continue;
 		let i = t.points;
 		if (!i || i.length < 4) continue;
-		let a = ie(H(i, rt), rt);
+		let a = O(D(i, ze), ze);
 		if (!a) continue;
-		let { p3: o } = a, s = a.kind === "HVH", c = pe(t, n, rt);
+		let { p3: o } = a, s = a.kind === "HVH", c = ne(t, n, ze);
 		if (!c) continue;
 		let { srcId: l, dstId: u, srcInfo: d, dstInfo: f, collinearX: p, collinearY: m } = c;
 		if (p || m) continue;
 		let h, g = d.rect;
-		for (let n of at) {
+		for (let n of Ve) {
 			let i, a, c;
 			if (s) {
 				let e = f.cy > d.cy ? g.bottom : g.top, t = d.cx + n;
-				if (t <= g.left + rt || t >= g.right - rt) continue;
+				if (t <= g.left + ze || t >= g.right - ze) continue;
 				i = {
 					x: t,
 					y: e
@@ -1363,7 +1150,7 @@ function ot(e, t) {
 				};
 			} else {
 				let e = f.cx > d.cx ? g.right : g.left, t = d.cy + n;
-				if (t <= g.top + rt || t >= g.bottom - rt) continue;
+				if (t <= g.top + ze || t >= g.bottom - ze) continue;
 				i = {
 					x: e,
 					y: t
@@ -1375,16 +1162,16 @@ function ot(e, t) {
 					y: o.y
 				};
 			}
-			let p = P(i, a, rt), m = P(a, c, rt);
-			if (p && m || !p && J(i, a, r, [l], 1) || !m && J(a, c, r, [u], 1)) continue;
-			let _ = !p && ge(i, a, e, t, {
-				epsilon: rt,
+			let p = v(i, a, ze), m = v(a, c, ze);
+			if (p && m || !p && B(i, a, r, [l], 1) || !m && B(a, c, r, [u], 1)) continue;
+			let _ = !p && ae(i, a, e, t, {
+				epsilon: ze,
 				skipDegenerateOther: !0
-			}), v = !m && ge(a, c, e, t, {
-				epsilon: rt,
+			}), y = !m && ae(a, c, e, t, {
+				epsilon: ze,
 				skipDegenerateOther: !0
 			});
-			if (!(_ || v)) {
+			if (!(_ || y)) {
 				h = p ? [a, c] : m ? [i, a] : [
 					i,
 					a,
@@ -1396,83 +1183,83 @@ function ot(e, t) {
 		h && (t.points = h);
 	}
 }
-e(ot, "portSwapToLShape");
-function st(t, n) {
-	let r = .001, { realNodeRects: i, labelNodeRects: a } = q(n.values());
+e(He, "portSwapToLShape");
+function Ue(t, n) {
+	let r = .001, { realNodeRects: i, labelNodeRects: a } = z(n.values());
 	for (let o of t) {
 		if (o.isLayoutOnly) continue;
 		let s = o.points;
 		if (!s || s.length < 4) continue;
-		let c = H(s, r);
+		let c = D(s, r);
 		if (c.length < 4) continue;
 		let l = c.length - 1, u = c[l], d = c[l - 1], f = c[l - 2], p = u.x - d.x, m = u.y - d.y, h = Math.hypot(p, m);
 		if (h >= 10 || h < r) continue;
 		let g = d.x - f.x, _ = d.y - f.y;
 		if (Math.hypot(g, _) < r) continue;
-		let v = L(d, u, r), y = R(d, u, r), b = L(f, d, r), x = R(f, d, r);
-		if (!(v && x || y && b)) continue;
-		let S = o.end, C = o.start, w = S ? n.get(S) : void 0;
-		if (!w) continue;
-		let T = w.x ?? 0, E = w.y ?? 0, D = K(w);
-		if (!D) continue;
-		let O, k;
-		if (x) {
+		let v = x(d, u, r), C = S(d, u, r), w = x(f, d, r), T = S(f, d, r);
+		if (!(v && T || C && w)) continue;
+		let E = o.end, O = o.start, k = E ? n.get(E) : void 0;
+		if (!k) continue;
+		let j = k.x ?? 0, M = k.y ?? 0, N = F(k);
+		if (!N) continue;
+		let P, I;
+		if (T) {
 			let e = _ < 0;
-			O = {
-				x: T,
+			P = {
+				x: j,
 				y: f.y
-			}, k = {
-				x: T,
-				y: e ? D.bottom : D.top
+			}, I = {
+				x: j,
+				y: e ? N.bottom : N.top
 			};
 		} else {
 			let e = g > 0;
-			O = {
+			P = {
 				x: f.x,
-				y: E
-			}, k = {
-				x: e ? D.right : D.left,
-				y: E
+				y: M
+			}, I = {
+				x: e ? N.right : N.left,
+				y: M
 			};
 		}
-		if (J(O, k, i, S ? [S] : [], -2) || J(O, k, a, [], -2)) continue;
-		if (C) {
-			let e = n.get(C), t = e ? K(e) : void 0;
-			if (t && U(O, t, 2)) continue;
+		if (B(P, I, i, E ? [E] : [], -2) || B(P, I, a, [], -2)) continue;
+		if (O) {
+			let e = n.get(O), t = e ? F(e) : void 0;
+			if (t && A(P, t, 2)) continue;
 		}
-		let A = /* @__PURE__ */ e((e, t) => `${e.x.toFixed(3)},${e.y.toFixed(3)}|${t.x.toFixed(3)},${t.y.toFixed(3)}`, "ownSegmentKey"), j = /* @__PURE__ */ new Set();
-		for (let e = 0; e < c.length - 1; e++) j.add(A(c[e], c[e + 1]));
-		let ee = /* @__PURE__ */ e((e, n) => {
+		let ee = /* @__PURE__ */ e((e, t) => `${e.x.toFixed(3)},${e.y.toFixed(3)}|${t.x.toFixed(3)},${t.y.toFixed(3)}`, "ownSegmentKey"), L = /* @__PURE__ */ new Set();
+		for (let e = 0; e < c.length - 1; e++) L.add(ee(c[e], c[e + 1]));
+		let R = /* @__PURE__ */ e((e, n) => {
 			for (let i of t) {
 				if (i === o || i.isLayoutOnly) continue;
 				let t = i.points;
 				if (!(!t || t.length < 2)) for (let i = 0; i < t.length - 1; i++) {
 					let a = t[i], o = t[i + 1];
-					if (!j.has(A(a, o)) && _e(e, n, a, o, r)) return !0;
+					if (!L.has(ee(a, o)) && V(e, n, a, o, r)) return !0;
 				}
 			}
 			return !1;
 		}, "segmentCrossesOtherEdge");
-		if (ee(O, k)) continue;
+		if (R(P, I)) continue;
 		if (l - 3 >= 0) {
-			let e = c[l - 3], t = [C, S].filter((e) => !!e);
-			if (J(e, O, i, t, -2) || ee(e, O)) continue;
+			let e = c[l - 3], t = [O, E].filter((e) => !!e);
+			if (B(e, P, i, t, -2) || R(e, P)) continue;
 		}
-		let te = [
+		let z = [
 			...c.slice(0, l - 2),
-			O,
-			k
+			P,
+			I
 		];
-		o.points = te;
-		let M = o.labelNodeId;
-		if (M) {
-			let e = n.get(M);
+		o.points = z;
+		let te = o.labelNodeId;
+		if (te) {
+			let e = n.get(te);
 			if (e) {
 				let t = e.width ?? 0, n = e.height ?? 0;
 				if (t > 0 && n > 0) {
 					let i, a, o = -1;
-					for (let e = 0; e < te.length - 1; e++) {
-						let s = te[e], c = te[e + 1], l = Math.hypot(c.x - s.x, c.y - s.y), u = I(s, c, r), d = F(s, c, r);
+					for (let e = 0; e < z.length - 1; e++) {
+						let s = z[e], c = z[e + 1], l = Math.hypot(c.x - s.x, c.y - s.y), u = b(s, c, r), d = y(s, c, r);
 						(u && l >= t + 2 || d && l >= n + 2) && l > o && (o = l, i = (s.x + c.x) / 2, a = (s.y + c.y) / 2);
 					}
 					i !== void 0 && a !== void 0 && (e.x = i, e.y = a);
@@ -1481,9 +1268,9 @@ function st(t, n) {
 		}
 	}
 }
-e(st, "collapseShortTerminalStub");
-var X = .001, Z = 8, Q = re, ct = /* @__PURE__ */ e((e, t) => F(e, t, X) || I(e, t, X), "orthogonallyAligned");
-function lt(t, n) {
+e(Ue, "collapseShortTerminalStub");
+var Y = .001, X = 8, Z = T, We = /* @__PURE__ */ e((e, t) => y(e, t, Y) || b(e, t, Y), "orthogonallyAligned");
+function Ge(t, n) {
 	let r = /* @__PURE__ */ e((e, t) => {
 		let n = e.x ?? 0, r = e.y ?? 0, i = t.x - n, a = t.y - r, o = (e.width ?? 0) / 2, s = (e.height ?? 0) / 2;
 		return Math.abs(a) * o > Math.abs(i) * s ? (a < 0 && (s = -s), {
@@ -1494,12 +1281,12 @@ function lt(t, n) {
 			y: r + (i === 0 ? 0 : o * a / i)
 		});
 	}, "rectIntersect"), i = /* @__PURE__ */ e((e, t) => {
-		let i = H(e.points ?? []);
+		let i = D(e.points ?? []);
 		if (i.length < 2) return;
-		let a = t ? e.start : e.end, o = a ? n.get(a) : void 0, s = o ? K(o) : void 0;
+		let a = t ? e.start : e.end, o = a ? n.get(a) : void 0, s = o ? F(o) : void 0;
 		if (!o || !a || !s) return;
 		let c = t ? i[0] : i[i.length - 1], l = t ? i[1] : i[i.length - 2], u = r(o, c), d = c;
-		if (ct(l, u) && (d = l), F(u, d, X)) return {
+		if (We(l, u) && (d = l), y(u, d, Y)) return {
 			edge: e,
 			edgeId: String(e.id ?? ""),
 			nodeId: a,
@@ -1512,7 +1299,7 @@ function lt(t, n) {
 			railEnd: d,
 			rect: s
 		};
-		if (I(u, d, X)) return {
+		if (b(u, d, Y)) return {
 			edge: e,
 			edgeId: String(e.id ?? ""),
 			nodeId: a,
@@ -1525,14 +1312,14 @@ function lt(t, n) {
 			railEnd: d,
 			rect: s
 		};
-	}, "terminalLaneFor"), a = /* @__PURE__ */ e((e, t) => Math.max(0, Math.min(e.max, t.max) - Math.max(e.min, t.min)), "projectedOverlapLength"), o = /* @__PURE__ */ e((e, t) => e.nodeId !== t.nodeId || e.orientation !== t.orientation ? !1 : e.orientation === "H" ? (Math.abs(e.boundary.x - e.rect.left) < 1 || Math.abs(e.boundary.x - e.rect.right) < 1) && F(e.boundary, t.boundary, 1) : (Math.abs(e.boundary.y - e.rect.top) < 1 || Math.abs(e.boundary.y - e.rect.bottom) < 1) && I(e.boundary, t.boundary, 1), "sameTerminalFace"), s = /* @__PURE__ */ e((e, t) => e.nodeId !== t.nodeId || e.orientation !== t.orientation ? !1 : a(e, t) >= Z && Math.abs(e.coord - t.coord) < .5, "exactTerminalLaneConflict"), c = /* @__PURE__ */ e((e, t) => {
+	}, "terminalLaneFor"), a = /* @__PURE__ */ e((e, t) => Math.max(0, Math.min(e.max, t.max) - Math.max(e.min, t.min)), "projectedOverlapLength"), o = /* @__PURE__ */ e((e, t) => e.nodeId !== t.nodeId || e.orientation !== t.orientation ? !1 : e.orientation === "H" ? (Math.abs(e.boundary.x - e.rect.left) < 1 || Math.abs(e.boundary.x - e.rect.right) < 1) && y(e.boundary, t.boundary, 1) : (Math.abs(e.boundary.y - e.rect.top) < 1 || Math.abs(e.boundary.y - e.rect.bottom) < 1) && b(e.boundary, t.boundary, 1), "sameTerminalFace"), s = /* @__PURE__ */ e((e, t) => e.nodeId !== t.nodeId || e.orientation !== t.orientation ? !1 : a(e, t) >= X && Math.abs(e.coord - t.coord) < .5, "exactTerminalLaneConflict"), c = /* @__PURE__ */ e((e, t) => {
 		if (e.nodeId !== t.nodeId || e.orientation !== t.orientation || e.orientation !== "H" || e.atStart === t.atStart) return !1;
 		let n = a(e, t);
-		if (n < Z) return !1;
+		if (n < X) return !1;
 		let r = e.rect.bottom - e.rect.top;
 		return n < r || n > 2 * r ? !1 : o(e, t) && Math.abs(e.coord - t.coord) < 16;
 	}, "nearTerminalLaneConflict"), l = /* @__PURE__ */ e((t, n) => {
-		let r = H(t.edge.points ?? []);
+		let r = D(t.edge.points ?? []);
 		if (r.length < 2) return;
 		let i = t.orientation === "V" ? {
 			x: t.boundary.x + n,
@@ -1547,28 +1334,28 @@ function lt(t, n) {
 			x: t.railEnd.x,
 			y: t.railEnd.y + n
 		};
-		if (!(/* @__PURE__ */ e(() => Math.abs(t.boundary.y - t.rect.top) < 1 || Math.abs(t.boundary.y - t.rect.bottom) < 1 ? I(i, t.boundary, X) && i.x >= t.rect.left + 1 && i.x <= t.rect.right - 1 : Math.abs(t.boundary.x - t.rect.left) < 1 || Math.abs(t.boundary.x - t.rect.right) < 1 ? F(i, t.boundary, X) && i.y >= t.rect.top + 1 && i.y <= t.rect.bottom - 1 : !1, "boundaryStaysOnSameFace"))()) return;
+		if (!(/* @__PURE__ */ e(() => Math.abs(t.boundary.y - t.rect.top) < 1 || Math.abs(t.boundary.y - t.rect.bottom) < 1 ? b(i, t.boundary, Y) && i.x >= t.rect.left + 1 && i.x <= t.rect.right - 1 : Math.abs(t.boundary.x - t.rect.left) < 1 || Math.abs(t.boundary.x - t.rect.right) < 1 ? y(i, t.boundary, Y) && i.y >= t.rect.top + 1 && i.y <= t.rect.bottom - 1 : !1, "boundaryStaysOnSameFace"))()) return;
 		if (t.atStart) {
-			let e = r.length > 1 && P(r[1], t.railEnd, X), n = r.slice(e ? 2 : 1), o = n[0];
-			return o && !ct(o, a) ? void 0 : [
+			let e = r.length > 1 && v(r[1], t.railEnd, Y), n = r.slice(e ? 2 : 1), o = n[0];
+			return o && !We(o, a) ? void 0 : [
 				i,
 				a,
 				...n
 			];
 		}
-		let o = r.length > 1 && P(r[r.length - 2], t.railEnd, X), s = r.slice(0, o ? -2 : -1), c = s[s.length - 1];
-		if (!(c && !ct(c, a))) return [
+		let o = r.length > 1 && v(r[r.length - 2], t.railEnd, Y), s = r.slice(0, o ? -2 : -1), c = s[s.length - 1];
+		if (!(c && !We(c, a))) return [
 			...s,
 			a,
 			i
 		];
 	}, "shiftedCandidate"), u = /* @__PURE__ */ e((e) => {
-		let t = e.edge, r = H(t.points ?? []);
+		let t = e.edge, r = D(t.points ?? []);
 		if (r.length !== 2) return !1;
 		let i = t.start, a = t.end, o = i ? n.get(i) : void 0, s = a ? n.get(a) : void 0;
 		if (!o || !s) return !1;
 		let c = o.x ?? 0, l = o.y ?? 0, u = s.x ?? 0, d = s.y ?? 0, [f, p] = r;
-		return I(f, p, X) && Math.abs(l - d) < 1 && Math.abs(c - u) > 1 || F(f, p, X) && Math.abs(c - u) < 1 && Math.abs(l - d) > 1;
+		return b(f, p, Y) && Math.abs(l - d) < 1 && Math.abs(c - u) > 1 || y(f, p, Y) && Math.abs(c - u) < 1 && Math.abs(l - d) > 1;
 	}, "laneIsStraightCollinearConnector"), d = [
 		-7,
 		7,
@@ -1605,32 +1392,32 @@ function lt(t, n) {
 		if (!n) return;
 	}
 }
-e(lt, "separateSharedRenderedTerminalLanes");
-function ut(t, n) {
-	let { realNodeRects: r, labelNodeRects: i } = q(n.values()), a = /* @__PURE__ */ e((e, n) => {
-		let a = e.start, o = e.end, s = Q(n);
+e(Ge, "separateSharedRenderedTerminalLanes");
+function Ke(t, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = /* @__PURE__ */ e((e, n) => {
+		let a = e.start, o = e.end, s = Z(n);
 		if (s.length !== n.length - 1) return !1;
 		let c = [a, o].filter((e) => !!e);
-		for (let e of s) if (J(e.a, e.b, r, c, -2) || J(e.a, e.b, i, [], -2)) return !1;
+		for (let e of s) if (B(e.a, e.b, r, c, -2) || B(e.a, e.b, i, [], -2)) return !1;
 		for (let n of t) {
 			if (n === e || n.isLayoutOnly) continue;
 			let t = n.points;
 			if (!(!t || t.length < 2)) {
-				for (let e of s) for (let n of Q(H(t))) if (B(e, n, .5) >= Z || _e(e.a, e.b, n.a, n.b, X)) return !1;
+				for (let e of s) for (let n of Z(D(t))) if (w(e, n, .5) >= X || V(e.a, e.b, n.a, n.b, Y)) return !1;
 			}
 		}
 		return !0;
 	}, "candidateIsSafe"), o = /* @__PURE__ */ e((e, t) => {
 		if (t + 4 >= e.length) return;
-		let n = e[t], r = e[t + 1], i = e[t + 2], a = e[t + 3], o = e[t + 4], s = L(n, r) && R(r, i) && L(i, a) && R(a, o) && F(n, a, X) && F(n, o, X) && F(r, i, X) && (r.x - n.x) * (a.x - i.x) < 0, c = R(n, r) && L(r, i) && R(i, a) && L(a, o) && I(n, a, X) && I(n, o, X) && I(r, i, X) && (r.y - n.y) * (a.y - i.y) < 0;
-		if (s || c) return H([
+		let n = e[t], r = e[t + 1], i = e[t + 2], a = e[t + 3], o = e[t + 4], s = x(n, r) && S(r, i) && x(i, a) && S(a, o) && y(n, a, Y) && y(n, o, Y) && y(r, i, Y) && (r.x - n.x) * (a.x - i.x) < 0, c = S(n, r) && x(r, i) && S(i, a) && x(a, o) && b(n, a, Y) && b(n, o, Y) && b(r, i, Y) && (r.y - n.y) * (a.y - i.y) < 0;
+		if (s || c) return D([
 			...e.slice(0, t + 1),
 			o,
 			...e.slice(t + 5)
 		]);
 		if (t + 5 >= e.length) return;
-		let l = e[t + 5], u = R(n, r) && L(r, i) && R(i, a) && L(a, o) && R(o, l) && F(n, o, X) && F(n, l, X) && F(i, a, X) && (i.x - r.x) * (o.x - a.x) < 0, d = L(n, r) && R(r, i) && L(i, a) && R(a, o) && L(o, l) && I(n, o, X) && I(n, l, X) && I(i, a, X) && (i.y - r.y) * (o.y - a.y) < 0;
-		if (!(!u && !d)) return H([
+		let l = e[t + 5], u = S(n, r) && x(r, i) && S(i, a) && x(a, o) && S(o, l) && y(n, o, Y) && y(n, l, Y) && y(i, a, Y) && (i.x - r.x) * (o.x - a.x) < 0, d = x(n, r) && S(r, i) && x(i, a) && S(a, o) && x(o, l) && b(n, o, Y) && b(n, l, Y) && b(i, a, Y) && (i.y - r.y) * (o.y - a.y) < 0;
+		if (!(!u && !d)) return D([
 			...e.slice(0, t + 1),
 			l,
 			...e.slice(t + 6)
@@ -1640,7 +1427,7 @@ function ut(t, n) {
 		let e = !1;
 		for (let n of t) {
 			if (n.isLayoutOnly) continue;
-			let t = H(n.points ?? []);
+			let t = D(n.points ?? []);
 			for (let r = 0; r <= t.length - 5; r++) {
 				let i = o(t, r);
 				if (!(!i || !a(n, i))) {
@@ -1653,20 +1440,20 @@ function ut(t, n) {
 		if (!e) return;
 	}
 }
-e(ut, "collapseRedundantRectangularDoglegs");
-function dt(t, n) {
-	let { realNodeRects: r, labelNodeRects: i } = q(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t, n) => H(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ e((e, t) => {
+e(Ke, "collapseRedundantRectangularDoglegs");
+function qe(t, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t, n) => D(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ e((e, t) => {
 		let n = 0;
 		for (let r = 0; r < a.length; r++) {
-			let i = Q(o(a[r], e, t));
+			let i = Z(o(a[r], e, t));
 			for (let s = r + 1; s < a.length; s++) {
-				let r = Q(o(a[s], e, t));
-				for (let e of i) for (let t of r) _e(e.a, e.b, t.a, t.b, X) && n++;
+				let r = Z(o(a[s], e, t));
+				for (let e of i) for (let t of r) V(e.a, e.b, t.a, t.b, Y) && n++;
 			}
 		}
 		return n;
 	}, "strictCrossingCount"), c = /* @__PURE__ */ e((e) => {
-		let t = Q(e);
+		let t = Z(e);
 		if (t.length !== 3) return;
 		let n = t[1];
 		if (t[0].horizontal !== n.horizontal && t[2].horizontal !== n.horizontal) return {
@@ -1680,21 +1467,21 @@ function dt(t, n) {
 		return r.filter((e) => {
 			if (n.includes(e.id)) return !1;
 			let r = e.rect;
-			return t.horizontal ? z(t.a.x, t.b.x, r.left, r.right) >= Z && t.a.y >= r.top - 2 && t.a.y <= r.bottom + 2 : z(t.a.y, t.b.y, r.top, r.bottom) >= Z && t.a.x >= r.left - 2 && t.a.x <= r.right + 2;
+			return t.horizontal ? C(t.a.x, t.b.x, r.left, r.right) >= X && t.a.y >= r.top - 2 && t.a.y <= r.bottom + 2 : C(t.a.y, t.b.y, r.top, r.bottom) >= X && t.a.x >= r.left - 2 && t.a.x <= r.right + 2;
 		});
 	}, "blockingRectsFor"), u = /* @__PURE__ */ e((e, t, n) => {
 		let r = e.map((e) => ({ ...e }));
 		if (t.horizontal) r[t.index].y = n, r[t.index + 1].y = n;
 		else if (t.vertical) r[t.index].x = n, r[t.index + 1].x = n;
 		else return;
-		let i = Se(H(r));
-		return Q(i).length === i.length - 1 ? i : void 0;
+		let i = G(D(r));
+		return Z(i).length === i.length - 1 ? i : void 0;
 	}, "candidateByMovingRail"), d = /* @__PURE__ */ e((e, t, n) => {
-		let c = [e.start, e.end].filter((e) => !!e), l = Q(t);
+		let c = [e.start, e.end].filter((e) => !!e), l = Z(t);
 		if (l.length !== t.length - 1) return !1;
-		for (let e of l) if (J(e.a, e.b, r, c, -2) || J(e.a, e.b, i, [], -2)) return !1;
+		for (let e of l) if (B(e.a, e.b, r, c, -2) || B(e.a, e.b, i, [], -2)) return !1;
 		for (let t of a) if (t !== e) {
-			for (let e of l) for (let n of Q(o(t))) if (B(e, n, .5) >= Z) return !1;
+			for (let e of l) for (let n of Z(o(t))) if (w(e, n, .5) >= X) return !1;
 		}
 		return s(e, t) <= n;
 	}, "candidateIsSafe");
@@ -1718,8 +1505,8 @@ function dt(t, n) {
 		if (!t) return;
 	}
 }
-e(dt, "liftObstacleHuggingSameSideRails");
-function ft(t, n) {
+e(qe, "liftObstacleHuggingSameSideRails");
+function Je(t, n) {
 	let r = /* @__PURE__ */ e((e) => {
 		let t = e.groupTitleRect;
 		if (!(!t || typeof t.left != "number" || typeof t.right != "number" || typeof t.top != "number" || typeof t.bottom != "number" || !Number.isFinite(t.left) || !Number.isFinite(t.right) || !Number.isFinite(t.top) || !Number.isFinite(t.bottom) || t.right <= t.left || t.bottom <= t.top)) return {
@@ -1742,16 +1529,16 @@ function ft(t, n) {
 	}, "topLaneTitleFor"), a = /* @__PURE__ */ e((e, t) => {
 		if (!e.horizontal) return !1;
 		let n = e.a.y;
-		return n <= t.top + X || n >= t.bottom - X ? !1 : z(e.a.x, e.b.x, t.left, t.right) >= Z;
+		return n <= t.top + Y || n >= t.bottom - Y ? !1 : C(e.a.x, e.b.x, t.left, t.right) >= X;
 	}, "horizontalSegmentIntersectsTitle"), o = [...n.values()].map(i).filter((e) => !!e);
 	if (o.length === 0) return;
 	let s = 0;
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
-		let t = H(e.points ?? []);
-		for (let e of Q(t)) for (let t of o) a(e, t.rect) && (s = Math.max(s, t.rect.bottom - e.a.y + 4));
+		let t = D(e.points ?? []);
+		for (let e of Z(t)) for (let t of o) a(e, t.rect) && (s = Math.max(s, t.rect.bottom - e.a.y + 4));
 	}
-	if (!(s <= X)) for (let e of o) {
+	if (!(s <= Y)) for (let e of o) {
 		let t = e.node.y, n = e.node.height;
 		typeof t != "number" || typeof n != "number" || !Number.isFinite(t) || !Number.isFinite(n) || n <= 0 || (e.node.y = t - s / 2, e.node.height = n + s, e.node.groupTitleRect = {
 			...e.rect,
@@ -1760,8 +1547,8 @@ function ft(t, n) {
 		});
 	}
 }
-e(ft, "liftTopLaneTitleBandsAboveRails");
-function pt(t, n) {
+e(Je, "liftTopLaneTitleBandsAboveRails");
+function Ye(t, n) {
 	let r = /* @__PURE__ */ e((e) => {
 		let t = e.groupTitleRect;
 		if (!(!t || typeof t.left != "number" || typeof t.right != "number" || typeof t.top != "number" || typeof t.bottom != "number" || !Number.isFinite(t.left) || !Number.isFinite(t.right) || !Number.isFinite(t.top) || !Number.isFinite(t.bottom) || t.right <= t.left || t.bottom <= t.top)) return {
@@ -1782,24 +1569,24 @@ function pt(t, n) {
 	}, "leftLaneTitleFor"), a = /* @__PURE__ */ e((e, t) => {
 		if (!e.vertical) return !1;
 		let n = e.a.x;
-		return n <= t.left + X || n >= t.right - X ? !1 : z(e.a.y, e.b.y, t.top, t.bottom) >= Z;
+		return n <= t.left + Y || n >= t.right - Y ? !1 : C(e.a.y, e.b.y, t.top, t.bottom) >= X;
 	}, "verticalSegmentIntersectsTitle"), o = /* @__PURE__ */ e((e, t) => {
 		if (!e.horizontal) return !1;
 		let n = e.a.y;
-		return n <= t.top + X || n >= t.bottom - X ? !1 : z(e.a.x, e.b.x, t.left, t.right) >= Z;
+		return n <= t.top + Y || n >= t.bottom - Y ? !1 : C(e.a.x, e.b.x, t.left, t.right) >= X;
 	}, "horizontalSegmentIntersectsTitle"), s = [...n.values()].map(i).filter((e) => !!e);
 	if (s.length === 0) return;
 	let c = 0;
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
-		let t = H(e.points ?? []);
-		for (let e of Q(t)) for (let t of s) if (a(e, t.rect)) c = Math.max(c, t.rect.right - e.a.x + 4);
+		let t = D(e.points ?? []);
+		for (let e of Z(t)) for (let t of s) if (a(e, t.rect)) c = Math.max(c, t.rect.right - e.a.x + 4);
 		else if (o(e, t.rect)) {
 			let n = Math.min(e.a.x, e.b.x);
 			c = Math.max(c, t.rect.right - n + 4);
 		}
 	}
-	if (!(c <= X)) for (let e of s) {
+	if (!(c <= Y)) for (let e of s) {
 		let t = e.node.x, n = e.node.width;
 		typeof t != "number" || typeof n != "number" || !Number.isFinite(t) || !Number.isFinite(n) || n <= 0 || (e.node.x = t - c / 2, e.node.width = n + c, e.node.groupTitleRect = {
 			...e.rect,
@@ -1808,23 +1595,23 @@ function pt(t, n) {
 		});
 	}
 }
-e(pt, "shiftLeftLaneTitleBandsLeftOfRails");
-function mt(t, n) {
-	let { realNodeRects: r } = q(n.values()), i = t.filter((e) => !e.isLayoutOnly), a = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => H(t.get(e) ?? e.points ?? []), "replacementPointsFor"), o = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => {
+e(Ye, "shiftLeftLaneTitleBandsLeftOfRails");
+function Xe(t, n) {
+	let { realNodeRects: r } = z(n.values()), i = t.filter((e) => !e.isLayoutOnly), a = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), o = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => {
 		let t = 0;
 		for (let n = 0; n < i.length; n++) {
-			let r = Q(a(i[n], e));
+			let r = Z(a(i[n], e));
 			for (let o = n + 1; o < i.length; o++) {
-				let n = Q(a(i[o], e));
-				for (let e of r) for (let r of n) _e(e.a, e.b, r.a, r.b, X) && t++;
+				let n = Z(a(i[o], e));
+				for (let e of r) for (let r of n) V(e.a, e.b, r.a, r.b, Y) && t++;
 			}
 		}
 		return t;
-	}, "crossingCount"), s = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => i.reduce((t, n) => t + V(a(n, e)), 0), "totalBends"), c = /* @__PURE__ */ e((e) => {
+	}, "crossingCount"), s = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => i.reduce((t, n) => t + E(a(n, e)), 0), "totalBends"), c = /* @__PURE__ */ e((e) => {
 		let t = a(e);
 		if (t.length < 4) return;
 		let n = t[t.length - 2], r = t[t.length - 1];
-		if (!(!L(n, r, X) && !R(n, r, X))) return {
+		if (!(!x(n, r, Y) && !S(n, r, Y))) return {
 			tailStart: n,
 			terminal: r
 		};
@@ -1832,30 +1619,30 @@ function mt(t, n) {
 		let n = a(e);
 		if (n.length < 3) return;
 		let r = n[0], i = n[1], o;
-		if (L(r, i, X)) o = {
+		if (x(r, i, Y)) o = {
 			x: i.x,
 			y: t.tailStart.y
 		};
-		else if (R(r, i, X)) o = {
+		else if (S(r, i, Y)) o = {
 			x: t.tailStart.x,
 			y: i.y
 		};
 		else return;
-		let s = Se(H([
+		let s = G(D([
 			r,
 			i,
 			o,
 			t.tailStart,
 			t.terminal
 		]));
-		return Q(s).length === s.length - 1 ? s : void 0;
+		return Z(s).length === s.length - 1 ? s : void 0;
 	}, "candidateWithDestinationTail"), u = /* @__PURE__ */ e((e, t) => {
 		let n = [e.start, e.end].filter((e) => !!e);
-		for (let e of Q(t)) if (J(e.a, e.b, r, n, -2)) return !0;
+		for (let e of Z(t)) if (B(e.a, e.b, r, n, -2)) return !0;
 		return !1;
 	}, "pathHasNodeHit"), d = /* @__PURE__ */ e((e, t, n) => {
 		for (let r of i) if (r !== e) {
-			for (let e of Q(t)) for (let t of Q(a(r, n))) if (B(e, t, .5) >= Z) return !0;
+			for (let e of Z(t)) for (let t of Z(a(r, n))) if (w(e, t, .5) >= X) return !0;
 		}
 		return !1;
 	}, "pathHasSharedTrack"), f = /* @__PURE__ */ e((e, t, n) => !u(e, t) && !d(e, t, n), "candidateIsSafe"), p = /* @__PURE__ */ e(() => {
@@ -1886,20 +1673,20 @@ function mt(t, n) {
 		for (let [e, t] of n) e.points = t;
 	}
 }
-e(mt, "swapDestinationTerminalTailsToReduceCrossings");
-function ht(t, n) {
-	let { realNodeRects: r, labelNodeRects: i } = q(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => H(t.get(e) ?? e.points ?? []), "replacementPointsFor"), s = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => {
+e(Xe, "swapDestinationTerminalTailsToReduceCrossings");
+function Ze(t, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), s = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => {
 		let t = 0;
 		for (let n = 0; n < a.length; n++) {
-			let r = Q(o(a[n], e));
+			let r = Z(o(a[n], e));
 			for (let i = n + 1; i < a.length; i++) {
-				let n = Q(o(a[i], e));
-				for (let e of r) for (let r of n) _e(e.a, e.b, r.a, r.b, X) && t++;
+				let n = Z(o(a[i], e));
+				for (let e of r) for (let r of n) V(e.a, e.b, r.a, r.b, Y) && t++;
 			}
 		}
 		return t;
-	}, "strictCrossingCount"), c = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => a.reduce((t, n) => t + V(o(n, e)), 0), "totalBends"), l = /* @__PURE__ */ e((e) => {
-		let t = e.start, r = e.end, i = t ? n.get(t) : void 0, a = r ? n.get(r) : void 0, o = i ? K(i) : void 0, s = a ? K(a) : void 0;
+	}, "strictCrossingCount"), c = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => a.reduce((t, n) => t + E(o(n, e)), 0), "totalBends"), l = /* @__PURE__ */ e((e) => {
+		let t = e.start, r = e.end, i = t ? n.get(t) : void 0, a = r ? n.get(r) : void 0, o = i ? F(i) : void 0, s = a ? F(a) : void 0;
 		return o && s ? {
 			src: o,
 			dst: s
@@ -1909,7 +1696,7 @@ function ht(t, n) {
 		let r = l(e);
 		if (r) {
 			if (n.vertical) {
-				let i = n.a.x, a = Math.min(r.src.left, r.dst.left), o = Math.max(r.src.right, r.dst.right), s = i < a - X ? "left" : i > o + X ? "right" : void 0;
+				let i = n.a.x, a = Math.min(r.src.left, r.dst.left), o = Math.max(r.src.right, r.dst.right), s = i < a - Y ? "left" : i > o + Y ? "right" : void 0;
 				return s ? {
 					edge: e,
 					points: t,
@@ -1922,7 +1709,7 @@ function ht(t, n) {
 				} : void 0;
 			}
 			if (n.horizontal) {
-				let i = n.a.y, a = Math.min(r.src.top, r.dst.top), o = Math.max(r.src.bottom, r.dst.bottom), s = i < a - X ? "top" : i > o + X ? "bottom" : void 0;
+				let i = n.a.y, a = Math.min(r.src.top, r.dst.top), o = Math.max(r.src.bottom, r.dst.bottom), s = i < a - Y ? "top" : i > o + Y ? "bottom" : void 0;
 				return s ? {
 					edge: e,
 					points: t,
@@ -1939,13 +1726,13 @@ function ht(t, n) {
 		let e = [];
 		for (let t of a) {
 			let n = o(t);
-			for (let r of Q(n)) {
+			for (let r of Z(n)) {
 				let i = u(t, n, r);
 				i && e.push(i);
 			}
 		}
 		return e;
-	}, "collectExternalRails"), f = /* @__PURE__ */ e((e, t) => e.edge !== t.edge && e.axis === t.axis && e.side === t.side && z(e.min, e.max, t.min, t.max) >= Z, "railsInteract"), p = /* @__PURE__ */ e((e) => {
+	}, "collectExternalRails"), f = /* @__PURE__ */ e((e, t) => e.edge !== t.edge && e.axis === t.axis && e.side === t.side && C(e.min, e.max, t.min, t.max) >= X, "railsInteract"), p = /* @__PURE__ */ e((e) => {
 		let t = [], n = /* @__PURE__ */ new Set();
 		for (let r of e) {
 			if (n.has(r)) continue;
@@ -1960,7 +1747,7 @@ function ht(t, n) {
 		return t;
 	}, "connectedComponents"), m = /* @__PURE__ */ e((e) => {
 		let t = [];
-		for (let n of e) t.some((e) => Math.abs(e - n.coord) < X) || t.push(n.coord);
+		for (let n of e) t.some((e) => Math.abs(e - n.coord) < Y) || t.push(n.coord);
 		for (; t.length < e.length;) {
 			let n = Math.min(...t), r = Math.max(...t), i = e[0].side;
 			t.push(i === "left" || i === "top" ? n - 12 * (e.length - t.length) : r + 12 * (e.length - t.length));
@@ -1971,7 +1758,7 @@ function ht(t, n) {
 		if (t.length <= 6) {
 			let a = Array(r.length).fill(!1), o = [], s = /* @__PURE__ */ e(() => {
 				if (o.length === t.length) {
-					o.some((e, t) => Math.abs(e - n[t]) >= X) && i.push([...o]);
+					o.some((e, t) => Math.abs(e - n[t]) >= Y) && i.push([...o]);
 					return;
 				}
 				for (let [e, t] of r.entries()) a[e] || (a[e] = !0, o.push(t), s(), o.pop(), a[e] = !1);
@@ -1994,23 +1781,23 @@ function ht(t, n) {
 		}
 		let r = /* @__PURE__ */ new Map();
 		for (let [e, t] of n) {
-			let n = Se(H(t));
-			if (Q(n).length !== n.length - 1) return;
+			let n = G(D(t));
+			if (Z(n).length !== n.length - 1) return;
 			r.set(e, n);
 		}
 		return r;
 	}, "replacementsForAssignment"), _ = /* @__PURE__ */ e((e) => {
 		for (let [t, n] of e) {
 			let e = [t.start, t.end].filter((e) => !!e);
-			for (let t of Q(n)) if (J(t.a, t.b, r, e, -2) || J(t.a, t.b, i, [], -2)) return !1;
+			for (let t of Z(n)) if (B(t.a, t.b, r, e, -2) || B(t.a, t.b, i, [], -2)) return !1;
 		}
 		for (let t = 0; t < a.length; t++) {
-			let n = a[t], r = e.has(n), i = Q(o(n, e));
+			let n = a[t], r = e.has(n), i = Z(o(n, e));
 			for (let n = t + 1; n < a.length; n++) {
 				let t = a[n];
 				if (!r && !e.has(t)) continue;
-				let s = Q(o(t, e));
-				for (let e of i) for (let t of s) if (B(e, t, .5) >= Z) return !1;
+				let s = Z(o(t, e));
+				for (let e of i) for (let t of s) if (w(e, t, .5) >= X) return !1;
 			}
 		}
 		return !0;
@@ -2031,43 +1818,43 @@ function ht(t, n) {
 		for (let [e, n] of t) e.points = n;
 	}
 }
-e(ht, "reassignCrossingExternalRailChannels");
-function gt(t, n) {
-	let { realNodeRects: r, labelNodeRects: i } = q(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t, n) => H(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ e((e) => Q(e).reduce((e, t) => {
+e(Ze, "reassignCrossingExternalRailChannels");
+function Qe(t, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = t.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ e((e, t, n) => D(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ e((e) => Z(e).reduce((e, t) => {
 		let n = t.a.x - t.b.x, r = t.a.y - t.b.y;
 		return e + Math.hypot(n, r);
 	}, 0), "pathLength"), c = /* @__PURE__ */ e((e, t) => {
 		let n = 0;
 		for (let r = 0; r < a.length; r++) {
-			let i = Q(o(a[r], e, t));
+			let i = Z(o(a[r], e, t));
 			for (let s = r + 1; s < a.length; s++) {
-				let r = Q(o(a[s], e, t));
-				for (let e of i) for (let t of r) _e(e.a, e.b, t.a, t.b, X) && n++;
+				let r = Z(o(a[s], e, t));
+				for (let e of i) for (let t of r) V(e.a, e.b, t.a, t.b, Y) && n++;
 			}
 		}
 		return n;
 	}, "strictCrossingCount"), l = /* @__PURE__ */ e((e, t) => {
 		if (e.horizontal) {
 			let n = e.a.y;
-			return (Math.abs(n - t.top) < 1 || Math.abs(n - t.bottom) < 1) && z(e.a.x, e.b.x, t.left, t.right) >= Z;
+			return (Math.abs(n - t.top) < 1 || Math.abs(n - t.bottom) < 1) && C(e.a.x, e.b.x, t.left, t.right) >= X;
 		}
 		if (e.vertical) {
 			let n = e.a.x;
-			return (Math.abs(n - t.left) < 1 || Math.abs(n - t.right) < 1) && z(e.a.y, e.b.y, t.top, t.bottom) >= Z;
+			return (Math.abs(n - t.left) < 1 || Math.abs(n - t.right) < 1) && C(e.a.y, e.b.y, t.top, t.bottom) >= X;
 		}
 		return !1;
 	}, "segmentRunsAlongRectBorder"), u = /* @__PURE__ */ e((e) => {
 		let t = [e.start, e.end].filter((e) => !!e), r = [];
 		for (let e of t) {
-			let t = n.get(e), i = t ? K(t) : void 0;
+			let t = n.get(e), i = t ? F(t) : void 0;
 			i && r.push(i);
 		}
 		return r;
 	}, "endpointRectsFor"), d = /* @__PURE__ */ e((e, t) => {
 		if (t + 3 >= e.length) return [];
-		let n = e[t], r = e[t + 1], i = e[t + 2], a = e[t + 3], o = L(n, r, X) && R(r, i, X) && L(i, a, X), s = R(n, r, X) && L(r, i, X) && R(i, a, X);
+		let n = e[t], r = e[t + 1], i = e[t + 2], a = e[t + 3], o = x(n, r, Y) && S(r, i, Y) && x(i, a, Y), s = S(n, r, Y) && x(r, i, Y) && S(i, a, Y);
 		if (!o && !s || !(o ? Math.sign(r.x - n.x) !== Math.sign(a.x - i.x) : Math.sign(r.y - n.y) !== Math.sign(a.y - i.y))) return [];
-		let c = F(n, a, X) || I(n, a, X) ? [] : [{
+		let c = y(n, a, Y) || b(n, a, Y) ? [] : [{
 			x: n.x,
 			y: a.y
 		}, {
@@ -2078,26 +1865,26 @@ function gt(t, n) {
 			n,
 			...e.slice(t + 3)
 		]), u = /* @__PURE__ */ new Set();
-		return l.map((e) => Se(H(e))).filter((e) => {
-			if (Q(e).length !== e.length - 1 || !e.some((e) => P(e, a, X))) return !1;
+		return l.map((e) => G(D(e))).filter((e) => {
+			if (Z(e).length !== e.length - 1 || !e.some((e) => v(e, a, Y))) return !1;
 			let t = e.map((e) => `${e.x.toFixed(3)},${e.y.toFixed(3)}`).join("|");
 			return !u.has(t) && (u.add(t), !0);
 		});
 	}, "shortcutCandidatesAt"), f = /* @__PURE__ */ e((e, t, n) => {
 		let s = [e.start, e.end].filter((e) => !!e), d = u(e);
-		for (let e of Q(t)) if (J(e.a, e.b, r, s, -2) || J(e.a, e.b, i, [], -2) || d.some((t) => l(e, t))) return !1;
+		for (let e of Z(t)) if (B(e.a, e.b, r, s, -2) || B(e.a, e.b, i, [], -2) || d.some((t) => l(e, t))) return !1;
 		for (let n of a) if (n !== e) {
-			for (let e of Q(t)) for (let t of Q(o(n))) if (B(e, t, .5) >= Z) return !1;
+			for (let e of Z(t)) for (let t of Z(o(n))) if (w(e, t, .5) >= X) return !1;
 		}
 		return c(e, t) <= n;
 	}, "candidateIsSafe");
 	for (let e = 0; e < 8; e++) {
 		let e = c(), t, n, r = e, i = Infinity, l = Infinity;
 		for (let u of a) {
-			let a = o(u), p = V(a, X), m = s(a);
+			let a = o(u), p = E(a, Y), m = s(a);
 			for (let o = 0; o <= a.length - 4; o++) for (let h of d(a, o)) {
-				let a = V(h, X), o = s(h);
-				if (!(a < p || a === p && o < m - X) || !f(u, h, e)) continue;
+				let a = E(h, Y), o = s(h);
+				if (!(a < p || a === p && o < m - Y) || !f(u, h, e)) continue;
 				let d = c(u, h);
 				d > r || d === r && (a > i || a === i && o >= l) || (t = u, n = h, r = d, i = a, l = o);
 			}
@@ -2106,12 +1893,12 @@ function gt(t, n) {
 		t.points = n;
 	}
 }
-e(gt, "shortcutRedundantOrthogonalJogs");
-function _t(t, n) {
+e(Qe, "shortcutRedundantOrthogonalJogs");
+function $e(t, n) {
 	let r = [];
 	for (let e of n.values()) {
 		if (e.isGroup || e.isEdgeLabel) continue;
-		let t = e.x ?? 0, n = e.y ?? 0, i = K(e);
+		let t = e.x ?? 0, n = e.y ?? 0, i = F(e);
 		i && r.push({
 			id: String(e.id ?? ""),
 			cx: t,
@@ -2137,11 +1924,11 @@ function _t(t, n) {
 		let t = e === "left" || e === "top" ? -1 : 1, n = [];
 		for (let r = 0; r <= 2; r++) n.push(s[e] + t * 20 * r);
 		return n;
-	}, "outwardTracksForSide"), d = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => H(t.get(e) ?? e.points ?? []), "replacementPointsFor"), f = /* @__PURE__ */ e((e, t) => {
+	}, "outwardTracksForSide"), d = /* @__PURE__ */ e((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), f = /* @__PURE__ */ e((e, t) => {
 		let n = 0;
-		for (let r of e) for (let e of t) _e(r.a, r.b, e.a, e.b, X) && n++;
+		for (let r of e) for (let e of t) V(r.a, r.b, e.a, e.b, Y) && n++;
 		return n;
-	}, "crossingCountBetweenSegments"), p = /* @__PURE__ */ e((e, t) => f(Q(e), Q(t)), "crossingCountBetweenPaths"), m = /* @__PURE__ */ e((t = /* @__PURE__ */ new Map()) => {
+	}, "crossingCountBetweenSegments"), p = /* @__PURE__ */ e((e, t) => f(Z(e), Z(t)), "crossingCountBetweenPaths"), m = /* @__PURE__ */ e((t = /* @__PURE__ */ new Map()) => {
 		let n = 0, r = [], i = /* @__PURE__ */ new Set(), a = [], o = /* @__PURE__ */ e((e) => {
 			i.has(e) || (i.add(e), a.push(e));
 		}, "addEdge");
@@ -2208,34 +1995,34 @@ function _t(t, n) {
 		let t = /* @__PURE__ */ new Map();
 		for (let n of e.pairs) t.set(n.first, (t.get(n.first) ?? 0) + n.count), t.set(n.second, (t.get(n.second) ?? 0) + n.count);
 		return t;
-	}, "currentCrossingsByEdge"), x = /* @__PURE__ */ e((e) => e.slice(1).reduce((t, n, r) => {
+	}, "currentCrossingsByEdge"), C = /* @__PURE__ */ e((e) => e.slice(1).reduce((t, n, r) => {
 		let i = e[r];
 		return t + Math.abs(n.x - i.x) + Math.abs(n.y - i.y);
-	}, 0), "pathLength"), S = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + V(d(n, e)), 0), "totalBends"), C = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + x(d(n, e)), 0), "totalLength"), w = /* @__PURE__ */ e((e, t, n = /* @__PURE__ */ new Map()) => {
-		let r = Q(t);
+	}, 0), "pathLength"), T = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + E(d(n, e)), 0), "totalBends"), O = /* @__PURE__ */ e((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + C(d(n, e)), 0), "totalLength"), k = /* @__PURE__ */ e((e, t, n = /* @__PURE__ */ new Map()) => {
+		let r = Z(t);
 		for (let t of c) if (t !== e) {
-			for (let e of r) for (let r of Q(d(t, n))) if (B(e, r, .5) >= Z) return !0;
+			for (let e of r) for (let r of Z(d(t, n))) if (w(e, r, .5) >= X) return !0;
 		}
 		return !1;
-	}, "pathHasSegmentConflict"), T = /* @__PURE__ */ e((e, t) => {
+	}, "pathHasSegmentConflict"), A = /* @__PURE__ */ e((e, t) => {
 		let n = [e.start, e.end].filter((e) => !!e);
-		for (let e of Q(t)) if (J(e.a, e.b, a, n, -2)) return !0;
+		for (let e of Z(t)) if (B(e.a, e.b, a, n, -2)) return !0;
 		return !1;
-	}, "pathHitsNode"), E = /* @__PURE__ */ e((e, t) => {
-		let n = Se(H(t));
-		Q(n).length === n.length - 1 && e.push(n);
-	}, "pushOrthogonalCandidate"), D = /* @__PURE__ */ e((e) => e === "left" || e === "right", "sideIsHorizontal"), O = /* @__PURE__ */ e((e, t, n) => {
+	}, "pathHitsNode"), j = /* @__PURE__ */ e((e, t) => {
+		let n = G(D(t));
+		Z(n).length === n.length - 1 && e.push(n);
+	}, "pushOrthogonalCandidate"), M = /* @__PURE__ */ e((e) => e === "left" || e === "right", "sideIsHorizontal"), N = /* @__PURE__ */ e((e, t, n) => {
 		switch (t) {
 			case "left": return Math.min(e.x, n.x) - 20;
 			case "right": return Math.max(e.x, n.x) + 20;
 			case "top": return Math.min(e.y, n.y) - 20;
 			case "bottom": return Math.max(e.y, n.y) + 20;
 		}
-	}, "localTrackForSameSide"), k = /* @__PURE__ */ e((e, t, n, r) => {
-		let i = n === "left" || n === "top" ? -1 : 1, a = [O(t, n, r), s[n]];
-		for (let o of a) for (let a = 0; a <= 2; a++) E(e, ue(t, n, r, o + i * 20 * a));
-	}, "addSameSideCandidates"), A = /* @__PURE__ */ e((e, t, n, r, i) => {
-		for (let a of u(n)) for (let n of u(i)) E(e, [
+	}, "localTrackForSameSide"), P = /* @__PURE__ */ e((e, t, n, r) => {
+		let i = n === "left" || n === "top" ? -1 : 1, a = [N(t, n, r), s[n]];
+		for (let o of a) for (let a = 0; a <= 2; a++) j(e, L(t, n, r, o + i * 20 * a));
+	}, "addSameSideCandidates"), R = /* @__PURE__ */ e((e, t, n, r, i) => {
+		for (let a of u(n)) for (let n of u(i)) j(e, [
 			t,
 			{
 				x: a,
@@ -2251,8 +2038,8 @@ function _t(t, n) {
 			},
 			r
 		]);
-	}, "addHorizontalToVerticalCandidates"), j = /* @__PURE__ */ e((e, t, n, r, i) => {
-		for (let a of u(n)) for (let n of u(i)) E(e, [
+	}, "addHorizontalToVerticalCandidates"), z = /* @__PURE__ */ e((e, t, n, r, i) => {
+		for (let a of u(n)) for (let n of u(i)) j(e, [
 			t,
 			{
 				x: t.x,
@@ -2268,9 +2055,9 @@ function _t(t, n) {
 			},
 			r
 		]);
-	}, "addVerticalToHorizontalCandidates"), ee = /* @__PURE__ */ e((e, t, n, r, i) => {
+	}, "addVerticalToHorizontalCandidates"), te = /* @__PURE__ */ e((e, t, n, r, i) => {
 		let a = [...u("top"), ...u("bottom")];
-		for (let o of u(n)) for (let n of u(i)) for (let i of a) E(e, [
+		for (let o of u(n)) for (let n of u(i)) for (let i of a) j(e, [
 			t,
 			{
 				x: o,
@@ -2290,9 +2077,9 @@ function _t(t, n) {
 			},
 			r
 		]);
-	}, "addHorizontalPairCandidates"), te = /* @__PURE__ */ e((e, t, n, r, i) => {
+	}, "addHorizontalPairCandidates"), ne = /* @__PURE__ */ e((e, t, n, r, i) => {
 		let a = [...u("left"), ...u("right")];
-		for (let o of u(n)) for (let n of u(i)) for (let i of a) E(e, [
+		for (let o of u(n)) for (let n of u(i)) for (let i of a) j(e, [
 			t,
 			{
 				x: t.x,
@@ -2312,23 +2099,23 @@ function _t(t, n) {
 			},
 			r
 		]);
-	}, "addVerticalPairCandidates"), M = /* @__PURE__ */ e((e) => {
+	}, "addVerticalPairCandidates"), re = /* @__PURE__ */ e((e) => {
 		let t = /* @__PURE__ */ new Set();
-		return e.map((e) => H(e)).filter((e) => {
+		return e.map((e) => D(e)).filter((e) => {
 			let n = e.map((e) => `${e.x.toFixed(3)},${e.y.toFixed(3)}`).join("|");
 			return t.has(n) || e.length < 2 ? !1 : (t.add(n), !0);
 		});
-	}, "dedupeCandidatePaths"), ne = /* @__PURE__ */ e((e, t, n, r) => {
-		let i = [], a = le(e, t, n, r, 20, X);
-		a && E(i, a), t === r && k(i, e, t, n);
-		let o = D(t), s = D(r);
-		return o && !s ? A(i, e, t, n, r) : !o && s ? j(i, e, t, n, r) : o ? ee(i, e, t, n, r) : te(i, e, t, n, r), M(i);
-	}, "buildCandidatesForSides"), N = /* @__PURE__ */ e((e, t, n, r) => {
+	}, "dedupeCandidatePaths"), ie = /* @__PURE__ */ e((e, t, n, r) => {
+		let i = [], a = ee(e, t, n, r, 20, Y);
+		a && j(i, a), t === r && P(i, e, t, n);
+		let o = M(t), s = M(r);
+		return o && !s ? R(i, e, t, n, r) : !o && s ? z(i, e, t, n, r) : o ? te(i, e, t, n, r) : ne(i, e, t, n, r), re(i);
+	}, "buildCandidatesForSides"), ae = /* @__PURE__ */ e((e, t, n, r) => {
 		let i = [...u("left"), ...u("right")], a = [...u("top"), ...u("bottom")];
 		for (let s of o) {
-			let o = ce(r, s), c = s === "top" || s === "bottom" ? u(s) : a;
+			let o = I(r, s), c = s === "top" || s === "bottom" ? u(s) : a;
 			for (let r of i) {
-				E(e, [
+				j(e, [
 					t,
 					n,
 					{
@@ -2341,7 +2128,7 @@ function _t(t, n) {
 					},
 					o
 				]);
-				for (let i of c) E(e, [
+				for (let i of c) j(e, [
 					t,
 					n,
 					{
@@ -2360,12 +2147,12 @@ function _t(t, n) {
 				]);
 			}
 		}
-	}, "addVerticalDepartureOuterTrackCandidates"), P = /* @__PURE__ */ e((e, t, n, r) => {
+	}, "addVerticalDepartureOuterTrackCandidates"), oe = /* @__PURE__ */ e((e, t, n, r) => {
 		let i = [...u("left"), ...u("right")], a = [...u("top"), ...u("bottom")];
 		for (let s of o) {
-			let o = ce(r, s), c = s === "left" || s === "right" ? u(s) : i;
+			let o = I(r, s), c = s === "left" || s === "right" ? u(s) : i;
 			for (let r of a) {
-				E(e, [
+				j(e, [
 					t,
 					n,
 					{
@@ -2378,7 +2165,7 @@ function _t(t, n) {
 					},
 					o
 				]);
-				for (let i of c) E(e, [
+				for (let i of c) j(e, [
 					t,
 					n,
 					{
@@ -2397,88 +2184,88 @@ function _t(t, n) {
 				]);
 			}
 		}
-	}, "addHorizontalDepartureOuterTrackCandidates"), F = /* @__PURE__ */ e((e) => {
+	}, "addHorizontalDepartureOuterTrackCandidates"), H = /* @__PURE__ */ e((e) => {
 		let t = e.start, n = e.end, r = n ? i.get(n) : void 0;
 		if (!t || !r) return [];
-		let a = H(e.points ?? []);
+		let a = D(e.points ?? []);
 		if (a.length < 4) return [];
 		let o = a[0], s = a[1], c = [];
-		return R(o, s, X) ? N(c, o, s, r) : L(o, s, X) && P(c, o, s, r), c;
-	}, "terminalPreservingOuterTrackCandidates"), I = /* @__PURE__ */ e((e) => {
+		return S(o, s, Y) ? ae(c, o, s, r) : x(o, s, Y) && oe(c, o, s, r), c;
+	}, "terminalPreservingOuterTrackCandidates"), U = /* @__PURE__ */ e((e) => {
 		let t = e.start, n = e.end, r = t ? i.get(t) : void 0, a = n ? i.get(n) : void 0;
 		if (!r || !a) return [];
 		let s = [];
 		for (let e of o) {
-			let t = ce(r, e);
-			for (let n of o) s.push(...ne(t, e, ce(a, n), n));
+			let t = I(r, e);
+			for (let n of o) s.push(...ie(t, e, I(a, n), n));
 		}
-		return s.push(...F(e)), s;
-	}, "candidatePathsFor"), z = /* @__PURE__ */ e(() => new Map(c.map((e) => [e, Q(d(e))])), "currentSegmentsByEdge"), re = /* @__PURE__ */ e((e, t, n) => {
+		return s.push(...H(e)), s;
+	}, "candidatePathsFor"), W = /* @__PURE__ */ e(() => new Map(c.map((e) => [e, Z(d(e))])), "currentSegmentsByEdge"), K = /* @__PURE__ */ e((e, t, n) => {
 		let r = /* @__PURE__ */ new Set();
 		for (let i of c) {
 			if (i === e) continue;
-			let a = n.get(i) ?? Q(d(i));
-			t.some((e) => a.some((t) => B(e, t, .5) >= Z)) && r.add(i);
+			let a = n.get(i) ?? Z(d(i));
+			t.some((e) => a.some((t) => w(e, t, .5) >= X)) && r.add(i);
 		}
 		return r;
-	}, "sharedTrackConflictsFor"), ie = /* @__PURE__ */ e((e, t, n, r) => {
+	}, "sharedTrackConflictsFor"), se = /* @__PURE__ */ e((e, t, n, r) => {
 		let i = /* @__PURE__ */ new Set();
-		return I(e).map((e) => Se(H(e))).filter((t) => {
-			if (T(e, t)) return !1;
+		return U(e).map((e) => G(D(e))).filter((t) => {
+			if (A(e, t)) return !1;
 			let n = t.map((e) => `${e.x.toFixed(3)},${e.y.toFixed(3)}`).join("|");
 			return i.has(n) || t.length < 2 ? !1 : (i.add(n), !0);
 		}).map((i) => {
-			let a = Q(i), o = 0;
-			for (let t of c) t !== e && (o += f(a, n.get(t) ?? Q(d(t))));
+			let a = Z(i), o = 0;
+			for (let t of c) t !== e && (o += f(a, n.get(t) ?? Z(d(t))));
 			return {
 				candidate: i,
 				candidateSegments: a,
 				crossings: t.count - (r.get(e) ?? 0) + o,
-				bends: V(i, X),
-				totalBends: V(i),
-				length: x(i)
+				bends: E(i, Y),
+				totalBends: E(i),
+				length: C(i)
 			};
 		}).filter(({ crossings: e }) => e <= t.count).sort((e, t) => e.crossings - t.crossings || e.bends - t.bends || e.length - t.length).slice(0, 48).map((t) => ({
 			path: t.candidate,
 			segments: t.candidateSegments,
-			sharedTrackConflicts: re(e, t.candidateSegments, n),
+			sharedTrackConflicts: K(e, t.candidateSegments, n),
 			totalBends: t.totalBends,
 			length: t.length
 		}));
-	}, "pairCandidatesFor"), ae = /* @__PURE__ */ e((e, t, n, r, i, a) => {
+	}, "pairCandidatesFor"), ce = /* @__PURE__ */ e((e, t, n, r, i, a) => {
 		let o = 0;
 		for (let n of e.pairs) (n.first === t || n.second === t || n.first === r || n.second === r) && (o += n.count);
 		let s = f(n.segments, i.segments);
 		for (let e of c) {
 			if (e === t || e === r) continue;
-			let o = a.get(e) ?? Q(d(e));
+			let o = a.get(e) ?? Z(d(e));
 			s += f(n.segments, o) + f(i.segments, o);
 		}
 		return e.count - o + s;
-	}, "pairCrossingCount"), U = /* @__PURE__ */ e((e, t) => {
+	}, "pairCrossingCount"), le = /* @__PURE__ */ e((e, t) => {
 		for (let n of e.sharedTrackConflicts) if (n !== t) return !1;
 		return !0;
-	}, "conflictsOnlyWith"), W = /* @__PURE__ */ e((e, t) => e.segments.some((e) => t.segments.some((t) => B(e, t, .5) >= Z)), "candidatesShareTrack"), G = /* @__PURE__ */ e((e, t, n, r) => U(t, n.edge) && U(r, e.edge) && !W(t, r), "pairCandidatesAreCompatible"), oe = /* @__PURE__ */ e((e, t, n, r, i) => {
-		let a = ae(e.current, t.edge, n, r.edge, i, e.baseSegments);
+	}, "conflictsOnlyWith"), ue = /* @__PURE__ */ e((e, t) => e.segments.some((e) => t.segments.some((t) => w(e, t, .5) >= X)), "candidatesShareTrack"), de = /* @__PURE__ */ e((e, t, n, r) => le(t, n.edge) && le(r, e.edge) && !ue(t, r), "pairCandidatesAreCompatible"), q = /* @__PURE__ */ e((e, t, n, r, i) => {
+		let a = ce(e.current, t.edge, n, r.edge, i, e.baseSegments);
 		if (!(a >= e.current.count)) return {
 			replacements: /* @__PURE__ */ new Map([[t.edge, n.path], [r.edge, i.path]]),
 			crossings: a,
 			bends: e.currentBends - (e.baseBendsByEdge.get(t.edge) ?? 0) - (e.baseBendsByEdge.get(r.edge) ?? 0) + n.totalBends + i.totalBends,
 			length: e.currentLength - (e.baseLengthByEdge.get(t.edge) ?? 0) - (e.baseLengthByEdge.get(r.edge) ?? 0) + n.length + i.length
 		};
-	}, "scorePairReplacement"), se = /* @__PURE__ */ e((e, t) => e.crossings < t.crossings || e.crossings === t.crossings && (e.bends < t.bends || e.bends === t.bends && e.length < t.length), "pairScoreIsBetter"), de = /* @__PURE__ */ e((e, t, n, r) => {
+	}, "scorePairReplacement"), J = /* @__PURE__ */ e((e, t) => e.crossings < t.crossings || e.crossings === t.crossings && (e.bends < t.bends || e.bends === t.bends && e.length < t.length), "pairScoreIsBetter"), fe = /* @__PURE__ */ e((e, t, n, r) => {
 		let i = r;
 		for (let r of t.candidates) for (let a of n.candidates) {
-			if (!G(t, r, n, a)) continue;
-			let o = oe(e, t, r, n, a);
-			o && se(o, i) && (i = o);
+			if (!de(t, r, n, a)) continue;
+			let o = q(e, t, r, n, a);
+			o && J(o, i) && (i = o);
 		}
 		return i;
-	}, "bestScoreForOptionPair"), q = /* @__PURE__ */ e((e) => {
-		let t = S(), n = C(), r = z(), i = b(e), a = new Map(c.map((e) => [e, V(d(e))])), o = new Map(c.map((e) => [e, x(d(e))])), s = /* @__PURE__ */ new Map(), l = v(e);
+	}, "bestScoreForOptionPair"), pe = /* @__PURE__ */ e((e) => {
+		let t = T(), n = O(), r = W(), i = b(e), a = new Map(c.map((e) => [e, E(d(e))])), o = new Map(c.map((e) => [e, C(d(e))])), s = /* @__PURE__ */ new Map(), l = v(e);
 		for (let t of l) for (let n of t) {
 			if (s.has(n)) continue;
-			let t = ie(n, e, r, i);
+			let t = se(n, e, r, i);
 			t.length > 0 && s.set(n, {
 				edge: n,
 				candidates: t
@@ -2503,7 +2290,7 @@ function _t(t, n) {
 				let t = r[e];
 				for (let i = e + 1; i < r.length; i++) {
 					let e = r[i];
-					!n.has(t.edge) && !n.has(e.edge) || (u = de(f, t, e, u));
+					!n.has(t.edge) && !n.has(e.edge) || (u = fe(f, t, e, u));
 				}
 			}
 		}
@@ -2514,9 +2301,9 @@ function _t(t, n) {
 		if (t === 0) return;
 		let n, r, i = t, a = Infinity;
 		for (let o of e.edges) {
-			let s = V(d(o), X);
-			for (let c of I(o)) {
-				let l = T(o, c), u = !l && w(o, c), d = y(e, o, c), f = V(c, X);
+			let s = E(d(o), Y);
+			for (let c of U(o)) {
+				let l = A(o, c), u = !l && k(o, c), d = y(e, o, c), f = E(c, Y);
 				l || u || (d < t || d === t && f < s) && (d > i || d === i && f >= a || (n = o, r = c, i = d, a = f));
 			}
 		}
@@ -2524,15 +2311,15 @@ function _t(t, n) {
 			n.points = r;
 			continue;
 		}
-		let o = q(e);
+		let o = pe(e);
 		if (!o) return;
 		for (let [e, t] of o) e.points = t;
 	}
 }
-e(_t, "resolveRenderedOrthogonalCrossings");
-var vt = .001, yt = 8;
-function bt(t, n) {
-	let { nodeInfoById: r, realNodeRects: i } = de(n), a = [
+e($e, "resolveRenderedOrthogonalCrossings");
+var et = .001, tt = 8;
+function nt(t, n) {
+	let { nodeInfoById: r, realNodeRects: i } = R(n), a = [
 		"top",
 		"bottom",
 		"left",
@@ -2543,27 +2330,27 @@ function bt(t, n) {
 		left: Math.min(...i.map((e) => e.rect.left)) - 20,
 		right: Math.max(...i.map((e) => e.rect.right)) + 20
 	}, s = /* @__PURE__ */ e((e, t, n, r) => {
-		let i = [], a = le(e, t, n, r, 20, vt);
-		return a && i.push(a), t === r && i.push(ue(e, t, n, o[t])), i;
+		let i = [], a = ee(e, t, n, r, 20, et);
+		return a && i.push(a), t === r && i.push(L(e, t, n, o[t])), i;
 	}, "buildOrthogonalPathCandidates"), c = /* @__PURE__ */ e((e, t) => {
 		for (let n = 0; n < e.length - 1; n++) {
 			let r = e[n], a = e[n + 1];
-			if (J(r, a, i, t, 1)) return !0;
+			if (B(r, a, i, t, 1)) return !0;
 		}
 		return !1;
 	}, "pathHitsNode"), l = /* @__PURE__ */ e((e, n, r = !1) => {
-		let i = 0, a = re(e, vt), o = n.start, s = n.end;
+		let i = 0, a = T(e, et), o = n.start, s = n.end;
 		for (let e of t) {
 			if (e === n || e.isLayoutOnly) continue;
 			let t = e.start, c = e.end;
 			if (!r && o && s && (t === o || t === s || c === o || c === s)) continue;
 			let l = e.points;
-			if (!(!l || l.length < 2)) for (let e of a) for (let t of re(l, vt)) {
-				if (me(e.a, e.b, t.a, t.b, vt, vt)) {
+			if (!(!l || l.length < 2)) for (let e of a) for (let t of T(l, et)) {
+				if (re(e.a, e.b, t.a, t.b, et, et)) {
 					i++;
 					continue;
 				}
-				B(e, t, vt) >= yt && i++;
+				w(e, t, et) >= tt && i++;
 			}
 		}
 		return i;
@@ -2596,7 +2383,7 @@ function bt(t, n) {
 		if (e.isLayoutOnly) continue;
 		let t = e.points;
 		if (!t || t.length < 2) continue;
-		let n = V(t, vt);
+		let n = E(t, et);
 		if (n < 4) continue;
 		let i = e.start, o = e.end;
 		if (!i || !o) continue;
@@ -2605,13 +2392,13 @@ function bt(t, n) {
 		let g = e.id ?? "", _ = l(t, e, !0), v = l(t, e), y, b = _, x = n;
 		for (let t of a) {
 			if (p(i, t, g)) continue;
-			let n = ce(m, t);
+			let n = I(m, t);
 			for (let r of a) {
 				if (p(o, r, g)) continue;
-				let a = ce(h, r);
+				let a = I(h, r);
 				for (let u of s(n, t, a, r)) {
 					if (c(u, [i, o])) continue;
-					let t = V(u, vt);
+					let t = E(u, et);
 					if (_ > 0) {
 						let n = l(u, e, !0);
 						if (n > b || n === b && t >= x) continue;
@@ -2631,27 +2418,27 @@ function bt(t, n) {
 		}
 	}
 }
-e(bt, "simplifyDetouredEdges");
-var xt = .001, St = 10, Ct = 7;
-function wt(e, t) {
+e(nt, "simplifyDetouredEdges");
+var Q = .001, rt = 10, it = 7;
+function at(e, t) {
 	let n = t ? 0 : e.length - 1, r = t ? 1 : -1, i = e[n], a = e[n + r];
 	if (!i || !a) return;
 	let o = a.x - i.x, s = a.y - i.y;
-	if (!(Math.abs(o) + Math.abs(s) < xt)) {
-		if (Math.abs(s) <= xt) {
-			let e = i.x + Math.sign(o) * St;
+	if (!(Math.abs(o) + Math.abs(s) < Q)) {
+		if (Math.abs(s) <= Q) {
+			let e = i.x + Math.sign(o) * rt;
 			return {
 				left: Math.min(i.x, e),
 				right: Math.max(i.x, e),
-				top: i.y - Ct,
-				bottom: i.y + Ct
+				top: i.y - it,
+				bottom: i.y + it
 			};
 		}
-		if (Math.abs(o) <= xt) {
-			let e = i.y + Math.sign(s) * St;
+		if (Math.abs(o) <= Q) {
+			let e = i.y + Math.sign(s) * rt;
 			return {
-				left: i.x - Ct,
-				right: i.x + Ct,
+				left: i.x - it,
+				right: i.x + it,
 				top: Math.min(i.y, e),
 				bottom: Math.max(i.y, e)
 			};
@@ -2664,8 +2451,8 @@ function wt(e, t) {
 		};
 	}
 }
-e(wt, "markerClearanceRectFor");
-function Tt(e) {
+e(at, "markerClearanceRectFor");
+function ot(e) {
 	return {
 		left: Math.min(e.left, e.right),
 		right: Math.max(e.left, e.right),
@@ -2673,13 +2460,13 @@ function Tt(e) {
 		bottom: Math.max(e.top, e.bottom)
 	};
 }
-e(Tt, "normalizeRect");
-function Et(e, t) {
-	let n = H(t);
-	return [wt(n, !0), wt(n, !1)].some((t) => t && G(e, Tt(t)));
+e(ot, "normalizeRect");
+function st(e, t) {
+	let n = D(t);
+	return [at(n, !0), at(n, !1)].some((t) => t && M(e, ot(t)));
 }
-e(Et, "labelOverlapsOwnMarker");
-function Dt(t, n) {
+e(st, "labelOverlapsOwnMarker");
+function ct(t, n) {
 	let r = [];
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
@@ -2694,7 +2481,7 @@ function Dt(t, n) {
 	for (let e of n.values()) {
 		let t = e.isGroup, n = e.parentId;
 		if (t && !n) {
-			let t = K(e);
+			let t = F(e);
 			t && a.push({
 				id: e.id,
 				rect: t
@@ -2702,23 +2489,23 @@ function Dt(t, n) {
 			continue;
 		}
 		if (t || e.isEdgeLabel) continue;
-		let r = K(e);
+		let r = F(e);
 		r && i.push({
 			nodeId: e.id,
 			rect: r
 		});
 	}
 	let o = /* @__PURE__ */ e((e, t) => {
-		let n = oe(t, 3);
-		for (let { nodeId: t, rect: r } of i) if (t !== e && G(n, r)) return !0;
+		let n = N(t, 3);
+		for (let { nodeId: t, rect: r } of i) if (t !== e && M(n, r)) return !0;
 		return !1;
 	}, "labelOverlapsForeignNode"), s = /* @__PURE__ */ e((e, t) => {
-		let n = oe(t, 3);
-		for (let t of r) if (t.edgeId !== e && ae(t.p1, t.p2, n)) return !0;
+		let n = N(t, 3);
+		for (let t of r) if (t.edgeId !== e && k(t.p1, t.p2, n)) return !0;
 		return !1;
 	}, "labelOverlapsForeignEdge"), c = /* @__PURE__ */ e((e, t, n) => o(e, n) || s(t, n), "labelOverlapsAnything"), l = [], u = /* @__PURE__ */ e((e) => {
-		for (let { id: t, rect: n } of a) if (W(n, e)) return t;
-	}, "findContainingLane"), d = /* @__PURE__ */ e((e, t) => l.some((n) => n.labelId !== e && G(t, n.rect)), "overlapsPlacedLabel");
+		for (let { id: t, rect: n } of a) if (j(n, e)) return t;
+	}, "findContainingLane"), d = /* @__PURE__ */ e((e, t) => l.some((n) => n.labelId !== e && M(t, n.rect)), "overlapsPlacedLabel");
 	for (let r of t) {
 		if (r.isLayoutOnly) continue;
 		let t = r.labelNodeId;
@@ -2732,10 +2519,10 @@ function Dt(t, n) {
 		let h = [];
 		for (let e = 0; e < f.length - 1; e++) {
 			let t = f[e], n = f[e + 1], r = Math.abs(t.x - n.x), i = Math.abs(t.y - n.y);
-			r < xt && i < xt || r >= xt && i >= xt || h.push({
+			r < Q && i < Q || r >= Q && i >= Q || h.push({
 				idx: e,
 				length: r + i,
-				orientation: r >= xt ? "horizontal" : "vertical",
+				orientation: r >= Q ? "horizontal" : "vertical",
 				midX: (t.x + n.x) / 2,
 				midY: (t.y + n.y) / 2
 			});
@@ -2762,8 +2549,8 @@ function Dt(t, n) {
 				midX: n.x + (r.x - n.x) * t,
 				midY: n.y + (r.y - n.y) * t
 			};
-		}, "anchorAtT"), w = /* @__PURE__ */ e((e, t, n) => Math.min(n, Math.max(t, e)), "clamp"), T = /* @__PURE__ */ e((e, t) => e.midX >= t.left - xt && e.midX <= t.right + xt && e.midY >= t.top - xt && e.midY <= t.bottom + xt, "pointInsideRectInclusive"), E = /* @__PURE__ */ e((e) => {
-			let t = se(e.midX, e.midY, p, m), n = u(t);
+		}, "anchorAtT"), w = /* @__PURE__ */ e((e, t, n) => Math.min(n, Math.max(t, e)), "clamp"), T = /* @__PURE__ */ e((e, t) => e.midX >= t.left - Q && e.midX <= t.right + Q && e.midY >= t.top - Q && e.midY <= t.bottom + Q, "pointInsideRectInclusive"), E = /* @__PURE__ */ e((e) => {
+			let t = P(e.midX, e.midY, p, m), n = u(t);
 			if (n) return {
 				laneId: n,
 				anchor: e,
@@ -2776,7 +2563,7 @@ function Dt(t, n) {
 			let l = {
 				midX: w(e.midX, i, o),
 				midY: w(e.midY, s, c)
-			}, d = se(l.midX, l.midY, p, m);
+			}, d = P(l.midX, l.midY, p, m);
 			return T(e, d) ? {
 				laneId: r.id,
 				anchor: l,
@@ -2786,11 +2573,11 @@ function Dt(t, n) {
 			let n = (e.orientation === "horizontal" ? p / 2 : m / 2) + 12;
 			if (e === b) {
 				let r = f[e.idx];
-				if (D(e, t, r) + xt < n) return !1;
+				if (D(e, t, r) + Q < n) return !1;
 			}
 			if (e === x) {
 				let r = f[e.idx + 1];
-				if (D(e, t, r) + xt < n) return !1;
+				if (D(e, t, r) + Q < n) return !1;
 			}
 			return !0;
 		}, "labelClearsTerminalEndpoints"), k = /* @__PURE__ */ e((e) => {
@@ -2799,7 +2586,7 @@ function Dt(t, n) {
 				let i = C(e, n);
 				if (!O(e, i)) continue;
 				let a = E(i);
-				if (a && !Et(a.rect, f) && !d(t, a.rect) && !c(t, r.id, a.rect)) return {
+				if (a && !st(a.rect, f) && !d(t, a.rect) && !c(t, r.id, a.rect)) return {
 					laneId: a.laneId,
 					anchor: a.anchor
 				};
@@ -2813,7 +2600,7 @@ function Dt(t, n) {
 				};
 				if (n && !O(e, a)) continue;
 				let c = E(a);
-				if (c && !Et(c.rect, f) && !d(t, c.rect) && !o(t, c.rect) && (i || !s(r.id, c.rect))) return {
+				if (c && !st(c.rect, f) && !d(t, c.rect) && !o(t, c.rect) && (i || !s(r.id, c.rect))) return {
 					laneId: c.laneId,
 					anchor: c.anchor
 				};
@@ -2821,7 +2608,7 @@ function Dt(t, n) {
 		}, "findLaneContainingFallback"), j = k(_) ?? (_.length < h.length ? k(h) : void 0) ?? A(h, !0) ?? A(h, !1) ?? A(h, !1, !0);
 		if (j) {
 			i.x = j.anchor.midX, i.y = j.anchor.midY, i.parentId = j.laneId;
-			let e = se(j.anchor.midX, j.anchor.midY, p, m), n = l.findIndex((e) => e.labelId === t);
+			let e = P(j.anchor.midX, j.anchor.midY, p, m), n = l.findIndex((e) => e.labelId === t);
 			n >= 0 ? l[n] = {
 				labelId: t,
 				rect: e
@@ -2832,14 +2619,14 @@ function Dt(t, n) {
 		}
 	}
 }
-e(Dt, "anchorLabelsToPolyline");
-var Ot = 1e-6, kt = 4, At = 3;
-function jt(e, t) {
+e(ct, "anchorLabelsToPolyline");
+var lt = 1e-6, ut = 4, dt = 3;
+function ft(e, t) {
 	return e < t ? `${e}::${t}` : `${t}::${e}`;
 }
-e(jt, "pairKey");
-function Mt(t, n) {
-	let { nodeInfoById: r, realNodeRects: i } = de(n), a = /* @__PURE__ */ new Map();
+e(ft, "pairKey");
+function pt(t, n) {
+	let { nodeInfoById: r, realNodeRects: i } = R(n), a = /* @__PURE__ */ new Map();
 	for (let e of n) {
 		let t = e.id;
 		if (!e.isGroup && e.isEdgeLabel) {
@@ -2851,7 +2638,7 @@ function Mt(t, n) {
 		}
 	}
 	let o = /* @__PURE__ */ e((n, r, i, o) => {
-		let s = jt(r, i), c = 0, l = /* @__PURE__ */ e((e) => {
+		let s = ft(r, i), c = 0, l = /* @__PURE__ */ e((e) => {
 			if (!e) return;
 			let t = a.get(e);
 			if (!t) return;
@@ -2862,15 +2649,15 @@ function Mt(t, n) {
 		for (let e of t) {
 			if (e === n || e.isLayoutOnly) continue;
 			let t = e.start, r = e.end;
-			!t || !r || jt(t, r) === s && l(e.labelNodeId);
+			!t || !r || ft(t, r) === s && l(e.labelNodeId);
 		}
-		return c > 0 ? c + At : 0;
+		return c > 0 ? c + dt : 0;
 	}, "labelClearanceFor");
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
 		let n = e.points;
-		if (!ie(n, Ot)) continue;
-		let a = pe(e, r, Ot);
+		if (!O(n, lt)) continue;
+		let a = ne(e, r, lt);
 		if (!a) continue;
 		let { srcId: s, dstId: c, srcInfo: l, dstInfo: u, collinearX: d, collinearY: f } = a;
 		if (d === f) continue;
@@ -2894,8 +2681,8 @@ function Mt(t, n) {
 				y: u.cy
 			};
 		}
-		if (J(p, m, i, [s, c], 1)) continue;
-		let h = o(e, s, c, d ? "x" : "y"), g = h > kt ? h : kt, _ = [
+		if (B(p, m, i, [s, c], 1)) continue;
+		let h = o(e, s, c, d ? "x" : "y"), g = h > ut ? h : ut, _ = [
 			0,
 			g,
 			-g
@@ -2905,16 +2692,16 @@ function Mt(t, n) {
 			if (d) {
 				if (r.x += n, a.x += n, r.x <= l.rect.left || r.x >= l.rect.right || a.x <= u.rect.left || a.x >= u.rect.right) continue;
 			} else if (r.y += n, a.y += n, r.y <= l.rect.top || r.y >= l.rect.bottom || a.y <= u.rect.top || a.y >= u.rect.bottom) continue;
-			if (!J(r, a, i, [s, c], 1) && !ge(r, a, t, e, { epsilon: Ot })) {
+			if (!B(r, a, i, [s, c], 1) && !ae(r, a, t, e, { epsilon: lt })) {
 				e.points = [r, a];
 				break;
 			}
 		}
 	}
 }
-e(Mt, "straightenCollinearSiblingDetours");
-function Nt(t, n) {
-	let r = .001, { realNodeRects: i, labelNodeRects: a } = q(n.values()), o = /* @__PURE__ */ e((e, t) => re(t, r).map((n) => ({
+e(pt, "straightenCollinearSiblingDetours");
+function mt(t, n) {
+	let r = .001, { realNodeRects: i, labelNodeRects: a } = z(n.values()), o = /* @__PURE__ */ e((e, t) => T(t, r).map((n) => ({
 		...n,
 		edge: e,
 		interior: n.index >= 1 && n.index <= t.length - 3
@@ -2923,24 +2710,24 @@ function Nt(t, n) {
 		for (let n of t) {
 			if (n.isLayoutOnly) continue;
 			let t = n.points;
-			!t || t.length < 2 || e.push(...o(n, H(t)));
+			!t || t.length < 2 || e.push(...o(n, D(t)));
 		}
 		return e;
-	}, "allSegments"), c = /* @__PURE__ */ e((e, t) => e.horizontal && t.horizontal ? z(e.a.x, e.b.x, t.a.x, t.b.x) >= 8 && Math.abs(e.a.y - t.a.y) < 7 : e.vertical && t.vertical ? z(e.a.y, e.b.y, t.a.y, t.b.y) >= 8 && Math.abs(e.a.x - t.a.x) < 7 : !1, "hasCrowdedParallelTrack"), l = /* @__PURE__ */ e((e, n) => {
+	}, "allSegments"), c = /* @__PURE__ */ e((e, t) => e.horizontal && t.horizontal ? C(e.a.x, e.b.x, t.a.x, t.b.x) >= 8 && Math.abs(e.a.y - t.a.y) < 7 : e.vertical && t.vertical ? C(e.a.y, e.b.y, t.a.y, t.b.y) >= 8 && Math.abs(e.a.x - t.a.x) < 7 : !1, "hasCrowdedParallelTrack"), l = /* @__PURE__ */ e((e, n) => {
 		let s = e.start, l = e.end, u = o(e, n);
 		if (u.length !== n.length - 1) return !1;
 		let d = [s, l].filter((e) => !!e), f = e.labelNodeId ? [e.labelNodeId] : [];
-		for (let e of u) if (J(e.a, e.b, i, d, -2) || J(e.a, e.b, a, f, -2)) return !1;
+		for (let e of u) if (B(e.a, e.b, i, d, -2) || B(e.a, e.b, a, f, -2)) return !1;
 		for (let n of t) {
 			if (n === e || n.isLayoutOnly) continue;
 			let t = n.points;
 			if (!(!t || t.length < 2)) {
-				for (let e of u) for (let i of o(n, H(t))) if (c(e, i) || _e(e.a, e.b, i.a, i.b, r)) return !1;
+				for (let e of u) for (let i of o(n, D(t))) if (c(e, i) || V(e.a, e.b, i.a, i.b, r)) return !1;
 			}
 		}
 		return !0;
 	}, "candidateIsSafe"), u = /* @__PURE__ */ e((e, t) => {
-		let n = H(e.edge.points ?? []);
+		let n = D(e.edge.points ?? []);
 		if (n.length < 4 || e.index >= n.length - 1) return;
 		let r = n.map((e) => ({ ...e }));
 		if (e.horizontal) r[e.index].y += t, r[e.index + 1].y += t;
@@ -2951,9 +2738,9 @@ function Nt(t, n) {
 		x: e.x ?? (t.left + t.right) / 2,
 		y: e.y ?? (t.top + t.bottom) / 2
 	}), "nodeCenter"), f = /* @__PURE__ */ e((e) => {
-		let t = e.edge, r = H(t.points ?? []);
+		let t = e.edge, r = D(t.points ?? []);
 		if (r.length !== 4 || e.index !== 1) return;
-		let i = t.start ? n.get(t.start) : void 0, a = t.end ? n.get(t.end) : void 0, o = i ? K(i) : void 0, s = a ? K(a) : void 0, c = r.slice(e.index + 2);
+		let i = t.start ? n.get(t.start) : void 0, a = t.end ? n.get(t.end) : void 0, o = i ? F(i) : void 0, s = a ? F(a) : void 0, c = r.slice(e.index + 2);
 		if (!(!i || !a || !o || !s || c.length === 0)) return {
 			sourceCenter: d(i, o),
 			targetCenter: d(a, s),
@@ -2964,7 +2751,7 @@ function Nt(t, n) {
 		let s = i.y >= n.y, c = s ? a.bottom : a.top, l = c + (s ? 20 : -20);
 		if (s && e.b.y <= l + r || !s && e.b.y >= l - r) return;
 		let u = e.a.x + t;
-		return H([
+		return D([
 			{
 				x: n.x,
 				y: c
@@ -2987,7 +2774,7 @@ function Nt(t, n) {
 		let s = i.x >= n.x, c = s ? a.right : a.left, l = c + (s ? 20 : -20);
 		if (s && e.b.x <= l + r || !s && e.b.x >= l - r) return;
 		let u = e.a.y + t;
-		return H([
+		return D([
 			{
 				x: c,
 				y: n.y
@@ -3045,25 +2832,25 @@ function Nt(t, n) {
 		if (!t) return;
 	}
 }
-e(Nt, "nudgeSharedInteriorSubpaths");
-function Pt(e, t, n, r) {
+e(mt, "nudgeSharedInteriorSubpaths");
+function ht(e, t, n, r) {
 	let i = t.x - e.x, a = t.y - e.y, o = r.x - n.x, s = r.y - n.y, c = i * s - a * o;
 	if (Math.abs(c) < 1e-10) return !1;
 	let l = n.x - e.x, u = n.y - e.y, d = (l * s - u * o) / c, f = (l * a - u * i) / c, p = .01;
 	return d > p && d < .99 && f > p && f < .99;
 }
-e(Pt, "segmentsIntersect");
-function Ft(e) {
+e(ht, "segmentsIntersect");
+function gt(e) {
 	let n = e.nodes ?? [], r = e.edges ?? [], i = [];
 	if (!r.length || !n.length) return i;
-	let a = fe(n), o = [];
+	let a = te(n), o = [];
 	for (let e of r) {
 		if (e.isLayoutOnly) continue;
 		let t = e.points;
 		if (!t || t.length < 2) continue;
 		let n = e.start, r = e.end, s = e.labelNodeId, c = e.id ?? `${n}->${r}`;
 		for (let e of a) if (e.nodeId !== n && e.nodeId !== r && !(s && e.nodeId === s)) {
-			for (let n = 0; n < t.length - 1; n++) if (ae(t[n], t[n + 1], e, -1)) {
+			for (let n = 0; n < t.length - 1; n++) if (k(t[n], t[n + 1], e, -1)) {
 				i.push({
 					type: "edge-node-overlap",
 					edgeId: c,
@@ -3084,7 +2871,7 @@ function Ft(e) {
 	let s = /* @__PURE__ */ new Set();
 	for (let e = 0; e < o.length; e++) for (let t = e + 1; t < o.length; t++) {
 		let n = o[e], r = o[t];
-		if (n.edgeId !== r.edgeId && n.start !== r.start && n.start !== r.end && n.end !== r.start && n.end !== r.end && Pt(n.p1, n.p2, r.p1, r.p2)) {
+		if (n.edgeId !== r.edgeId && n.start !== r.start && n.start !== r.end && n.end !== r.start && n.end !== r.end && ht(n.p1, n.p2, r.p1, r.p2)) {
 			let e = n.edgeId < r.edgeId ? `${n.edgeId}|${r.edgeId}` : `${r.edgeId}|${n.edgeId}`;
 			s.has(e) || (s.add(e), i.push({
 				type: "edge-edge-crossing",
@@ -3101,26 +2888,26 @@ function Ft(e) {
 	}
 	return i;
 }
-e(Ft, "validateSwimlanesLayout");
-function It(t, n) {
+e(gt, "validateSwimlanesLayout");
+function _t(t, n) {
 	let r = t.nodes ?? [], i = t.edges ?? [], a = r.filter((e) => !e.isGroup);
-	if ((n === "LR" || n === "RL") && a.length > 0 && !nt(t, n) || n === "BT" && a.length > 0 && !tt(t)) return;
+	if ((n === "LR" || n === "RL") && a.length > 0 && !Re(t, n) || n === "BT" && a.length > 0 && !Le(t)) return;
 	for (let e of i) {
 		if (e.isLayoutOnly) continue;
 		let t = e.points;
-		!t || t.length < 2 || (e.points = Se(xe(t)));
+		!t || t.length < 2 || (e.points = G(W(t)));
 	}
-	bt(i, r), Mt(i, r), ot(i, r);
+	nt(i, r), pt(i, r), He(i, r);
 	let o = /* @__PURE__ */ new Map();
 	for (let e of r) o.set(String(e.id), e);
-	Dt(i, o), Oe(i, o), st(i, o), Nt(i, o), lt(i, o), ut(i, o), dt(i, o), mt(i, o);
+	ct(i, o), q(i, o), Ue(i, o), mt(i, o), Ge(i, o), Ke(i, o), qe(i, o), Xe(i, o);
 	let s = /* @__PURE__ */ e(() => {
-		_t(i, o), ht(i, o), gt(i, o), Dt(i, o), qe(i, o), dt(i, o), Dt(i, o), qe(i, o);
+		$e(i, o), Ze(i, o), Qe(i, o), ct(i, o), ke(i, o), qe(i, o), ct(i, o), ke(i, o);
 	}, "finalizeRenderedEdges");
-	s(), Nt(i, o), s(), ft(i, o), pt(i, o), ft(i, o), pt(i, o);
+	s(), mt(i, o), s(), Je(i, o), Ye(i, o), Je(i, o), Ye(i, o);
 }
-e(It, "postProcessSwimlaneLayout");
-function Lt(e) {
+e(_t, "postProcessSwimlaneLayout");
+function vt(e) {
 	let t = new Map(e.nodeById), n = /* @__PURE__ */ new Set(), r = [];
 	for (let i of e.edges) {
 		if (!t.has(i.src) || !t.has(i.dst)) continue;
@@ -3134,36 +2921,36 @@ function Lt(e) {
 		nodeById: t
 	};
 }
-e(Lt, "normalizeGraph");
-function Rt(e, t) {
+e(vt, "normalizeGraph");
+function yt(e, t) {
 	return e.edges.filter((e) => e.dst === t);
 }
-e(Rt, "incoming");
-function zt(e) {
+e(yt, "incoming");
+function bt(e) {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e.nodes) t.set(n, []);
 	for (let n of e.edges) t.get(n.src).push(n.dst);
 	return t;
 }
-e(zt, "buildSuccessorMap");
-function Bt(e) {
-	let t = zt(e);
+e(bt, "buildSuccessorMap");
+function xt(e) {
+	let t = bt(e);
 	for (let e of t.values()) e.sort((e, t) => e.localeCompare(t));
 	return t;
 }
-e(Bt, "buildSortedSuccessorMap");
-function Vt(e) {
+e(xt, "buildSortedSuccessorMap");
+function St(e) {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e.nodes) t.set(n, 0);
 	for (let n of e.edges) t.set(n.dst, (t.get(n.dst) ?? 0) + 1);
 	return t;
 }
-e(Vt, "buildInDegreeMap");
-function Ht(e) {
+e(St, "buildInDegreeMap");
+function Ct(e) {
 	return [...e.entries()].filter(([, e]) => e === 0).map(([e]) => e).sort((e, t) => e.localeCompare(t));
 }
-e(Ht, "sortedZeroInDegreeNodes");
-function Ut(e, t = () => !0) {
+e(Ct, "sortedZeroInDegreeNodes");
+function wt(e, t = () => !0) {
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
 	for (let t of e.nodes) n.set(t, []), r.set(t, []);
 	for (let i of e.edges) t(i) && (r.get(i.src).push(i.dst), n.get(i.dst).push(i.src));
@@ -3172,17 +2959,17 @@ function Ut(e, t = () => !0) {
 		succs: r
 	};
 }
-e(Ut, "buildPredecessorSuccessorMaps");
-function Wt(e, t, n, r) {
+e(wt, "buildPredecessorSuccessorMaps");
+function Tt(e, t, n, r) {
 	let i = 0;
 	for (let t of e.nodes) r?.skipGroups && e.nodeById.get(t)?.isGroup || (i = Math.max(i, n[t] ?? 0));
 	let a = Array.from({ length: i + 1 }, () => []);
 	for (let i of t) r?.skipGroups && e.nodeById.get(i)?.isGroup || a[Math.max(0, n[i] ?? 0)].push(i);
 	return a;
 }
-e(Wt, "buildLayersFromRanks");
-function Gt(e) {
-	let t = Vt(e), n = Ht(t), r = [], i = Bt(e);
+e(Tt, "buildLayersFromRanks");
+function Et(e) {
+	let t = St(e), n = Ct(t), r = [], i = xt(e);
 	for (; n.length;) {
 		let e = n.shift();
 		r.push(e);
@@ -3194,14 +2981,14 @@ function Gt(e) {
 	}
 	return r.length === e.nodes.length ? r : null;
 }
-e(Gt, "topoSortIfAcyclic");
-function Kt(e) {
+e(Et, "topoSortIfAcyclic");
+function Dt(e) {
 	let t = /* @__PURE__ */ new Map(), n = 0;
 	for (let r of e) t.set(r, n), n++;
 	return t;
 }
-e(Kt, "buildLayerIndex");
-function qt(t) {
+e(Dt, "buildLayerIndex");
+function Ot(t) {
 	let n = Array(t.length), r = /* @__PURE__ */ e((e, i) => {
 		if (i - e <= 1) return 0;
 		let a = e + i >> 1, o = r(e, a) + r(a, i), s = e, c = a, l = e;
@@ -3211,9 +2998,9 @@ function qt(t) {
 	}, "count");
 	return r(0, t.length);
 }
-e(qt, "countInversions");
-function Jt(t) {
-	let n = Lt(t), r = /* @__PURE__ */ new Map();
+e(Ot, "countInversions");
+function kt(t) {
+	let n = vt(t), r = /* @__PURE__ */ new Map();
 	for (let e of n.nodes) r.set(e, []);
 	for (let e of n.edges) r.get(e.src).push(e);
 	for (let e of r.values()) e.sort((e, t) => e.dst === t.dst ? e.id.localeCompare(t.id) : e.dst.localeCompare(t.dst));
@@ -3226,9 +3013,9 @@ function Jt(t) {
 			i[e] === 0 ? o(e) : i[e] === 1 && a.push(t);
 		}
 		i[e] = 2;
-	}, "dfs"), s = [...n.nodes].sort((e, t) => e.localeCompare(t));
-	for (let e of s) i[e] === 0 && o(e);
-	let c = new Set(a.map((e) => `${e.id}:${e.src}->${e.dst}`)), l = n.edges.map((e) => c.has(`${e.id}:${e.src}->${e.dst}`) ? {
+	}, "dfs"), s = St(n), c = [...n.nodes.filter((e) => (s.get(e) ?? 0) === 0), ...n.nodes.filter((e) => (s.get(e) ?? 0) !== 0)];
+	for (let e of c) i[e] === 0 && o(e);
+	let l = new Set(a.map((e) => `${e.id}:${e.src}->${e.dst}`)), u = n.edges.map((e) => l.has(`${e.id}:${e.src}->${e.dst}`) ? {
 		id: e.id,
 		src: e.dst,
 		dst: e.src,
@@ -3238,15 +3025,15 @@ function Jt(t) {
 	return {
 		acyclic: {
 			nodes: [...n.nodes],
-			edges: l,
+			edges: u,
 			layout: n.layout,
 			nodeById: new Map(n.nodeById)
 		},
 		reversed: a
 	};
 }
-e(Jt, "removeCycles_DFS");
-function Yt(t) {
+e(kt, "removeCycles_DFS");
+function At(t) {
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ e((e) => {
 		if (n.has(e)) return n.get(e);
 		let i = t.nodeById.get(e);
@@ -3259,46 +3046,46 @@ function Yt(t) {
 	for (let e of t.nodes) r(e);
 	return n;
 }
-e(Yt, "buildTopLaneMap");
-function Xt(e) {
-	let t = Yt(e);
+e(At, "buildTopLaneMap");
+function jt(e) {
+	let t = At(e);
 	return (e) => t.get(e) ?? null;
 }
-e(Xt, "createTopLaneResolver");
-function Zt(e) {
+e(jt, "createTopLaneResolver");
+function Mt(e) {
 	let t = [];
 	for (let n of e.layout.nodes ?? []) n.isGroup && !n.parentId && t.push(n.id);
 	return [...new Set(t)].reverse();
 }
-e(Zt, "buildTopLaneOrder");
-function Qt(e, t) {
-	let n = Zt(e);
+e(Mt, "buildTopLaneOrder");
+function Nt(e, t) {
+	let n = Mt(e);
 	if (!t || t.length === 0) return n;
 	let r = new Set(n), i = /* @__PURE__ */ new Set(), a = [];
 	for (let e of t) !r.has(e) || i.has(e) || (i.add(e), a.push(e));
 	for (let e of n) i.has(e) || a.push(e);
 	return a;
 }
-e(Qt, "resolveTopLaneOrder");
-var $t = { EPSILON: 1e-6 }, en = {
+e(Nt, "resolveTopLaneOrder");
+var Pt = { EPSILON: 1e-6 }, Ft = {
 	GRAVITY_ITERATIONS: 8,
 	MAX_CROSSING_OPTIMIZATION_PASSES: 4,
 	DEFAULT_COMPACT_SINGLE_INPUT: !0
-}, tn = {
+}, It = {
 	DEFAULT_LAYER_GAP: 100,
 	DEFAULT_NODE_GAP: 40
 };
-function nn(t, n) {
-	let r = Lt(t), i = n?.laneOf ?? (() => null), a = n?.rankHint, { preds: o } = Ut(r);
+function Lt(t, n) {
+	let r = vt(t), i = n?.laneOf ?? (() => null), a = n?.rankHint, { preds: o } = wt(r);
 	for (let e of o.values()) e.sort((e, t) => e.localeCompare(t));
-	let s = Gt(r) ?? [...r.nodes].sort((e, t) => e.localeCompare(t)), c = /* @__PURE__ */ new Map();
+	let s = Et(r) ?? [...r.nodes].sort((e, t) => e.localeCompare(t)), c = /* @__PURE__ */ new Map();
 	for (let [e, t] of s.entries()) c.set(t, e);
 	let l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
 	for (let e of r.nodes) u.set(e, []);
 	for (let e of s) {
 		let t = (o.get(e) ?? []).filter((e) => l.has(e));
 		if (t.length > 0) {
-			let n = rn(e, t, {
+			let n = Rt(e, t, {
 				laneOf: i,
 				rankHint: a,
 				topoIndex: c
@@ -3312,9 +3099,9 @@ function nn(t, n) {
 	let f = [...d].sort((e, t) => {
 		let n = c.get(e) ?? 0, r = c.get(t) ?? 0;
 		return n === r ? e.localeCompare(t) : n - r;
-	}), p = an(r), m = /* @__PURE__ */ new Map();
+	}), p = zt(r), m = /* @__PURE__ */ new Map();
 	for (let [e, t] of p.entries()) m.set(e, [...t].sort((e, t) => e.localeCompare(t)));
-	let h = on(m), g = sn(m), _ = /* @__PURE__ */ new Map();
+	let h = Bt(m), g = Vt(m), _ = /* @__PURE__ */ new Map();
 	for (let e of r.nodes) _.set(e, []);
 	for (let e of g) for (let t of e.nodes) {
 		let n = _.get(t);
@@ -3342,8 +3129,8 @@ function nn(t, n) {
 		topologicalOrder: s
 	};
 }
-e(nn, "buildDrivingTree");
-function rn(e, t, n) {
+e(Lt, "buildDrivingTree");
+function Rt(e, t, n) {
 	let r = n.laneOf(e);
 	return [...t].sort((e, t) => {
 		let i = n.laneOf(e), a = n.laneOf(t), o = i != null && i === r;
@@ -3354,15 +3141,15 @@ function rn(e, t, n) {
 		return l === u ? e.localeCompare(t) : l - u;
 	})[0];
 }
-e(rn, "chooseParent");
-function an(e) {
+e(Rt, "chooseParent");
+function zt(e) {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e.nodes) t.set(n, /* @__PURE__ */ new Set());
 	for (let n of e.edges) t.get(n.src).add(n.dst), t.get(n.dst).add(n.src);
 	return t;
 }
-e(an, "buildAdjacency");
-function on(e) {
+e(zt, "buildAdjacency");
+function Bt(e) {
 	let t = /* @__PURE__ */ new Map(), n = 0;
 	for (let r of e.keys()) {
 		if (t.has(r)) continue;
@@ -3378,17 +3165,17 @@ function on(e) {
 	}
 	return t;
 }
-e(on, "assignComponents");
-function sn(t) {
+e(Bt, "assignComponents");
+function Vt(t) {
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = [], a = [], o = 0, s = /* @__PURE__ */ e((e, c) => {
 		n.set(e, ++o), r.set(e, o);
-		for (let l of t.get(e) ?? []) l !== c && (n.has(l) ? (n.get(l) ?? 0) < (n.get(e) ?? 0) && (i.push([e, l]), r.set(e, Math.min(r.get(e) ?? o, n.get(l) ?? o))) : (i.push([e, l]), s(l, e), r.set(e, Math.min(r.get(e) ?? o, r.get(l) ?? o)), (r.get(l) ?? 0) >= (n.get(e) ?? 0) && a.push(cn(e, l, i, a.length))));
+		for (let l of t.get(e) ?? []) l !== c && (n.has(l) ? (n.get(l) ?? 0) < (n.get(e) ?? 0) && (i.push([e, l]), r.set(e, Math.min(r.get(e) ?? o, n.get(l) ?? o))) : (i.push([e, l]), s(l, e), r.set(e, Math.min(r.get(e) ?? o, r.get(l) ?? o)), (r.get(l) ?? 0) >= (n.get(e) ?? 0) && a.push(Ht(e, l, i, a.length))));
 	}, "visit");
 	for (let e of t.keys()) n.has(e) || s(e, null);
 	return a;
 }
-e(sn, "computeBlocks");
-function cn(e, t, n, r) {
+e(Vt, "computeBlocks");
+function Ht(e, t, n, r) {
 	let i = [], a = /* @__PURE__ */ new Set();
 	for (; n.length > 0;) {
 		let r = n.pop();
@@ -3400,8 +3187,8 @@ function cn(e, t, n, r) {
 		nodes: [...a]
 	};
 }
-e(cn, "popBlock");
-function ln(t, n, r) {
+e(Ht, "popBlock");
+function Ut(t, n, r) {
 	let i = [...t.nodes], a = /* @__PURE__ */ new Map();
 	for (let [e, t] of i.entries()) a.set(t, e);
 	let o = i.length, s = Array(o).fill(-1), c = Array(o).fill(0), l = [], u = /* @__PURE__ */ new Set();
@@ -3474,11 +3261,11 @@ function ln(t, n, r) {
 	for (let e of i) _.has(e) || v(e);
 	return h;
 }
-e(ln, "computeSubtreeCrossCounts");
-function un(t, n, r) {
+e(Ut, "computeSubtreeCrossCounts");
+function Wt(t, n, r) {
 	let i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ e((e) => {
 		let t = r[e] ?? 0, o = [...n.get(e) ?? []];
-		o.sort(dn(r));
+		o.sort(Gt(r));
 		for (let e of o) {
 			a(e);
 			let n = i.get(e);
@@ -3489,15 +3276,15 @@ function un(t, n, r) {
 	for (let e of t) a(e);
 	return i;
 }
-e(un, "annotateMinimumLayers");
-function dn(e) {
+e(Wt, "annotateMinimumLayers");
+function Gt(e) {
 	return (t, n) => {
 		let r = e[t] ?? 0, i = e[n] ?? 0;
 		return r === i ? t.localeCompare(n) : r - i;
 	};
 }
-e(dn, "compareByRankThenId");
-function fn(t, n, r, i) {
+e(Gt, "compareByRankThenId");
+function Kt(t, n, r, i) {
 	let a = 0;
 	for (let e of n) {
 		let t = r[e] ?? 0;
@@ -3517,8 +3304,8 @@ function fn(t, n, r, i) {
 	}
 	return o;
 }
-e(fn, "emitNodesInTreeOrder");
-function pn(e) {
+e(Kt, "emitNodesInTreeOrder");
+function qt(e) {
 	let t = [];
 	for (let n of e) {
 		let e = /* @__PURE__ */ new Set(), r = [];
@@ -3527,8 +3314,8 @@ function pn(e) {
 	}
 	return t;
 }
-e(pn, "deduplicateLayers");
-function mn(e, t, n, r) {
+e(qt, "deduplicateLayers");
+function Jt(e, t, n, r) {
 	return (i) => {
 		let a = e.get(i) ?? [];
 		if (a.length === 0) return [];
@@ -3548,24 +3335,24 @@ function mn(e, t, n, r) {
 		}), [...s.map((e) => e.child), ...c];
 	};
 }
-e(mn, "createChildOrderer");
-function hn(e, t, n) {
-	let r = nn(e, {
+e(Jt, "createChildOrderer");
+function Yt(e, t, n) {
+	let r = Lt(e, {
 		rankHint: t,
 		laneOf: n
 	}), { children: i, roots: a } = r;
 	for (let t of e.nodes) i.has(t) || i.set(t, []);
-	let o = ln(e, t, r), s = [...a].sort(dn(t)), c = mn(i, t, o, un(s, i, t)), l = fn(s, e.nodes, t, c);
-	return l = pn(l), l;
+	let o = Ut(e, t, r), s = [...a].sort(Gt(t)), c = Jt(i, t, o, Wt(s, i, t)), l = Kt(s, e.nodes, t, c);
+	return l = qt(l), l;
 }
-e(hn, "buildMultitreeLayerOrder");
-function gn(e, t, n) {
-	let r = new Set(e), i = new Set(t), a = Kt(t), o = [];
+e(Yt, "buildMultitreeLayerOrder");
+function Xt(e, t, n) {
+	let r = new Set(e), i = new Set(t), a = Dt(t), o = [];
 	for (let e of n) r.has(e.src) && i.has(e.dst) && o.push(a.get(e.dst));
-	return qt(o);
+	return Ot(o);
 }
-e(gn, "countCrossingsBetweenAdjacent");
-function _n(e, t, n) {
+e(Xt, "countCrossingsBetweenAdjacent");
+function Zt(e, t, n) {
 	let r = [];
 	for (let e of t) {
 		let t = n[e.src], i = n[e.dst];
@@ -3580,12 +3367,12 @@ function _n(e, t, n) {
 		});
 	}
 	let i = 0;
-	for (let t = 0; t + 1 < e.length; t++) i += gn(e[t], e[t + 1], r);
+	for (let t = 0; t + 1 < e.length; t++) i += Xt(e[t], e[t + 1], r);
 	return i;
 }
-e(_n, "totalCrossings");
-function vn(e, t) {
-	let n = { ...t }, { preds: r } = Ut(e), i = Xt(e), a = _n(hn(e, n, i), e.edges, n), o = en.MAX_CROSSING_OPTIMIZATION_PASSES;
+e(Zt, "totalCrossings");
+function Qt(e, t) {
+	let n = { ...t }, { preds: r } = wt(e), i = jt(e), a = Zt(Yt(e, n, i), e.edges, n), o = Ft.MAX_CROSSING_OPTIMIZATION_PASSES;
 	for (let t = 0; t < o; t++) {
 		let t = !1, o = [...e.nodes].sort((e, t) => (n[t] ?? 0) - (n[e] ?? 0));
 		for (let s of o) {
@@ -3596,16 +3383,16 @@ function vn(e, t) {
 			if (c >= o) continue;
 			let l = o;
 			n[s] = c;
-			let u = _n(hn(e, n, i), e.edges, n);
+			let u = Zt(Yt(e, n, i), e.edges, n);
 			u < a ? (a = u, t = !0) : n[s] = l;
 		}
 		if (!t) break;
 	}
 	return n;
 }
-e(vn, "optimizeRanksByCrossings");
-function yn(e, t) {
-	let n = Xt(e), r = [...e.nodes].sort((e, n) => (t[e] ?? 0) - (t[n] ?? 0) || e.localeCompare(n));
+e(Qt, "optimizeRanksByCrossings");
+function $t(e, t) {
+	let n = jt(e), r = [...e.nodes].sort((e, n) => (t[e] ?? 0) - (t[n] ?? 0) || e.localeCompare(n));
 	for (let i of r) {
 		let r = n(i);
 		if (!r) continue;
@@ -3630,11 +3417,11 @@ function yn(e, t) {
 		p !== u && (t[i] = p);
 	}
 }
-e(yn, "adjustCrossLaneSources");
-function bn(e, t) {
-	let n = Lt(e), r = Gt(n) ?? [...n.nodes].sort(), i = t?.compactSingleInput ?? !1, a = Xt(n), o = /* @__PURE__ */ Object.create(null);
+e($t, "adjustCrossLaneSources");
+function en(e, t) {
+	let n = vt(e), r = Et(n) ?? [...n.nodes].sort(), i = t?.compactSingleInput ?? !1, a = jt(n), o = /* @__PURE__ */ Object.create(null);
 	for (let e of r) {
-		let r = Rt(n, e), s = t?.ignoreCrossLaneEdges ? r.filter((t) => {
+		let r = yt(n, e), s = t?.ignoreCrossLaneEdges ? r.filter((t) => {
 			let n = a(t.src), r = a(e);
 			return !n || !r || n === r;
 		}) : r;
@@ -3648,30 +3435,30 @@ function bn(e, t) {
 			o[e] = t === -Infinity ? 0 : t;
 		}
 	}
-	return (t?.optimizeRanksByCrossings ?? !1) && (o = vn(n, o)), t?.ignoreCrossLaneEdges && yn(n, o), {
-		layers: hn(n, o, a),
+	return (t?.optimizeRanksByCrossings ?? !1) && (o = Qt(n, o)), t?.ignoreCrossLaneEdges && $t(n, o), {
+		layers: Yt(n, o, a),
 		rankOf: o,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-e(bn, "assignLayers_LongestPath");
-function xn(t, n) {
-	let r = Lt(t), i = { ...bn(r, {
+e(en, "assignLayers_LongestPath");
+function tn(t, n) {
+	let r = vt(t), i = { ...en(r, {
 		compactSingleInput: n?.compactSingleInput,
 		ignoreCrossLaneEdges: n?.ignoreCrossLaneEdges,
 		optimizeRanksByCrossings: n?.optimizeRanksByCrossings
-	}).rankOf }, a = Xt(r), { preds: o, succs: s } = Ut(r, (e) => {
+	}).rankOf }, a = jt(r), { preds: o, succs: s } = wt(r, (e) => {
 		if (n?.ignoreCrossLaneEdges) {
 			let t = a(e.src), n = a(e.dst);
 			if (t && n && t !== n) return !1;
 		}
 		return !0;
-	}), c = Gt(r) ?? [...r.nodes], l = [...c].reverse(), u = /* @__PURE__ */ e((e, t) => {
+	}), c = Et(r) ?? [...r.nodes], l = [...c].reverse(), u = /* @__PURE__ */ e((e, t) => {
 		let n = 0;
 		for (let t of o.get(e) ?? []) n = Math.max(n, (i[t] ?? 0) + 1);
 		let r = Infinity, a = s.get(e) ?? [];
 		return a.length > 0 && (r = Math.min(...a.map((e) => (i[e] ?? 0) - 1))), Number.isFinite(r) || (r = Math.max(n, t)), Math.min(Math.max(t, n), r);
-	}, "clampFeasible"), d = en.GRAVITY_ITERATIONS, f = /* @__PURE__ */ e((e) => {
+	}, "clampFeasible"), d = Ft.GRAVITY_ITERATIONS, f = /* @__PURE__ */ e((e) => {
 		let t = !1;
 		for (let n of e) {
 			let e = o.get(n) ?? [], r = s.get(n) ?? [];
@@ -3698,14 +3485,14 @@ function xn(t, n) {
 		}
 	}
 	return {
-		layers: Wt(r, c, i),
+		layers: Tt(r, c, i),
 		rankOf: i,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-e(xn, "assignLayers_Gravity");
-function Sn(e) {
-	let t = Vt(e), n = Bt(e), r = Ht(t), i = [];
+e(tn, "assignLayers_Gravity");
+function nn(e) {
+	let t = St(e), n = xt(e), r = Ct(t), i = [];
 	for (; r.length > 0;) {
 		let e = [];
 		for (let a of r) {
@@ -3716,12 +3503,12 @@ function Sn(e) {
 	}
 	return i.length === e.nodes.length ? i : null;
 }
-e(Sn, "topoSortByGenerationIfAcyclic");
-function Cn(t, n) {
-	let r = Lt(t), i = n?.direction === "LR" ? Sn(r) ?? [...r.nodes].sort() : Gt(r) ?? [...r.nodes].sort(), a = Xt(r), o = /* @__PURE__ */ e((e) => a(e) ?? e, "laneOf"), s = /* @__PURE__ */ Object.create(null), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ e((e, t) => n?.ignoreCrossLaneEdges ?? !0 ? +(o(e) === o(t)) : 1, "edgeWeight");
+e(nn, "topoSortByGenerationIfAcyclic");
+function rn(t, n) {
+	let r = vt(t), i = n?.direction === "LR" ? nn(r) ?? [...r.nodes].sort() : Et(r) ?? [...r.nodes].sort(), a = jt(r), o = /* @__PURE__ */ e((e) => a(e) ?? e, "laneOf"), s = /* @__PURE__ */ Object.create(null), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ e((e, t) => n?.ignoreCrossLaneEdges ?? !0 ? +(o(e) === o(t)) : 1, "edgeWeight");
 	for (let e of i) {
 		if (r.nodeById.get(e)?.isGroup) continue;
-		let t = Rt(r, e), n = 0;
+		let t = yt(r, e), n = 0;
 		if (t.length > 0) for (let r of t) {
 			let t = r.src, i = s[t] ?? 0;
 			n = Math.max(n, i + l(t, e));
@@ -3730,14 +3517,14 @@ function Cn(t, n) {
 		s[e] = u, c.set(i, u + 1);
 	}
 	return {
-		layers: Wt(r, i, s, { skipGroups: !0 }),
+		layers: Tt(r, i, s, { skipGroups: !0 }),
 		rankOf: s,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-e(Cn, "assignLayers_LaneAwareCompact");
-function wn(t, n) {
-	let r = Lt(n), { rankOf: i } = t, a = t.layers.map((e) => [...e]), o = new Set(t.dummy ? [...t.dummy] : []), s = 0, c = new Map(r.nodeById), l = /* @__PURE__ */ e((e) => {
+e(rn, "assignLayers_LaneAwareCompact");
+function an(t, n) {
+	let r = vt(n), { rankOf: i } = t, a = t.layers.map((e) => [...e]), o = new Set(t.dummy ? [...t.dummy] : []), s = 0, c = new Map(r.nodeById), l = /* @__PURE__ */ e((e) => {
 		let t = `placeholder-${s++}`, n = {
 			id: t,
 			isGroup: !1,
@@ -3789,49 +3576,49 @@ function wn(t, n) {
 		graphWithDummies: f
 	};
 }
-e(wn, "makeProperLayering");
-function Tn(e) {
+e(an, "makeProperLayering");
+function on(e) {
 	let t = e.length;
 	if (t === 0) return Infinity;
 	let n = [...e].sort((e, t) => e - t);
 	return t % 2 == 1 ? n[(t - 1) / 2] : .5 * (n[t / 2 - 1] + n[t / 2]);
 }
-e(Tn, "median");
-function En(e) {
+e(on, "median");
+function sn(e) {
 	return e.length === 0 ? Infinity : e.reduce((e, t) => e + t, 0) / e.length;
 }
-e(En, "barycenter");
-function Dn(e, t, n, r) {
+e(sn, "barycenter");
+function cn(e, t, n, r) {
 	let i = /* @__PURE__ */ new Map();
 	for (let t of e) i.set(t, []);
 	for (let e of n) r === "down" ? t.has(e.src) && i.has(e.dst) && i.get(e.dst).push(t.get(e.src)) : t.has(e.dst) && i.has(e.src) && i.get(e.src).push(t.get(e.dst));
 	return i;
 }
-e(Dn, "neighborPositionsFor");
-function On(e, t, n) {
+e(cn, "neighborPositionsFor");
+function ln(e, t, n) {
 	let r = n.get(e) ?? 0, i = n.get(t) ?? 0;
 	return r === i ? e.localeCompare(t) : r - i;
 }
-e(On, "currentOrderTieBreak");
-function kn(e, t, n) {
-	let r = new Set(e), i = new Set(t), a = Kt(e), o = Kt(t), s = [];
+e(ln, "currentOrderTieBreak");
+function un(e, t, n) {
+	let r = new Set(e), i = new Set(t), a = Dt(e), o = Dt(t), s = [];
 	for (let e of n) r.has(e.src) && i.has(e.dst) && s.push({
 		u: a.get(e.src),
 		v: o.get(e.dst)
 	});
-	return s.sort((e, t) => e.u === t.u ? e.v - t.v : e.u - t.u), qt(s.map((e) => e.v));
+	return s.sort((e, t) => e.u === t.u ? e.v - t.v : e.u - t.u), Ot(s.map((e) => e.v));
 }
-e(kn, "countCrossingsBetweenAdjacent");
-function An(e, t, n) {
+e(un, "countCrossingsBetweenAdjacent");
+function dn(e, t, n) {
 	return [...e].sort((e, r) => {
-		let i = Tn(t.get(e) ?? []), a = Tn(t.get(r) ?? []);
-		return i === a ? On(e, r, n) : isFinite(i) ? isFinite(a) ? i - a : -1 : 1;
+		let i = on(t.get(e) ?? []), a = on(t.get(r) ?? []);
+		return i === a ? ln(e, r, n) : isFinite(i) ? isFinite(a) ? i - a : -1 : 1;
 	});
 }
-e(An, "sortByHeuristic");
-function jn(e, t, n, r, i, a) {
-	let o = Kt(e), s = Kt(t), c = Dn(t, o, n, r);
-	if (!i || !a || a.length === 0) return An(t, c, s);
+e(dn, "sortByHeuristic");
+function fn(e, t, n, r, i, a) {
+	let o = Dt(e), s = Dt(t), c = cn(t, o, n, r);
+	if (!i || !a || a.length === 0) return dn(t, c, s);
 	let l = /* @__PURE__ */ new Map();
 	for (let e of t) {
 		let t = i(e), n = l.get(t) ?? [];
@@ -3841,16 +3628,16 @@ function jn(e, t, n, r, i, a) {
 	for (let e of a) {
 		let t = l.get(e);
 		if (!t || t.length === 0) continue;
-		let n = An(t, c, s);
+		let n = dn(t, c, s);
 		u.push(...n);
 	}
 	let d = l.get(null);
 	if (d && d.length > 0) {
-		let e = An(d, c, s);
+		let e = dn(d, c, s);
 		for (let t of e) {
-			let e = En(c.get(t) ?? []), n = u.length;
+			let e = sn(c.get(t) ?? []), n = u.length;
 			if (isFinite(e)) {
-				for (let [t, r] of u.entries()) if (e < En(c.get(r) ?? [])) {
+				for (let [t, r] of u.entries()) if (e < sn(c.get(r) ?? [])) {
 					n = t;
 					break;
 				}
@@ -3860,11 +3647,11 @@ function jn(e, t, n, r, i, a) {
 	}
 	return u;
 }
-e(jn, "reorderLayer");
-function Mn(t, n, r, i, a) {
+e(fn, "reorderLayer");
+function pn(t, n, r, i, a) {
 	let o = [...n], s = new Set(t), c = new Set(n), l = i ? new Set(i) : null, u = r.filter((e) => s.has(e.src) && c.has(e.dst)), d = l ? r.filter((e) => c.has(e.src) && l.has(e.dst)) : void 0, f = /* @__PURE__ */ e((e) => {
-		let n = kn(t, e, u);
-		return d && i && (n += kn(e, i, d)), n;
+		let n = un(t, e, u);
+		return d && i && (n += un(e, i, d)), n;
 	}, "crossingScore"), p = a ? /* @__PURE__ */ new Map() : null;
 	if (a && p) for (let e of n) p.set(e, a(e));
 	let m = !0, h = f(o);
@@ -3880,18 +3667,18 @@ function Mn(t, n, r, i, a) {
 	}
 	return o;
 }
-e(Mn, "transposeImprove");
-function Nn(e, t, n) {
-	let r = e.layers.map((e) => [...e]), i = t.edges, a = Xt(t), o = Qt(t, n?.laneOrder);
+e(pn, "transposeImprove");
+function mn(e, t, n) {
+	let r = e.layers.map((e) => [...e]), i = t.edges, a = jt(t), o = Nt(t, n?.laneOrder);
 	for (let e = 0; e < 3; e++) {
-		for (let e = 1; e < r.length; e++) r[e] = jn(r[e - 1], r[e], i, "down", a, o), r[e] = Mn(r[e - 1], r[e], i, r[e + 1], a);
-		for (let e = r.length - 2; e >= 0; e--) r[e] = jn(r[e + 1], r[e], i, "up", a, o), r[e] = Mn(r[e + 1], r[e], i, r[e - 1], a);
+		for (let e = 1; e < r.length; e++) r[e] = fn(r[e - 1], r[e], i, "down", a, o), r[e] = pn(r[e - 1], r[e], i, r[e + 1], a);
+		for (let e = r.length - 2; e >= 0; e--) r[e] = fn(r[e + 1], r[e], i, "up", a, o), r[e] = pn(r[e + 1], r[e], i, r[e - 1], a);
 	}
 	return { layers: r };
 }
-e(Nn, "orderLayers");
-function Pn(t, n, r) {
-	let i = r?.layerGap ?? tn.DEFAULT_LAYER_GAP, a = r?.nodeGap ?? tn.DEFAULT_NODE_GAP, o = r?.laneGap ?? a * 2, s = r?.direction ?? "TB", c = s === "LR" || s === "RL", l = t.layers, u = /* @__PURE__ */ Object.create(null), d = /* @__PURE__ */ Object.create(null), f = /* @__PURE__ */ e((e) => n.nodeById.get(e), "getNode"), p = /* @__PURE__ */ e((e) => f(e)?.width ?? 0, "getWidth"), m = /* @__PURE__ */ e((e) => f(e)?.height ?? 0, "getHeight"), h = Xt(n), g = Qt(n, r?.laneOrder), _ = l.map((e) => e.reduce((e, t) => Math.max(e, m(t)), 0)), v = [];
+e(mn, "orderLayers");
+function hn(t, n, r) {
+	let i = r?.layerGap ?? It.DEFAULT_LAYER_GAP, a = r?.nodeGap ?? It.DEFAULT_NODE_GAP, o = r?.laneGap ?? a * 2, s = r?.direction ?? "TB", c = s === "LR" || s === "RL", l = t.layers, u = /* @__PURE__ */ Object.create(null), d = /* @__PURE__ */ Object.create(null), f = /* @__PURE__ */ e((e) => n.nodeById.get(e), "getNode"), p = /* @__PURE__ */ e((e) => f(e)?.width ?? 0, "getWidth"), m = /* @__PURE__ */ e((e) => f(e)?.height ?? 0, "getHeight"), h = jt(n), g = Nt(n, r?.laneOrder), _ = l.map((e) => e.reduce((e, t) => Math.max(e, m(t)), 0)), v = [];
 	if (c) for (let e = 0; e + 1 < l.length; e++) {
 		let t = l[e].reduce((e, t) => Math.max(e, p(t)), 0), n = l[e + 1].reduce((e, t) => Math.max(e, p(t)), 0), r = _[e], a = _[e + 1], o = r / 2 + a / 2, s = (t + n) / 2, c = Math.max(0, s - o - i);
 		v.push(c);
@@ -3967,15 +3754,15 @@ function Pn(t, n, r) {
 		y: d
 	};
 }
-e(Pn, "assignCoordinates");
-var Fn = 8;
-function In(e) {
+e(hn, "assignCoordinates");
+var gn = 8;
+function _n(e) {
 	let t = 2166136261;
 	for (let n = 0; n < e.length; n++) t ^= e.charCodeAt(n), t = Math.imul(t, 16777619);
 	return t >>> 0;
 }
-e(In, "hashString");
-function Ln(e) {
+e(_n, "hashString");
+function vn(e) {
 	let t = e >>> 0;
 	return () => {
 		t += 1831565813;
@@ -3983,23 +3770,23 @@ function Ln(e) {
 		return e = Math.imul(e ^ e >>> 15, e | 1), e ^= e + Math.imul(e ^ e >>> 7, e | 61), ((e ^ e >>> 14) >>> 0) / 4294967296;
 	};
 }
-e(Ln, "mulberry32");
-function Rn(e, t) {
-	let n = [...e], r = Ln(t);
+e(vn, "mulberry32");
+function yn(e, t) {
+	let n = [...e], r = vn(t);
 	for (let e = n.length - 1; e > 0; e--) {
 		let t = Math.floor(r() * (e + 1));
 		[n[e], n[t]] = [n[t], n[e]];
 	}
 	return n;
 }
-e(Rn, "deterministicShuffle");
-function zn(e, t) {
+e(yn, "deterministicShuffle");
+function bn(e, t) {
 	let n = 0;
 	for (let [r, i] of e.entries()) n += Math.abs(r - (t.get(i) ?? r));
 	return n;
 }
-e(zn, "sourceDistance");
-function Bn(e, t) {
+e(bn, "sourceDistance");
+function xn(e, t) {
 	let n = /* @__PURE__ */ new Map();
 	for (let [t, r] of e.entries()) n.set(r, t);
 	let r = 0;
@@ -4009,11 +3796,11 @@ function Bn(e, t) {
 	}
 	return r;
 }
-e(Bn, "laneArrangementCost");
-function Vn(e) {
-	let t = Zt(e);
+e(xn, "laneArrangementCost");
+function Sn(e) {
+	let t = Mt(e);
 	if (t.length < 2) return [];
-	let n = new Map(t.map((e, t) => [e, t])), r = Xt(e), i = /* @__PURE__ */ new Map();
+	let n = new Map(t.map((e, t) => [e, t])), r = jt(e), i = /* @__PURE__ */ new Map();
 	for (let t of e.layout.edges ?? []) {
 		if (t.isLayoutOnly) continue;
 		let a = typeof t.start == "string" ? t.start : void 0, o = typeof t.end == "string" ? t.end : void 0;
@@ -4031,56 +3818,56 @@ function Vn(e) {
 	}
 	return [...i.values()];
 }
-e(Vn, "buildWeightedLaneEdges");
-function Hn(e, t, n) {
-	let r = [...e], i = Bn(r, t), a = !0, o = 0, s = Math.max(1, r.length);
+e(Sn, "buildWeightedLaneEdges");
+function Cn(e, t, n) {
+	let r = [...e], i = xn(r, t), a = !0, o = 0, s = Math.max(1, r.length);
 	for (; a && o < s;) {
 		a = !1, o++;
 		for (let e = 0; e + 1 < r.length; e++) {
 			[r[e], r[e + 1]] = [r[e + 1], r[e]];
-			let n = Bn(r, t);
+			let n = xn(r, t);
 			n < i ? (i = n, a = !0) : [r[e], r[e + 1]] = [r[e + 1], r[e]];
 		}
 	}
 	return {
 		order: r,
 		cost: i,
-		sourceDistance: zn(r, n)
+		sourceDistance: bn(r, n)
 	};
 }
-e(Hn, "greedySwitch");
-function Un(e, t) {
+e(Cn, "greedySwitch");
+function wn(e, t) {
 	return e.cost === t.cost ? e.sourceDistance < t.sourceDistance : e.cost < t.cost;
 }
-e(Un, "isBetterCandidate");
-function Wn(e, t, n) {
+e(wn, "isBetterCandidate");
+function Tn(e, t, n) {
 	let r = [...t].sort((e, t) => e.a === t.a ? e.b.localeCompare(t.b) : e.a.localeCompare(t.a)).map(({ a: e, b: t, weight: n }) => `${e}:${t}:${n}`).join("|");
-	return In(`${e.join("|")}#${r}#${n}`);
+	return _n(`${e.join("|")}#${r}#${n}`);
 }
-e(Wn, "seedForRestart");
-function Gn(e, t = {}) {
-	let n = Zt(e);
+e(Tn, "seedForRestart");
+function En(e, t = {}) {
+	let n = Mt(e);
 	if (n.length < 2) return n;
-	let r = Vn(e);
+	let r = Sn(e);
 	if (r.length === 0) return n;
-	let i = new Map(n.map((e, t) => [e, t])), a = Hn(n, r, i), o = Math.max(0, t.restarts ?? Fn);
+	let i = new Map(n.map((e, t) => [e, t])), a = Cn(n, r, i), o = Math.max(0, t.restarts ?? gn);
 	for (let e = 0; e < o; e++) {
-		let t = Hn(Rn(n, Wn(n, r, e)), r, i);
-		Un(t, a) && (a = t);
+		let t = Cn(yn(n, Tn(n, r, e)), r, i);
+		wn(t, a) && (a = t);
 	}
 	return a.order;
 }
-e(Gn, "optimizeTopLaneOrder");
-function Kn(e, t) {
-	let n = t?.ignoreCrossLaneEdges ?? !0, r = t?.optimizeRanksByCrossings ?? !0, i = Lt(e), a = t?.automaticLaneOrdering ? Gn(i, { restarts: Fn }) : void 0, o = Jt(i), s = o.acyclic, { layering: c, graphWithDummies: l } = wn(n ? Cn(s, {
-		compactSingleInput: t?.compactSingleInput ?? en.DEFAULT_COMPACT_SINGLE_INPUT,
+e(En, "optimizeTopLaneOrder");
+function Dn(e, t) {
+	let n = t?.ignoreCrossLaneEdges ?? !0, r = t?.optimizeRanksByCrossings ?? !0, i = vt(e), a = t?.automaticLaneOrdering ? En(i, { restarts: gn }) : void 0, o = kt(i), s = o.acyclic, { layering: c, graphWithDummies: l } = an(n ? rn(s, {
+		compactSingleInput: t?.compactSingleInput ?? Ft.DEFAULT_COMPACT_SINGLE_INPUT,
 		ignoreCrossLaneEdges: !0,
 		direction: t?.direction
-	}) : xn(s, {
-		compactSingleInput: t?.compactSingleInput ?? en.DEFAULT_COMPACT_SINGLE_INPUT,
+	}) : tn(s, {
+		compactSingleInput: t?.compactSingleInput ?? Ft.DEFAULT_COMPACT_SINGLE_INPUT,
 		ignoreCrossLaneEdges: !1,
 		optimizeRanksByCrossings: r
-	}), s), u = Nn(c, l, { laneOrder: a }), d = Pn(u, l, {
+	}), s), u = mn(c, l, { laneOrder: a }), d = hn(u, l, {
 		layerGap: t?.layerGap,
 		nodeGap: t?.nodeGap,
 		direction: t?.direction,
@@ -4094,18 +3881,18 @@ function Kn(e, t) {
 		coordinates: d
 	};
 }
-e(Kn, "sugiyamaLayout");
-var $ = $t.EPSILON, qn = 8, Jn = 15, Yn = 15, Xn = 25, Zn = 20, Qn = 10;
-function $n(e, t, n) {
+e(Dn, "sugiyamaLayout");
+var $ = Pt.EPSILON, On = 8, kn = 15, An = 15, jn = 25, Mn = 20, Nn = 10;
+function Pn(e, t, n) {
 	let r = e.x ?? 0, i = e.y ?? 0, a = t.x - r, o = t.y - i, s = Math.abs(a), c = Math.abs(o);
 	return s < $ && c < $ ? n : c > $ && c * 3 >= s ? o > 0 ? "bottom" : "top" : s > $ ? a > 0 ? "right" : "left" : n;
 }
-e($n, "chooseOrthogonalSide");
-function er(e, t) {
+e(Pn, "chooseOrthogonalSide");
+function Fn(e, t) {
 	return Math.abs(e.to - t.from) < $ || Math.abs(e.to - t.to) < $ ? e.to : e.from;
 }
-e(er, "sharedLineEndpointCoord");
-function tr(e, t) {
+e(Fn, "sharedLineEndpointCoord");
+function In(e, t) {
 	return e.orient === "vertical" ? {
 		x: e.coord,
 		y: t
@@ -4114,8 +3901,8 @@ function tr(e, t) {
 		y: e.coord
 	};
 }
-e(tr, "pointOnLine");
-function nr(t, n) {
+e(In, "pointOnLine");
+function Ln(t, n) {
 	let r = t.nodes ?? [], i = t.edges ?? [], a = [];
 	for (let e of i) e.isLayoutOnly || a.push({
 		...e,
@@ -4131,7 +3918,7 @@ function nr(t, n) {
 		i(t);
 	}
 	let d = r.filter((e) => !e.isGroup && !e.isEdgeLabel).map((e) => {
-		let t = e.width ?? 10, n = e.height ?? 10, r = e.x ?? 0, i = e.y ?? 0, a = qn;
+		let t = e.width ?? 10, n = e.height ?? 10, r = e.x ?? 0, i = e.y ?? 0, a = On;
 		return {
 			nodeId: e.id,
 			minX: r - t / 2 - a,
@@ -4170,7 +3957,7 @@ function nr(t, n) {
 				y: a
 			};
 		}
-	}, "portForSide"), m = /* @__PURE__ */ e((e, t, n) => p(e, $n(e, t, n ? "bottom" : "top")), "getOrthogonalPort"), h = [], g = [], _ = /* @__PURE__ */ new Set(), v = 1e3, y = /* @__PURE__ */ e((e, t, n) => {
+	}, "portForSide"), m = /* @__PURE__ */ e((e, t, n) => p(e, Pn(e, t, n ? "bottom" : "top")), "getOrthogonalPort"), h = [], g = [], _ = /* @__PURE__ */ new Set(), v = 1e3, y = /* @__PURE__ */ e((e, t, n) => {
 		if (h.length === 0) return 0;
 		let r = Math.abs(t.y - n.y) < $, i = Math.abs(t.x - n.x) < $;
 		if (!r && !i) return 0;
@@ -4208,7 +3995,7 @@ function nr(t, n) {
 		return !!d.find((c) => n && c.nodeId === n || r && c.nodeId === r ? !1 : Math.abs(e.x - t.x) > $ ? c.minY < e.y && c.maxY > e.y && c.maxX > i && c.minX < a : c.minX < e.x && c.maxX > e.x && c.maxY > o && c.minY < s);
 	}, "isSegmentBlocked"), S = /* @__PURE__ */ new Map(), C = /* @__PURE__ */ new Map();
 	for (let e of a) !e.start || !e.end || e.start === e.end || (C.set(e.start, (C.get(e.start) ?? 0) + 1), C.set(e.end, (C.get(e.end) ?? 0) + 1));
-	let w = /* @__PURE__ */ e((e, t) => $n(e, t, "bottom"), "determineSide"), T = /* @__PURE__ */ new Map();
+	let w = /* @__PURE__ */ e((e, t) => Pn(e, t, "bottom"), "determineSide"), T = /* @__PURE__ */ new Map();
 	for (let [e, t] of a.entries()) {
 		if (!t.start || !t.end || t.start === t.end || t.points && t.points.length > 0) continue;
 		let n = o.get(t.start), r = o.get(t.end);
@@ -4252,11 +4039,11 @@ function nr(t, n) {
 	let j = /* @__PURE__ */ e((e) => {
 		let t = e?.shape;
 		return t === "question" || t === "diamond";
-	}, "isDiamondNode"), ee = /* @__PURE__ */ new Map();
-	for (let e of T.values()) ee.has(e.dstId) || ee.set(e.dstId, /* @__PURE__ */ new Set()), ee.get(e.dstId).add(e.dstSide);
+	}, "isDiamondNode"), M = /* @__PURE__ */ new Map();
+	for (let e of T.values()) M.has(e.dstId) || M.set(e.dstId, /* @__PURE__ */ new Set()), M.get(e.dstId).add(e.dstSide);
 	for (let e of T.values()) {
 		if (!j(o.get(e.srcId))) continue;
-		let t = ee.get(e.srcId);
+		let t = M.get(e.srcId);
 		if (!t?.has(e.srcSide)) continue;
 		let n = D(e);
 		if (t.has(n) || (k.get(A(e.srcId, n)) ?? 0) > 0) continue;
@@ -4275,7 +4062,7 @@ function nr(t, n) {
 			oppositeCoord: f
 		});
 	}
-	let te = /* @__PURE__ */ new Map();
+	let N = /* @__PURE__ */ new Map();
 	for (let [e, t] of S) {
 		if (t.length < 2) continue;
 		t.sort((e, t) => e.oppositeCoord - t.oppositeCoord);
@@ -4284,24 +4071,24 @@ function nr(t, n) {
 		let c = i === "left" || i === "right" ? s.height ?? 10 : s.width ?? 10, l = s.shape, u = l === "question" || l === "diamond" ? c * .3 : c, d = Math.min(20, Math.max(8, u / (t.length + 1))), f = -(d * (t.length - 1)) / 2;
 		for (let [e, n] of t.entries()) {
 			let t = f + e * d, r = `${n.edgeIdx}:${a}`;
-			te.set(r, t);
+			N.set(r, t);
 		}
 	}
-	let M = /* @__PURE__ */ e((e) => !!a[e]?.labelNodeId, "edgeHasLabelNode"), ne = /* @__PURE__ */ e((e, t) => e ? (S.get(`${e}:${t}:src`) ?? []).some(({ edgeIdx: e }) => M(e)) || (S.get(`${e}:${t}:dst`) ?? []).some(({ edgeIdx: e }) => M(e)) : !1, "faceHasLabelNode"), N = /* @__PURE__ */ e((e, t, n) => t === "top" || t === "bottom" ? {
+	let P = /* @__PURE__ */ e((e) => !!a[e]?.labelNodeId, "edgeHasLabelNode"), F = /* @__PURE__ */ e((e, t) => e ? (S.get(`${e}:${t}:src`) ?? []).some(({ edgeIdx: e }) => P(e)) || (S.get(`${e}:${t}:dst`) ?? []).some(({ edgeIdx: e }) => P(e)) : !1, "faceHasLabelNode"), I = /* @__PURE__ */ e((e, t, n) => t === "top" || t === "bottom" ? {
 		x: e.x + n,
 		y: e.y
 	} : {
 		x: e.x,
 		y: e.y + n
-	}, "applyPortOffset"), P = /* @__PURE__ */ e((e, t, n) => {
+	}, "applyPortOffset"), ee = /* @__PURE__ */ e((e, t, n) => {
 		let r = T.get(e), i = {
 			x: n.x ?? 0,
 			y: n.y ?? 0
 		}, a = {
 			x: t.x ?? 0,
 			y: t.y ?? 0
-		}, o = r?.srcSide ?? w(t, i), s = r?.dstSide ?? w(n, a), c = r ? p(t, r.srcSide) : m(t, i, !0), l = r ? p(n, r.dstSide) : m(n, a, !1), u = te.get(`${e}:src`), d = te.get(`${e}:dst`);
-		return u !== void 0 && (c = N(c, o, u)), d !== void 0 && (l = N(l, s, d)), {
+		}, o = r?.srcSide ?? w(t, i), s = r?.dstSide ?? w(n, a), c = r ? p(t, r.srcSide) : m(t, i, !0), l = r ? p(n, r.dstSide) : m(n, a, !1), u = N.get(`${e}:src`), d = N.get(`${e}:dst`);
+		return u !== void 0 && (c = I(c, o, u)), d !== void 0 && (l = I(l, s, d)), {
 			pSrcPort: c,
 			pDstPort: l,
 			srcSide: o,
@@ -4313,8 +4100,8 @@ function nr(t, n) {
 		if (g[t] = [], !n.start || !n.end || n.points && n.points.length > 0 || n.start === n.end) continue;
 		let r = o.get(n.start), i = o.get(n.end);
 		if (!r || !i) continue;
-		let { pSrcPort: s, pDstPort: u, srcSide: p, dstSide: m } = P(t, r, i), v = { ...s }, b = { ...u }, w = p === "top" || p === "bottom", T = m === "top" || m === "bottom";
-		w ? v.y = s.y > (r.y ?? 0) ? s.y + Zn : s.y - Zn : v.x = s.x > (r.x ?? 0) ? s.x + Zn : s.x - Zn, T ? b.y = u.y > (i.y ?? 0) ? u.y + Zn : u.y - Zn : b.x = u.x > (i.x ?? 0) ? u.x + Zn : u.x - Zn;
+		let { pSrcPort: s, pDstPort: u, srcSide: p, dstSide: m } = ee(t, r, i), v = { ...s }, b = { ...u }, w = p === "top" || p === "bottom", T = m === "top" || m === "bottom";
+		w ? v.y = s.y > (r.y ?? 0) ? s.y + Mn : s.y - Mn : v.x = s.x > (r.x ?? 0) ? s.x + Mn : s.x - Mn, T ? b.y = u.y > (i.y ?? 0) ? u.y + Mn : u.y - Mn : b.x = u.x > (i.x ?? 0) ? u.x + Mn : u.x - Mn;
 		let E = /* @__PURE__ */ e((e, t) => {
 			for (let n of d) if (!t.includes(n.nodeId) && e.x > n.minX && e.x < n.maxX && e.y > n.minY && e.y < n.maxY) return {
 				inside: !0,
@@ -4325,15 +4112,15 @@ function nr(t, n) {
 			if (i) {
 				let i = e.y > (t.y ?? 0);
 				return {
-					x: (n.x ?? 0) >= e.x ? r.maxX + Jn : r.minX - Jn,
-					y: i ? r.maxY + Yn : r.minY - Yn,
+					x: (n.x ?? 0) >= e.x ? r.maxX + kn : r.minX - kn,
+					y: i ? r.maxY + An : r.minY - An,
 					leavesPositiveSide: i
 				};
 			}
 			let a = e.x > (t.x ?? 0), o = (n.y ?? 0) >= e.y;
 			return {
-				x: a ? r.maxX + Jn : r.minX - Jn,
-				y: o ? r.maxY + Yn : r.minY - Yn,
+				x: a ? r.maxX + kn : r.minX - kn,
+				y: o ? r.maxY + An : r.minY - An,
 				leavesPositiveSide: a
 			};
 		}, "obstacleDetour"), O = [], k = [n.start, n.end], A = E(v, k);
@@ -4342,7 +4129,7 @@ function nr(t, n) {
 			if (w) {
 				let t = D(s, r, i, e, !0);
 				v.x = t.x, v.y = t.y;
-				let n = t.leavesPositiveSide ? Math.min(e.minY - 2, s.y + Zn) : Math.max(e.maxY + 2, s.y - Zn);
+				let n = t.leavesPositiveSide ? Math.min(e.minY - 2, s.y + Mn) : Math.max(e.maxY + 2, s.y - Mn);
 				O = [
 					{
 						x: s.x,
@@ -4358,7 +4145,7 @@ function nr(t, n) {
 					}
 				];
 			} else {
-				let t = D(s, r, i, e, !1), n = t.leavesPositiveSide ? Math.min(e.minX - 2, s.x + Zn) : Math.max(e.maxX + 2, s.x - Zn);
+				let t = D(s, r, i, e, !1), n = t.leavesPositiveSide ? Math.min(e.minX - 2, s.x + Mn) : Math.max(e.maxX + 2, s.x - Mn);
 				v.x = t.x, v.y = t.y, O = [
 					{
 						x: n,
@@ -4375,9 +4162,9 @@ function nr(t, n) {
 				];
 			}
 		}
-		let j = [], ee = E(b, k);
-		if (ee.inside && ee.obstacle) {
-			let e = ee.obstacle;
+		let j = [], M = E(b, k);
+		if (M.inside && M.obstacle) {
+			let e = M.obstacle;
 			if (T) {
 				let t = D(u, i, r, e, !0);
 				b.x = t.x, b.y = t.y, j = [{
@@ -4399,7 +4186,7 @@ function nr(t, n) {
 			}
 		}
 		if (O.length === 0 && j.length === 0) {
-			let e = Jn, r = Math.abs(v.x - b.x) < e, i = Math.abs(v.y - b.y) < e, a = te.get(`${t}:src`) !== void 0 || te.get(`${t}:dst`) !== void 0, o = (S.get(`${n.start ?? ""}:${p}:src`)?.length ?? 0) + (S.get(`${n.start ?? ""}:${p}:dst`)?.length ?? 0), c = (S.get(`${n.end ?? ""}:${m}:src`)?.length ?? 0) + (S.get(`${n.end ?? ""}:${m}:dst`)?.length ?? 0), l = o > 1 || c > 1, d = C.get(n.start ?? "") ?? 0, f = C.get(n.end ?? "") ?? 0, g = o > 1 && ne(n.start, p) || c > 1 && ne(n.end, m);
+			let e = kn, r = Math.abs(v.x - b.x) < e, i = Math.abs(v.y - b.y) < e, a = N.get(`${t}:src`) !== void 0 || N.get(`${t}:dst`) !== void 0, o = (S.get(`${n.start ?? ""}:${p}:src`)?.length ?? 0) + (S.get(`${n.start ?? ""}:${p}:dst`)?.length ?? 0), c = (S.get(`${n.end ?? ""}:${m}:src`)?.length ?? 0) + (S.get(`${n.end ?? ""}:${m}:dst`)?.length ?? 0), l = o > 1 || c > 1, d = C.get(n.start ?? "") ?? 0, f = C.get(n.end ?? "") ?? 0, g = o > 1 && F(n.start, p) || c > 1 && F(n.end, m);
 			if ((r || i) && !a && (!l || l && !g && (o <= 1 || d <= 2) && (c <= 1 || f <= 2)) && !x(s, u, n.start, n.end)) {
 				n.points = [
 					{ ...s },
@@ -4428,52 +4215,52 @@ function nr(t, n) {
 			}
 		}
 		v.x = f("vertical", v.x, v.y, v.y).coord, b.x = f("vertical", b.x, b.y, b.y).coord;
-		let M = Math.min(v.x, b.x) - 50, N = Math.max(v.x, b.x) + 50, F = Math.min(v.y, b.y) - 50, I = Math.max(v.y, b.y) + 50;
+		let P = Math.min(v.x, b.x) - 50, I = Math.max(v.x, b.x) + 50, L = Math.min(v.y, b.y) - 50, R = Math.max(v.y, b.y) + 50;
 		for (let e of d) {
 			let t = Math.min(v.x, b.x), n = Math.max(v.x, b.x), r = Math.min(v.y, b.y), i = Math.max(v.y, b.y);
-			e.minX < n && e.maxX > t && e.minY < i && e.maxY > r && (M = Math.min(M, e.minX - Xn), N = Math.max(N, e.maxX + Xn), F = Math.min(F, e.minY - Xn), I = Math.max(I, e.maxY + Xn));
+			e.minX < n && e.maxX > t && e.minY < i && e.maxY > r && (P = Math.min(P, e.minX - jn), I = Math.max(I, e.maxX + jn), L = Math.min(L, e.minY - jn), R = Math.max(R, e.maxY + jn));
 		}
 		for (let e of d) {
-			if (e.maxX < M || e.minX > N || e.maxY < F || e.minY > I) continue;
-			let t = Jn;
-			f("horizontal", e.minY - t, M, N), f("horizontal", e.maxY + t, M, N);
-			let n = Yn;
-			f("vertical", e.minX - n, F, I), f("vertical", e.maxX + n, F, I);
-		}
-		f("horizontal", v.y, M, N), f("horizontal", b.y, M, N);
-		let L = c.filter((e) => e.orientation === "horizontal" && e.coord >= F && e.coord <= I), R = c.filter((e) => e.orientation === "vertical" && e.coord >= M && e.coord <= N), z = /* @__PURE__ */ e((e, t) => `${e.toFixed(1)},${t.toFixed(1)}`, "getKey"), B = z(v.x, v.y), re = z(b.x, b.y), V = /* @__PURE__ */ new Map(), H = /* @__PURE__ */ new Map(), ie = /* @__PURE__ */ new Map(), ae = /* @__PURE__ */ new Set(), U = [];
-		V.set(B, 0), ie.set(B, "n"), U.push({
+			if (e.maxX < P || e.minX > I || e.maxY < L || e.minY > R) continue;
+			let t = kn;
+			f("horizontal", e.minY - t, P, I), f("horizontal", e.maxY + t, P, I);
+			let n = An;
+			f("vertical", e.minX - n, L, R), f("vertical", e.maxX + n, L, R);
+		}
+		f("horizontal", v.y, P, I), f("horizontal", b.y, P, I);
+		let z = c.filter((e) => e.orientation === "horizontal" && e.coord >= L && e.coord <= R), te = c.filter((e) => e.orientation === "vertical" && e.coord >= P && e.coord <= I), ne = /* @__PURE__ */ e((e, t) => `${e.toFixed(1)},${t.toFixed(1)}`, "getKey"), B = ne(v.x, v.y), re = ne(b.x, b.y), ie = /* @__PURE__ */ new Map(), ae = /* @__PURE__ */ new Map(), V = /* @__PURE__ */ new Map(), oe = /* @__PURE__ */ new Set(), H = [];
+		ie.set(B, 0), V.set(B, "n"), H.push({
 			key: B,
 			f: Math.hypot(b.x - v.x, b.y - v.y),
 			pt: v
-		}), ae.add(B);
-		let W = [], G = /* @__PURE__ */ e((e, t) => x(e, t, n.start, n.end), "checkSegmentBlocked"), oe = {
+		}), oe.add(B);
+		let U = [], W = /* @__PURE__ */ e((e, t) => x(e, t, n.start, n.end), "checkSegmentBlocked"), G = {
 			x: b.x,
 			y: v.y
-		}, se = G(v, oe), K = G(oe, b), ce = se || K, le = {
+		}, K = W(v, G), se = W(G, b), ce = K || se, le = {
 			x: v.x,
 			y: b.y
-		}, ue = G(v, le), de = G(le, b);
-		if (ce ? ue || de || (W = Math.abs(v.x - b.x) < $ ? [v, b] : [
+		}, ue = W(v, le), de = W(le, b);
+		if (ce ? ue || de || (U = Math.abs(v.x - b.x) < $ ? [v, b] : [
 			v,
 			le,
 			b
-		]) : W = Math.abs(v.y - b.y) < $ || Math.abs(v.x - b.x) < $ ? [v, b] : [
+		]) : U = Math.abs(v.y - b.y) < $ || Math.abs(v.x - b.x) < $ ? [v, b] : [
 			v,
-			oe,
+			G,
 			b
-		], W.length === 0) for (; U.length > 0;) {
-			U.sort((e, t) => e.f - t.f);
-			let e = U.shift();
-			if (ae.delete(e.key), e.key === re) {
+		], U.length === 0) for (; H.length > 0;) {
+			H.sort((e, t) => e.f - t.f);
+			let e = H.shift();
+			if (oe.delete(e.key), e.key === re) {
 				let e = re, t = b;
-				for (W = [t]; H.has(e);) {
-					let n = H.get(e);
-					W.unshift(n), t = n, e = z(n.x, n.y);
+				for (U = [t]; ae.has(e);) {
+					let n = ae.get(e);
+					U.unshift(n), t = n, e = ne(n.x, n.y);
 				}
 				break;
 			}
-			let r = e.pt.x, i = e.pt.y, a = R.sort((e, t) => e.coord - t.coord), o = a.findIndex((e) => Math.abs(e.coord - r) < 1), s = L.sort((e, t) => e.coord - t.coord), c = s.findIndex((e) => Math.abs(e.coord - i) < 1), l = [];
+			let r = e.pt.x, i = e.pt.y, a = te.sort((e, t) => e.coord - t.coord), o = a.findIndex((e) => Math.abs(e.coord - r) < 1), s = z.sort((e, t) => e.coord - t.coord), c = s.findIndex((e) => Math.abs(e.coord - i) < 1), l = [];
 			o > 0 && l.push({
 				x: a[o - 1].coord,
 				y: i
@@ -4490,37 +4277,37 @@ function nr(t, n) {
 			for (let a of l) {
 				let o = Math.min(r, a.x), s = Math.max(r, a.x), c = Math.min(i, a.y), l = Math.max(i, a.y);
 				if (d.some((e) => e.nodeId === n.start || e.nodeId === n.end ? !1 : o === s ? e.minX < r && e.maxX > r && e.maxY > c && e.minY < l : e.minY < i && e.maxY > i && e.maxX > o && e.minX < s)) continue;
-				let u = z(a.x, a.y), f = Math.abs(a.x - r) + Math.abs(a.y - i), p = y(t, e.pt, a), m = 0, h = b.x - v.x, g = b.y - v.y, _ = a.x - r, x = a.y - i;
+				let u = ne(a.x, a.y), f = Math.abs(a.x - r) + Math.abs(a.y - i), p = y(t, e.pt, a), m = 0, h = b.x - v.x, g = b.y - v.y, _ = a.x - r, x = a.y - i;
 				(g > 10 && x < -5 || g < -10 && x > 5) && (m = Math.abs(x) * 100), (h > 10 && _ < -5 || h < -10 && _ > 5) && (m += Math.abs(_) * 50);
-				let S = 0, C = ie.get(e.key) ?? "n", w = Math.abs(_) > $ ? "h" : "v";
+				let S = 0, C = V.get(e.key) ?? "n", w = Math.abs(_) > $ ? "h" : "v";
 				C !== "n" && C !== w && (S = 50);
-				let T = f + p + m + S, E = (V.get(e.key) ?? Infinity) + T, D = Math.abs(b.x - a.x) + Math.abs(b.y - a.y);
-				if (E < (V.get(u) ?? Infinity)) {
-					if (H.set(u, e.pt), V.set(u, E), ie.set(u, w), !ae.has(u)) U.push({
+				let T = f + p + m + S, E = (ie.get(e.key) ?? Infinity) + T, D = Math.abs(b.x - a.x) + Math.abs(b.y - a.y);
+				if (E < (ie.get(u) ?? Infinity)) {
+					if (ae.set(u, e.pt), ie.set(u, E), V.set(u, w), !oe.has(u)) H.push({
 						key: u,
 						f: E + D,
 						pt: a
-					}), ae.add(u);
+					}), oe.add(u);
 					else {
-						let e = U.findIndex((e) => e.key === u);
-						e !== -1 && (U[e].f = E + D);
+						let e = H.findIndex((e) => e.key === u);
+						e !== -1 && (H[e].f = E + D);
 					}
 				}
 			}
 		}
-		if (W.length === 0 && (W = [
+		if (U.length === 0 && (U = [
 			v,
 			{
 				x: v.x,
 				y: b.y
 			},
 			b
-		]), W.length > 4) {
-			let t = W[0], n = W[W.length - 1], r = Math.min(t.x, n.x), i = Math.max(t.x, n.x), a = Math.min(t.y, n.y), o = Math.max(t.y, n.y);
-			for (let e of W) r = Math.min(r, e.x), i = Math.max(i, e.x), a = Math.min(a, e.y), o = Math.max(o, e.y);
+		]), U.length > 4) {
+			let t = U[0], n = U[U.length - 1], r = Math.min(t.x, n.x), i = Math.max(t.x, n.x), a = Math.min(t.y, n.y), o = Math.max(t.y, n.y);
+			for (let e of U) r = Math.min(r, e.x), i = Math.max(i, e.x), a = Math.min(a, e.y), o = Math.max(o, e.y);
 			let s = i > Math.max(t.x, n.x), c = r < Math.min(t.x, n.x);
 			if (l) {
-				let e = Yn;
+				let e = An;
 				if (s) {
 					let r = Math.max(t.x, n.x), a = Math.min(t.y, n.y), o = Math.max(t.y, n.y), s = d.filter((e) => e.minX < r && e.maxX > r && e.minY < o && e.maxY > a);
 					if (s.length > 0) {
@@ -4556,7 +4343,7 @@ function nr(t, n) {
 					t.length > 0 && (a = t);
 				}
 				if (a.length === 0) return n.y;
-				let o = Jn;
+				let o = kn;
 				if (r) {
 					let e = Math.max(...a.map((e) => e.maxY)) + o;
 					if (e < n.y - $) return e;
@@ -4575,7 +4362,7 @@ function nr(t, n) {
 				}, o = {
 					x: n.x,
 					y: r
-				}, s = G(t, i), c = G(i, a), l = G(a, o), d = r !== n.y && G(o, n);
+				}, s = W(t, i), c = W(i, a), l = W(a, o), d = r !== n.y && W(o, n);
 				return !s && !c && !l && !d ? Math.abs(r - n.y) < $ ? [
 					t,
 					i,
@@ -4589,12 +4376,12 @@ function nr(t, n) {
 					n
 				] : null;
 			}, "trySimplifyWithDetourX"), p = s && !c ? f(i) : c && !s ? f(r) : null;
-			p && (W = p);
+			p && (U = p);
 		}
 		let q = [
 			s,
 			...O,
-			...W,
+			...U,
 			...j.reverse(),
 			u
 		];
@@ -4608,32 +4395,32 @@ function nr(t, n) {
 				r !== 0 && r === i && Math.abs(t.y - n.y) > Math.abs(e.y - n.y) && q.splice(-2, 1);
 			}
 		}
-		let fe = [q[0]];
+		let J = [q[0]];
 		for (let e = 1; e < q.length - 1; e++) {
 			if (e === 1) {
-				fe.push(q[e]);
+				J.push(q[e]);
 				continue;
 			}
-			let t = fe[fe.length - 1], n = q[e], r = q[e + 1];
+			let t = J[J.length - 1], n = q[e], r = q[e + 1];
 			if (Math.abs(t.y - n.y) < $ && Math.abs(n.y - r.y) < $) {
 				if (n.x > t.x != r.x > n.x) {
-					fe.push(n);
+					J.push(n);
 					continue;
 				}
 				continue;
 			}
 			if (Math.abs(t.x - n.x) < $ && Math.abs(n.x - r.x) < $) {
 				if (n.y > t.y != r.y > n.y) {
-					fe.push(n);
+					J.push(n);
 					continue;
 				}
 				continue;
 			}
-			fe.push(n);
+			J.push(n);
 		}
-		fe.push(q[q.length - 1]);
-		for (let e = 0; e < fe.length - 1; e++) {
-			let n = fe[e], r = fe[e + 1], i = Math.abs(n.x - r.x) < $ ? "vertical" : "horizontal", a = i === "vertical" ? n.x : n.y, o = i === "vertical" ? Math.min(n.y, r.y) : Math.min(n.x, r.x), s = i === "vertical" ? Math.max(n.y, r.y) : Math.max(n.x, r.x), c = f(i, a, o, s), l = {
+		J.push(q[q.length - 1]);
+		for (let e = 0; e < J.length - 1; e++) {
+			let n = J[e], r = J[e + 1], i = Math.abs(n.x - r.x) < $ ? "vertical" : "horizontal", a = i === "vertical" ? n.x : n.y, o = i === "vertical" ? Math.min(n.y, r.y) : Math.min(n.x, r.x), s = i === "vertical" ? Math.max(n.y, r.y) : Math.max(n.x, r.x), c = f(i, a, o, s), l = {
 				edgeIndex: t,
 				segmentIndex: e,
 				orientation: i,
@@ -4654,8 +4441,8 @@ function nr(t, n) {
 			});
 		}
 	}
-	let F = /* @__PURE__ */ e((e, t) => e.from < t.to && t.from < e.to, "segmentsOverlap"), I = /* @__PURE__ */ e((e, t, n, r) => {
-		let i = !r.segments.some((n) => (n.edgeIndex !== t.edgeIndex || n.segmentIndex !== t.segmentIndex) && F(n, e)), a = !n.segments.some((n) => (n.edgeIndex !== e.edgeIndex || n.segmentIndex !== e.segmentIndex) && F(n, t));
+	let L = /* @__PURE__ */ e((e, t) => e.from < t.to && t.from < e.to, "segmentsOverlap"), R = /* @__PURE__ */ e((e, t, n, r) => {
+		let i = !r.segments.some((n) => (n.edgeIndex !== t.edgeIndex || n.segmentIndex !== t.segmentIndex) && L(n, e)), a = !n.segments.some((n) => (n.edgeIndex !== e.edgeIndex || n.segmentIndex !== e.segmentIndex) && L(n, t));
 		return i && a ? (e.trackIndex = r.index, t.trackIndex = n.index, n.segments = [...n.segments.filter((t) => t.edgeIndex !== e.edgeIndex || t.segmentIndex !== e.segmentIndex), {
 			edgeIndex: t.edgeIndex,
 			segmentIndex: t.segmentIndex,
@@ -4667,14 +4454,14 @@ function nr(t, n) {
 			from: e.from,
 			to: e.to
 		}], !0) : !1;
-	}, "trySwapSegmentsAcrossTracks"), L = /* @__PURE__ */ e((e) => {
+	}, "trySwapSegmentsAcrossTracks"), z = /* @__PURE__ */ e((e) => {
 		let t = e.tracks.length;
 		return e.tracks[t] = {
 			index: t,
 			coord: e.coord,
 			segments: []
 		}, t;
-	}, "createNewTrack"), R = /* @__PURE__ */ e((e, t) => {
+	}, "createNewTrack"), te = /* @__PURE__ */ e((e, t) => {
 		let n = e.pipe.tracks[e.trackIndex];
 		n.segments = n.segments.filter((t) => t.edgeIndex !== e.edgeIndex || t.segmentIndex !== e.segmentIndex), e.trackIndex = t, e.pipe.tracks[t].segments.push({
 			edgeIndex: e.edgeIndex,
@@ -4682,11 +4469,11 @@ function nr(t, n) {
 			from: e.from,
 			to: e.to
 		});
-	}, "moveSegmentToTrack"), z = /* @__PURE__ */ e((e, t) => {
+	}, "moveSegmentToTrack"), ne = /* @__PURE__ */ e((e, t) => {
 		let n = g[e.edgeIndex];
 		for (let r of n) {
 			let n = h[r];
-			n.pipe === e.pipe && R(n, t);
+			n.pipe === e.pipe && te(n, t);
 		}
 	}, "moveSegmentChainToTrack"), B = /* @__PURE__ */ e((e) => {
 		let t = g[e.edgeIndex], n = t.indexOf(h.indexOf(e)), r = [];
@@ -4695,26 +4482,26 @@ function nr(t, n) {
 		if (e.orientation === t.orientation) return !1;
 		let n = e.orientation === "horizontal" ? e : t, r = e.orientation === "horizontal" ? t : e;
 		return r.pipe.coord > n.from && r.pipe.coord < n.to && n.pipe.coord > r.from && n.pipe.coord < r.to;
-	}, "haveAnyCrossing"), V = /* @__PURE__ */ e((e, t) => {
-		for (let n of e.tracks) if (!n.segments.some((e) => (e.edgeIndex !== t.edgeIndex || e.segmentIndex !== t.segmentIndex) && F(e, t))) return n.index;
+	}, "haveAnyCrossing"), ie = /* @__PURE__ */ e((e, t) => {
+		for (let n of e.tracks) if (!n.segments.some((e) => (e.edgeIndex !== t.edgeIndex || e.segmentIndex !== t.segmentIndex) && L(e, t))) return n.index;
 		return -1;
-	}, "findAvailableTrack"), H = /* @__PURE__ */ e((e, t) => {
-		if (e.trackIndex === t.trackIndex) return F(e, t);
+	}, "findAvailableTrack"), ae = /* @__PURE__ */ e((e, t) => {
+		if (e.trackIndex === t.trackIndex) return L(e, t);
 		let n = B(e), r = B(t);
 		return n.some((e) => r.some((t) => re(e, t)));
-	}, "segmentsConflict"), ie = /* @__PURE__ */ e((e, t, n) => {
-		if (I(e, t, e.pipe.tracks[e.trackIndex], t.pipe.tracks[t.trackIndex])) return;
-		let r = V(e.pipe, t);
-		n(t, r === -1 ? L(e.pipe) : r);
-	}, "resolveTrackConflict"), ae = /* @__PURE__ */ e((e) => {
+	}, "segmentsConflict"), V = /* @__PURE__ */ e((e, t, n) => {
+		if (R(e, t, e.pipe.tracks[e.trackIndex], t.pipe.tracks[t.trackIndex])) return;
+		let r = ie(e.pipe, t);
+		n(t, r === -1 ? z(e.pipe) : r);
+	}, "resolveTrackConflict"), oe = /* @__PURE__ */ e((e) => {
 		let t = 0;
 		for (let n = 0; n < e.length; n++) for (let r = n + 1; r < e.length; r++) {
 			let i = e[n], a = e[r];
-			i.pipe === a.pipe && H(i, a) && (t++, ie(i, a, z));
+			i.pipe === a.pipe && ae(i, a) && (t++, V(i, a, ne));
 		}
 		return t;
-	}, "resolveHandleConflicts"), U = /* @__PURE__ */ new Map(), W = /* @__PURE__ */ e((e) => {
-		if (U.has(e)) return U.get(e);
+	}, "resolveHandleConflicts"), H = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ e((e) => {
+		if (H.has(e)) return H.get(e);
 		let t = g[e];
 		if (t.length === 0) {
 			let t = {
@@ -4723,7 +4510,7 @@ function nr(t, n) {
 				base: 0,
 				delta: 0
 			};
-			return U.set(e, t), t;
+			return H.set(e, t), t;
 		}
 		let n = h[t[0]].pipe.coord, r = n;
 		for (let e = 1; e < t.length; e++) {
@@ -4740,8 +4527,8 @@ function nr(t, n) {
 			base: n,
 			delta: r - n
 		};
-		return U.set(e, a), a;
-	}, "getDestInfo"), G = /* @__PURE__ */ e(() => {
+		return H.set(e, a), a;
+	}, "getDestInfo"), W = /* @__PURE__ */ e(() => {
 		let t = 0, n = /* @__PURE__ */ new Map();
 		for (let [e, t] of a.entries()) g[e].length !== 0 && t.start && (n.has(t.start) || n.set(t.start, []), n.get(t.start).push(e));
 		let r = /* @__PURE__ */ e((e) => {
@@ -4754,7 +4541,7 @@ function nr(t, n) {
 		}, "getEdgeDistance");
 		for (let e of n.values()) {
 			e.sort((e, t) => {
-				let n = W(e), i = W(t);
+				let n = U(e), i = U(t);
 				if (Math.abs(n.deviation - i.deviation) > 1) return n.deviation - i.deviation;
 				if (Math.abs(n.dest - i.dest) > 1) return n.dest - i.dest;
 				let a = r(e), o = r(t);
@@ -4771,10 +4558,10 @@ function nr(t, n) {
 				return 0;
 			});
 			let n = e.map((e) => h[g[e][0]]);
-			t += ae(n);
+			t += oe(n);
 		}
 		return t;
-	}, "fixSourceHandleCrossings"), oe = /* @__PURE__ */ e(() => {
+	}, "fixSourceHandleCrossings"), G = /* @__PURE__ */ e(() => {
 		let t = 0, n = /* @__PURE__ */ new Map();
 		for (let [e, t] of a.entries()) g[e].length !== 0 && t.end && (n.has(t.end) || n.set(t.end, []), n.get(t.end).push(e));
 		for (let r of n.values()) {
@@ -4788,10 +4575,10 @@ function nr(t, n) {
 				return Math.abs(i - a) > .1 ? i - a : t - n;
 			});
 			let n = r.map((e) => h[g[e][g[e].length - 1]]);
-			t += ae(n);
+			t += oe(n);
 		}
 		return t;
-	}, "fixTargetHandleCrossings"), se = /* @__PURE__ */ e(() => {
+	}, "fixTargetHandleCrossings"), K = /* @__PURE__ */ e(() => {
 		let e = 0;
 		for (let t of c) {
 			let n = [];
@@ -4802,15 +4589,15 @@ function nr(t, n) {
 			n.sort((e, t) => e.edgeIndex - t.edgeIndex || e.segmentIndex - t.segmentIndex);
 			for (let t = 0; t < n.length; t++) for (let r = t + 1; r < n.length; r++) {
 				let i = n[t], a = n[r];
-				H(i, a) && (e++, ie(i, a, R));
+				ae(i, a) && (e++, V(i, a, te));
 			}
 		}
 		return e;
-	}, "fixPipeCrossings"), K = 0;
-	for (; K < 10;) {
+	}, "fixPipeCrossings"), se = 0;
+	for (; se < 10;) {
 		let e = 0;
-		if (e += G(), e += oe(), e += se(), e === 0) break;
-		K++;
+		if (e += W(), e += G(), e += K(), e === 0) break;
+		se++;
 	}
 	let ce = /* @__PURE__ */ new Map();
 	for (let t of c) {
@@ -4840,7 +4627,7 @@ function nr(t, n) {
 			n.forEach((e) => r.add(e.trackIndex));
 			let i = /* @__PURE__ */ new Map();
 			n.forEach((e) => {
-				let t = W(e.edgeIndex);
+				let t = U(e.edgeIndex);
 				i.set(e.trackIndex, (i.get(e.trackIndex) ?? 0) + t.delta);
 			});
 			let a = [...r].filter((e) => (i.get(e) ?? 0) < -1), o = [...r].filter((e) => (i.get(e) ?? 0) > 1), s = [...r].filter((e) => Math.abs(i.get(e) ?? 0) <= 1);
@@ -4851,7 +4638,7 @@ function nr(t, n) {
 					ce.set(`${e.edgeIndex}-${e.segmentIndex}`, n);
 				});
 			}, "assignCoord"), l = 0;
-			for (let e of a) l++, c(e, t.coord - l * Qn);
+			for (let e of a) l++, c(e, t.coord - l * Nn);
 			if (s.length === 0 && r.size > 0) {
 				let e = [...r].sort((e, t) => Math.abs(i.get(e) ?? 0) - Math.abs(i.get(t) ?? 0))[0], t = a.indexOf(e);
 				t !== -1 && a.splice(t, 1);
@@ -4863,18 +4650,18 @@ function nr(t, n) {
 				if (u === 0) c(e, t.coord);
 				else {
 					let n = u % 2 == 1 ? 1 : -1, r = Math.ceil(u / 2);
-					c(e, t.coord + n * r * Qn * .5);
+					c(e, t.coord + n * r * Nn * .5);
 				}
 				u++;
 			}
 			let d = 0;
-			for (let e of o) d++, c(e, t.coord + d * Qn);
+			for (let e of o) d++, c(e, t.coord + d * Nn);
 		}
 	}
 	for (let [e, t] of a.entries()) {
 		let n = g[e] ?? [];
 		if (n.length === 0) continue;
-		let r = [], { pSrcPort: i, pDstPort: a } = P(e, o.get(t.start), o.get(t.end)), s = n.map((e) => {
+		let r = [], { pSrcPort: i, pDstPort: a } = ee(e, o.get(t.start), o.get(t.end)), s = n.map((e) => {
 			let t = h[e], n = ce.get(`${t.edgeIndex}-${t.segmentIndex}`) ?? t.pipe.coord;
 			return {
 				orient: t.orientation,
@@ -4886,15 +4673,15 @@ function nr(t, n) {
 		r.push(i);
 		for (let e = 0; e < s.length; e++) {
 			let t = s[e], n = r[r.length - 1], i = t.orient === "vertical" ? n.y : n.x, a = t.orient === "vertical" ? n.x : n.y, o = s[e + 1], c = e < s.length - 1;
-			if (Math.abs(a - t.coord) > $ && r.push(tr(t, i)), c && o.orient === t.orient) {
+			if (Math.abs(a - t.coord) > $ && r.push(In(t, i)), c && o.orient === t.orient) {
 				if (Math.abs(t.coord - o.coord) > $) {
-					let e = t.orient === "vertical" ? (i + o.from) / 2 : er(t, o);
-					r.push(tr(t, e), tr(o, e));
-				} else (e === 0 || e === s.length - 2) && r.push(tr(t, er(t, o)));
-			} else if (c) r.push(tr(t, o.coord));
+					let e = t.orient === "vertical" ? (i + o.from) / 2 : Fn(t, o);
+					r.push(In(t, e), In(o, e));
+				} else (e === 0 || e === s.length - 2) && r.push(In(t, Fn(t, o)));
+			} else if (c) r.push(In(t, o.coord));
 			else {
 				let e = Math.abs(t.from - i) < Math.abs(t.to - i) ? t.to : t.from;
-				r.push(tr(t, e));
+				r.push(In(t, e));
 			}
 		}
 		let c = r[r.length - 1];
@@ -4940,13 +4727,13 @@ function nr(t, n) {
 	}
 	return t;
 }
-e(nr, "routeEdgesOrthogonal");
-function rr(e) {
+e(Ln, "routeEdgesOrthogonal");
+function Rn(e) {
 	return e.direction ?? "TB";
 }
-e(rr, "getSwimlaneDirection");
-function ir(e) {
-	let t = A(e), n = e.config.flowchart?.nodeSpacing ?? 40, r = e.config.flowchart?.rankSpacing ?? 100, i = e.config.swimlane?.ignoreCrossLaneEdges ?? !0, a = e.config.swimlane?.optimizeRanksByCrossings ?? !0, o = e.config.swimlane?.automaticLaneOrdering ?? !1, s = rr(e), { ordered: c, coordinates: l } = Kn(t, {
+e(Rn, "getSwimlaneDirection");
+function zn(e) {
+	let t = d(e), n = e.config.flowchart?.nodeSpacing ?? 40, r = e.config.flowchart?.rankSpacing ?? 100, i = e.config.swimlane?.ignoreCrossLaneEdges ?? !0, a = e.config.swimlane?.optimizeRanksByCrossings ?? !0, o = e.config.swimlane?.automaticLaneOrdering ?? !1, s = Rn(e), { ordered: c, coordinates: l } = Dn(t, {
 		nodeGap: n,
 		layerGap: r,
 		ignoreCrossLaneEdges: i,
@@ -4954,26 +4741,26 @@ function ir(e) {
 		automaticLaneOrdering: o,
 		direction: s
 	});
-	j(t, c, l, {
+	f(t, c, l, {
 		nodeGap: n,
 		layerGap: r
 	});
 	for (let t of e.edges ?? []) delete t.points;
-	nr(e, s);
+	Ln(e, s);
 	for (let t of e.edges ?? []) (!t.curve || t.curve === "basis") && (t.curve = "rounded");
-	return It(e, s), Ft(e), s;
+	return _t(e, s), gt(e), s;
 }
-e(ir, "runSwimlaneLayoutCore");
-function ar(e) {
-	k(e);
-	let t = te(e);
+e(zn, "runSwimlaneLayoutCore");
+function Bn(e) {
+	u(e);
+	let t = m(e);
 	e.nodes = t.nodes, e.edges = t.edges;
 }
-e(ar, "prepareSwimlaneLayout");
-var or = r({
-	prepareLayout: ar,
-	runLayoutCore: ir,
-	afterPaint: C
+e(Bn, "prepareSwimlaneLayout");
+var Vn = n({
+	prepareLayout: Bn,
+	runLayoutCore: zn,
+	afterPaint: i
 });
 //#endregion
-export { or as render };
+export { Vn as render };