@pi-outpost/embed 0.38.0 → 0.40.0

package/dist/{swimlanes-N4OXWK64-DipLcZla.js → swimlanes-B3ENRKFQ-Do-xntE9.js}

@@ -1,17 +1,17 @@
 import { n as e } from "./chunk-Y2CYZVJY-CwsV_8W4.js";
 import { m as t } from "./src-Dkp7vqs8.js";
-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
+import "./chunk-DSNLSHJZ-Bicto10E.js";
+import "./chunk-7S6XSTFO-DV8etStf.js";
+import "./chunk-YZO67HFG-DWHo0c6-.js";
+import "./chunk-AQDTSKZB-CUCC855j.js";
+import "./chunk-UHW7PFBP-NbzzxkEP.js";
+import "./chunk-HAGFOTED-BjDmRfgG.js";
+import "./chunk-ZAUX2LTX-COHXRsvU.js";
+import "./chunk-WQQL4CDK-l3Yf4SAX.js";
+import "./chunk-HNE4Q36P-5u7dvjgt.js";
+import { r as n } from "./chunk-ZCHMQSOR-Cw-9SNln.js";
+import { t as r } from "./chunk-4EMNKR2T-C2XrT3x_.js";
+//#region ../node_modules/mermaid/dist/chunks/mermaid.core/swimlanes-B3ENRKFQ.mjs
 function i(e, { measure: t }) {
 	let n = e.config?.swimlane?.lineHops;
 	if (n === !1) return;
@@ -1269,8 +1269,8 @@ function Ue(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) {
+var Y = .001, X = 8, We = /* @__PURE__ */ e((e) => typeof e == "string" ? e.toUpperCase() : "", "upperCaseDirection"), Z = T, Ge = /* @__PURE__ */ e((e, t) => y(e, t, Y) || b(e, t, Y), "orthogonallyAligned");
+function Ke(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), {
@@ -1286,7 +1286,7 @@ function Ge(t, n) {
 		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 (We(l, u) && (d = l), y(u, d, Y)) return {
+		if (Ge(l, u) && (d = l), y(u, d, Y)) return {
 			edge: e,
 			edgeId: String(e.id ?? ""),
 			nodeId: a,
@@ -1337,14 +1337,14 @@ function Ge(t, n) {
 		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 && v(r[1], t.railEnd, Y), n = r.slice(e ? 2 : 1), o = n[0];
-			return o && !We(o, a) ? void 0 : [
+			return o && !Ge(o, a) ? void 0 : [
 				i,
 				a,
 				...n
 			];
 		}
 		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 [
+		if (!(c && !Ge(c, a))) return [
 			...s,
 			a,
 			i
@@ -1392,8 +1392,8 @@ function Ge(t, n) {
 		if (!n) return;
 	}
 }
-e(Ge, "separateSharedRenderedTerminalLanes");
-function Ke(t, n) {
+e(Ke, "separateSharedRenderedTerminalLanes");
+function qe(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;
@@ -1440,8 +1440,8 @@ function Ke(t, n) {
 		if (!e) return;
 	}
 }
-e(Ke, "collapseRedundantRectangularDoglegs");
-function qe(t, n) {
+e(qe, "collapseRedundantRectangularDoglegs");
+function Je(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++) {
@@ -1505,9 +1505,9 @@ function qe(t, n) {
 		if (!t) return;
 	}
 }
-e(qe, "liftObstacleHuggingSameSideRails");
-function Je(t, n) {
-	let r = /* @__PURE__ */ e((e) => {
+e(Je, "liftObstacleHuggingSameSideRails");
+function Ye(t, n, r) {
+	let i = /* @__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 {
 			left: t.left,
@@ -1515,41 +1515,41 @@ function Je(t, n) {
 			top: t.top,
 			bottom: t.bottom
 		};
-	}, "validTitleRect"), i = /* @__PURE__ */ e((e) => {
+	}, "validTitleRect"), a = /* @__PURE__ */ e((e) => {
 		if (!e.isGroup || e.parentId) return;
-		let t = e.direction, n = typeof t == "string" ? t.toUpperCase() : "";
-		if (n === "LR" || n === "RL" || n === "BT") return;
-		let i = r(e), a = e.y, o = e.height;
-		if (!i || typeof a != "number" || typeof o != "number" || !Number.isFinite(a) || !Number.isFinite(o) || o <= 0) return;
-		let s = i.right - i.left, c = i.bottom - i.top;
+		let t = We(e.direction ?? r);
+		if (t === "LR" || t === "RL" || t === "BT") return;
+		let n = i(e), a = e.y, o = e.height;
+		if (!n || typeof a != "number" || typeof o != "number" || !Number.isFinite(a) || !Number.isFinite(o) || o <= 0) return;
+		let s = n.right - n.left, c = n.bottom - n.top;
 		if (!(c <= 0 || s < c)) return {
 			node: e,
-			rect: i
+			rect: n
 		};
-	}, "topLaneTitleFor"), a = /* @__PURE__ */ e((e, t) => {
+	}, "topLaneTitleFor"), o = /* @__PURE__ */ e((e, t) => {
 		if (!e.horizontal) return !1;
 		let n = e.a.y;
-		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;
+		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(a).filter((e) => !!e);
+	if (s.length === 0) return;
+	let c = 0;
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
 		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));
+		for (let e of Z(t)) for (let t of s) o(e, t.rect) && (c = Math.max(c, t.rect.bottom - e.a.y + 4));
 	}
-	if (!(s <= Y)) for (let e of o) {
+	if (!(c <= Y)) for (let e of s) {
 		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 = {
+		typeof t != "number" || typeof n != "number" || !Number.isFinite(t) || !Number.isFinite(n) || n <= 0 || (e.node.y = t - c / 2, e.node.height = n + c, e.node.groupTitleRect = {
 			...e.rect,
-			top: e.rect.top - s,
-			bottom: e.rect.bottom - s
+			top: e.rect.top - c,
+			bottom: e.rect.bottom - c
 		});
 	}
 }
-e(Je, "liftTopLaneTitleBandsAboveRails");
-function Ye(t, n) {
-	let r = /* @__PURE__ */ e((e) => {
+e(Ye, "liftTopLaneTitleBandsAboveRails");
+function Xe(t, n, r) {
+	let i = /* @__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 {
 			left: t.left,
@@ -1557,46 +1557,46 @@ function Ye(t, n) {
 			top: t.top,
 			bottom: t.bottom
 		};
-	}, "validTitleRect"), i = /* @__PURE__ */ e((e) => {
-		if (!e.isGroup || e.parentId || e.direction !== "LR") return;
-		let t = r(e), n = e.x, i = e.width;
-		if (!t || typeof n != "number" || typeof i != "number" || !Number.isFinite(n) || !Number.isFinite(i) || i <= 0) return;
-		let a = t.right - t.left, o = t.bottom - t.top;
-		if (!(a <= 0 || o < a)) return {
+	}, "validTitleRect"), a = /* @__PURE__ */ e((e) => {
+		if (!e.isGroup || e.parentId || We(e.direction ?? r) !== "LR") return;
+		let t = i(e), n = e.x, a = e.width;
+		if (!t || typeof n != "number" || typeof a != "number" || !Number.isFinite(n) || !Number.isFinite(a) || a <= 0) return;
+		let o = t.right - t.left, s = t.bottom - t.top;
+		if (!(o <= 0 || s < o)) return {
 			node: e,
 			rect: t
 		};
-	}, "leftLaneTitleFor"), a = /* @__PURE__ */ e((e, t) => {
+	}, "leftLaneTitleFor"), o = /* @__PURE__ */ e((e, t) => {
 		if (!e.vertical) return !1;
 		let n = e.a.x;
-		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) => {
+		return n < t.left - Y || n > t.right + Y ? !1 : C(e.a.y, e.b.y, t.top, t.bottom) >= X;
+	}, "verticalSegmentIntersectsTitle"), s = /* @__PURE__ */ e((e, t) => {
 		if (!e.horizontal) return !1;
 		let n = e.a.y;
-		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;
+		return n < t.top - Y || n > t.bottom + Y ? !1 : C(e.a.x, e.b.x, t.left, t.right) >= X;
+	}, "horizontalSegmentIntersectsTitle"), c = [...n.values()].map(a).filter((e) => !!e);
+	if (c.length === 0) return;
+	let l = 0;
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
 		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)) {
+		for (let e of Z(t)) for (let t of c) if (o(e, t.rect)) l = Math.max(l, t.rect.right - e.a.x + 4);
+		else if (s(e, t.rect)) {
 			let n = Math.min(e.a.x, e.b.x);
-			c = Math.max(c, t.rect.right - n + 4);
+			l = Math.max(l, t.rect.right - n + 4);
 		}
 	}
-	if (!(c <= Y)) for (let e of s) {
+	if (!(l <= Y)) for (let e of c) {
 		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 = {
+		typeof t != "number" || typeof n != "number" || !Number.isFinite(t) || !Number.isFinite(n) || n <= 0 || (e.node.x = t - l / 2, e.node.width = n + l, e.node.groupTitleRect = {
 			...e.rect,
-			left: e.rect.left - c,
-			right: e.rect.right - c
+			left: e.rect.left - l,
+			right: e.rect.right - l
 		});
 	}
 }
-e(Ye, "shiftLeftLaneTitleBandsLeftOfRails");
-function Xe(t, n) {
+e(Xe, "shiftLeftLaneTitleBandsLeftOfRails");
+function Ze(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++) {
@@ -1673,8 +1673,8 @@ function Xe(t, n) {
 		for (let [e, t] of n) e.points = t;
 	}
 }
-e(Xe, "swapDestinationTerminalTailsToReduceCrossings");
-function Ze(t, n) {
+e(Ze, "swapDestinationTerminalTailsToReduceCrossings");
+function Qe(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++) {
@@ -1818,8 +1818,8 @@ function Ze(t, n) {
 		for (let [e, n] of t) e.points = n;
 	}
 }
-e(Ze, "reassignCrossingExternalRailChannels");
-function Qe(t, n) {
+e(Qe, "reassignCrossingExternalRailChannels");
+function $e(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);
@@ -1893,8 +1893,8 @@ function Qe(t, n) {
 		t.points = n;
 	}
 }
-e(Qe, "shortcutRedundantOrthogonalJogs");
-function $e(t, n) {
+e($e, "shortcutRedundantOrthogonalJogs");
+function et(t, n) {
 	let r = [];
 	for (let e of n.values()) {
 		if (e.isGroup || e.isEdgeLabel) continue;
@@ -2316,9 +2316,9 @@ function $e(t, n) {
 		for (let [e, t] of o) e.points = t;
 	}
 }
-e($e, "resolveRenderedOrthogonalCrossings");
-var et = .001, tt = 8;
-function nt(t, n) {
+e(et, "resolveRenderedOrthogonalCrossings");
+var tt = .001, nt = 8;
+function rt(t, n) {
 	let { nodeInfoById: r, realNodeRects: i } = R(n), a = [
 		"top",
 		"bottom",
@@ -2330,7 +2330,7 @@ function nt(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 = ee(e, t, n, r, 20, et);
+		let i = [], a = ee(e, t, n, r, 20, tt);
 		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++) {
@@ -2339,18 +2339,18 @@ function nt(t, n) {
 		}
 		return !1;
 	}, "pathHitsNode"), l = /* @__PURE__ */ e((e, n, r = !1) => {
-		let i = 0, a = T(e, et), o = n.start, s = n.end;
+		let i = 0, a = T(e, tt), 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 T(l, et)) {
-				if (re(e.a, e.b, t.a, t.b, et, et)) {
+			if (!(!l || l.length < 2)) for (let e of a) for (let t of T(l, tt)) {
+				if (re(e.a, e.b, t.a, t.b, tt, tt)) {
 					i++;
 					continue;
 				}
-				w(e, t, et) >= tt && i++;
+				w(e, t, tt) >= nt && i++;
 			}
 		}
 		return i;
@@ -2383,7 +2383,7 @@ function nt(t, n) {
 		if (e.isLayoutOnly) continue;
 		let t = e.points;
 		if (!t || t.length < 2) continue;
-		let n = E(t, et);
+		let n = E(t, tt);
 		if (n < 4) continue;
 		let i = e.start, o = e.end;
 		if (!i || !o) continue;
@@ -2398,7 +2398,7 @@ function nt(t, n) {
 				let a = I(h, r);
 				for (let u of s(n, t, a, r)) {
 					if (c(u, [i, o])) continue;
-					let t = E(u, et);
+					let t = E(u, tt);
 					if (_ > 0) {
 						let n = l(u, e, !0);
 						if (n > b || n === b && t >= x) continue;
@@ -2418,27 +2418,27 @@ function nt(t, n) {
 		}
 	}
 }
-e(nt, "simplifyDetouredEdges");
-var Q = .001, rt = 10, it = 7;
-function at(e, t) {
+e(rt, "simplifyDetouredEdges");
+var Q = .001, it = 10, at = 7;
+function ot(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) < Q)) {
 		if (Math.abs(s) <= Q) {
-			let e = i.x + Math.sign(o) * rt;
+			let e = i.x + Math.sign(o) * it;
 			return {
 				left: Math.min(i.x, e),
 				right: Math.max(i.x, e),
-				top: i.y - it,
-				bottom: i.y + it
+				top: i.y - at,
+				bottom: i.y + at
 			};
 		}
 		if (Math.abs(o) <= Q) {
-			let e = i.y + Math.sign(s) * rt;
+			let e = i.y + Math.sign(s) * it;
 			return {
-				left: i.x - it,
-				right: i.x + it,
+				left: i.x - at,
+				right: i.x + at,
 				top: Math.min(i.y, e),
 				bottom: Math.max(i.y, e)
 			};
@@ -2451,8 +2451,8 @@ function at(e, t) {
 		};
 	}
 }
-e(at, "markerClearanceRectFor");
-function ot(e) {
+e(ot, "markerClearanceRectFor");
+function st(e) {
 	return {
 		left: Math.min(e.left, e.right),
 		right: Math.max(e.left, e.right),
@@ -2460,13 +2460,13 @@ function ot(e) {
 		bottom: Math.max(e.top, e.bottom)
 	};
 }
-e(ot, "normalizeRect");
-function st(e, t) {
+e(st, "normalizeRect");
+function ct(e, t) {
 	let n = D(t);
-	return [at(n, !0), at(n, !1)].some((t) => t && M(e, ot(t)));
+	return [ot(n, !0), ot(n, !1)].some((t) => t && M(e, st(t)));
 }
-e(st, "labelOverlapsOwnMarker");
-function ct(t, n) {
+e(ct, "labelOverlapsOwnMarker");
+function lt(t, n) {
 	let r = [];
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
@@ -2586,7 +2586,7 @@ function ct(t, n) {
 				let i = C(e, n);
 				if (!O(e, i)) continue;
 				let a = E(i);
-				if (a && !st(a.rect, f) && !d(t, a.rect) && !c(t, r.id, a.rect)) return {
+				if (a && !ct(a.rect, f) && !d(t, a.rect) && !c(t, r.id, a.rect)) return {
 					laneId: a.laneId,
 					anchor: a.anchor
 				};
@@ -2600,7 +2600,7 @@ function ct(t, n) {
 				};
 				if (n && !O(e, a)) continue;
 				let c = E(a);
-				if (c && !st(c.rect, f) && !d(t, c.rect) && !o(t, c.rect) && (i || !s(r.id, c.rect))) return {
+				if (c && !ct(c.rect, f) && !d(t, c.rect) && !o(t, c.rect) && (i || !s(r.id, c.rect))) return {
 					laneId: c.laneId,
 					anchor: c.anchor
 				};
@@ -2619,13 +2619,13 @@ function ct(t, n) {
 		}
 	}
 }
-e(ct, "anchorLabelsToPolyline");
-var lt = 1e-6, ut = 4, dt = 3;
-function ft(e, t) {
+e(lt, "anchorLabelsToPolyline");
+var ut = 1e-6, dt = 4, ft = 3;
+function pt(e, t) {
 	return e < t ? `${e}::${t}` : `${t}::${e}`;
 }
-e(ft, "pairKey");
-function pt(t, n) {
+e(pt, "pairKey");
+function mt(t, n) {
 	let { nodeInfoById: r, realNodeRects: i } = R(n), a = /* @__PURE__ */ new Map();
 	for (let e of n) {
 		let t = e.id;
@@ -2638,7 +2638,7 @@ function pt(t, n) {
 		}
 	}
 	let o = /* @__PURE__ */ e((n, r, i, o) => {
-		let s = ft(r, i), c = 0, l = /* @__PURE__ */ e((e) => {
+		let s = pt(r, i), c = 0, l = /* @__PURE__ */ e((e) => {
 			if (!e) return;
 			let t = a.get(e);
 			if (!t) return;
@@ -2649,15 +2649,15 @@ function pt(t, n) {
 		for (let e of t) {
 			if (e === n || e.isLayoutOnly) continue;
 			let t = e.start, r = e.end;
-			!t || !r || ft(t, r) === s && l(e.labelNodeId);
+			!t || !r || pt(t, r) === s && l(e.labelNodeId);
 		}
-		return c > 0 ? c + dt : 0;
+		return c > 0 ? c + ft : 0;
 	}, "labelClearanceFor");
 	for (let e of t) {
 		if (e.isLayoutOnly) continue;
 		let n = e.points;
-		if (!O(n, lt)) continue;
-		let a = ne(e, r, lt);
+		if (!O(n, ut)) continue;
+		let a = ne(e, r, ut);
 		if (!a) continue;
 		let { srcId: s, dstId: c, srcInfo: l, dstInfo: u, collinearX: d, collinearY: f } = a;
 		if (d === f) continue;
@@ -2682,7 +2682,7 @@ function pt(t, n) {
 			};
 		}
 		if (B(p, m, i, [s, c], 1)) continue;
-		let h = o(e, s, c, d ? "x" : "y"), g = h > ut ? h : ut, _ = [
+		let h = o(e, s, c, d ? "x" : "y"), g = h > dt ? h : dt, _ = [
 			0,
 			g,
 			-g
@@ -2692,15 +2692,15 @@ function pt(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 (!B(r, a, i, [s, c], 1) && !ae(r, a, t, e, { epsilon: lt })) {
+			if (!B(r, a, i, [s, c], 1) && !ae(r, a, t, e, { epsilon: ut })) {
 				e.points = [r, a];
 				break;
 			}
 		}
 	}
 }
-e(pt, "straightenCollinearSiblingDetours");
-function mt(t, n) {
+e(mt, "straightenCollinearSiblingDetours");
+function ht(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,
@@ -2832,15 +2832,15 @@ function mt(t, n) {
 		if (!t) return;
 	}
 }
-e(mt, "nudgeSharedInteriorSubpaths");
-function ht(e, t, n, r) {
+e(ht, "nudgeSharedInteriorSubpaths");
+function gt(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(ht, "segmentsIntersect");
-function gt(e) {
+e(gt, "segmentsIntersect");
+function _t(e) {
 	let n = e.nodes ?? [], r = e.edges ?? [], i = [];
 	if (!r.length || !n.length) return i;
 	let a = te(n), o = [];
@@ -2871,7 +2871,7 @@ function gt(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 && ht(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 && gt(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",
@@ -2888,8 +2888,8 @@ function gt(e) {
 	}
 	return i;
 }
-e(gt, "validateSwimlanesLayout");
-function _t(t, n) {
+e(_t, "validateSwimlanesLayout");
+function vt(t, n) {
 	let r = t.nodes ?? [], i = t.edges ?? [], a = r.filter((e) => !e.isGroup);
 	if ((n === "LR" || n === "RL") && a.length > 0 && !Re(t, n) || n === "BT" && a.length > 0 && !Le(t)) return;
 	for (let e of i) {
@@ -2897,17 +2897,17 @@ function _t(t, n) {
 		let t = e.points;
 		!t || t.length < 2 || (e.points = G(W(t)));
 	}
-	nt(i, r), pt(i, r), He(i, r);
+	rt(i, r), mt(i, r), He(i, r);
 	let o = /* @__PURE__ */ new Map();
 	for (let e of r) o.set(String(e.id), e);
-	ct(i, o), q(i, o), Ue(i, o), mt(i, o), Ge(i, o), Ke(i, o), qe(i, o), Xe(i, o);
+	lt(i, o), q(i, o), Ue(i, o), ht(i, o), Ke(i, o), qe(i, o), Je(i, o), Ze(i, o);
 	let s = /* @__PURE__ */ e(() => {
-		$e(i, o), Ze(i, o), Qe(i, o), ct(i, o), ke(i, o), qe(i, o), ct(i, o), ke(i, o);
+		et(i, o), Ke(i, o), Qe(i, o), $e(i, o), lt(i, o), ke(i, o), Je(i, o), lt(i, o), ke(i, o);
 	}, "finalizeRenderedEdges");
-	s(), mt(i, o), s(), Je(i, o), Ye(i, o), Je(i, o), Ye(i, o);
+	s(), ht(i, o), s(), Ye(i, o, n), Xe(i, o, n), Ye(i, o, n), Xe(i, o, n);
 }
-e(_t, "postProcessSwimlaneLayout");
-function vt(e) {
+e(vt, "postProcessSwimlaneLayout");
+function yt(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;
@@ -2921,36 +2921,37 @@ function vt(e) {
 		nodeById: t
 	};
 }
-e(vt, "normalizeGraph");
-function yt(e, t) {
+e(yt, "normalizeGraph");
+function bt(e, t) {
 	return e.edges.filter((e) => e.dst === t);
 }
-e(yt, "incoming");
-function bt(e) {
+e(bt, "incoming");
+function xt(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(bt, "buildSuccessorMap");
-function xt(e) {
-	let t = bt(e);
+e(xt, "buildSuccessorMap");
+function St(e) {
+	let t = xt(e);
 	for (let e of t.values()) e.sort((e, t) => e.localeCompare(t));
 	return t;
 }
-e(xt, "buildSortedSuccessorMap");
-function St(e) {
+e(St, "buildSortedSuccessorMap");
+function Ct(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(St, "buildInDegreeMap");
-function Ct(e) {
-	return [...e.entries()].filter(([, e]) => e === 0).map(([e]) => e).sort((e, t) => e.localeCompare(t));
+e(Ct, "buildInDegreeMap");
+function wt(t, n) {
+	let r = [...n.entries()].filter(([, e]) => e === 0).map(([e]) => e).sort((e, t) => e.localeCompare(t)), i = new Set(t.edges.flatMap((e) => [e.src, e.dst])), a = /* @__PURE__ */ e((e) => !i.has(e) && !t.nodeById.get(e)?.isGroup, "isUnconnected"), o = [...n.keys()].filter((e) => n.get(e) === 0 && a(e)), s = 0;
+	return r.map((e) => a(e) ? o[s++] : e);
 }
-e(Ct, "sortedZeroInDegreeNodes");
-function wt(e, t = () => !0) {
+e(wt, "sortedZeroInDegreeNodes");
+function Tt(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));
@@ -2959,17 +2960,17 @@ function wt(e, t = () => !0) {
 		succs: r
 	};
 }
-e(wt, "buildPredecessorSuccessorMaps");
-function Tt(e, t, n, r) {
+e(Tt, "buildPredecessorSuccessorMaps");
+function Et(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(Tt, "buildLayersFromRanks");
-function Et(e) {
-	let t = St(e), n = Ct(t), r = [], i = xt(e);
+e(Et, "buildLayersFromRanks");
+function Dt(e) {
+	let t = Ct(e), n = wt(e, t), r = [], i = St(e);
 	for (; n.length;) {
 		let e = n.shift();
 		r.push(e);
@@ -2981,14 +2982,14 @@ function Et(e) {
 	}
 	return r.length === e.nodes.length ? r : null;
 }
-e(Et, "topoSortIfAcyclic");
-function Dt(e) {
+e(Dt, "topoSortIfAcyclic");
+function Ot(e) {
 	let t = /* @__PURE__ */ new Map(), n = 0;
 	for (let r of e) t.set(r, n), n++;
 	return t;
 }
-e(Dt, "buildLayerIndex");
-function Ot(t) {
+e(Ot, "buildLayerIndex");
+function kt(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;
@@ -2998,9 +2999,9 @@ function Ot(t) {
 	}, "count");
 	return r(0, t.length);
 }
-e(Ot, "countInversions");
-function kt(t) {
-	let n = vt(t), r = /* @__PURE__ */ new Map();
+e(kt, "countInversions");
+function At(t) {
+	let n = yt(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));
@@ -3013,7 +3014,7 @@ function kt(t) {
 			i[e] === 0 ? o(e) : i[e] === 1 && a.push(t);
 		}
 		i[e] = 2;
-	}, "dfs"), s = St(n), c = [...n.nodes.filter((e) => (s.get(e) ?? 0) === 0), ...n.nodes.filter((e) => (s.get(e) ?? 0) !== 0)];
+	}, "dfs"), s = Ct(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,
@@ -3032,8 +3033,8 @@ function kt(t) {
 		reversed: a
 	};
 }
-e(kt, "removeCycles_DFS");
-function At(t) {
+e(At, "removeCycles_DFS");
+function jt(t) {
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ e((e) => {
 		if (n.has(e)) return n.get(e);
 		let i = t.nodeById.get(e);
@@ -3046,46 +3047,46 @@ function At(t) {
 	for (let e of t.nodes) r(e);
 	return n;
 }
-e(At, "buildTopLaneMap");
-function jt(e) {
-	let t = At(e);
+e(jt, "buildTopLaneMap");
+function Mt(e) {
+	let t = jt(e);
 	return (e) => t.get(e) ?? null;
 }
-e(jt, "createTopLaneResolver");
-function Mt(e) {
+e(Mt, "createTopLaneResolver");
+function Nt(e) {
 	let t = [];
 	for (let n of e.layout.nodes ?? []) n.isGroup && !n.parentId && t.push(n.id);
 	return [...new Set(t)].reverse();
 }
-e(Mt, "buildTopLaneOrder");
-function Nt(e, t) {
-	let n = Mt(e);
+e(Nt, "buildTopLaneOrder");
+function Pt(e, t) {
+	let n = Nt(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(Nt, "resolveTopLaneOrder");
-var Pt = { EPSILON: 1e-6 }, Ft = {
+e(Pt, "resolveTopLaneOrder");
+var Ft = { EPSILON: 1e-6 }, It = {
 	GRAVITY_ITERATIONS: 8,
 	MAX_CROSSING_OPTIMIZATION_PASSES: 4,
 	DEFAULT_COMPACT_SINGLE_INPUT: !0
-}, It = {
+}, Lt = {
 	DEFAULT_LAYER_GAP: 100,
 	DEFAULT_NODE_GAP: 40
 };
-function Lt(t, n) {
-	let r = vt(t), i = n?.laneOf ?? (() => null), a = n?.rankHint, { preds: o } = wt(r);
+function Rt(t, n) {
+	let r = yt(t), i = n?.laneOf ?? (() => null), a = n?.rankHint, { preds: o } = Tt(r);
 	for (let e of o.values()) e.sort((e, t) => e.localeCompare(t));
-	let s = Et(r) ?? [...r.nodes].sort((e, t) => e.localeCompare(t)), c = /* @__PURE__ */ new Map();
+	let s = Dt(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 = Rt(e, t, {
+			let n = zt(e, t, {
 				laneOf: i,
 				rankHint: a,
 				topoIndex: c
@@ -3099,9 +3100,9 @@ function Lt(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 = zt(r), m = /* @__PURE__ */ new Map();
+	}), p = Bt(r), m = /* @__PURE__ */ new Map();
 	for (let [e, t] of p.entries()) m.set(e, [...t].sort((e, t) => e.localeCompare(t)));
-	let h = Bt(m), g = Vt(m), _ = /* @__PURE__ */ new Map();
+	let h = Vt(m), g = Ht(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);
@@ -3129,8 +3130,8 @@ function Lt(t, n) {
 		topologicalOrder: s
 	};
 }
-e(Lt, "buildDrivingTree");
-function Rt(e, t, n) {
+e(Rt, "buildDrivingTree");
+function zt(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;
@@ -3141,15 +3142,15 @@ function Rt(e, t, n) {
 		return l === u ? e.localeCompare(t) : l - u;
 	})[0];
 }
-e(Rt, "chooseParent");
-function zt(e) {
+e(zt, "chooseParent");
+function Bt(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(zt, "buildAdjacency");
-function Bt(e) {
+e(Bt, "buildAdjacency");
+function Vt(e) {
 	let t = /* @__PURE__ */ new Map(), n = 0;
 	for (let r of e.keys()) {
 		if (t.has(r)) continue;
@@ -3165,17 +3166,17 @@ function Bt(e) {
 	}
 	return t;
 }
-e(Bt, "assignComponents");
-function Vt(t) {
+e(Vt, "assignComponents");
+function Ht(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(Ht(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(Ut(e, l, i, a.length))));
 	}, "visit");
 	for (let e of t.keys()) n.has(e) || s(e, null);
 	return a;
 }
-e(Vt, "computeBlocks");
-function Ht(e, t, n, r) {
+e(Ht, "computeBlocks");
+function Ut(e, t, n, r) {
 	let i = [], a = /* @__PURE__ */ new Set();
 	for (; n.length > 0;) {
 		let r = n.pop();
@@ -3187,8 +3188,8 @@ function Ht(e, t, n, r) {
 		nodes: [...a]
 	};
 }
-e(Ht, "popBlock");
-function Ut(t, n, r) {
+e(Ut, "popBlock");
+function Wt(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();
@@ -3261,11 +3262,11 @@ function Ut(t, n, r) {
 	for (let e of i) _.has(e) || v(e);
 	return h;
 }
-e(Ut, "computeSubtreeCrossCounts");
-function Wt(t, n, r) {
+e(Wt, "computeSubtreeCrossCounts");
+function Gt(t, n, r) {
 	let i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ e((e) => {
 		let t = r[e] ?? 0, o = [...n.get(e) ?? []];
-		o.sort(Gt(r));
+		o.sort(Kt(r));
 		for (let e of o) {
 			a(e);
 			let n = i.get(e);
@@ -3276,15 +3277,15 @@ function Wt(t, n, r) {
 	for (let e of t) a(e);
 	return i;
 }
-e(Wt, "annotateMinimumLayers");
-function Gt(e) {
+e(Gt, "annotateMinimumLayers");
+function Kt(e) {
 	return (t, n) => {
 		let r = e[t] ?? 0, i = e[n] ?? 0;
 		return r === i ? t.localeCompare(n) : r - i;
 	};
 }
-e(Gt, "compareByRankThenId");
-function Kt(t, n, r, i) {
+e(Kt, "compareByRankThenId");
+function qt(t, n, r, i) {
 	let a = 0;
 	for (let e of n) {
 		let t = r[e] ?? 0;
@@ -3304,8 +3305,8 @@ function Kt(t, n, r, i) {
 	}
 	return o;
 }
-e(Kt, "emitNodesInTreeOrder");
-function qt(e) {
+e(qt, "emitNodesInTreeOrder");
+function Jt(e) {
 	let t = [];
 	for (let n of e) {
 		let e = /* @__PURE__ */ new Set(), r = [];
@@ -3314,8 +3315,8 @@ function qt(e) {
 	}
 	return t;
 }
-e(qt, "deduplicateLayers");
-function Jt(e, t, n, r) {
+e(Jt, "deduplicateLayers");
+function Yt(e, t, n, r) {
 	return (i) => {
 		let a = e.get(i) ?? [];
 		if (a.length === 0) return [];
@@ -3335,24 +3336,24 @@ function Jt(e, t, n, r) {
 		}), [...s.map((e) => e.child), ...c];
 	};
 }
-e(Jt, "createChildOrderer");
-function Yt(e, t, n) {
-	let r = Lt(e, {
+e(Yt, "createChildOrderer");
+function Xt(e, t, n) {
+	let r = Rt(e, {
 		rankHint: t,
 		laneOf: n
 	}), { children: i, roots: a } = r;
 	for (let t of e.nodes) i.has(t) || i.set(t, []);
-	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;
+	let o = Wt(e, t, r), s = [...a].sort(Kt(t)), c = Yt(i, t, o, Gt(s, i, t)), l = qt(s, e.nodes, t, c);
+	return l = Jt(l), l;
 }
-e(Yt, "buildMultitreeLayerOrder");
-function Xt(e, t, n) {
-	let r = new Set(e), i = new Set(t), a = Dt(t), o = [];
+e(Xt, "buildMultitreeLayerOrder");
+function Zt(e, t, n) {
+	let r = new Set(e), i = new Set(t), a = Ot(t), o = [];
 	for (let e of n) r.has(e.src) && i.has(e.dst) && o.push(a.get(e.dst));
-	return Ot(o);
+	return kt(o);
 }
-e(Xt, "countCrossingsBetweenAdjacent");
-function Zt(e, t, n) {
+e(Zt, "countCrossingsBetweenAdjacent");
+function Qt(e, t, n) {
 	let r = [];
 	for (let e of t) {
 		let t = n[e.src], i = n[e.dst];
@@ -3367,12 +3368,12 @@ function Zt(e, t, n) {
 		});
 	}
 	let i = 0;
-	for (let t = 0; t + 1 < e.length; t++) i += Xt(e[t], e[t + 1], r);
+	for (let t = 0; t + 1 < e.length; t++) i += Zt(e[t], e[t + 1], r);
 	return i;
 }
-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;
+e(Qt, "totalCrossings");
+function $t(e, t) {
+	let n = { ...t }, { preds: r } = Tt(e), i = Mt(e), a = Qt(Xt(e, n, i), e.edges, n), o = It.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) {
@@ -3383,16 +3384,16 @@ function Qt(e, t) {
 			if (c >= o) continue;
 			let l = o;
 			n[s] = c;
-			let u = Zt(Yt(e, n, i), e.edges, n);
+			let u = Qt(Xt(e, n, i), e.edges, n);
 			u < a ? (a = u, t = !0) : n[s] = l;
 		}
 		if (!t) break;
 	}
 	return 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));
+e($t, "optimizeRanksByCrossings");
+function en(e, t) {
+	let n = Mt(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;
@@ -3417,11 +3418,11 @@ function $t(e, t) {
 		p !== u && (t[i] = p);
 	}
 }
-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);
+e(en, "adjustCrossLaneSources");
+function tn(e, t) {
+	let n = yt(e), r = Dt(n) ?? [...n.nodes].sort(), i = t?.compactSingleInput ?? !1, a = Mt(n), o = /* @__PURE__ */ Object.create(null);
 	for (let e of r) {
-		let r = yt(n, e), s = t?.ignoreCrossLaneEdges ? r.filter((t) => {
+		let r = bt(n, e), s = t?.ignoreCrossLaneEdges ? r.filter((t) => {
 			let n = a(t.src), r = a(e);
 			return !n || !r || n === r;
 		}) : r;
@@ -3435,30 +3436,30 @@ function en(e, t) {
 			o[e] = t === -Infinity ? 0 : t;
 		}
 	}
-	return (t?.optimizeRanksByCrossings ?? !1) && (o = Qt(n, o)), t?.ignoreCrossLaneEdges && $t(n, o), {
-		layers: Yt(n, o, a),
+	return (t?.optimizeRanksByCrossings ?? !1) && (o = $t(n, o)), t?.ignoreCrossLaneEdges && en(n, o), {
+		layers: Xt(n, o, a),
 		rankOf: o,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-e(en, "assignLayers_LongestPath");
-function tn(t, n) {
-	let r = vt(t), i = { ...en(r, {
+e(tn, "assignLayers_LongestPath");
+function nn(t, n) {
+	let r = yt(t), i = { ...tn(r, {
 		compactSingleInput: n?.compactSingleInput,
 		ignoreCrossLaneEdges: n?.ignoreCrossLaneEdges,
 		optimizeRanksByCrossings: n?.optimizeRanksByCrossings
-	}).rankOf }, a = jt(r), { preds: o, succs: s } = wt(r, (e) => {
+	}).rankOf }, a = Mt(r), { preds: o, succs: s } = Tt(r, (e) => {
 		if (n?.ignoreCrossLaneEdges) {
 			let t = a(e.src), n = a(e.dst);
 			if (t && n && t !== n) return !1;
 		}
 		return !0;
-	}), c = Et(r) ?? [...r.nodes], l = [...c].reverse(), u = /* @__PURE__ */ e((e, t) => {
+	}), c = Dt(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 = Ft.GRAVITY_ITERATIONS, f = /* @__PURE__ */ e((e) => {
+	}, "clampFeasible"), d = It.GRAVITY_ITERATIONS, f = /* @__PURE__ */ e((e) => {
 		let t = !1;
 		for (let n of e) {
 			let e = o.get(n) ?? [], r = s.get(n) ?? [];
@@ -3485,14 +3486,14 @@ function tn(t, n) {
 		}
 	}
 	return {
-		layers: Tt(r, c, i),
+		layers: Et(r, c, i),
 		rankOf: i,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-e(tn, "assignLayers_Gravity");
-function nn(e) {
-	let t = St(e), n = xt(e), r = Ct(t), i = [];
+e(nn, "assignLayers_Gravity");
+function rn(e) {
+	let t = Ct(e), n = St(e), r = wt(e, t), i = [];
 	for (; r.length > 0;) {
 		let e = [];
 		for (let a of r) {
@@ -3503,12 +3504,12 @@ function nn(e) {
 	}
 	return i.length === e.nodes.length ? i : null;
 }
-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");
+e(rn, "topoSortByGenerationIfAcyclic");
+function an(t, n) {
+	let r = yt(t), i = n?.direction === "LR" ? rn(r) ?? [...r.nodes].sort() : Dt(r) ?? [...r.nodes].sort(), a = Mt(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 = yt(r, e), n = 0;
+		let t = bt(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));
@@ -3517,14 +3518,14 @@ function rn(t, n) {
 		s[e] = u, c.set(i, u + 1);
 	}
 	return {
-		layers: Tt(r, i, s, { skipGroups: !0 }),
+		layers: Et(r, i, s, { skipGroups: !0 }),
 		rankOf: s,
 		dummy: /* @__PURE__ */ new Set()
 	};
 }
-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) => {
+e(an, "assignLayers_LaneAwareCompact");
+function on(t, n) {
+	let r = yt(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,
@@ -3576,49 +3577,49 @@ function an(t, n) {
 		graphWithDummies: f
 	};
 }
-e(an, "makeProperLayering");
-function on(e) {
+e(on, "makeProperLayering");
+function sn(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(on, "median");
-function sn(e) {
+e(sn, "median");
+function cn(e) {
 	return e.length === 0 ? Infinity : e.reduce((e, t) => e + t, 0) / e.length;
 }
-e(sn, "barycenter");
-function cn(e, t, n, r) {
+e(cn, "barycenter");
+function ln(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(cn, "neighborPositionsFor");
-function ln(e, t, n) {
+e(ln, "neighborPositionsFor");
+function un(e, t, n) {
 	let r = n.get(e) ?? 0, i = n.get(t) ?? 0;
 	return r === i ? e.localeCompare(t) : r - i;
 }
-e(ln, "currentOrderTieBreak");
-function un(e, t, n) {
-	let r = new Set(e), i = new Set(t), a = Dt(e), o = Dt(t), s = [];
+e(un, "currentOrderTieBreak");
+function dn(e, t, n) {
+	let r = new Set(e), i = new Set(t), a = Ot(e), o = Ot(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), Ot(s.map((e) => e.v));
+	return s.sort((e, t) => e.u === t.u ? e.v - t.v : e.u - t.u), kt(s.map((e) => e.v));
 }
-e(un, "countCrossingsBetweenAdjacent");
-function dn(e, t, n) {
+e(dn, "countCrossingsBetweenAdjacent");
+function fn(e, t, n) {
 	return [...e].sort((e, r) => {
-		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;
+		let i = sn(t.get(e) ?? []), a = sn(t.get(r) ?? []);
+		return i === a ? un(e, r, n) : isFinite(i) ? isFinite(a) ? i - a : -1 : 1;
 	});
 }
-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);
+e(fn, "sortByHeuristic");
+function pn(e, t, n, r, i, a) {
+	let o = Ot(e), s = Ot(t), c = ln(t, o, n, r);
+	if (!i || !a || a.length === 0) return fn(t, c, s);
 	let l = /* @__PURE__ */ new Map();
 	for (let e of t) {
 		let t = i(e), n = l.get(t) ?? [];
@@ -3628,16 +3629,16 @@ function fn(e, t, n, r, i, a) {
 	for (let e of a) {
 		let t = l.get(e);
 		if (!t || t.length === 0) continue;
-		let n = dn(t, c, s);
+		let n = fn(t, c, s);
 		u.push(...n);
 	}
 	let d = l.get(null);
 	if (d && d.length > 0) {
-		let e = dn(d, c, s);
+		let e = fn(d, c, s);
 		for (let t of e) {
-			let e = sn(c.get(t) ?? []), n = u.length;
+			let e = cn(c.get(t) ?? []), n = u.length;
 			if (isFinite(e)) {
-				for (let [t, r] of u.entries()) if (e < sn(c.get(r) ?? [])) {
+				for (let [t, r] of u.entries()) if (e < cn(c.get(r) ?? [])) {
 					n = t;
 					break;
 				}
@@ -3647,11 +3648,11 @@ function fn(e, t, n, r, i, a) {
 	}
 	return u;
 }
-e(fn, "reorderLayer");
-function pn(t, n, r, i, a) {
+e(pn, "reorderLayer");
+function mn(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 = un(t, e, u);
-		return d && i && (n += un(e, i, d)), n;
+		let n = dn(t, e, u);
+		return d && i && (n += dn(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);
@@ -3667,18 +3668,18 @@ function pn(t, n, r, i, a) {
 	}
 	return o;
 }
-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);
+e(mn, "transposeImprove");
+function hn(e, t, n) {
+	let r = e.layers.map((e) => [...e]), i = t.edges, a = Mt(t), o = Pt(t, n?.laneOrder);
 	for (let e = 0; e < 3; e++) {
-		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);
+		for (let e = 1; e < r.length; e++) r[e] = pn(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] = pn(r[e + 1], r[e], i, "up", a, o), r[e] = mn(r[e + 1], r[e], i, r[e - 1], a);
 	}
 	return { layers: r };
 }
-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 = [];
+e(hn, "orderLayers");
+function gn(t, n, r) {
+	let i = r?.layerGap ?? Lt.DEFAULT_LAYER_GAP, a = r?.nodeGap ?? Lt.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 = Mt(n), g = Pt(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);
@@ -3754,15 +3755,15 @@ function hn(t, n, r) {
 		y: d
 	};
 }
-e(hn, "assignCoordinates");
-var gn = 8;
-function _n(e) {
+e(gn, "assignCoordinates");
+var _n = 8;
+function vn(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(_n, "hashString");
-function vn(e) {
+e(vn, "hashString");
+function yn(e) {
 	let t = e >>> 0;
 	return () => {
 		t += 1831565813;
@@ -3770,23 +3771,23 @@ function vn(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(vn, "mulberry32");
-function yn(e, t) {
-	let n = [...e], r = vn(t);
+e(yn, "mulberry32");
+function bn(e, t) {
+	let n = [...e], r = yn(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(yn, "deterministicShuffle");
-function bn(e, t) {
+e(bn, "deterministicShuffle");
+function xn(e, t) {
 	let n = 0;
 	for (let [r, i] of e.entries()) n += Math.abs(r - (t.get(i) ?? r));
 	return n;
 }
-e(bn, "sourceDistance");
-function xn(e, t) {
+e(xn, "sourceDistance");
+function Sn(e, t) {
 	let n = /* @__PURE__ */ new Map();
 	for (let [t, r] of e.entries()) n.set(r, t);
 	let r = 0;
@@ -3796,11 +3797,11 @@ function xn(e, t) {
 	}
 	return r;
 }
-e(xn, "laneArrangementCost");
-function Sn(e) {
-	let t = Mt(e);
+e(Sn, "laneArrangementCost");
+function Cn(e) {
+	let t = Nt(e);
 	if (t.length < 2) return [];
-	let n = new Map(t.map((e, t) => [e, t])), r = jt(e), i = /* @__PURE__ */ new Map();
+	let n = new Map(t.map((e, t) => [e, t])), r = Mt(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;
@@ -3818,56 +3819,56 @@ function Sn(e) {
 	}
 	return [...i.values()];
 }
-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);
+e(Cn, "buildWeightedLaneEdges");
+function wn(e, t, n) {
+	let r = [...e], i = Sn(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 = xn(r, t);
+			let n = Sn(r, t);
 			n < i ? (i = n, a = !0) : [r[e], r[e + 1]] = [r[e + 1], r[e]];
 		}
 	}
 	return {
 		order: r,
 		cost: i,
-		sourceDistance: bn(r, n)
+		sourceDistance: xn(r, n)
 	};
 }
-e(Cn, "greedySwitch");
-function wn(e, t) {
+e(wn, "greedySwitch");
+function Tn(e, t) {
 	return e.cost === t.cost ? e.sourceDistance < t.sourceDistance : e.cost < t.cost;
 }
-e(wn, "isBetterCandidate");
-function Tn(e, t, n) {
+e(Tn, "isBetterCandidate");
+function En(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 _n(`${e.join("|")}#${r}#${n}`);
+	return vn(`${e.join("|")}#${r}#${n}`);
 }
-e(Tn, "seedForRestart");
-function En(e, t = {}) {
-	let n = Mt(e);
+e(En, "seedForRestart");
+function Dn(e, t = {}) {
+	let n = Nt(e);
 	if (n.length < 2) return n;
-	let r = Sn(e);
+	let r = Cn(e);
 	if (r.length === 0) return n;
-	let i = new Map(n.map((e, t) => [e, t])), a = Cn(n, r, i), o = Math.max(0, t.restarts ?? gn);
+	let i = new Map(n.map((e, t) => [e, t])), a = wn(n, r, i), o = Math.max(0, t.restarts ?? _n);
 	for (let e = 0; e < o; e++) {
-		let t = Cn(yn(n, Tn(n, r, e)), r, i);
-		wn(t, a) && (a = t);
+		let t = wn(bn(n, En(n, r, e)), r, i);
+		Tn(t, a) && (a = t);
 	}
 	return a.order;
 }
-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,
+e(Dn, "optimizeTopLaneOrder");
+function On(e, t) {
+	let n = t?.ignoreCrossLaneEdges ?? !0, r = t?.optimizeRanksByCrossings ?? !0, i = yt(e), a = t?.automaticLaneOrdering ? Dn(i, { restarts: _n }) : void 0, o = At(i), s = o.acyclic, { layering: c, graphWithDummies: l } = on(n ? an(s, {
+		compactSingleInput: t?.compactSingleInput ?? It.DEFAULT_COMPACT_SINGLE_INPUT,
 		ignoreCrossLaneEdges: !0,
 		direction: t?.direction
-	}) : tn(s, {
-		compactSingleInput: t?.compactSingleInput ?? Ft.DEFAULT_COMPACT_SINGLE_INPUT,
+	}) : nn(s, {
+		compactSingleInput: t?.compactSingleInput ?? It.DEFAULT_COMPACT_SINGLE_INPUT,
 		ignoreCrossLaneEdges: !1,
 		optimizeRanksByCrossings: r
-	}), s), u = mn(c, l, { laneOrder: a }), d = hn(u, l, {
+	}), s), u = hn(c, l, { laneOrder: a }), d = gn(u, l, {
 		layerGap: t?.layerGap,
 		nodeGap: t?.nodeGap,
 		direction: t?.direction,
@@ -3881,18 +3882,18 @@ function Dn(e, t) {
 		coordinates: d
 	};
 }
-e(Dn, "sugiyamaLayout");
-var $ = Pt.EPSILON, On = 8, kn = 15, An = 15, jn = 25, Mn = 20, Nn = 10;
-function Pn(e, t, n) {
+e(On, "sugiyamaLayout");
+var $ = Ft.EPSILON, kn = 8, An = 15, jn = 15, Mn = 25, Nn = 20, Pn = 10;
+function Fn(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(Pn, "chooseOrthogonalSide");
-function Fn(e, t) {
+e(Fn, "chooseOrthogonalSide");
+function In(e, t) {
 	return Math.abs(e.to - t.from) < $ || Math.abs(e.to - t.to) < $ ? e.to : e.from;
 }
-e(Fn, "sharedLineEndpointCoord");
-function In(e, t) {
+e(In, "sharedLineEndpointCoord");
+function Ln(e, t) {
 	return e.orient === "vertical" ? {
 		x: e.coord,
 		y: t
@@ -3901,8 +3902,8 @@ function In(e, t) {
 		y: e.coord
 	};
 }
-e(In, "pointOnLine");
-function Ln(t, n) {
+e(Ln, "pointOnLine");
+function Rn(t, n) {
 	let r = t.nodes ?? [], i = t.edges ?? [], a = [];
 	for (let e of i) e.isLayoutOnly || a.push({
 		...e,
@@ -3918,7 +3919,7 @@ function Ln(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 = On;
+		let t = e.width ?? 10, n = e.height ?? 10, r = e.x ?? 0, i = e.y ?? 0, a = kn;
 		return {
 			nodeId: e.id,
 			minX: r - t / 2 - a,
@@ -3957,7 +3958,7 @@ function Ln(t, n) {
 				y: a
 			};
 		}
-	}, "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) => {
+	}, "portForSide"), m = /* @__PURE__ */ e((e, t, n) => p(e, Fn(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;
@@ -3995,7 +3996,7 @@ function Ln(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) => Pn(e, t, "bottom"), "determineSide"), T = /* @__PURE__ */ new Map();
+	let w = /* @__PURE__ */ e((e, t) => Fn(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);
@@ -4101,7 +4102,7 @@ function Ln(t, n) {
 		let r = o.get(n.start), i = o.get(n.end);
 		if (!r || !i) continue;
 		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;
+		w ? v.y = s.y > (r.y ?? 0) ? s.y + Nn : s.y - Nn : v.x = s.x > (r.x ?? 0) ? s.x + Nn : s.x - Nn, T ? b.y = u.y > (i.y ?? 0) ? u.y + Nn : u.y - Nn : b.x = u.x > (i.x ?? 0) ? u.x + Nn : u.x - Nn;
 		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,
@@ -4112,15 +4113,15 @@ function Ln(t, n) {
 			if (i) {
 				let i = e.y > (t.y ?? 0);
 				return {
-					x: (n.x ?? 0) >= e.x ? r.maxX + kn : r.minX - kn,
-					y: i ? r.maxY + An : r.minY - An,
+					x: (n.x ?? 0) >= e.x ? r.maxX + An : r.minX - An,
+					y: i ? r.maxY + jn : r.minY - jn,
 					leavesPositiveSide: i
 				};
 			}
 			let a = e.x > (t.x ?? 0), o = (n.y ?? 0) >= e.y;
 			return {
-				x: a ? r.maxX + kn : r.minX - kn,
-				y: o ? r.maxY + An : r.minY - An,
+				x: a ? r.maxX + An : r.minX - An,
+				y: o ? r.maxY + jn : r.minY - jn,
 				leavesPositiveSide: a
 			};
 		}, "obstacleDetour"), O = [], k = [n.start, n.end], A = E(v, k);
@@ -4129,7 +4130,7 @@ function Ln(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 + Mn) : Math.max(e.maxY + 2, s.y - Mn);
+				let n = t.leavesPositiveSide ? Math.min(e.minY - 2, s.y + Nn) : Math.max(e.maxY + 2, s.y - Nn);
 				O = [
 					{
 						x: s.x,
@@ -4145,7 +4146,7 @@ function Ln(t, n) {
 					}
 				];
 			} else {
-				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);
+				let t = D(s, r, i, e, !1), n = t.leavesPositiveSide ? Math.min(e.minX - 2, s.x + Nn) : Math.max(e.maxX + 2, s.x - Nn);
 				v.x = t.x, v.y = t.y, O = [
 					{
 						x: n,
@@ -4186,7 +4187,7 @@ function Ln(t, n) {
 			}
 		}
 		if (O.length === 0 && j.length === 0) {
-			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);
+			let e = An, 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 },
@@ -4218,13 +4219,13 @@ function Ln(t, n) {
 		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 && (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));
+			e.minX < n && e.maxX > t && e.minY < i && e.maxY > r && (P = Math.min(P, e.minX - Mn), I = Math.max(I, e.maxX + Mn), L = Math.min(L, e.minY - Mn), R = Math.max(R, e.maxY + Mn));
 		}
 		for (let e of d) {
 			if (e.maxX < P || e.minX > I || e.maxY < L || e.minY > R) continue;
-			let t = kn;
+			let t = An;
 			f("horizontal", e.minY - t, P, I), f("horizontal", e.maxY + t, P, I);
-			let n = An;
+			let n = jn;
 			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);
@@ -4307,7 +4308,7 @@ function Ln(t, n) {
 			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 = An;
+				let e = jn;
 				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) {
@@ -4343,7 +4344,7 @@ function Ln(t, n) {
 					t.length > 0 && (a = t);
 				}
 				if (a.length === 0) return n.y;
-				let o = kn;
+				let o = An;
 				if (r) {
 					let e = Math.max(...a.map((e) => e.maxY)) + o;
 					if (e < n.y - $) return e;
@@ -4638,7 +4639,7 @@ function Ln(t, n) {
 					ce.set(`${e.edgeIndex}-${e.segmentIndex}`, n);
 				});
 			}, "assignCoord"), l = 0;
-			for (let e of a) l++, c(e, t.coord - l * Nn);
+			for (let e of a) l++, c(e, t.coord - l * Pn);
 			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);
@@ -4650,12 +4651,12 @@ function Ln(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 * Nn * .5);
+					c(e, t.coord + n * r * Pn * .5);
 				}
 				u++;
 			}
 			let d = 0;
-			for (let e of o) d++, c(e, t.coord + d * Nn);
+			for (let e of o) d++, c(e, t.coord + d * Pn);
 		}
 	}
 	for (let [e, t] of a.entries()) {
@@ -4673,15 +4674,15 @@ function Ln(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(In(t, i)), c && o.orient === t.orient) {
+			if (Math.abs(a - t.coord) > $ && r.push(Ln(t, i)), c && o.orient === t.orient) {
 				if (Math.abs(t.coord - 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));
+					let e = t.orient === "vertical" ? (i + o.from) / 2 : In(t, o);
+					r.push(Ln(t, e), Ln(o, e));
+				} else (e === 0 || e === s.length - 2) && r.push(Ln(t, In(t, o)));
+			} else if (c) r.push(Ln(t, o.coord));
 			else {
 				let e = Math.abs(t.from - i) < Math.abs(t.to - i) ? t.to : t.from;
-				r.push(In(t, e));
+				r.push(Ln(t, e));
 			}
 		}
 		let c = r[r.length - 1];
@@ -4727,13 +4728,13 @@ function Ln(t, n) {
 	}
 	return t;
 }
-e(Ln, "routeEdgesOrthogonal");
-function Rn(e) {
+e(Rn, "routeEdgesOrthogonal");
+function zn(e) {
 	return e.direction ?? "TB";
 }
-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, {
+e(zn, "getSwimlaneDirection");
+function Bn(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 = zn(e), { ordered: c, coordinates: l } = On(t, {
 		nodeGap: n,
 		layerGap: r,
 		ignoreCrossLaneEdges: i,
@@ -4746,21 +4747,21 @@ function zn(e) {
 		layerGap: r
 	});
 	for (let t of e.edges ?? []) delete t.points;
-	Ln(e, s);
+	Rn(e, s);
 	for (let t of e.edges ?? []) (!t.curve || t.curve === "basis") && (t.curve = "rounded");
-	return _t(e, s), gt(e), s;
+	return vt(e, s), _t(e), s;
 }
-e(zn, "runSwimlaneLayoutCore");
-function Bn(e) {
+e(Bn, "runSwimlaneLayoutCore");
+function Vn(e) {
 	u(e);
 	let t = m(e);
 	e.nodes = t.nodes, e.edges = t.edges;
 }
-e(Bn, "prepareSwimlaneLayout");
-var Vn = n({
-	prepareLayout: Bn,
-	runLayoutCore: zn,
+e(Vn, "prepareSwimlaneLayout");
+var Hn = n({
+	prepareLayout: Vn,
+	runLayoutCore: Bn,
 	afterPaint: i
 });
 //#endregion
-export { Vn as render };
+export { Hn as render };