for-humanity 0.12.0 → 0.13.1

package/dist/mermaid/chunk-CWV_EN-4.js

@@ -0,0 +1,4745 @@
+import { m as e } from "./chunk-DVNvSFoz.js";
+import { n as t } from "./chunk-BYzrzvCI.js";
+import "./chunk-MFVRUoO0.js";
+import "./chunk-K7Myuj2-.js";
+import "./chunk-Bok8z-Yo.js";
+import "./chunk-KuPYb48V.js";
+import "./chunk-_a9EZE1v.js";
+import "./chunk-DORnIAsy.js";
+import "./chunk-CLgRAtOz.js";
+import "./chunk-DU69_VcF.js";
+import "./chunk-DpuxlyL_.js";
+import { r as n } from "./chunk-BLeiQSWo.js";
+import { t as r } from "./chunk-C_YGy4Fn.js";
+//#region node_modules/.pnpm/mermaid@12.2.0/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;
+	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
+	}));
+	r(t.groups.edgePaths, a, {
+		enabled: !0,
+		jumpRadius: 6,
+		jumpStyle: i
+	});
+}
+t(i, "applySwimlaneLineJumps");
+var a = "__swimlane_default__", o = 21, s = 20;
+function c(e) {
+	return Math.max(e.padding ?? s, s);
+}
+t(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 s = n - i / 2, c = Math.min(a, n + i / 2), l = s + Math.min(o, Math.max(0, c - s));
+	l <= s ? delete e.groupTitleRect : e.groupTitleRect = {
+		left: t - r / 2,
+		right: t + r / 2,
+		top: s,
+		bottom: l
+	};
+}
+t(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 === a);
+	i ? i.isGroup && (i.shape = "swimlane", t && (i.direction = t)) : (i = {
+		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 = a;
+}
+t(u, "prepareLayoutForSwimlanes");
+function d(e) {
+	let t = /* @__PURE__ */ new Map();
+	for (let n of e.nodes ?? []) t.set(n.id, n);
+	let n = [];
+	for (let t of e.edges ?? []) {
+		let e = typeof t.start == "string" ? t.start : void 0, r = typeof t.end == "string" ? t.end : void 0;
+		e && r && (t.labelNodeId || n.push({
+			id: t.id,
+			src: e,
+			dst: r,
+			ref: t
+		}));
+	}
+	let r = e.nodes ?? [], i = r.filter((e) => e.isGroup), a = r.filter((e) => !e.isGroup);
+	return {
+		nodes: [...[...i].reverse(), ...a].map((e) => e.id),
+		edges: n,
+		layout: e,
+		nodeById: t
+	};
+}
+t(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) {
+			let e = a.get(r);
+			if (!e) {
+				t++;
+				continue;
+			}
+			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++;
+		}
+		u++;
+	}
+	let d = i.nodes ?? [], f = /* @__PURE__ */ new Map(), p = [];
+	for (let e of d) {
+		if (!e?.isGroup) continue;
+		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 * 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,
+				maxY: o
+			});
+		}
+	}
+	if (p.length > 0 && f.size > 0) {
+		let e = Infinity, t = -Infinity, n = 0;
+		for (let r of p) {
+			let i = r.padding ?? 20;
+			i > n && (n = i);
+			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 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 = f.get(e.id);
+				if (!t) continue;
+				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 d = o.length;
+			if (d > 0) {
+				let e = /* @__PURE__ */ new Map();
+				if (d === 1) e.set(o[0], u[0]);
+				else {
+					let t = [];
+					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 < d - 1; e++) n[e + 1] = 2 * t[e] - n[e];
+					let r = 0, i = Infinity;
+					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 < 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 p) {
+					let n = e.get(t.id);
+					n != null && (t.width = n), l(t);
+				}
+			}
+		}
+	}
+}
+t(f, "writeBackToLayoutData");
+var p = "[EdgeLabelNodes]";
+function m(t) {
+	let n = [], r = [], i = /* @__PURE__ */ new Map();
+	for (let e of t.nodes) i.set(e.id, e);
+	for (let a of t.edges) {
+		if (!a.label || a.label.length === 0 || a.isLayoutOnly || a.labelNodeId) continue;
+		let t = a.start ? i.get(a.start) : void 0, o = a.end ? i.get(a.end) : void 0;
+		if (!t || !o) {
+			e.warn(p, `Edge ${a.id} has missing source or target node`);
+			continue;
+		}
+		let s = `edge-label-${a.start}-${a.end}-${a.id}`, c = t.parentId === o.parentId ? t.parentId : o.parentId, l = {
+			id: s,
+			label: a.label,
+			edgeStart: a.start ?? "",
+			edgeEnd: a.end ?? "",
+			shape: "labelRect",
+			width: 0,
+			height: 0,
+			isEdgeLabel: !0,
+			isDummy: !0,
+			parentId: c,
+			isGroup: !1,
+			labelStyle: Array.isArray(a.labelStyle) ? a.labelStyle[0] : a.labelStyle ?? "",
+			...t.dir ? { dir: t.dir } : {}
+		};
+		n.push(l), a.labelNodeId = s, a.label = void 0, a.text = void 0;
+		let u = {
+			id: `${a.id}-to-label`,
+			start: a.start,
+			end: s,
+			type: "normal",
+			isLayoutOnly: !0
+		}, d = {
+			id: `${a.id}-from-label`,
+			start: s,
+			end: a.end,
+			type: "normal",
+			isLayoutOnly: !0
+		};
+		r.push(u, d);
+	}
+	let a = [...t.nodes, ...n], o = [...t.edges, ...r];
+	return {
+		...t,
+		nodes: a,
+		edges: o
+	};
+}
+t(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: P(t, n, r, i)
+	} : void 0;
+}
+t(g, "measuredNodeRect");
+function _(e) {
+	if (e.isGroup) return;
+	let t = g(e);
+	if (t) return {
+		id: String(e.id ?? ""),
+		cx: t.cx,
+		cy: t.cy,
+		rect: t.rect
+	};
+}
+t(_, "nodeBoundsInfoFor");
+function v(e, t, n = h) {
+	return Math.abs(e.x - t.x) < n && Math.abs(e.y - t.y) < n;
+}
+t(v, "samePoint");
+function y(e, t, n = h) {
+	return Math.abs(e.x - t.x) < n;
+}
+t(y, "sameX");
+function b(e, t, n = h) {
+	return Math.abs(e.y - t.y) < n;
+}
+t(b, "sameY");
+function x(e, t, n = h) {
+	return b(e, t, n) && Math.abs(e.x - t.x) > n;
+}
+t(x, "isHorizontalSegment");
+function S(e, t, n = h) {
+	return y(e, t, n) && Math.abs(e.y - t.y) > n;
+}
+t(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)));
+}
+t(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;
+}
+t(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 = x(i, a, t), s = S(i, a, t);
+		(o || s) && n.push({
+			index: r,
+			a: i,
+			b: a,
+			horizontal: o,
+			vertical: s
+		});
+	}
+	return n;
+}
+t(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;
+}
+t(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 || !v(e, r, t)) && n.push({
+			x: r.x,
+			y: r.y
+		});
+	}
+	return n;
+}
+t(D, "dedupeConsecutivePoints");
+function O(e, t = h) {
+	if (!e || e.length !== 4) return;
+	let [n, r, i, a] = e;
+	return x(n, r, t) && S(r, i, t) && x(i, a, t) ? {
+		kind: "HVH",
+		p0: n,
+		p1: r,
+		p2: i,
+		p3: a
+	} : S(n, r, t) && x(r, i, t) && S(i, a, t) ? {
+		kind: "VHV",
+		p0: n,
+		p1: r,
+		p2: i,
+		p3: a
+	} : void 0;
+}
+t(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;
+}
+t(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;
+}
+t(A, "pointInsideRect");
+function j(e, t) {
+	return e.left <= t.left && e.right >= t.right && e.top <= t.top && e.bottom >= t.bottom;
+}
+t(j, "rectContainsRect");
+function M(e, t) {
+	return e.left < t.right && e.right > t.left && e.top < t.bottom && e.bottom > t.top;
+}
+t(M, "rectsOverlap");
+function N(e, t) {
+	return {
+		left: e.left - t,
+		right: e.right + t,
+		top: e.top - t,
+		bottom: e.bottom + t
+	};
+}
+t(N, "inflateRect");
+function P(e, t, n, r) {
+	return {
+		left: e - n / 2,
+		right: e + n / 2,
+		top: t - r / 2,
+		bottom: t + r / 2
+	};
+}
+t(P, "rectFromCenterSize");
+function F(e) {
+	return g(e)?.rect;
+}
+t(F, "rectOfNodeBounds");
+function I(e, t) {
+	switch (t) {
+		case "top": return {
+			x: e.cx,
+			y: e.rect.top
+		};
+		case "bottom": return {
+			x: e.cx,
+			y: e.rect.bottom
+		};
+		case "left": return {
+			x: e.rect.left,
+			y: e.cy
+		};
+		case "right": return {
+			x: e.rect.right,
+			y: e.cy
+		};
+	}
+}
+t(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 (b(e, n, a)) return [e, n];
+			let t = (e.x + n.x) / 2;
+			return [
+				e,
+				{
+					x: t,
+					y: e.y
+				},
+				{
+					x: t,
+					y: n.y
+				},
+				n
+			];
+		}
+		if (t === r) {
+			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,
+				{
+					x: r,
+					y: e.y
+				},
+				{
+					x: r,
+					y: n.y
+				},
+				n
+			];
+		}
+		return;
+	}
+	if (!o && !s) {
+		if (t === r) {
+			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,
+				{
+					x: e.x,
+					y: r
+				},
+				{
+					x: n.x,
+					y: r
+				},
+				n
+			];
+		}
+		if (!(t === "bottom" && r === "top" && e.y < n.y || t === "top" && r === "bottom" && e.y > n.y)) return;
+		if (y(e, n, a)) return [e, n];
+		let o = (e.y + n.y) / 2;
+		return [
+			e,
+			{
+				x: e.x,
+				y: o
+			},
+			{
+				x: n.x,
+				y: o
+			},
+			n
+		];
+	}
+	if (o && !s) {
+		let i = t === "right" && n.x > e.x || t === "left" && n.x < e.x, a = r === "top" && e.y < n.y || r === "bottom" && e.y > n.y;
+		return i && a ? [
+			e,
+			{
+				x: n.x,
+				y: e.y
+			},
+			n
+		] : void 0;
+	}
+	let c = t === "bottom" && n.y > e.y || t === "top" && n.y < e.y, l = r === "left" && e.x < n.x || r === "right" && e.x > n.x;
+	return c && l ? [
+		e,
+		{
+			x: e.x,
+			y: n.y
+		},
+		n
+	] : void 0;
+}
+t(ee, "buildOrthogonalPortPath");
+function L(e, t, n, r) {
+	return t === "left" || t === "right" ? [
+		e,
+		{
+			x: r,
+			y: e.y
+		},
+		{
+			x: r,
+			y: n.y
+		},
+		n
+	] : [
+		e,
+		{
+			x: e.x,
+			y: r
+		},
+		{
+			x: n.x,
+			y: r
+		},
+		n
+	];
+}
+t(L, "buildSameSideTrackPath");
+function R(e) {
+	let t = /* @__PURE__ */ new Map(), n = [];
+	for (let r of e) {
+		if (r.isEdgeLabel) continue;
+		let e = _(r);
+		e && (t.set(e.id, e), n.push({
+			id: e.id,
+			rect: e.rect
+		}));
+	}
+	return {
+		nodeInfoById: t,
+		realNodeRects: n
+	};
+}
+t(R, "collectRealNodeBounds");
+function z(e) {
+	let t = [], n = [];
+	for (let r of e) {
+		let e = _(r);
+		if (!e) continue;
+		let i = {
+			id: e.id,
+			rect: e.rect
+		};
+		r.isEdgeLabel ? n.push(i) : t.push(i);
+	}
+	return {
+		realNodeRects: t,
+		labelNodeRects: n
+	};
+}
+t(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,
+			...P(e, i, a, o)
+		});
+	}
+	return n;
+}
+t(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);
+	if (a && o) return {
+		srcId: r,
+		dstId: i,
+		srcInfo: a,
+		dstInfo: o,
+		collinearX: Math.abs(a.cx - o.cx) < n,
+		collinearY: Math.abs(a.cy - o.cy) < n
+	};
+}
+t(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;
+}
+t(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,
+		b: t
+	} : {
+		a: n,
+		b: r
+	}, d = s ? {
+		a: e,
+		b: t
+	} : {
+		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), 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);
+}
+t(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;
+}
+t(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 && v(o, s, i)) && (re(e, t, o, s, i) || ie(e, t, o, s, i))) return !0;
+		}
+	}
+	return !1;
+}
+t(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,
+		b: t
+	} : {
+		a: n,
+		b: r
+	}, u = a ? {
+		a: n,
+		b: r
+	} : {
+		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, 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;
+}
+t(V, "orthogonalSegmentsStrictlyCross");
+function oe(e, t, n) {
+	let r = Math.min(t, n), i = Math.max(t, n);
+	return e > r + h && e < i - h;
+}
+t(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;
+}
+t(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 (v(i, o)) {
+				r++, t = !0;
+				continue;
+			}
+			if (H(i, a, o)) {
+				t = !0;
+				continue;
+			}
+		}
+		n.push(a);
+	}
+	return {
+		points: n,
+		changed: t
+	};
+}
+t(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 (!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
+			} : {
+				x: i.x,
+				y: r.y
+			};
+			t.push(n);
+		}
+		t.push(i);
+	}
+	let n = [];
+	for (let e of t) {
+		let t = n[n.length - 1];
+		(!t || !v(t, e)) && n.push(e);
+	}
+	return n;
+}
+t(W, "orthogonalizePolyline");
+function G(e) {
+	if (e.length < 3) return e;
+	let t = [...e];
+	for (let e = 0; e < 32; e++) {
+		let e = U(t);
+		if (t = e.points, !e.changed) break;
+	}
+	return t;
+}
+t(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 ? F(i) : void 0,
+		dstRect: a ? F(a) : void 0
+	};
+}
+t(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 (y(e, t, K)) {
+		let t = e.y < n.top ? n.top : n.bottom;
+		return {
+			x: e.x,
+			y: t
+		};
+	}
+	return {
+		x: Math.min(n.right, Math.max(n.left, e.x)),
+		y: Math.min(n.bottom, Math.max(n.top, e.y))
+	};
+}
+t(ue, "segmentEnterPoint");
+function de(e, t, n) {
+	let r = n ? 1 : -1, i = n ? 0 : e.length - 1;
+	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 = ue(e[i], e[a], t);
+	return n ? [o, ...e.slice(i)] : [...e.slice(0, i + 1), o];
+}
+t(de, "clipEndpoint");
+function q(e, t) {
+	for (let n of e) {
+		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 = G(W(r)), r = xe(r, e.srcRect, e.dstRect), e.edge.points = G(W(r));
+	}
+}
+t(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 - K) return {
+				x: n.left,
+				y: e.y
+			};
+			if (e.x > n.right + K) return {
+				x: n.right,
+				y: e.y
+			};
+		}
+		return {
+			x: Math.abs(t.x - n.left) <= Math.abs(t.x - n.right) ? n.left : n.right,
+			y: e.y
+		};
+	}
+	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 - K) return {
+				x: e.x,
+				y: n.top
+			};
+			if (e.y > n.bottom + K) return {
+				x: e.x,
+				y: n.bottom
+			};
+		}
+		let i = Math.abs(t.y - n.top) <= Math.abs(t.y - n.bottom);
+		return {
+			x: e.x,
+			y: i ? n.top : n.bottom
+		};
+	}
+	return t;
+}
+t(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 (!v(t, r, K)) return t;
+	}
+	return e[t + n];
+}
+t(fe, "firstDistinctAdjacent");
+function pe(e, t) {
+	let n = e + ce, r = t - ce;
+	return n <= r ? {
+		lo: n,
+		hi: r
+	} : {
+		lo: (e + t) / 2,
+		hi: (e + t) / 2
+	};
+}
+t(pe, "cornerClearanceRange");
+function me(e, t, n) {
+	let { lo: r, hi: i } = pe(t, n);
+	return Math.min(i, Math.max(r, e));
+}
+t(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
+	};
+}
+t(he, "intersectRanges");
+function ge(e, t) {
+	return t === "left" || t === "right" ? pe(e.top, e.bottom) : pe(e.left, e.right);
+}
+t(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 (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";
+	}
+}
+t(_e, "terminalSideForSegment");
+function ve(e) {
+	return e === "left" || e === "right";
+}
+t(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;
+}
+t(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) < K)) return i ? [{
+		x: e.x,
+		y: s
+	}, {
+		x: t.x,
+		y: s
+	}] : [{
+		x: s,
+		y: e.y
+	}, {
+		x: s,
+		y: t.y
+	}];
+}
+t(be, "clearStraightEndpointCornerAxis");
+function xe(e, t, n) {
+	if (e.length !== 2) return e;
+	let [r, i] = 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;
+}
+t(xe, "clearStraightEndpointCornerConnections");
+function Se(e, t, n) {
+	return ve(n) ? {
+		x: e.x,
+		y: me(e.y, t.top, t.bottom)
+	} : {
+		x: me(e.x, t.left, t.right),
+		y: e.y
+	};
+}
+t(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 && !b(t, r, K) || !a && !y(t, r, K)) break;
+		a ? o[s].y = i.y : o[s].x = i.x;
+	}
+	return o;
+}
+t(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 = fe(e, r, i);
+	if (!o) return e;
+	let s = _e(a, o, t);
+	if (!s) return e;
+	let c = ve(s), l = Se(a, t, s);
+	return v(a, l, K) ? e : Ce(e, r, i, a, l, c);
+}
+t(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";
+}
+t(Te, "borderSideForSegment");
+function Ee(e, t, n, r) {
+	switch (e) {
+		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;
+	}
+}
+t(Ee, "leavesOutward");
+function De(e, t, n) {
+	if (e.length < 3) return e;
+	if (n) {
+		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 = Te(e[r - 1], e[r], t);
+	return i && Ee(i, e[r - 1], e[r - 2], t) ? e.slice(0, r) : e;
+}
+t(De, "collapseOwnBorderStub");
+function Oe(e, t, n) {
+	let r = e;
+	if (t) {
+		let e = fe(r, 0, 1);
+		if (e) {
+			let n = J(e, r[0], t);
+			n !== r[0] && (r = [n, ...r.slice(1)]);
+		}
+		r = De(r, t, !0);
+	}
+	if (n) {
+		let e = r.length - 1, t = fe(r, e, -1);
+		if (t) {
+			let i = J(t, r[e], n, !0);
+			i !== r[e] && (r = [...r.slice(0, e), i]);
+		}
+		r = De(r, n, !1);
+	}
+	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);
+}
+t(Oe, "snapAndCollapseEndpoints");
+function ke(e, t) {
+	for (let n of e) {
+		let e = le(n, t, 2);
+		if (!e) continue;
+		let r = Oe(D(e.points, K), e.srcRect, e.dstRect);
+		if (r.length < 3) {
+			e.edge.points = r;
+			continue;
+		}
+		let i = [
+			r[0],
+			{ ...r[0] },
+			...r.slice(1, -1),
+			r[r.length - 1],
+			{ ...r[r.length - 1] }
+		];
+		e.edge.points = i;
+	}
+}
+t(ke, "prepareEdgeEndpointsForRenderer");
+function Ae(e) {
+	return new Map(e.map((e) => [e.id, e]));
+}
+t(Ae, "buildNodeMap");
+function je(e, t) {
+	let n = e.parentId, r = null;
+	for (; n;) {
+		let e = t.get(n);
+		if (!e?.isGroup) break;
+		r = e.id, n = e.parentId;
+	}
+	return r;
+}
+t(je, "resolveTopLevelGroupId");
+function Me(e, t) {
+	let n = 0, r = e.parentId;
+	for (; r;) {
+		let e = t.get(r);
+		if (!e?.isGroup) break;
+		n++, r = e.parentId;
+	}
+	return n;
+}
+t(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;
+		if (typeof e != "number" || typeof o != "number") continue;
+		let s = a.width ?? 0, c = a.height ?? 0;
+		t = Math.min(t, e - s / 2), n = Math.max(n, e + s / 2), r = Math.min(r, o - c / 2), i = Math.max(i, o + c / 2);
+	}
+	return t === Infinity || r === Infinity ? null : {
+		minX: t,
+		maxX: n,
+		minY: r,
+		maxY: i
+	};
+}
+t(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;
+}
+t(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 = Ne(e.filter((e) => e.parentId === t.id));
+		n && Pe(t, n);
+	}
+}
+t(Fe, "recomputeNestedGroupBounds");
+function Ie(e, n) {
+	let r = e.nodes ?? [], i = e.edges ?? [], a = r.filter((e) => !e.isGroup), o = Infinity, s = -Infinity;
+	for (let e of a) {
+		let t = e[n];
+		typeof t == "number" && (o = Math.min(o, t), s = Math.max(s, t));
+	}
+	if (!Number.isFinite(o) || !Number.isFinite(s)) return !1;
+	let c = /* @__PURE__ */ t((e) => o + s - e, "mirror");
+	for (let e of r) {
+		let t = e[n];
+		typeof t == "number" && (e[n] = c(t));
+		let r = e.groupTitleRect;
+		r && (e.groupTitleRect = n === "x" ? {
+			...r,
+			left: c(r.right),
+			right: c(r.left)
+		} : {
+			...r,
+			top: c(r.bottom),
+			bottom: c(r.top)
+		});
+	}
+	for (let e of i) for (let t of e.points ?? []) t[n] = c(t[n]);
+	return !0;
+}
+t(Ie, "mirrorAxis");
+function Le(e) {
+	return !(e.nodes ?? []).some((e) => !e.isGroup) || Ie(e, "y");
+}
+t(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;
+		t < a && (a = t), n < o && (o = n);
+	}
+	if (!Number.isFinite(a) || !Number.isFinite(o)) return !1;
+	let s = 0, c = 0;
+	for (let e of i) s += e.width ?? 0, c += e.height ?? 0;
+	let l = s / i.length, u = c / i.length, d = u > 0 ? Math.max(1, l / u) : 1;
+	for (let e of i) {
+		let t = e.x ?? 0, n = ((e.y ?? 0) - o) * d + 36, r = t - a;
+		e.x = n, e.y = r;
+	}
+	for (let e of r) if (e.points) for (let t of e.points) {
+		let e = t.x, n = (t.y - o) * d + 36, r = e - a;
+		t.x = n, t.y = r;
+	}
+	Fe(n);
+	let f = n.filter((e) => e.isGroup && !e.parentId);
+	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 = je(e, p);
+		if (!t) continue;
+		let n = m.get(t) ?? [];
+		n.push(e), m.set(t, n);
+	}
+	let h = 0;
+	for (let e of f) {
+		let t = e.padding ?? 0;
+		t > h && (h = t);
+	}
+	let g = [], _ = Infinity, v = -Infinity;
+	for (let e of f) {
+		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,
+			contentBottom: t.maxY,
+			centerY: (t.minY + t.maxY) / 2
+		}));
+	}
+	if (_ === Infinity || v === -Infinity) return !0;
+	let y = Math.max(0, v - _) + 2 * Math.max(h, 10), b = 36 + y, x = (_ + v) / 2 - y / 2 - 36, S = x + b / 2, C = Math.max(h, 36);
+	g.sort((e, t) => e.centerY - t.centerY);
+	for (let e = 0; e < g.length; e++) {
+		let t = g[e], n, r;
+		if (n = e === 0 ? t.contentTop - C : (g[e - 1].contentBottom + t.contentTop) / 2, e === g.length - 1) r = t.contentBottom + C;
+		else {
+			let n = g[e + 1];
+			r = (t.contentBottom + n.contentTop) / 2;
+		}
+		let i = Math.max(0, r - n), a = (n + r) / 2;
+		t.lane.x = S, t.lane.y = a, t.lane.width = b, t.lane.height = i, t.lane.swimlaneContentTop = t.contentTop, t.lane.groupTitleRect = {
+			left: x,
+			right: x + 36,
+			top: n,
+			bottom: r
+		};
+	}
+	return t === "RL" && Ie(e, "x"), !0;
+}
+t(Re, "applyLrDirectionTransform");
+var ze = 1e-6, Be = 8, Ve = [
+	0,
+	Be,
+	-Be,
+	2 * Be,
+	-2 * Be
+];
+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 = O(D(i, ze), ze);
+		if (!a) continue;
+		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 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 + ze || t >= g.right - ze) continue;
+				i = {
+					x: t,
+					y: e
+				}, a = {
+					x: t,
+					y: o.y
+				}, c = {
+					x: o.x,
+					y: o.y
+				};
+			} else {
+				let e = f.cx > d.cx ? g.right : g.left, t = d.cy + n;
+				if (t <= g.top + ze || t >= g.bottom - ze) continue;
+				i = {
+					x: e,
+					y: t
+				}, a = {
+					x: o.x,
+					y: t
+				}, c = {
+					x: o.x,
+					y: o.y
+				};
+			}
+			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
+			}), y = !m && ae(a, c, e, t, {
+				epsilon: ze,
+				skipDegenerateOther: !0
+			});
+			if (!(_ || y)) {
+				h = p ? [a, c] : m ? [i, a] : [
+					i,
+					a,
+					c
+				];
+				break;
+			}
+		}
+		h && (t.points = h);
+	}
+}
+t(He, "portSwapToLShape");
+function Ue(e, n) {
+	let r = .001, { realNodeRects: i, labelNodeRects: a } = z(n.values());
+	for (let o of e) {
+		if (o.isLayoutOnly) continue;
+		let s = o.points;
+		if (!s || s.length < 4) continue;
+		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 = 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;
+			P = {
+				x: j,
+				y: f.y
+			}, I = {
+				x: j,
+				y: e ? N.bottom : N.top
+			};
+		} else {
+			let e = g > 0;
+			P = {
+				x: f.x,
+				y: M
+			}, I = {
+				x: e ? N.right : N.left,
+				y: M
+			};
+		}
+		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 ee = /* @__PURE__ */ t((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__ */ t((t, n) => {
+			for (let i of e) {
+				if (i === o || i.isLayoutOnly) continue;
+				let e = i.points;
+				if (!(!e || e.length < 2)) for (let i = 0; i < e.length - 1; i++) {
+					let a = e[i], o = e[i + 1];
+					if (!L.has(ee(a, o)) && V(t, n, a, o, r)) return !0;
+				}
+			}
+			return !1;
+		}, "segmentCrossesOtherEdge");
+		if (R(P, I)) continue;
+		if (l - 3 >= 0) {
+			let e = c[l - 3], t = [O, E].filter((e) => !!e);
+			if (B(e, P, i, t, -2) || R(e, P)) continue;
+		}
+		let z = [
+			...c.slice(0, l - 2),
+			P,
+			I
+		];
+		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 < 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);
+				}
+			}
+		}
+	}
+}
+t(Ue, "collapseShortTerminalStub");
+var Y = .001, X = 8, We = /* @__PURE__ */ t((e) => typeof e == "string" ? e.toUpperCase() : "", "upperCaseDirection"), Z = T, Ge = /* @__PURE__ */ t((e, t) => y(e, t, Y) || b(e, t, Y), "orthogonallyAligned");
+function Ke(e, n) {
+	let r = /* @__PURE__ */ t((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), {
+			x: n + (a === 0 ? 0 : s * i / a),
+			y: r + s
+		}) : (i < 0 && (o = -o), {
+			x: n + o,
+			y: r + (i === 0 ? 0 : o * a / i)
+		});
+	}, "rectIntersect"), i = /* @__PURE__ */ t((e, t) => {
+		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 ? 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 (Ge(l, u) && (d = l), y(u, d, Y)) return {
+			edge: e,
+			edgeId: String(e.id ?? ""),
+			nodeId: a,
+			atStart: t,
+			orientation: "V",
+			coord: u.x,
+			min: Math.min(u.y, d.y),
+			max: Math.max(u.y, d.y),
+			boundary: u,
+			railEnd: d,
+			rect: s
+		};
+		if (b(u, d, Y)) return {
+			edge: e,
+			edgeId: String(e.id ?? ""),
+			nodeId: a,
+			atStart: t,
+			orientation: "H",
+			coord: u.y,
+			min: Math.min(u.x, d.x),
+			max: Math.max(u.x, d.x),
+			boundary: u,
+			railEnd: d,
+			rect: s
+		};
+	}, "terminalLaneFor"), a = /* @__PURE__ */ t((e, t) => Math.max(0, Math.min(e.max, t.max) - Math.max(e.min, t.min)), "projectedOverlapLength"), o = /* @__PURE__ */ t((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__ */ t((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__ */ t((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 < 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__ */ t((e, n) => {
+		let r = D(e.edge.points ?? []);
+		if (r.length < 2) return;
+		let i = e.orientation === "V" ? {
+			x: e.boundary.x + n,
+			y: e.boundary.y
+		} : {
+			x: e.boundary.x,
+			y: e.boundary.y + n
+		}, a = e.orientation === "V" ? {
+			x: e.railEnd.x + n,
+			y: e.railEnd.y
+		} : {
+			x: e.railEnd.x,
+			y: e.railEnd.y + n
+		};
+		if (!(/* @__PURE__ */ t(() => Math.abs(e.boundary.y - e.rect.top) < 1 || Math.abs(e.boundary.y - e.rect.bottom) < 1 ? b(i, e.boundary, Y) && i.x >= e.rect.left + 1 && i.x <= e.rect.right - 1 : Math.abs(e.boundary.x - e.rect.left) < 1 || Math.abs(e.boundary.x - e.rect.right) < 1 ? y(i, e.boundary, Y) && i.y >= e.rect.top + 1 && i.y <= e.rect.bottom - 1 : !1, "boundaryStaysOnSameFace"))()) return;
+		if (e.atStart) {
+			let t = r.length > 1 && v(r[1], e.railEnd, Y), n = r.slice(t ? 2 : 1), o = n[0];
+			return o && !Ge(o, a) ? void 0 : [
+				i,
+				a,
+				...n
+			];
+		}
+		let o = r.length > 1 && v(r[r.length - 2], e.railEnd, Y), s = r.slice(0, o ? -2 : -1), c = s[s.length - 1];
+		if (!c || Ge(c, a)) return [
+			...s,
+			a,
+			i
+		];
+	}, "shiftedCandidate"), u = /* @__PURE__ */ t((e) => {
+		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 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,
+		-14,
+		14,
+		-21,
+		21
+	];
+	for (let t = 0; t < 8; t++) {
+		let t = e.filter((e) => !e.isLayoutOnly).flatMap((e) => [i(e, !0), i(e, !1)]).filter((e) => !!e), n = !1;
+		for (let e = 0; e < t.length && !n; e++) for (let r = e + 1; r < t.length && !n; r++) {
+			let a = t[e], o = t[r];
+			if (a.edge === o.edge || !(s(a, o) || c(a, o))) continue;
+			let f = !s(a, o), p = [a, o].sort((e, t) => {
+				let n = u(e), r = u(t);
+				return n === r ? Number(!t.atStart) - Number(!e.atStart) : Number(n) - Number(r);
+			});
+			for (let e of p) {
+				for (let r of d) {
+					let a = l(e, r);
+					if (!a) continue;
+					let o = i({
+						...e.edge,
+						points: a
+					}, e.atStart);
+					if (o && !t.some((t) => t.edge !== e.edge && (s(o, t) || f && c(o, t)))) {
+						e.edge.points = a, n = !0;
+						break;
+					}
+				}
+				if (n) break;
+			}
+		}
+		if (!n) return;
+	}
+}
+t(Ke, "separateSharedRenderedTerminalLanes");
+function qe(e, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = /* @__PURE__ */ t((t, n) => {
+		let a = t.start, o = t.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 (B(e.a, e.b, r, c, -2) || B(e.a, e.b, i, [], -2)) return !1;
+		for (let n of e) {
+			if (n === t || n.isLayoutOnly) continue;
+			let e = n.points;
+			if (!(!e || e.length < 2)) {
+				for (let t of s) for (let n of Z(D(e))) if (w(t, n, .5) >= X || V(t.a, t.b, n.a, n.b, Y)) return !1;
+			}
+		}
+		return !0;
+	}, "candidateIsSafe"), o = /* @__PURE__ */ t((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 = 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 = 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)
+		]);
+	}, "withoutDogleg");
+	for (let t = 0; t < 8; t++) {
+		let t = !1;
+		for (let n of e) {
+			if (n.isLayoutOnly) continue;
+			let e = D(n.points ?? []);
+			for (let r = 0; r <= e.length - 5; r++) {
+				let i = o(e, r);
+				if (i && a(n, i)) {
+					n.points = i, t = !0;
+					break;
+				}
+			}
+			if (t) break;
+		}
+		if (!t) return;
+	}
+}
+t(qe, "collapseRedundantRectangularDoglegs");
+function Je(e, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = e.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ t((e, t, n) => D(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ t((e, t) => {
+		let n = 0;
+		for (let r = 0; r < a.length; r++) {
+			let i = Z(o(a[r], e, t));
+			for (let s = r + 1; s < a.length; s++) {
+				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__ */ t((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 {
+			index: n.index,
+			horizontal: n.horizontal,
+			vertical: n.vertical,
+			segment: n
+		};
+	}, "middleRail"), l = /* @__PURE__ */ t((e, t) => {
+		let n = [e.start, e.end].filter((e) => !!e);
+		return r.filter((e) => {
+			if (n.includes(e.id)) return !1;
+			let r = e.rect;
+			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__ */ t((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 = G(D(r));
+		return Z(i).length === i.length - 1 ? i : void 0;
+	}, "candidateByMovingRail"), d = /* @__PURE__ */ t((e, t, n) => {
+		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 (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 Z(o(t))) if (w(e, n, .5) >= X) return !1;
+		}
+		return s(e, t) <= n;
+	}, "candidateIsSafe");
+	for (let e = 0; e < 8; e++) {
+		let e = s(), t = !1;
+		for (let n of a) {
+			let r = o(n), i = c(r);
+			if (!i) continue;
+			let a = l(n, i.segment);
+			if (a.length === 0) continue;
+			let s = i.horizontal ? [Math.min(...a.map((e) => e.rect.top)) - 20, Math.max(...a.map((e) => e.rect.bottom)) + 20] : [Math.min(...a.map((e) => e.rect.left)) - 20, Math.max(...a.map((e) => e.rect.right)) + 20];
+			for (let a of s) {
+				let o = u(r, i.segment, a);
+				if (o && d(n, o, e)) {
+					n.points = o, t = !0;
+					break;
+				}
+			}
+			if (t) break;
+		}
+		if (!t) return;
+	}
+}
+t(Je, "liftObstacleHuggingSameSideRails");
+function Ye(e, n, r) {
+	let i = /* @__PURE__ */ t((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,
+			right: t.right,
+			top: t.top,
+			bottom: t.bottom
+		};
+	}, "validTitleRect"), a = /* @__PURE__ */ t((e) => {
+		if (!e.isGroup || e.parentId) return;
+		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: n
+		};
+	}, "topLaneTitleFor"), o = /* @__PURE__ */ t((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(a).filter((e) => !!e);
+	if (s.length === 0) return;
+	let c = 0;
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let e = D(t.points ?? []);
+		for (let t of Z(e)) for (let e of s) o(t, e.rect) && (c = Math.max(c, e.rect.bottom - t.a.y + 4));
+	}
+	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 - c / 2, e.node.height = n + c, e.node.groupTitleRect = {
+			...e.rect,
+			top: e.rect.top - c,
+			bottom: e.rect.bottom - c
+		});
+	}
+}
+t(Ye, "liftTopLaneTitleBandsAboveRails");
+function Xe(e, n, r) {
+	let i = /* @__PURE__ */ t((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,
+			right: t.right,
+			top: t.top,
+			bottom: t.bottom
+		};
+	}, "validTitleRect"), a = /* @__PURE__ */ t((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"), o = /* @__PURE__ */ t((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"), s = /* @__PURE__ */ t((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"), c = [...n.values()].map(a).filter((e) => !!e);
+	if (c.length === 0) return;
+	let l = 0;
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let e = D(t.points ?? []);
+		for (let t of Z(e)) for (let e of c) if (o(t, e.rect)) l = Math.max(l, e.rect.right - t.a.x + 4);
+		else if (s(t, e.rect)) {
+			let n = Math.min(t.a.x, t.b.x);
+			l = Math.max(l, e.rect.right - n + 4);
+		}
+	}
+	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 - l / 2, e.node.width = n + l, e.node.groupTitleRect = {
+			...e.rect,
+			left: e.rect.left - l,
+			right: e.rect.right - l
+		});
+	}
+}
+t(Xe, "shiftLeftLaneTitleBandsLeftOfRails");
+function Ze(e, n) {
+	let { realNodeRects: r } = z(n.values()), i = e.filter((e) => !e.isLayoutOnly), a = /* @__PURE__ */ t((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), o = /* @__PURE__ */ t((e = /* @__PURE__ */ new Map()) => {
+		let t = 0;
+		for (let n = 0; n < i.length; n++) {
+			let r = Z(a(i[n], e));
+			for (let o = n + 1; o < i.length; o++) {
+				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__ */ t((e = /* @__PURE__ */ new Map()) => i.reduce((t, n) => t + E(a(n, e)), 0), "totalBends"), c = /* @__PURE__ */ t((e) => {
+		let t = a(e);
+		if (t.length < 4) return;
+		let n = t[t.length - 2], r = t[t.length - 1];
+		if (x(n, r, Y) || S(n, r, Y)) return {
+			tailStart: n,
+			terminal: r
+		};
+	}, "terminalTailFor"), l = /* @__PURE__ */ t((e, t) => {
+		let n = a(e);
+		if (n.length < 3) return;
+		let r = n[0], i = n[1], o;
+		if (x(r, i, Y)) o = {
+			x: i.x,
+			y: t.tailStart.y
+		};
+		else if (S(r, i, Y)) o = {
+			x: t.tailStart.x,
+			y: i.y
+		};
+		else return;
+		let s = G(D([
+			r,
+			i,
+			o,
+			t.tailStart,
+			t.terminal
+		]));
+		return Z(s).length === s.length - 1 ? s : void 0;
+	}, "candidateWithDestinationTail"), u = /* @__PURE__ */ t((e, t) => {
+		let n = [e.start, e.end].filter((e) => !!e);
+		for (let e of Z(t)) if (B(e.a, e.b, r, n, -2)) return !0;
+		return !1;
+	}, "pathHasNodeHit"), d = /* @__PURE__ */ t((e, t, n) => {
+		for (let r of i) if (r !== e) {
+			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__ */ t((e, t, n) => !u(e, t) && !d(e, t, n), "candidateIsSafe"), p = /* @__PURE__ */ t(() => {
+		let e = /* @__PURE__ */ new Map();
+		for (let t of i) {
+			let r = t.end;
+			if (!r || !n.has(r) || a(t).length < 4) continue;
+			let i = e.get(r) ?? [];
+			i.push(t), e.set(r, i);
+		}
+		return e;
+	}, "edgesByDestination");
+	for (let e = 0; e < 4; e++) {
+		let e = o();
+		if (e === 0) return;
+		let t = s(), n, r = e, i = t;
+		for (let t of p().values()) for (let a = 0; a < t.length; a++) for (let u = a + 1; u < t.length; u++) {
+			let d = t[a], p = t[u], m = c(d), h = c(p);
+			if (!m || !h) continue;
+			let g = l(d, h), _ = l(p, m);
+			if (!g || !_) continue;
+			let v = /* @__PURE__ */ new Map([[d, g], [p, _]]);
+			if (!f(d, g, v) || !f(p, _, v)) continue;
+			let y = o(v), b = s(v);
+			y >= e || y > r || y === r && b >= i || (n = v, r = y, i = b);
+		}
+		if (!n) return;
+		for (let [e, t] of n) e.points = t;
+	}
+}
+t(Ze, "swapDestinationTerminalTailsToReduceCrossings");
+function Qe(e, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = e.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ t((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), s = /* @__PURE__ */ t((e = /* @__PURE__ */ new Map()) => {
+		let t = 0;
+		for (let n = 0; n < a.length; n++) {
+			let r = Z(o(a[n], e));
+			for (let i = n + 1; i < a.length; i++) {
+				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__ */ t((e = /* @__PURE__ */ new Map()) => a.reduce((t, n) => t + E(o(n, e)), 0), "totalBends"), l = /* @__PURE__ */ t((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
+		} : void 0;
+	}, "endpointRectsFor"), u = /* @__PURE__ */ t((e, t, n) => {
+		if (n.index <= 0 || n.index + 1 >= t.length - 1) return;
+		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 - Y ? "left" : i > o + Y ? "right" : void 0;
+				return s ? {
+					edge: e,
+					points: t,
+					segmentIndex: n.index,
+					axis: "vertical",
+					side: s,
+					coord: i,
+					min: Math.min(n.a.y, n.b.y),
+					max: Math.max(n.a.y, n.b.y)
+				} : 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 - Y ? "top" : i > o + Y ? "bottom" : void 0;
+				return s ? {
+					edge: e,
+					points: t,
+					segmentIndex: n.index,
+					axis: "horizontal",
+					side: s,
+					coord: i,
+					min: Math.min(n.a.x, n.b.x),
+					max: Math.max(n.a.x, n.b.x)
+				} : void 0;
+			}
+		}
+	}, "externalRailForSegment"), d = /* @__PURE__ */ t(() => {
+		let e = [];
+		for (let t of a) {
+			let n = o(t);
+			for (let r of Z(n)) {
+				let i = u(t, n, r);
+				i && e.push(i);
+			}
+		}
+		return e;
+	}, "collectExternalRails"), f = /* @__PURE__ */ t((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__ */ t((e) => {
+		let t = [], n = /* @__PURE__ */ new Set();
+		for (let r of e) {
+			if (n.has(r)) continue;
+			let i = [r], a = [];
+			for (n.add(r); i.length > 0;) {
+				let t = i.pop();
+				a.push(t);
+				for (let r of e) !n.has(r) && f(t, r) && (n.add(r), i.push(r));
+			}
+			a.length > 1 && t.push(a);
+		}
+		return t;
+	}, "connectedComponents"), m = /* @__PURE__ */ t((e) => {
+		let t = [];
+		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));
+		}
+		return t;
+	}, "uniqueCoordsFor"), h = /* @__PURE__ */ t((e) => {
+		let n = e.map((e) => e.coord), r = m(e), i = [];
+		if (e.length <= 6) {
+			let a = Array(r.length).fill(!1), o = [], s = /* @__PURE__ */ t(() => {
+				if (o.length === e.length) o.some((e, t) => Math.abs(e - n[t]) >= Y) && i.push([...o]);
+				else for (let [e, t] of r.entries()) a[e] || (a[e] = !0, o.push(t), s(), o.pop(), a[e] = !1);
+			}, "visit");
+			return s(), i;
+		}
+		for (let e = 0; e < n.length; e++) for (let t = e + 1; t < n.length; t++) {
+			let r = [...n];
+			[r[e], r[t]] = [r[t], r[e]], i.push(r);
+		}
+		return i;
+	}, "coordinateAssignmentsFor"), g = /* @__PURE__ */ t((e, t) => {
+		let n = /* @__PURE__ */ new Map();
+		for (let [r, i] of e.entries()) {
+			let e = t[r], a = n.get(i.edge) ?? i.points.map((e) => ({
+				x: e.x,
+				y: e.y
+			}));
+			i.axis === "vertical" ? (a[i.segmentIndex].x = e, a[i.segmentIndex + 1].x = e) : (a[i.segmentIndex].y = e, a[i.segmentIndex + 1].y = e), n.set(i.edge, a);
+		}
+		let r = /* @__PURE__ */ new Map();
+		for (let [e, t] of n) {
+			let n = G(D(t));
+			if (Z(n).length !== n.length - 1) return;
+			r.set(e, n);
+		}
+		return r;
+	}, "replacementsForAssignment"), _ = /* @__PURE__ */ t((e) => {
+		for (let [t, n] of e) {
+			let e = [t.start, t.end].filter((e) => !!e);
+			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 = 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 = Z(o(t, e));
+				for (let e of i) for (let t of s) if (w(e, t, .5) >= X) return !1;
+			}
+		}
+		return !0;
+	}, "candidateIsSafe");
+	for (let e = 0; e < 4; e++) {
+		let e = s();
+		if (e === 0) return;
+		let t, n = e, r = c(), i = Infinity;
+		for (let a of p(d())) for (let o of h(a)) {
+			let l = g(a, o);
+			if (!l || !_(l)) continue;
+			let u = s(l);
+			if (u >= e) continue;
+			let d = c(l), f = a.reduce((e, t, n) => e + Math.abs(o[n] - t.coord), 0);
+			u > n || u === n && (d > r || d === r && f >= i) || (t = l, n = u, r = d, i = f);
+		}
+		if (!t) return;
+		for (let [e, n] of t) e.points = n;
+	}
+}
+t(Qe, "reassignCrossingExternalRailChannels");
+function $e(e, n) {
+	let { realNodeRects: r, labelNodeRects: i } = z(n.values()), a = e.filter((e) => !e.isLayoutOnly), o = /* @__PURE__ */ t((e, t, n) => D(e === t ? n ?? [] : e.points ?? []), "pointsFor"), s = /* @__PURE__ */ t((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__ */ t((e, t) => {
+		let n = 0;
+		for (let r = 0; r < a.length; r++) {
+			let i = Z(o(a[r], e, t));
+			for (let s = r + 1; s < a.length; s++) {
+				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__ */ t((e, t) => {
+		if (e.horizontal) {
+			let n = e.a.y;
+			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) && C(e.a.y, e.b.y, t.top, t.bottom) >= X;
+		}
+		return !1;
+	}, "segmentRunsAlongRectBorder"), u = /* @__PURE__ */ t((e) => {
+		let t = [e.start, e.end].filter((e) => !!e), r = [];
+		for (let e of t) {
+			let t = n.get(e), i = t ? F(t) : void 0;
+			i && r.push(i);
+		}
+		return r;
+	}, "endpointRectsFor"), d = /* @__PURE__ */ t((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 = 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 = y(n, a, Y) || b(n, a, Y) ? [] : [{
+			x: n.x,
+			y: a.y
+		}, {
+			x: a.x,
+			y: n.y
+		}], l = c.length === 0 ? [[...e.slice(0, t + 1), ...e.slice(t + 3)]] : c.map((n) => [
+			...e.slice(0, t + 1),
+			n,
+			...e.slice(t + 3)
+		]), u = /* @__PURE__ */ new Set();
+		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__ */ t((e, t, n) => {
+		let s = [e.start, e.end].filter((e) => !!e), d = u(e);
+		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 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 = E(a, Y), m = s(a);
+			for (let o = 0; o <= a.length - 4; o++) for (let h of d(a, o)) {
+				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);
+			}
+		}
+		if (!t || !n) return;
+		t.points = n;
+	}
+}
+t($e, "shortcutRedundantOrthogonalJogs");
+function et(e, 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 = F(e);
+		i && r.push({
+			id: String(e.id ?? ""),
+			cx: t,
+			cy: n,
+			rect: i
+		});
+	}
+	if (r.length === 0) return;
+	let i = new Map(r.map((e) => [e.id, e])), a = r.map((e) => ({
+		id: e.id,
+		rect: e.rect
+	})), o = [
+		"top",
+		"bottom",
+		"left",
+		"right"
+	], s = {
+		top: Math.min(...r.map((e) => e.rect.top)) - 20,
+		bottom: Math.max(...r.map((e) => e.rect.bottom)) + 20,
+		left: Math.min(...r.map((e) => e.rect.left)) - 20,
+		right: Math.max(...r.map((e) => e.rect.right)) + 20
+	}, c = e.filter((e) => !e.isLayoutOnly), l = new Map(c.map((e, t) => [e, t])), u = /* @__PURE__ */ t((e) => {
+		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__ */ t((e, t = /* @__PURE__ */ new Map()) => D(t.get(e) ?? e.points ?? []), "replacementPointsFor"), f = /* @__PURE__ */ t((e, t) => {
+		let n = 0;
+		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__ */ t((e, t) => f(Z(e), Z(t)), "crossingCountBetweenPaths"), m = /* @__PURE__ */ t((e = /* @__PURE__ */ new Map()) => {
+		let n = 0, r = [], i = /* @__PURE__ */ new Set(), a = [], o = /* @__PURE__ */ t((e) => {
+			i.has(e) || (i.add(e), a.push(e));
+		}, "addEdge");
+		for (let t = 0; t < c.length; t++) {
+			let i = c[t], a = d(i, e);
+			for (let s = t + 1; s < c.length; s++) {
+				let t = c[s], l = p(a, d(t, e));
+				l > 0 && (n += l, r.push({
+					first: i,
+					second: t,
+					count: l
+				}), o(i), o(t));
+			}
+		}
+		return a.sort((e, t) => (l.get(e) ?? 0) - (l.get(t) ?? 0)), {
+			count: n,
+			pairs: r,
+			edgeSet: i,
+			edges: a
+		};
+	}, "crossingSnapshot"), h = /* @__PURE__ */ t((e, t) => {
+		let n = new Set(t.keys());
+		if (n.size === 0) return e.count;
+		let r = 0;
+		for (let t of e.pairs) (n.has(t.first) || n.has(t.second)) && (r += t.count);
+		let i = 0;
+		for (let e = 0; e < c.length; e++) {
+			let r = c[e], a = n.has(r), o = d(r, t);
+			for (let r = e + 1; r < c.length; r++) {
+				let e = c[r];
+				(a || n.has(e)) && (i += p(o, d(e, t)));
+			}
+		}
+		return e.count - r + i;
+	}, "crossingCountWithReplacements"), g = /* @__PURE__ */ t((e) => {
+		let t = /* @__PURE__ */ new Map();
+		for (let n of e.pairs) {
+			let e = t.get(n.first) ?? /* @__PURE__ */ new Set();
+			e.add(n.second), t.set(n.first, e);
+			let r = t.get(n.second) ?? /* @__PURE__ */ new Set();
+			r.add(n.first), t.set(n.second, r);
+		}
+		let n = [], r = /* @__PURE__ */ new Set();
+		for (let i of e.edges) {
+			if (r.has(i)) continue;
+			let e = [i], a = [];
+			for (r.add(i); e.length > 0;) {
+				let n = e.pop();
+				a.push(n);
+				for (let i of t.get(n) ?? []) r.has(i) || (r.add(i), e.push(i));
+			}
+			a.sort((e, t) => (l.get(e) ?? 0) - (l.get(t) ?? 0)), a.length > 1 && n.push(a);
+		}
+		return n;
+	}, "crossingComponents"), _ = /* @__PURE__ */ t((e) => [e.start, e.end].filter((e) => !!e), "endpointIdsFor"), v = /* @__PURE__ */ t((e) => {
+		let t = [];
+		for (let n of g(e)) {
+			let e = new Set(n), r = new Set(n.flatMap((e) => _(e))), i = [...n];
+			for (let t of c) e.has(t) || _(t).some((e) => r.has(e)) && i.push(t);
+			i.sort((e, t) => (l.get(e) ?? 0) - (l.get(t) ?? 0)), t.push(i);
+		}
+		return t;
+	}, "pairSearchGroups"), y = /* @__PURE__ */ t((e, t, n) => h(e, /* @__PURE__ */ new Map([[t, n]])), "crossingCountWithSingleReplacement"), b = /* @__PURE__ */ t((e) => {
+		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"), C = /* @__PURE__ */ t((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"), T = /* @__PURE__ */ t((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + E(d(n, e)), 0), "totalBends"), O = /* @__PURE__ */ t((e = /* @__PURE__ */ new Map()) => c.reduce((t, n) => t + C(d(n, e)), 0), "totalLength"), k = /* @__PURE__ */ t((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 Z(d(t, n))) if (w(e, r, .5) >= X) return !0;
+		}
+		return !1;
+	}, "pathHasSegmentConflict"), A = /* @__PURE__ */ t((e, t) => {
+		let n = [e.start, e.end].filter((e) => !!e);
+		for (let e of Z(t)) if (B(e.a, e.b, a, n, -2)) return !0;
+		return !1;
+	}, "pathHitsNode"), j = /* @__PURE__ */ t((e, t) => {
+		let n = G(D(t));
+		Z(n).length === n.length - 1 && e.push(n);
+	}, "pushOrthogonalCandidate"), M = /* @__PURE__ */ t((e) => e === "left" || e === "right", "sideIsHorizontal"), N = /* @__PURE__ */ t((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"), P = /* @__PURE__ */ t((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__ */ t((e, t, n, r, i) => {
+		for (let a of u(n)) for (let n of u(i)) j(e, [
+			t,
+			{
+				x: a,
+				y: t.y
+			},
+			{
+				x: a,
+				y: n
+			},
+			{
+				x: r.x,
+				y: n
+			},
+			r
+		]);
+	}, "addHorizontalToVerticalCandidates"), z = /* @__PURE__ */ t((e, t, n, r, i) => {
+		for (let a of u(n)) for (let n of u(i)) j(e, [
+			t,
+			{
+				x: t.x,
+				y: a
+			},
+			{
+				x: n,
+				y: a
+			},
+			{
+				x: n,
+				y: r.y
+			},
+			r
+		]);
+	}, "addVerticalToHorizontalCandidates"), te = /* @__PURE__ */ t((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) j(e, [
+			t,
+			{
+				x: o,
+				y: t.y
+			},
+			{
+				x: o,
+				y: i
+			},
+			{
+				x: n,
+				y: i
+			},
+			{
+				x: n,
+				y: r.y
+			},
+			r
+		]);
+	}, "addHorizontalPairCandidates"), ne = /* @__PURE__ */ t((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) j(e, [
+			t,
+			{
+				x: t.x,
+				y: o
+			},
+			{
+				x: i,
+				y: o
+			},
+			{
+				x: i,
+				y: n
+			},
+			{
+				x: r.x,
+				y: n
+			},
+			r
+		]);
+	}, "addVerticalPairCandidates"), re = /* @__PURE__ */ t((e) => {
+		let t = /* @__PURE__ */ new Set();
+		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"), ie = /* @__PURE__ */ t((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__ */ t((e, t, n, r) => {
+		let i = [...u("left"), ...u("right")], a = [...u("top"), ...u("bottom")];
+		for (let s of o) {
+			let o = I(r, s), c = s === "top" || s === "bottom" ? u(s) : a;
+			for (let r of i) {
+				j(e, [
+					t,
+					n,
+					{
+						x: r,
+						y: n.y
+					},
+					{
+						x: r,
+						y: o.y
+					},
+					o
+				]);
+				for (let i of c) j(e, [
+					t,
+					n,
+					{
+						x: r,
+						y: n.y
+					},
+					{
+						x: r,
+						y: i
+					},
+					{
+						x: o.x,
+						y: i
+					},
+					o
+				]);
+			}
+		}
+	}, "addVerticalDepartureOuterTrackCandidates"), oe = /* @__PURE__ */ t((e, t, n, r) => {
+		let i = [...u("left"), ...u("right")], a = [...u("top"), ...u("bottom")];
+		for (let s of o) {
+			let o = I(r, s), c = s === "left" || s === "right" ? u(s) : i;
+			for (let r of a) {
+				j(e, [
+					t,
+					n,
+					{
+						x: n.x,
+						y: r
+					},
+					{
+						x: o.x,
+						y: r
+					},
+					o
+				]);
+				for (let i of c) j(e, [
+					t,
+					n,
+					{
+						x: n.x,
+						y: r
+					},
+					{
+						x: i,
+						y: r
+					},
+					{
+						x: i,
+						y: o.y
+					},
+					o
+				]);
+			}
+		}
+	}, "addHorizontalDepartureOuterTrackCandidates"), H = /* @__PURE__ */ t((e) => {
+		let t = e.start, n = e.end, r = n ? i.get(n) : void 0;
+		if (!t || !r) return [];
+		let a = D(e.points ?? []);
+		if (a.length < 4) return [];
+		let o = a[0], s = a[1], c = [];
+		return S(o, s, Y) ? ae(c, o, s, r) : x(o, s, Y) && oe(c, o, s, r), c;
+	}, "terminalPreservingOuterTrackCandidates"), U = /* @__PURE__ */ t((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 = I(r, e);
+			for (let n of o) s.push(...ie(t, e, I(a, n), n));
+		}
+		return s.push(...H(e)), s;
+	}, "candidatePathsFor"), W = /* @__PURE__ */ t(() => new Map(c.map((e) => [e, Z(d(e))])), "currentSegmentsByEdge"), K = /* @__PURE__ */ t((e, t, n) => {
+		let r = /* @__PURE__ */ new Set();
+		for (let i of c) {
+			if (i === e) continue;
+			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"), se = /* @__PURE__ */ t((e, t, n, r) => {
+		let i = /* @__PURE__ */ new Set();
+		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 = 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: 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: K(e, t.candidateSegments, n),
+			totalBends: t.totalBends,
+			length: t.length
+		}));
+	}, "pairCandidatesFor"), ce = /* @__PURE__ */ t((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) ?? Z(d(e));
+			s += f(n.segments, o) + f(i.segments, o);
+		}
+		return e.count - o + s;
+	}, "pairCrossingCount"), le = /* @__PURE__ */ t((e, t) => {
+		for (let n of e.sharedTrackConflicts) if (n !== t) return !1;
+		return !0;
+	}, "conflictsOnlyWith"), ue = /* @__PURE__ */ t((e, t) => e.segments.some((e) => t.segments.some((t) => w(e, t, .5) >= X)), "candidatesShareTrack"), de = /* @__PURE__ */ t((e, t, n, r) => le(t, n.edge) && le(r, e.edge) && !ue(t, r), "pairCandidatesAreCompatible"), q = /* @__PURE__ */ t((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"), J = /* @__PURE__ */ t((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__ */ t((e, t, n, r) => {
+		let i = r;
+		for (let r of t.candidates) for (let a of n.candidates) {
+			if (!de(t, r, n, a)) continue;
+			let o = q(e, t, r, n, a);
+			o && J(o, i) && (i = o);
+		}
+		return i;
+	}, "bestScoreForOptionPair"), pe = /* @__PURE__ */ t((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 = se(n, e, r, i);
+			t.length > 0 && s.set(n, {
+				edge: n,
+				candidates: t
+			});
+		}
+		let u = {
+			replacements: /* @__PURE__ */ new Map(),
+			crossings: e.count,
+			bends: t,
+			length: n
+		}, f = {
+			current: e,
+			currentBends: t,
+			currentLength: n,
+			baseBendsByEdge: a,
+			baseLengthByEdge: o,
+			baseSegments: r
+		};
+		for (let t of l) {
+			let n = new Set(t.filter((t) => e.edgeSet.has(t))), r = t.map((e) => s.get(e)).filter((e) => !!e);
+			for (let e = 0; e < r.length; e++) {
+				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 = fe(f, t, e, u));
+				}
+			}
+		}
+		return u.replacements.size > 0 ? u.replacements : void 0;
+	}, "bestPairedReplacement");
+	for (let e = 0; e < 4; e++) {
+		let e = m(), t = e.count;
+		if (t === 0) return;
+		let n, r, i = t, a = Infinity;
+		for (let o of e.edges) {
+			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));
+			}
+		}
+		if (n && r) {
+			n.points = r;
+			continue;
+		}
+		let o = pe(e);
+		if (!o) return;
+		for (let [e, t] of o) e.points = t;
+	}
+}
+t(et, "resolveRenderedOrthogonalCrossings");
+var tt = .001, nt = 8;
+function rt(e, n) {
+	let { nodeInfoById: r, realNodeRects: i } = R(n), a = [
+		"top",
+		"bottom",
+		"left",
+		"right"
+	], o = {
+		top: Math.min(...i.map((e) => e.rect.top)) - 20,
+		bottom: Math.max(...i.map((e) => e.rect.bottom)) + 20,
+		left: Math.min(...i.map((e) => e.rect.left)) - 20,
+		right: Math.max(...i.map((e) => e.rect.right)) + 20
+	}, s = /* @__PURE__ */ t((e, t, n, r) => {
+		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__ */ t((e, t) => {
+		for (let n = 0; n < e.length - 1; n++) {
+			let r = e[n], a = e[n + 1];
+			if (B(r, a, i, t, 1)) return !0;
+		}
+		return !1;
+	}, "pathHitsNode"), l = /* @__PURE__ */ t((t, n, r = !1) => {
+		let i = 0, a = T(t, tt), o = n.start, s = n.end;
+		for (let t of e) {
+			if (t === n || t.isLayoutOnly) continue;
+			let e = t.start, c = t.end;
+			if (!r && o && s && (e === o || e === s || c === o || c === s)) continue;
+			let l = t.points;
+			if (!(!l || l.length < 2)) for (let e of a) for (let t of T(l, tt)) (re(e.a, e.b, t.a, t.b, tt, tt) || w(e, t, tt) >= nt) && i++;
+		}
+		return i;
+	}, "pathConflictCount"), u = /* @__PURE__ */ t((e, t) => {
+		let n = Math.abs(e.y - t.rect.top), r = Math.abs(e.y - t.rect.bottom), i = Math.abs(e.x - t.rect.left), a = Math.abs(e.x - t.rect.right), o = "top", s = n;
+		return r < s && (o = "bottom", s = r), i < s && (o = "left", s = i), a < s && (o = "right", s = a), o;
+	}, "nearestSideOfRect"), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ t((e, t, n) => {
+		let r = d.get(e) ?? [];
+		r.push({
+			side: t,
+			edgeId: n
+		}), d.set(e, r);
+	}, "addFaceClaim");
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let e = t.points ?? [];
+		if (e.length < 1) continue;
+		let n = t.id ?? "", i = t.start, a = t.end;
+		if (i) {
+			let t = r.get(i);
+			t && f(i, u(e[0], t), n);
+		}
+		if (a) {
+			let t = r.get(a);
+			t && f(a, u(e[e.length - 1], t), n);
+		}
+	}
+	let p = /* @__PURE__ */ t((e, t, n) => d.get(e)?.some((e) => e.edgeId !== n && e.side === t) ?? !1, "faceIsClaimed");
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let e = t.points;
+		if (!e || e.length < 2) continue;
+		let n = E(e, tt);
+		if (n < 4) continue;
+		let i = t.start, o = t.end;
+		if (!i || !o) continue;
+		let m = r.get(i), h = r.get(o);
+		if (!m || !h) continue;
+		let g = t.id ?? "", _ = l(e, t, !0), v = l(e, t), y, b = _, x = n;
+		for (let e of a) {
+			if (p(i, e, g)) continue;
+			let n = I(m, e);
+			for (let r of a) {
+				if (p(o, r, g)) continue;
+				let a = I(h, r);
+				for (let u of s(n, e, a, r)) {
+					if (c(u, [i, o])) continue;
+					let e = E(u, tt);
+					if (_ > 0) {
+						let n = l(u, t, !0);
+						if (n > b || n === b && e >= x) continue;
+						b = n, x = e, y = u;
+					} else l(u, t) > v || e < x && (x = e, y = u);
+				}
+			}
+		}
+		if (y) {
+			t.points = y;
+			let e = d.get(i);
+			e && d.set(i, e.filter((e) => e.edgeId !== g));
+			let n = d.get(o);
+			n && d.set(o, n.filter((e) => e.edgeId !== g)), f(i, u(y[0], m), g), f(o, u(y[y.length - 1], h), g);
+		}
+	}
+}
+t(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) * it;
+			return {
+				left: Math.min(i.x, e),
+				right: Math.max(i.x, e),
+				top: i.y - at,
+				bottom: i.y + at
+			};
+		}
+		if (Math.abs(o) <= Q) {
+			let e = i.y + Math.sign(s) * it;
+			return {
+				left: i.x - at,
+				right: i.x + at,
+				top: Math.min(i.y, e),
+				bottom: Math.max(i.y, e)
+			};
+		}
+		return {
+			left: Math.min(i.x, a.x),
+			right: Math.max(i.x, a.x),
+			top: Math.min(i.y, a.y),
+			bottom: Math.max(i.y, a.y)
+		};
+	}
+}
+t(ot, "markerClearanceRectFor");
+function st(e) {
+	return {
+		left: Math.min(e.left, e.right),
+		right: Math.max(e.left, e.right),
+		top: Math.min(e.top, e.bottom),
+		bottom: Math.max(e.top, e.bottom)
+	};
+}
+t(st, "normalizeRect");
+function ct(e, t) {
+	let n = D(t);
+	return [ot(n, !0), ot(n, !1)].some((t) => t && M(e, st(t)));
+}
+t(ct, "labelOverlapsOwnMarker");
+function lt(e, n) {
+	let r = [];
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let e = t.points;
+		if (!(!e || e.length < 2)) for (let n = 0; n < e.length - 1; n++) r.push({
+			edgeId: t.id,
+			p1: e[n],
+			p2: e[n + 1]
+		});
+	}
+	let i = [], a = [];
+	for (let e of n.values()) {
+		let t = e.isGroup, n = e.parentId;
+		if (t && !n) {
+			let t = F(e);
+			t && a.push({
+				id: e.id,
+				rect: t
+			});
+			continue;
+		}
+		if (t || e.isEdgeLabel) continue;
+		let r = F(e);
+		r && i.push({
+			nodeId: e.id,
+			rect: r
+		});
+	}
+	let o = /* @__PURE__ */ t((e, t) => {
+		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__ */ t((e, t) => {
+		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__ */ t((e, t, n) => o(e, n) || s(t, n), "labelOverlapsAnything"), l = [], u = /* @__PURE__ */ t((e) => {
+		for (let { id: t, rect: n } of a) if (j(n, e)) return t;
+	}, "findContainingLane"), d = /* @__PURE__ */ t((e, t) => l.some((n) => n.labelId !== e && M(t, n.rect)), "overlapsPlacedLabel");
+	for (let r of e) {
+		if (r.isLayoutOnly) continue;
+		let e = r.labelNodeId;
+		if (!e) continue;
+		let i = n.get(e);
+		if (!i) continue;
+		let f = r.points;
+		if (!f || f.length < 2) continue;
+		let p = i.width ?? 0, m = i.height ?? 0;
+		if (p <= 0 || m <= 0) continue;
+		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 < Q && i < Q || r >= Q && i >= Q || h.push({
+				idx: e,
+				length: r + i,
+				orientation: r >= Q ? "horizontal" : "vertical",
+				midX: (t.x + n.x) / 2,
+				midY: (t.y + n.y) / 2
+			});
+		}
+		if (h.length === 0) continue;
+		let g = h.length >= 3 ? h.filter((e) => e.idx > 0 && e.idx < h.length - 1) : h, _ = g.length > 0 ? g : h, v = p >= m ? "horizontal" : "vertical", y = /* @__PURE__ */ t((e) => [...e].sort((e, t) => {
+			let n = e.orientation === v;
+			if (n !== (t.orientation === v)) return n ? -1 : 1;
+			let r = e.length >= (e.orientation === "horizontal" ? p : m) + 2;
+			return r === t.length >= (t.orientation === "horizontal" ? p : m) + 2 ? t.length - e.length : r ? -1 : 1;
+		}), "rankSegments"), b = h[0], x = h[h.length - 1], S = [
+			.5,
+			.25,
+			.75,
+			.05,
+			.95,
+			.15,
+			.85,
+			.1,
+			.9
+		], C = /* @__PURE__ */ t((e, t) => {
+			let n = f[e.idx], r = f[e.idx + 1];
+			return {
+				midX: n.x + (r.x - n.x) * t,
+				midY: n.y + (r.y - n.y) * t
+			};
+		}, "anchorAtT"), w = /* @__PURE__ */ t((e, t, n) => Math.min(n, Math.max(t, e)), "clamp"), T = /* @__PURE__ */ t((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__ */ t((e) => {
+			let t = P(e.midX, e.midY, p, m), n = u(t);
+			if (n) return {
+				laneId: n,
+				anchor: e,
+				rect: t
+			};
+			let r = a.find(({ rect: t }) => T(e, t));
+			if (!r) return;
+			let i = r.rect.left + p / 2 + 1, o = r.rect.right - p / 2 - 1, s = r.rect.top + m / 2 + 1, c = r.rect.bottom - m / 2 - 1;
+			if (i > o || s > c) return;
+			let l = {
+				midX: w(e.midX, i, o),
+				midY: w(e.midY, s, c)
+			}, d = P(l.midX, l.midY, p, m);
+			return T(e, d) ? {
+				laneId: r.id,
+				anchor: l,
+				rect: d
+			} : void 0;
+		}, "placementForAnchor"), D = /* @__PURE__ */ t((e, t, n) => e.orientation === "horizontal" ? Math.abs(t.midX - n.x) : Math.abs(t.midY - n.y), "distanceAlongSegment"), O = /* @__PURE__ */ t((e, t) => {
+			let n = (e.orientation === "horizontal" ? p / 2 : m / 2) + 12;
+			if (e === b) {
+				let r = f[e.idx];
+				if (D(e, t, r) + Q < n) return !1;
+			}
+			if (e === x) {
+				let r = f[e.idx + 1];
+				if (D(e, t, r) + Q < n) return !1;
+			}
+			return !0;
+		}, "labelClearsTerminalEndpoints"), k = /* @__PURE__ */ t((t) => {
+			let n = y(t);
+			for (let t of n) for (let n of S) {
+				let i = C(t, n);
+				if (!O(t, i)) continue;
+				let a = E(i);
+				if (a && !ct(a.rect, f) && !d(e, a.rect) && !c(e, r.id, a.rect)) return {
+					laneId: a.laneId,
+					anchor: a.anchor
+				};
+			}
+		}, "tryPool"), A = /* @__PURE__ */ t((t, n, i = !1) => {
+			let a = y(t);
+			for (let t of a) {
+				let a = {
+					midX: t.midX,
+					midY: t.midY
+				};
+				if (n && !O(t, a)) continue;
+				let c = E(a);
+				if (c && !ct(c.rect, f) && !d(e, c.rect) && !o(e, c.rect) && (i || !s(r.id, c.rect))) return {
+					laneId: c.laneId,
+					anchor: c.anchor
+				};
+			}
+		}, "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 t = P(j.anchor.midX, j.anchor.midY, p, m), n = l.findIndex((t) => t.labelId === e);
+			n >= 0 ? l[n] = {
+				labelId: e,
+				rect: t
+			} : l.push({
+				labelId: e,
+				rect: t
+			});
+		}
+	}
+}
+t(lt, "anchorLabelsToPolyline");
+var ut = 1e-6, dt = 4, ft = 3;
+function pt(e, t) {
+	return e < t ? `${e}::${t}` : `${t}::${e}`;
+}
+t(pt, "pairKey");
+function mt(e, n) {
+	let { nodeInfoById: r, realNodeRects: i } = R(n), a = /* @__PURE__ */ new Map();
+	for (let e of n) {
+		let t = e.id;
+		e.isGroup || e.isEdgeLabel && a.set(t, {
+			w: e.width ?? 0,
+			h: e.height ?? 0
+		});
+	}
+	let o = /* @__PURE__ */ t((n, r, i, o) => {
+		let s = pt(r, i), c = 0, l = /* @__PURE__ */ t((e) => {
+			if (!e) return;
+			let t = a.get(e);
+			if (!t) return;
+			let n = o === "x" ? t.w / 2 : t.h / 2;
+			n > c && (c = n);
+		}, "consider");
+		l(n.labelNodeId);
+		for (let t of e) {
+			if (t === n || t.isLayoutOnly) continue;
+			let e = t.start, r = t.end;
+			e && r && pt(e, r) === s && l(t.labelNodeId);
+		}
+		return c > 0 ? c + ft : 0;
+	}, "labelClearanceFor");
+	for (let t of e) {
+		if (t.isLayoutOnly) continue;
+		let n = t.points;
+		if (!O(n, ut)) continue;
+		let a = ne(t, r, ut);
+		if (!a) continue;
+		let { srcId: s, dstId: c, srcInfo: l, dstInfo: u, collinearX: d, collinearY: f } = a;
+		if (d === f) continue;
+		let p, m;
+		if (d) {
+			let e = u.cy > l.cy;
+			p = {
+				x: l.cx,
+				y: e ? l.rect.bottom : l.rect.top
+			}, m = {
+				x: u.cx,
+				y: e ? u.rect.top : u.rect.bottom
+			};
+		} else {
+			let e = u.cx > l.cx;
+			p = {
+				x: e ? l.rect.right : l.rect.left,
+				y: l.cy
+			}, m = {
+				x: e ? u.rect.left : u.rect.right,
+				y: u.cy
+			};
+		}
+		if (B(p, m, i, [s, c], 1)) continue;
+		let h = o(t, s, c, d ? "x" : "y"), g = h > dt ? h : dt, _ = [
+			0,
+			g,
+			-g
+		];
+		for (let n of _) {
+			let r = { ...p }, a = { ...m };
+			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, e, t, { epsilon: ut })) {
+				t.points = [r, a];
+				break;
+			}
+		}
+	}
+}
+t(mt, "straightenCollinearSiblingDetours");
+function ht(e, n) {
+	let r = .001, { realNodeRects: i, labelNodeRects: a } = z(n.values()), o = /* @__PURE__ */ t((e, t) => T(t, r).map((n) => ({
+		...n,
+		edge: e,
+		interior: n.index >= 1 && n.index <= t.length - 3
+	})), "segmentsFor"), s = /* @__PURE__ */ t(() => {
+		let t = [];
+		for (let n of e) {
+			if (n.isLayoutOnly) continue;
+			let e = n.points;
+			!e || e.length < 2 || t.push(...o(n, D(e)));
+		}
+		return t;
+	}, "allSegments"), c = /* @__PURE__ */ t((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__ */ t((t, n) => {
+		let s = t.start, l = t.end, u = o(t, n);
+		if (u.length !== n.length - 1) return !1;
+		let d = [s, l].filter((e) => !!e), f = t.labelNodeId ? [t.labelNodeId] : [];
+		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 e) {
+			if (n === t || n.isLayoutOnly) continue;
+			let e = n.points;
+			if (!(!e || e.length < 2)) {
+				for (let t of u) for (let i of o(n, D(e))) if (c(t, i) || V(t.a, t.b, i.a, i.b, r)) return !1;
+			}
+		}
+		return !0;
+	}, "candidateIsSafe"), u = /* @__PURE__ */ t((e, t) => {
+		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;
+		else if (e.vertical) r[e.index].x += t, r[e.index + 1].x += t;
+		else return;
+		return o(e.edge, r).length === r.length - 1 ? r : void 0;
+	}, "shiftedCandidate"), d = /* @__PURE__ */ t((e, t) => ({
+		x: e.x ?? (t.left + t.right) / 2,
+		y: e.y ?? (t.top + t.bottom) / 2
+	}), "nodeCenter"), f = /* @__PURE__ */ t((e) => {
+		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 ? 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),
+			sourceRect: o,
+			tail: c
+		};
+	}, "sourceDetourContextFor"), p = /* @__PURE__ */ t((e, t, n, i, a, o) => {
+		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 D([
+			{
+				x: n.x,
+				y: c
+			},
+			{
+				x: n.x,
+				y: l
+			},
+			{
+				x: u,
+				y: l
+			},
+			{
+				x: u,
+				y: e.b.y
+			},
+			...o
+		], r);
+	}, "verticalSourceDetour"), m = /* @__PURE__ */ t((e, t, n, i, a, o) => {
+		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 D([
+			{
+				x: c,
+				y: n.y
+			},
+			{
+				x: l,
+				y: n.y
+			},
+			{
+				x: l,
+				y: u
+			},
+			{
+				x: e.b.x,
+				y: u
+			},
+			...o
+		], r);
+	}, "horizontalSourceDetour"), h = /* @__PURE__ */ t((e, t) => {
+		let n = f(e);
+		if (n) {
+			if (e.vertical) return p(e, t, n.sourceCenter, n.targetCenter, n.sourceRect, n.tail);
+			if (e.horizontal) return m(e, t, n.sourceCenter, n.targetCenter, n.sourceRect, n.tail);
+		}
+	}, "sourceDetourCandidate"), g = [
+		-7,
+		7,
+		-14,
+		14,
+		-21,
+		21
+	];
+	for (let e = 0; e < 12; e++) {
+		let e = s(), t = !1;
+		for (let n = 0; n < e.length && !t; n++) for (let r = n + 1; r < e.length && !t; r++) {
+			let i = e[n], a = e[r];
+			if (i.edge === a.edge || !c(i, a)) continue;
+			let o = [i, a].filter((e) => e.interior);
+			for (let e of o) {
+				for (let n of g) {
+					let r = u(e, n);
+					if (r && l(e.edge, r)) {
+						e.edge.points = r, t = !0;
+						break;
+					}
+					let i = h(e, n);
+					if (i && l(e.edge, i)) {
+						e.edge.points = i, t = !0;
+						break;
+					}
+				}
+				if (t) break;
+			}
+		}
+		if (!t) return;
+	}
+}
+t(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;
+}
+t(gt, "segmentsIntersect");
+function _t(t) {
+	let n = t.nodes ?? [], r = t.edges ?? [], i = [];
+	if (!r.length || !n.length) return i;
+	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 (k(t[n], t[n + 1], e, -1)) {
+				i.push({
+					type: "edge-node-overlap",
+					edgeId: c,
+					targetId: e.nodeId,
+					detail: `segment ${n} passes through node "${e.nodeId}"`
+				});
+				break;
+			}
+		}
+		for (let e = 0; e < t.length - 1; e++) o.push({
+			edgeId: c,
+			start: n,
+			end: r,
+			p1: t[e],
+			p2: t[e + 1]
+		});
+	}
+	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 && 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",
+				edgeId: n.edgeId,
+				targetId: r.edgeId,
+				detail: `edges "${n.edgeId}" and "${r.edgeId}" cross`
+			}));
+		}
+	}
+	if (i.length > 0) {
+		let t = i.filter((e) => e.type === "edge-node-overlap").length, n = i.filter((e) => e.type === "edge-edge-crossing").length;
+		e.warn(`[SWIMLANE_VALIDATE] ${i.length} issue(s) detected: ${t} edge-node overlap(s), ${n} edge crossing(s)`);
+		for (let t of i) e.warn(`[SWIMLANE_VALIDATE]   ${t.type}: ${t.detail}`);
+	}
+	return i;
+}
+t(_t, "validateSwimlanesLayout");
+function vt(e, n) {
+	let r = e.nodes ?? [], i = e.edges ?? [], a = r.filter((e) => !e.isGroup);
+	if ((n === "LR" || n === "RL") && a.length > 0 && !Re(e, n) || n === "BT" && a.length > 0 && !Le(e)) return;
+	for (let e of i) {
+		if (e.isLayoutOnly) continue;
+		let t = e.points;
+		!t || t.length < 2 || (e.points = G(W(t)));
+	}
+	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);
+	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__ */ t(() => {
+		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(), ht(i, o), s(), Ye(i, o, n), Xe(i, o, n), Ye(i, o, n), Xe(i, o, n);
+}
+t(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;
+		let e = `${i.id}:${i.src}->${i.dst}`;
+		n.has(e) || (n.add(e), r.push(i));
+	}
+	return {
+		nodes: [...t.keys()],
+		edges: r,
+		layout: e.layout,
+		nodeById: t
+	};
+}
+t(yt, "normalizeGraph");
+function bt(e, t) {
+	return e.edges.filter((e) => e.dst === t);
+}
+t(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;
+}
+t(xt, "buildSuccessorMap");
+function St(e) {
+	let t = xt(e);
+	for (let e of t.values()) e.sort((e, t) => e.localeCompare(t));
+	return t;
+}
+t(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;
+}
+t(Ct, "buildInDegreeMap");
+function wt(e, n) {
+	let r = [...n.entries()].filter(([, e]) => e === 0).map(([e]) => e).sort((e, t) => e.localeCompare(t)), i = new Set(e.edges.flatMap((e) => [e.src, e.dst])), a = /* @__PURE__ */ t((t) => !i.has(t) && !e.nodeById.get(t)?.isGroup, "isUnconnected"), o = [...n.keys()].filter((e) => n.get(e) === 0 && a(e)), s = 0;
+	return r.map((e) => a(e) ? o[s++] : e);
+}
+t(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));
+	return {
+		preds: n,
+		succs: r
+	};
+}
+t(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;
+}
+t(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);
+		for (let r of i.get(e) ?? []) if (t.set(r, (t.get(r) ?? 0) - 1), (t.get(r) ?? 0) === 0) {
+			let e = 0;
+			for (; e < n.length && n[e] < r;) e++;
+			n.splice(e, 0, r);
+		}
+	}
+	return r.length === e.nodes.length ? r : null;
+}
+t(Dt, "topoSortIfAcyclic");
+function Ot(e) {
+	let t = /* @__PURE__ */ new Map(), n = 0;
+	for (let r of e) t.set(r, n), n++;
+	return t;
+}
+t(Ot, "buildLayerIndex");
+function kt(e) {
+	let n = Array(e.length), r = /* @__PURE__ */ t((t, i) => {
+		if (i - t <= 1) return 0;
+		let a = t + i >> 1, o = r(t, a) + r(a, i), s = t, c = a, l = t;
+		for (; s < a || c < i;) c >= i || s < a && e[s] <= e[c] ? n[l++] = e[s++] : (n[l++] = e[c++], o += a - s);
+		for (let r = t; r < i; r++) e[r] = n[r];
+		return o;
+	}, "count");
+	return r(0, e.length);
+}
+t(kt, "countInversions");
+function At(e) {
+	let n = yt(e), 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));
+	let i = /* @__PURE__ */ Object.create(null);
+	for (let e of n.nodes) i[e] = 0;
+	let a = [], o = /* @__PURE__ */ t((e) => {
+		i[e] = 1;
+		for (let t of r.get(e) ?? []) {
+			let e = t.dst;
+			i[e] === 0 ? o(e) : i[e] === 1 && a.push(t);
+		}
+		i[e] = 2;
+	}, "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,
+		src: e.dst,
+		dst: e.src,
+		weight: e.weight,
+		ref: e.ref
+	} : e);
+	return {
+		acyclic: {
+			nodes: [...n.nodes],
+			edges: u,
+			layout: n.layout,
+			nodeById: new Map(n.nodeById)
+		},
+		reversed: a
+	};
+}
+t(At, "removeCycles_DFS");
+function jt(e) {
+	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ t((t) => {
+		if (n.has(t)) return n.get(t);
+		let i = e.nodeById.get(t);
+		if (!i) return n.set(t, null), null;
+		let a = i.parentId;
+		if (!a) return n.set(t, null), null;
+		let o = r(a) ?? a;
+		return n.set(t, o), o;
+	}, "resolve");
+	for (let t of e.nodes) r(t);
+	return n;
+}
+t(jt, "buildTopLaneMap");
+function Mt(e) {
+	let t = jt(e);
+	return (e) => t.get(e) ?? null;
+}
+t(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();
+}
+t(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;
+}
+t(Pt, "resolveTopLaneOrder");
+var Ft = { EPSILON: 1e-6 }, It = {
+	GRAVITY_ITERATIONS: 8,
+	MAX_CROSSING_OPTIMIZATION_PASSES: 4,
+	DEFAULT_COMPACT_SINGLE_INPUT: !0
+}, Lt = {
+	DEFAULT_LAYER_GAP: 100,
+	DEFAULT_NODE_GAP: 40
+};
+function Rt(e, n) {
+	let r = yt(e), 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 = 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 = zt(e, t, {
+				laneOf: i,
+				rankHint: a,
+				topoIndex: c
+			});
+			l.set(e, n), u.get(n).push(e);
+		} else l.has(e) || l.set(e, null);
+	}
+	for (let e of r.nodes) l.has(e) || l.set(e, null);
+	let d = /* @__PURE__ */ new Set();
+	for (let e of r.nodes) (l.get(e) ?? null) === null && d.add(e);
+	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 = 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 = 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);
+		n ? n.push(e.id) : _.set(t, [e.id]);
+	}
+	let v = [], y = [], b = /* @__PURE__ */ new Set(), x = /* @__PURE__ */ t((e) => {
+		if (!b.has(e)) {
+			b.add(e), v.push(e);
+			for (let t of u.get(e) ?? []) x(t);
+			y.push(e);
+		}
+	}, "walk");
+	for (let e of f) x(e);
+	for (let e of s) x(e);
+	return {
+		parent: l,
+		children: u,
+		roots: f,
+		componentOf: h,
+		blocks: g,
+		nodeBlocks: _,
+		adjacency: m,
+		preorder: v,
+		postorder: y,
+		topologicalOrder: s
+	};
+}
+t(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;
+		if (o !== (a != null && a === r)) return o ? -1 : 1;
+		let s = n.rankHint?.[e], c = n.rankHint?.[t];
+		if (s != null && c != null && s !== c) return c - s;
+		let l = n.topoIndex.get(e) ?? 0, u = n.topoIndex.get(t) ?? 0;
+		return l === u ? e.localeCompare(t) : l - u;
+	})[0];
+}
+t(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;
+}
+t(Bt, "buildAdjacency");
+function Vt(e) {
+	let t = /* @__PURE__ */ new Map(), n = 0;
+	for (let r of e.keys()) {
+		if (t.has(r)) continue;
+		let i = [r];
+		for (; i.length > 0;) {
+			let r = i.pop();
+			if (!t.has(r)) {
+				t.set(r, n);
+				for (let n of e.get(r) ?? []) t.has(n) || i.push(n);
+			}
+		}
+		n++;
+	}
+	return t;
+}
+t(Vt, "assignComponents");
+function Ht(e) {
+	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = [], a = [], o = 0, s = /* @__PURE__ */ t((t, c) => {
+		n.set(t, ++o), r.set(t, o);
+		for (let l of e.get(t) ?? []) l !== c && (n.has(l) ? (n.get(l) ?? 0) < (n.get(t) ?? 0) && (i.push([t, l]), r.set(t, Math.min(r.get(t) ?? o, n.get(l) ?? o))) : (i.push([t, l]), s(l, t), r.set(t, Math.min(r.get(t) ?? o, r.get(l) ?? o)), (r.get(l) ?? 0) >= (n.get(t) ?? 0) && a.push(Ut(t, l, i, a.length))));
+	}, "visit");
+	for (let t of e.keys()) n.has(t) || s(t, null);
+	return a;
+}
+t(Ht, "computeBlocks");
+function Ut(e, t, n, r) {
+	let i = [], a = /* @__PURE__ */ new Set();
+	for (; n.length > 0;) {
+		let r = n.pop();
+		if (i.push(r), a.add(r[0]), a.add(r[1]), r[0] === e && r[1] === t || r[0] === t && r[1] === e) break;
+	}
+	return {
+		id: r,
+		edges: i,
+		nodes: [...a]
+	};
+}
+t(Ut, "popBlock");
+function Wt(e, n, r) {
+	let i = [...e.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();
+	for (let e of i) {
+		let t = r.parent.get(e) ?? null, n = a.get(e);
+		n != null && (t ?? (s[n] = -1, c[n] = 0, u.has(e) || (u.add(e), l.push(e))));
+	}
+	for (; l.length > 0;) {
+		let e = l.shift(), t = a.get(e);
+		if (t == null) continue;
+		let n = r.children.get(e) ?? [];
+		for (let e of n) {
+			if (u.has(e)) continue;
+			let n = a.get(e);
+			n != null && (s[n] = t, c[n] = c[t] + 1, u.add(e), l.push(e));
+		}
+	}
+	for (let e of i) {
+		if (u.has(e)) continue;
+		let t = a.get(e);
+		t != null && (s[t] = -1, c[t] = 0, u.add(e));
+	}
+	let d = Math.max(1, Math.ceil(Math.log2(Math.max(1, o))) + 1), f = Array.from({ length: d }, () => Array(o).fill(-1));
+	for (let e = 0; e < o; e++) f[0][e] = s[e];
+	for (let e = 1; e < d; e++) for (let t = 0; t < o; t++) {
+		let n = f[e - 1][t];
+		f[e][t] = n === -1 ? -1 : f[e - 1][n];
+	}
+	let p = /* @__PURE__ */ t((e, t) => {
+		if (e === -1 || t === -1) return -1;
+		c[e] < c[t] && ([e, t] = [t, e]);
+		let n = c[e] - c[t];
+		for (let t = 0; t < d; t++) if (n >> t & 1 && (e = f[t][e], e === -1)) return -1;
+		if (e === t) return e;
+		for (let n = d - 1; n >= 0; n--) {
+			let r = f[n][e], i = f[n][t];
+			r !== -1 && i !== -1 && r !== i && (e = r, t = i);
+		}
+		return f[0][e];
+	}, "lcaIndex"), m = Array.from({ length: o }, () => /* @__PURE__ */ new Map());
+	for (let t of e.edges) {
+		let e = t.src, r = t.dst, i = n[e], o = n[r];
+		if (i == null || o == null || (i > o && ([e, r] = [r, e], [i, o] = [o, i]), i == null || o == null || i === o)) continue;
+		let s = a.get(e), c = a.get(r);
+		if (s == null || c == null) continue;
+		let l = p(s, c);
+		if (l === -1) continue;
+		let u = m[l];
+		for (let e = i; e < o; e++) u.set(e, (u.get(e) ?? 0) + 1);
+	}
+	let h = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ t((e, t) => {
+		if (t.size !== 0) for (let [n, r] of t) e.set(n, (e.get(n) ?? 0) + r);
+	}, "mergeInto"), _ = /* @__PURE__ */ new Set(), v = /* @__PURE__ */ t((e) => {
+		let t = a.get(e);
+		_.add(e);
+		let i = t == null ? void 0 : m[t], o = i ? new Map(i) : /* @__PURE__ */ new Map(), s = r.children.get(e) ?? [];
+		for (let t of s) {
+			let r = v(t), i = n[e];
+			if (i != null) {
+				let a = h.get(e);
+				a || (a = /* @__PURE__ */ new Map(), h.set(e, a));
+				let o = r.get(i) ?? 0, s = n[t];
+				s != null && s > i && (o += 1), a.set(t, o);
+			}
+			g(o, r);
+		}
+		return o;
+	}, "dfs");
+	for (let e of r.roots) _.has(e) || v(e);
+	for (let e of i) _.has(e) || v(e);
+	return h;
+}
+t(Wt, "computeSubtreeCrossCounts");
+function Gt(e, n, r) {
+	let i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ t((e) => {
+		let t = r[e] ?? 0, o = [...n.get(e) ?? []];
+		o.sort(Kt(r));
+		for (let e of o) {
+			a(e);
+			let n = i.get(e);
+			n != null && (t = Math.min(t, n));
+		}
+		i.set(e, t);
+	}, "annotate");
+	for (let t of e) a(t);
+	return i;
+}
+t(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;
+	};
+}
+t(Kt, "compareByRankThenId");
+function qt(e, n, r, i) {
+	let a = 0;
+	for (let e of n) {
+		let t = r[e] ?? 0;
+		t > a && (a = t);
+	}
+	let o = Array.from({ length: a + 1 }, () => []), s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ t((e) => {
+		if (s.has(e)) return;
+		s.add(e);
+		let t = r[e] ?? 0;
+		o[t] || (o[t] = []), o[t].push(e);
+		for (let t of i(e)) c(t);
+	}, "emit");
+	for (let t of e) c(t);
+	for (let e of n) if (!s.has(e)) {
+		let t = r[e] ?? 0;
+		o[t] || (o[t] = []), o[t].push(e), s.add(e);
+	}
+	return o;
+}
+t(qt, "emitNodesInTreeOrder");
+function Jt(e) {
+	let t = [];
+	for (let n of e) {
+		let e = /* @__PURE__ */ new Set(), r = [];
+		for (let t of n) e.has(t) || (e.add(t), r.push(t));
+		t.push(r);
+	}
+	return t;
+}
+t(Jt, "deduplicateLayers");
+function Yt(e, t, n, r) {
+	return (i) => {
+		let a = e.get(i) ?? [];
+		if (a.length === 0) return [];
+		let o = t[i] ?? 0, s = [], c = [], l = n.get(i);
+		for (let e of a) {
+			let t = r.get(e) ?? o;
+			t > o ? s.push({
+				child: e,
+				min: t
+			}) : c.push(e);
+		}
+		return s.sort((e, t) => e.min === t.min ? e.child.localeCompare(t.child) : e.min - t.min), c.sort((e, t) => {
+			let n = l?.get(e) ?? 0, i = l?.get(t) ?? 0;
+			if (n !== i) return n - i;
+			let a = r.get(e) ?? o, s = r.get(t) ?? o;
+			return a === s ? e.localeCompare(t) : a - s;
+		}), [...s.map((e) => e.child), ...c];
+	};
+}
+t(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 = 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;
+}
+t(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 kt(o);
+}
+t(Zt, "countCrossingsBetweenAdjacent");
+function Qt(e, t, n) {
+	let r = [];
+	for (let e of t) {
+		let t = n[e.src], i = n[e.dst];
+		if (t == null || i == null || t === i) continue;
+		let a = e.src, o = e.dst, s = t, c = i;
+		t > i && (a = e.dst, o = e.src, s = i, c = t);
+		for (let t = s; t < c; t++) r.push({
+			id: `${e.id}@${t}`,
+			src: a,
+			dst: o,
+			ref: e.ref
+		});
+	}
+	let i = 0;
+	for (let t = 0; t + 1 < e.length; t++) i += Zt(e[t], e[t + 1], r);
+	return i;
+}
+t(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) {
+			let o = n[s] ?? 0;
+			if (o === 0) continue;
+			let c = 0;
+			for (let e of r.get(s) ?? []) c = Math.max(c, (n[e] ?? 0) + 1);
+			if (c >= o) continue;
+			let l = o;
+			n[s] = c;
+			let u = Qt(Xt(e, n, i), e.edges, n);
+			u < a ? (a = u, t = !0) : n[s] = l;
+		}
+		if (!t) break;
+	}
+	return n;
+}
+t($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;
+		let a = e.edges.filter((e) => e.src === i);
+		if (a.length === 0) continue;
+		let o = !1, s = 0;
+		for (let e of a) {
+			let t = n(e.dst);
+			t == null || t === r ? o = !0 : s++;
+		}
+		if (s === 0 || o) continue;
+		let c = 0, l = !1;
+		for (let t of e.edges) {
+			if (t.dst !== i) continue;
+			let e = n(t.src);
+			e && (e === r ? l = !0 : c++);
+		}
+		if (c > 0 || !l) continue;
+		let u = t[i] ?? 0, d = u + s, f = 0;
+		for (let n of e.edges) n.dst === i && (f = Math.max(f, (t[n.src] ?? 0) + 1));
+		let p = Math.max(u, f, d);
+		p !== u && (t[i] = p);
+	}
+}
+t(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 = bt(n, e), s = t?.ignoreCrossLaneEdges ? r.filter((t) => {
+			let n = a(t.src), r = a(e);
+			return !n || !r || n === r;
+		}) : r;
+		if (s.length === 0) o[e] = 0;
+		else if (i && s.length === 1) {
+			let t = s[0].src;
+			a(t) === a(e) ? o[e] = (o[t] ?? 0) + 1 : o[e] = o[t] ?? 0;
+		} else {
+			let t = -Infinity;
+			for (let e of s) t = Math.max(t, (o[e.src] ?? 0) + 1);
+			o[e] = t === -Infinity ? 0 : t;
+		}
+	}
+	return (t?.optimizeRanksByCrossings ?? !1) && (o = $t(n, o)), t?.ignoreCrossLaneEdges && en(n, o), {
+		layers: Xt(n, o, a),
+		rankOf: o,
+		dummy: /* @__PURE__ */ new Set()
+	};
+}
+t(tn, "assignLayers_LongestPath");
+function nn(e, n) {
+	let r = yt(e), i = { ...tn(r, {
+		compactSingleInput: n?.compactSingleInput,
+		ignoreCrossLaneEdges: n?.ignoreCrossLaneEdges,
+		optimizeRanksByCrossings: n?.optimizeRanksByCrossings
+	}).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 = Dt(r) ?? [...r.nodes], l = [...c].reverse(), u = /* @__PURE__ */ t((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 = It.GRAVITY_ITERATIONS, f = /* @__PURE__ */ t((e) => {
+		let t = !1;
+		for (let n of e) {
+			let e = o.get(n) ?? [], r = s.get(n) ?? [];
+			if (e.length === 0 && r.length === 0) continue;
+			let a = e.length > 0 ? e.reduce((e, t) => e + (i[t] ?? 0) + 1, 0) / e.length : i[n] ?? 0, c = r.length > 0 ? r.reduce((e, t) => e + (i[t] ?? 0) - 1, 0) / r.length : i[n] ?? 0, l = Math.round((a + c) / 2), d = u(n, l);
+			d !== i[n] && (i[n] = d, t = !0);
+		}
+		return t;
+	}, "relaxOrder");
+	for (let e = 0; e < d; e++) {
+		let e = f(c), t = f(l);
+		if (!e && !t) break;
+	}
+	for (let e of c) {
+		let t = 0;
+		for (let n of o.get(e) ?? []) t = Math.max(t, (i[n] ?? 0) + 1);
+		(i[e] ?? 0) < t && (i[e] = t);
+	}
+	for (let e of l) {
+		let t = s.get(e) ?? [];
+		if (t.length > 0) {
+			let n = Math.min(...t.map((e) => (i[e] ?? 0) - 1));
+			(i[e] ?? 0) > n && (i[e] = n);
+		}
+	}
+	return {
+		layers: Et(r, c, i),
+		rankOf: i,
+		dummy: /* @__PURE__ */ new Set()
+	};
+}
+t(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) {
+			i.push(a);
+			for (let r of n.get(a) ?? []) t.set(r, (t.get(r) ?? 0) - 1), (t.get(r) ?? 0) === 0 && e.push(r);
+		}
+		r = e.sort((e, t) => e.localeCompare(t));
+	}
+	return i.length === e.nodes.length ? i : null;
+}
+t(rn, "topoSortByGenerationIfAcyclic");
+function an(e, n) {
+	let r = yt(e), i = n?.direction === "LR" ? rn(r) ?? [...r.nodes].sort() : Dt(r) ?? [...r.nodes].sort(), a = Mt(r), o = /* @__PURE__ */ t((e) => a(e) ?? e, "laneOf"), s = /* @__PURE__ */ Object.create(null), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ t((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 = 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));
+		}
+		let i = o(e), a = c.get(i) ?? 0, u = Math.max(n, a);
+		s[e] = u, c.set(i, u + 1);
+	}
+	return {
+		layers: Et(r, i, s, { skipGroups: !0 }),
+		rankOf: s,
+		dummy: /* @__PURE__ */ new Set()
+	};
+}
+t(an, "assignLayers_LaneAwareCompact");
+function on(e, n) {
+	let r = yt(n), { rankOf: i } = e, a = e.layers.map((e) => [...e]), o = new Set(e.dummy ? [...e.dummy] : []), s = 0, c = new Map(r.nodeById), l = /* @__PURE__ */ t((e) => {
+		let t = `placeholder-${s++}`, n = {
+			id: t,
+			isGroup: !1,
+			isDummy: !0,
+			width: 0,
+			height: 0
+		};
+		for (c.set(t, n), o.add(t); a.length <= e;) a.push([]);
+		return a[e].push(t), i[t] = e, t;
+	}, "addDummyAt"), u = [...r.edges].sort((e, t) => e.id === t.id ? e.src === t.src ? e.dst.localeCompare(t.dst) : e.src.localeCompare(t.src) : e.id.localeCompare(t.id)), d = [];
+	for (let e of u) {
+		let t = i[e.src] ?? 0, n = i[e.dst] ?? 0;
+		if (n - t <= 1) {
+			d.push(e);
+			continue;
+		}
+		let r = e.src;
+		for (let i = t + 1, a = 0; i < n; i++, a++) {
+			let t = l(i);
+			d.push({
+				id: `${e.id}#${a}`,
+				src: r,
+				dst: t,
+				weight: e.weight,
+				ref: e.ref
+			}), r = t;
+		}
+		let a = n - t - 2;
+		d.push({
+			id: `${e.id}#${Math.max(a + 1, 0)}`,
+			src: r,
+			dst: e.dst,
+			weight: e.weight,
+			ref: e.ref
+		});
+	}
+	let f = {
+		nodes: [...r.nodes, ...[...o].filter((e) => !r.nodes.includes(e))],
+		edges: d,
+		layout: r.layout,
+		nodeById: c
+	};
+	return {
+		layering: {
+			layers: a,
+			rankOf: i,
+			dummy: o
+		},
+		graphWithDummies: f
+	};
+}
+t(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]);
+}
+t(sn, "median");
+function cn(e) {
+	return e.length === 0 ? Infinity : e.reduce((e, t) => e + t, 0) / e.length;
+}
+t(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;
+}
+t(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;
+}
+t(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), kt(s.map((e) => e.v));
+}
+t(dn, "countCrossingsBetweenAdjacent");
+function fn(e, t, n) {
+	return [...e].sort((e, r) => {
+		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;
+	});
+}
+t(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) ?? [];
+		n.push(e), l.set(t, n);
+	}
+	let u = [];
+	for (let e of a) {
+		let t = l.get(e);
+		if (!t || t.length === 0) continue;
+		let n = fn(t, c, s);
+		u.push(...n);
+	}
+	let d = l.get(null);
+	if (d && d.length > 0) {
+		let e = fn(d, c, s);
+		for (let t of e) {
+			let e = cn(c.get(t) ?? []), n = u.length;
+			if (isFinite(e)) {
+				for (let [t, r] of u.entries()) if (e < cn(c.get(r) ?? [])) {
+					n = t;
+					break;
+				}
+			}
+			u.splice(n, 0, t);
+		}
+	}
+	return u;
+}
+t(pn, "reorderLayer");
+function mn(e, n, r, i, a) {
+	let o = [...n], s = new Set(e), 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__ */ t((t) => {
+		let n = dn(e, t, u);
+		return d && i && (n += dn(t, 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);
+	for (; m;) {
+		m = !1;
+		for (let e = 0; e + 1 < o.length; e++) {
+			if (p && p.get(o[e]) !== p.get(o[e + 1])) continue;
+			let t = h;
+			[o[e], o[e + 1]] = [o[e + 1], o[e]];
+			let n = f(o);
+			n < t ? (h = n, m = !0) : [o[e], o[e + 1]] = [o[e + 1], o[e]];
+		}
+	}
+	return o;
+}
+t(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] = 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 };
+}
+t(hn, "orderLayers");
+function gn(e, 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 = e.layers, u = /* @__PURE__ */ Object.create(null), d = /* @__PURE__ */ Object.create(null), f = /* @__PURE__ */ t((e) => n.nodeById.get(e), "getNode"), p = /* @__PURE__ */ t((e) => f(e)?.width ?? 0, "getWidth"), m = /* @__PURE__ */ t((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);
+	}
+	let y = /* @__PURE__ */ new Set();
+	for (let e of l) for (let t of e) y.add(h(t));
+	let b = y.has(null), x = g.filter((e) => y.has(e)), S = [...b ? [null] : [], ...x], C = /* @__PURE__ */ Object.create(null);
+	for (let e of x) C[e] = 0;
+	b && (C.null = 0);
+	for (let e of l) {
+		let t = /* @__PURE__ */ Object.create(null), n = [];
+		for (let r of e) {
+			let e = h(r);
+			e === null ? n.push(r) : (t[e] ||= []).push(r);
+		}
+		for (let [e, n] of Object.entries(t)) {
+			let t = n.reduce((e, t) => e + p(t), 0) + a * Math.max(0, n.length - 1);
+			C[e] = Math.max(C[e] ?? 0, t);
+		}
+		if (b && n.length) {
+			let e = n.reduce((e, t) => e + p(t), 0) + a * Math.max(0, n.length - 1);
+			C.null = Math.max(C.null ?? 0, e);
+		}
+	}
+	let w = /* @__PURE__ */ new Map();
+	{
+		let e = S.map((e) => (e === null ? C.null : C[e]) ?? 0), t = -(e.reduce((e, t) => e + t, 0) + o * Math.max(0, S.length - 1)) / 2;
+		for (let n = 0; n < S.length; n++) {
+			let r = S[n], i = e[n] ?? 0, a = t + i / 2;
+			w.set(r, a), t += i, n < S.length - 1 && (t += o);
+		}
+	}
+	let T = 0;
+	for (let [e, t] of l.entries()) {
+		let n = _[e] ?? 0, r = /* @__PURE__ */ new Map();
+		for (let e of t) {
+			let t = h(e), n = r.get(t) ?? [];
+			n.push(e), r.set(t, n);
+		}
+		for (let e of S) {
+			let t = r.get(e) ?? [];
+			if (t.length === 0) continue;
+			let i = w.get(e);
+			if (t.length === 1) {
+				let e = t[0];
+				u[e] = i, d[e] = T + n / 2;
+			} else {
+				let e = t.map((e) => p(e)), r = i - (e.reduce((e, t) => e + t, 0) + a * (t.length - 1)) / 2;
+				for (let [i, o] of t.entries()) {
+					let t = e[i];
+					u[o] = r + t / 2, d[o] = T + n / 2, r += t + a;
+				}
+			}
+		}
+		let o = v[e] ?? 0;
+		T += n + i + o;
+	}
+	let E = /* @__PURE__ */ new Map();
+	for (let e of n.edges) {
+		let t = e.ref.id;
+		E.has(t) || E.set(t, []), E.get(t).push(e);
+	}
+	for (let [, e] of E) {
+		if (e.length === 0) continue;
+		let t = e[0].ref, r = t.start, i = t.end;
+		if (r == null || i == null) continue;
+		let a = Math.round(((u[r] ?? 0) + (u[i] ?? 0)) / 2), o = /* @__PURE__ */ new Set();
+		for (let t of e) o.add(t.src), o.add(t.dst);
+		for (let e of o) e !== r && e !== i && n.nodeById.get(e)?.isDummy && (u[e] = a);
+	}
+	return {
+		x: u,
+		y: d
+	};
+}
+t(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;
+}
+t(vn, "hashString");
+function yn(e) {
+	let t = e >>> 0;
+	return () => {
+		t += 1831565813;
+		let e = t;
+		return e = Math.imul(e ^ e >>> 15, e | 1), e ^= e + Math.imul(e ^ e >>> 7, e | 61), ((e ^ e >>> 14) >>> 0) / 4294967296;
+	};
+}
+t(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;
+}
+t(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;
+}
+t(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;
+	for (let { a: e, b: i, weight: a } of t) {
+		let t = n.get(e), o = n.get(i);
+		t != null && o != null && (r += a * Math.abs(t - o));
+	}
+	return r;
+}
+t(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 = 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;
+		if (!a || !o || !e.nodeById.has(a) || !e.nodeById.has(o)) continue;
+		let s = r(a), c = r(o);
+		if (!s || !c || s === c) continue;
+		let l = n.get(s), u = n.get(c);
+		if (l == null || u == null) continue;
+		let [d, f] = l <= u ? [s, c] : [c, s], p = `${d}\0${f}`, m = i.get(p);
+		m ? m.weight++ : i.set(p, {
+			a: d,
+			b: f,
+			weight: 1
+		});
+	}
+	return [...i.values()];
+}
+t(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 = 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: xn(r, n)
+	};
+}
+t(wn, "greedySwitch");
+function Tn(e, t) {
+	return e.cost === t.cost ? e.sourceDistance < t.sourceDistance : e.cost < t.cost;
+}
+t(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 vn(`${e.join("|")}#${r}#${n}`);
+}
+t(En, "seedForRestart");
+function Dn(e, t = {}) {
+	let n = Nt(e);
+	if (n.length < 2) return n;
+	let r = Cn(e);
+	if (r.length === 0) return n;
+	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 = wn(bn(n, En(n, r, e)), r, i);
+		Tn(t, a) && (a = t);
+	}
+	return a.order;
+}
+t(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
+	}) : nn(s, {
+		compactSingleInput: t?.compactSingleInput ?? It.DEFAULT_COMPACT_SINGLE_INPUT,
+		ignoreCrossLaneEdges: !1,
+		optimizeRanksByCrossings: r
+	}), s), u = hn(c, l, { laneOrder: a }), d = gn(u, l, {
+		layerGap: t?.layerGap,
+		nodeGap: t?.nodeGap,
+		direction: t?.direction,
+		laneOrder: a
+	});
+	return {
+		acyclic: s,
+		reversed: o.reversed,
+		layering: c,
+		ordered: u,
+		coordinates: d
+	};
+}
+t(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;
+}
+t(Fn, "chooseOrthogonalSide");
+function In(e, t) {
+	return Math.abs(e.to - t.from) < $ || Math.abs(e.to - t.to) < $ ? e.to : e.from;
+}
+t(In, "sharedLineEndpointCoord");
+function Ln(e, t) {
+	return e.orient === "vertical" ? {
+		x: e.coord,
+		y: t
+	} : {
+		x: t,
+		y: e.coord
+	};
+}
+t(Ln, "pointOnLine");
+function Rn(e, n) {
+	let r = e.nodes ?? [], i = e.edges ?? [], a = [];
+	for (let e of i) e.isLayoutOnly || a.push({
+		...e,
+		__originalEdge: e
+	});
+	let o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = [], l = n === "LR";
+	for (let e of r) o.set(e.id, e);
+	let u = r.filter((e) => e.isGroup && !e.parentId);
+	for (let e of u) {
+		let n = { id: e.id }, i = /* @__PURE__ */ t((e) => {
+			s.set(e.id, n), r.filter((t) => t.parentId === e.id).forEach(i);
+		}, "assignLane");
+		i(e);
+	}
+	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 = kn;
+		return {
+			nodeId: e.id,
+			minX: r - t / 2 - a,
+			maxX: r + t / 2 + a,
+			minY: i - n / 2 - a,
+			maxY: i + n / 2 + a,
+			visualXHalfExtent: l ? n / 2 + a : t / 2 + a
+		};
+	}), f = /* @__PURE__ */ t((e, t, n, r) => {
+		let i = c.find((n) => n.orientation === e && Math.abs(n.coord - t) < 1);
+		return i || (i = {
+			id: `pipe-${e}-${t.toFixed(0)}`,
+			orientation: e,
+			coord: t,
+			spanMin: n,
+			spanMax: r,
+			tracks: []
+		}, c.push(i)), i.spanMin = Math.min(i.spanMin, n), i.spanMax = Math.max(i.spanMax, r), i;
+	}, "getOrAddPipe"), p = /* @__PURE__ */ t((e, t) => {
+		let n = e.width ?? 10, r = e.height ?? 10, i = e.x ?? 0, a = e.y ?? 0;
+		switch (t) {
+			case "top": return {
+				x: i,
+				y: a - r / 2
+			};
+			case "bottom": return {
+				x: i,
+				y: a + r / 2
+			};
+			case "left": return {
+				x: i - n / 2,
+				y: a
+			};
+			case "right": return {
+				x: i + n / 2,
+				y: a
+			};
+		}
+	}, "portForSide"), m = /* @__PURE__ */ t((e, t, n) => p(e, Fn(e, t, n ? "bottom" : "top")), "getOrthogonalPort"), h = [], g = [], _ = /* @__PURE__ */ new Set(), v = 1e3, y = /* @__PURE__ */ t((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;
+		let a = 0;
+		if (r) {
+			let r = t.y, i = Math.min(t.x, n.x) - $, o = Math.max(t.x, n.x) + $;
+			if (o <= i) return 0;
+			for (let t of h) t.edgeIndex !== e && t.orientation === "vertical" && (t.pipe.coord < i || t.pipe.coord > o || t.from - $ <= r && t.to + $ >= r && (a += v));
+		} else if (i) {
+			let r = t.x, i = Math.min(t.y, n.y) - $, o = Math.max(t.y, n.y) + $;
+			if (o <= i) return 0;
+			for (let t of h) t.edgeIndex !== e && t.orientation === "horizontal" && (t.pipe.coord < i || t.pipe.coord > o || t.from - $ <= r && t.to + $ >= r && (a += v));
+		}
+		return a;
+	}, "crossingPenalty"), b = a.map((e, t) => {
+		if (!e.start || !e.end) return {
+			idx: t,
+			crossLane: 0,
+			dx: 0,
+			dy: 0
+		};
+		let n = o.get(e.start), r = o.get(e.end), i = s.get(e.start), a = s.get(e.end);
+		return {
+			idx: t,
+			crossLane: i && a && i.id !== a.id ? 1 : 0,
+			dx: n && r ? Math.abs((r.x ?? 0) - (n.x ?? 0)) : 0,
+			dy: n && r ? Math.abs((r.y ?? 0) - (n.y ?? 0)) : 0
+		};
+	}).sort((e, t) => {
+		if (e.crossLane !== t.crossLane) return t.crossLane - e.crossLane;
+		let n = e.dx + e.dy, r = t.dx + t.dy;
+		return Math.abs(n - r) > 1 ? n - r : e.idx - t.idx;
+	}).map((e) => e.idx), x = /* @__PURE__ */ t((e, t, n, r) => {
+		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 !!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__ */ t((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);
+		if (!n || !r) continue;
+		let i = (r.x ?? 0) - (n.x ?? 0), a = (r.y ?? 0) - (n.y ?? 0);
+		T.set(e, {
+			edgeIdx: e,
+			srcId: t.start,
+			dstId: t.end,
+			srcSide: w(n, {
+				x: r.x ?? 0,
+				y: r.y ?? 0
+			}),
+			dstSide: w(r, {
+				x: n.x ?? 0,
+				y: n.y ?? 0
+			}),
+			absDx: Math.abs(i),
+			absDy: Math.abs(a),
+			dxSign: Math.sign(i),
+			dySign: Math.sign(a)
+		});
+	}
+	let E = /* @__PURE__ */ t((e) => e.srcSide === "top" || e.srcSide === "bottom" ? e.absDx === 0 ? Infinity : e.absDy / e.absDx : e.absDy === 0 ? Infinity : e.absDx / e.absDy, "preferenceStrength"), D = /* @__PURE__ */ t((e) => e.srcSide === "top" || e.srcSide === "bottom" ? e.dxSign >= 0 ? "right" : "left" : e.dySign >= 0 ? "bottom" : "top", "secondarySide"), O = /* @__PURE__ */ new Map();
+	for (let e of T.values()) {
+		let t = `${e.srcId}:${e.srcSide}`;
+		O.has(t) || O.set(t, []), O.get(t).push(e);
+	}
+	let k = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ t((e, t) => `${e}:${t}`, "loadKey");
+	for (let e of T.values()) k.set(A(e.srcId, e.srcSide), (k.get(A(e.srcId, e.srcSide)) ?? 0) + 1), k.set(A(e.dstId, e.dstSide), (k.get(A(e.dstId, e.dstSide)) ?? 0) + 1);
+	for (let e of O.values()) if (!(e.length < 2)) {
+		e.sort((e, t) => {
+			let n = E(e), r = E(t);
+			return Math.abs(n - r) > 1e-9 ? r - n : e.edgeIdx - t.edgeIdx;
+		});
+		for (let t = 1; t < e.length; t++) {
+			let n = e[t], r = D(n), i = k.get(A(n.srcId, n.srcSide)) ?? 0, a = k.get(A(n.srcId, r)) ?? 0;
+			a >= i || (k.set(A(n.srcId, n.srcSide), i - 1), k.set(A(n.srcId, r), a + 1), n.srcSide = r);
+		}
+	}
+	let j = /* @__PURE__ */ t((e) => {
+		let t = e?.shape;
+		return t === "question" || t === "diamond";
+	}, "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 = 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;
+		let r = k.get(A(e.srcId, e.srcSide)) ?? 0;
+		k.set(A(e.srcId, e.srcSide), Math.max(0, r - 1)), k.set(A(e.srcId, n), 1), e.srcSide = n;
+	}
+	for (let e of T.values()) {
+		let { edgeIdx: t, srcId: n, dstId: r, srcSide: i, dstSide: a } = e, s = o.get(n), c = o.get(r), l = `${n}:${i}:src`, u = i === "top" || i === "bottom" ? c.x ?? 0 : c.y ?? 0;
+		S.has(l) || S.set(l, []), S.get(l).push({
+			edgeIdx: t,
+			oppositeCoord: u
+		});
+		let d = `${r}:${a}:dst`, f = a === "top" || a === "bottom" ? s.x ?? 0 : s.y ?? 0;
+		S.has(d) || S.set(d, []), S.get(d).push({
+			edgeIdx: t,
+			oppositeCoord: f
+		});
+	}
+	let N = /* @__PURE__ */ new Map();
+	for (let [e, t] of S) {
+		if (t.length < 2) continue;
+		t.sort((e, t) => e.oppositeCoord - t.oppositeCoord);
+		let n = e.split(":"), r = n.slice(0, -2).join(":"), i = n[n.length - 2], a = n[n.length - 1], s = o.get(r);
+		if (!s) continue;
+		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}`;
+			N.set(r, t);
+		}
+	}
+	let P = /* @__PURE__ */ t((e) => !!a[e]?.labelNodeId, "edgeHasLabelNode"), F = /* @__PURE__ */ t((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__ */ t((e, t, n) => t === "top" || t === "bottom" ? {
+		x: e.x + n,
+		y: e.y
+	} : {
+		x: e.x,
+		y: e.y + n
+	}, "applyPortOffset"), ee = /* @__PURE__ */ t((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 = 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,
+			dstSide: s
+		};
+	}, "portsForEdge");
+	for (let e of b) {
+		let n = a[e];
+		if (g[e] = [], !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 } = ee(e, 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 + 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__ */ t((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,
+				obstacle: n
+			};
+			return { inside: !1 };
+		}, "isPointInObstacle"), D = /* @__PURE__ */ t((e, t, n, r, i) => {
+			if (i) {
+				let i = e.y > (t.y ?? 0);
+				return {
+					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 + 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);
+		if (A.inside && A.obstacle) {
+			let e = A.obstacle;
+			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 + Nn) : Math.max(e.maxY + 2, s.y - Nn);
+				O = [
+					{
+						x: s.x,
+						y: n
+					},
+					{
+						x: t.x,
+						y: n
+					},
+					{
+						x: t.x,
+						y: t.y
+					}
+				];
+			} else {
+				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,
+						y: s.y
+					},
+					{
+						x: n,
+						y: t.y
+					},
+					{
+						x: t.x,
+						y: t.y
+					}
+				];
+			}
+		}
+		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 = [{
+					x: t.x,
+					y: t.y
+				}, {
+					x: u.x,
+					y: t.y
+				}];
+			} else {
+				let t = D(u, i, r, e, !1);
+				b.x = t.x, b.y = t.y, j = [{
+					x: t.x,
+					y: t.y
+				}, {
+					x: t.x,
+					y: u.y
+				}];
+			}
+		}
+		if (O.length === 0 && j.length === 0) {
+			let t = An, r = Math.abs(v.x - b.x) < t, i = Math.abs(v.y - b.y) < t, a = N.get(`${e}:src`) !== void 0 || N.get(`${e}: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 },
+					{ ...v },
+					{ ...b },
+					{ ...u }
+				], _.add(e);
+				let t = i ? "horizontal" : "vertical", r = i ? s.y : s.x, a = i ? Math.min(s.x, u.x) : Math.min(s.y, u.y), o = i ? Math.max(s.x, u.x) : Math.max(s.y, u.y), c = {
+					id: `fast-path-${t}-${r.toFixed(0)}-${e}`,
+					orientation: t,
+					coord: r,
+					spanMin: a,
+					spanMax: o,
+					tracks: []
+				};
+				h.push({
+					edgeIndex: e,
+					segmentIndex: 0,
+					orientation: t,
+					pipe: c,
+					trackIndex: 0,
+					from: a,
+					to: o
+				});
+				continue;
+			}
+		}
+		v.x = f("vertical", v.x, v.y, v.y).coord, b.x = f("vertical", b.x, b.y, b.y).coord;
+		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 - 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 = An;
+			f("horizontal", e.minY - t, P, I), f("horizontal", e.maxY + t, P, I);
+			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);
+		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__ */ t((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
+		}), oe.add(B);
+		let U = [], W = /* @__PURE__ */ t((e, t) => x(e, t, n.start, n.end), "checkSegmentBlocked"), G = {
+			x: b.x,
+			y: v.y
+		}, K = W(v, G), se = W(G, b), ce = K || se, le = {
+			x: v.x,
+			y: b.y
+		}, ue = W(v, le), de = W(le, b);
+		if (ce ? ue || de || (U = Math.abs(v.x - b.x) < $ ? [v, b] : [
+			v,
+			le,
+			b
+		]) : U = Math.abs(v.y - b.y) < $ || Math.abs(v.x - b.x) < $ ? [v, b] : [
+			v,
+			G,
+			b
+		], U.length === 0) for (; H.length > 0;) {
+			H.sort((e, t) => e.f - t.f);
+			let t = H.shift();
+			if (oe.delete(t.key), t.key === re) {
+				let e = re, t = b;
+				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 = t.pt.x, i = t.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
+			}), o >= 0 && o < a.length - 1 && l.push({
+				x: a[o + 1].coord,
+				y: i
+			}), c > 0 && l.push({
+				x: r,
+				y: s[c - 1].coord
+			}), c >= 0 && c < s.length - 1 && l.push({
+				x: r,
+				y: s[c + 1].coord
+			});
+			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 = ne(a.x, a.y), f = Math.abs(a.x - r) + Math.abs(a.y - i), p = y(e, t.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 = V.get(t.key) ?? "n", w = Math.abs(_) > $ ? "h" : "v";
+				C !== "n" && C !== w && (S = 50);
+				let T = f + p + m + S, E = (ie.get(t.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, t.pt), ie.set(u, E), V.set(u, w), !oe.has(u)) H.push({
+						key: u,
+						f: E + D,
+						pt: a
+					}), oe.add(u);
+					else {
+						let e = H.findIndex((e) => e.key === u);
+						e !== -1 && (H[e].f = E + D);
+					}
+				}
+			}
+		}
+		if (U.length === 0 && (U = [
+			v,
+			{
+				x: v.x,
+				y: b.y
+			},
+			b
+		]), U.length > 4) {
+			let e = U[0], n = U[U.length - 1], r = Math.min(e.x, n.x), i = Math.max(e.x, n.x), a = Math.min(e.y, n.y), o = Math.max(e.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(e.x, n.x), c = r < Math.min(e.x, n.x);
+			if (l) {
+				let t = jn;
+				if (s) {
+					let r = Math.max(e.x, n.x), a = Math.min(e.y, n.y), o = Math.max(e.y, n.y), s = d.filter((e) => e.minX < r && e.maxX > r && e.minY < o && e.maxY > a);
+					if (s.length > 0) {
+						let r = Math.max(e.x, n.x);
+						for (let e of s) {
+							let n = (e.minX + e.maxX) / 2;
+							if (e.visualXHalfExtent === void 0 || isNaN(e.visualXHalfExtent)) continue;
+							let i = n + e.visualXHalfExtent + t;
+							r = Math.max(r, i);
+						}
+						isNaN(r) || (i = r);
+					}
+				}
+				if (c) {
+					let i = d.filter((r) => r.minX < Math.min(e.x, n.x) + t && r.minY < Math.max(e.y, n.y) && r.maxY > Math.min(e.y, n.y));
+					if (i.length > 0) {
+						let a = Math.min(e.x, n.x);
+						for (let e of i) {
+							let n = (e.minX + e.maxX) / 2 - e.visualXHalfExtent - t;
+							a = Math.min(a, n);
+						}
+						r = a;
+					}
+				}
+			}
+			let u = /* @__PURE__ */ t((t) => {
+				let r = n.y > e.y, i = d.filter((t) => {
+					let r = Math.min(e.x, n.x) < t.maxX && Math.max(e.x, n.x) > t.minX, i = Math.min(e.y, n.y) < t.maxY && Math.max(e.y, n.y) > t.minY;
+					return r && i;
+				}), a = i;
+				if (l && i.length > 0) {
+					let e = i.filter((e) => e.minX < t && e.maxX > t);
+					e.length > 0 && (a = e);
+				}
+				if (a.length === 0) return n.y;
+				let o = An;
+				if (r) {
+					let e = Math.max(...a.map((e) => e.maxY)) + o;
+					if (e < n.y - $) return e;
+				} else {
+					let e = Math.min(...a.map((e) => e.minY)) - o;
+					if (e > n.y + $) return e;
+				}
+				return n.y;
+			}, "findBestReturnY"), f = /* @__PURE__ */ t((t) => {
+				let r = u(t), i = {
+					x: t,
+					y: e.y
+				}, a = {
+					x: t,
+					y: r
+				}, o = {
+					x: n.x,
+					y: r
+				}, s = W(e, 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) < $ ? [
+					e,
+					i,
+					a,
+					n
+				] : [
+					e,
+					i,
+					a,
+					o,
+					n
+				] : null;
+			}, "trySimplifyWithDetourX"), p = s && !c ? f(i) : c && !s ? f(r) : null;
+			p && (U = p);
+		}
+		let q = [
+			s,
+			...O,
+			...U,
+			...j.reverse(),
+			u
+		];
+		if (q.length >= 3) {
+			let e = q[q.length - 1], t = q[q.length - 2], n = q[q.length - 3], r = Math.abs(n.y - t.y) < $ && Math.abs(t.y - e.y) < $, i = Math.abs(n.x - t.x) < $ && Math.abs(t.x - e.x) < $;
+			if (r) {
+				let r = Math.sign(t.x - n.x), i = Math.sign(e.x - n.x);
+				r !== 0 && r === i && Math.abs(t.x - n.x) > Math.abs(e.x - n.x) && q.splice(-2, 1);
+			} else if (i) {
+				let r = Math.sign(t.y - n.y), i = Math.sign(e.y - n.y);
+				r !== 0 && r === i && Math.abs(t.y - n.y) > Math.abs(e.y - n.y) && q.splice(-2, 1);
+			}
+		}
+		let J = [q[0]];
+		for (let e = 1; e < q.length - 1; e++) {
+			if (e === 1) {
+				J.push(q[e]);
+				continue;
+			}
+			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) {
+					J.push(n);
+					continue;
+				}
+			} else if (Math.abs(t.x - n.x) < $ && Math.abs(n.x - r.x) < $) {
+				if (n.y > t.y != r.y > n.y) {
+					J.push(n);
+					continue;
+				}
+			} else J.push(n);
+		}
+		J.push(q[q.length - 1]);
+		for (let t = 0; t < J.length - 1; t++) {
+			let n = J[t], r = J[t + 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: e,
+				segmentIndex: t,
+				orientation: i,
+				pipe: c,
+				trackIndex: 0,
+				from: o,
+				to: s
+			};
+			h.push(l), g[e].push(h.length - 1), c.tracks[0] || (c.tracks[0] = {
+				index: 0,
+				coord: c.coord,
+				segments: []
+			}), c.tracks[0].segments.push({
+				edgeIndex: e,
+				segmentIndex: t,
+				from: o,
+				to: s
+			});
+		}
+	}
+	let L = /* @__PURE__ */ t((e, t) => e.from < t.to && t.from < e.to, "segmentsOverlap"), R = /* @__PURE__ */ t((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,
+			from: t.from,
+			to: t.to
+		}], r.segments = [...r.segments.filter((e) => e.edgeIndex !== t.edgeIndex || e.segmentIndex !== t.segmentIndex), {
+			edgeIndex: e.edgeIndex,
+			segmentIndex: e.segmentIndex,
+			from: e.from,
+			to: e.to
+		}], !0) : !1;
+	}, "trySwapSegmentsAcrossTracks"), z = /* @__PURE__ */ t((e) => {
+		let t = e.tracks.length;
+		return e.tracks[t] = {
+			index: t,
+			coord: e.coord,
+			segments: []
+		}, t;
+	}, "createNewTrack"), te = /* @__PURE__ */ t((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,
+			segmentIndex: e.segmentIndex,
+			from: e.from,
+			to: e.to
+		});
+	}, "moveSegmentToTrack"), ne = /* @__PURE__ */ t((e, t) => {
+		let n = g[e.edgeIndex];
+		for (let r of n) {
+			let n = h[r];
+			n.pipe === e.pipe && te(n, t);
+		}
+	}, "moveSegmentChainToTrack"), B = /* @__PURE__ */ t((e) => {
+		let t = g[e.edgeIndex], n = t.indexOf(h.indexOf(e)), r = [];
+		return n > 0 && r.push(h[t[n - 1]]), n < t.length - 1 && r.push(h[t[n + 1]]), r;
+	}, "getAdjacentSegmentsAlongEdge"), re = /* @__PURE__ */ t((e, t) => {
+		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"), ie = /* @__PURE__ */ t((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"), ae = /* @__PURE__ */ t((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"), V = /* @__PURE__ */ t((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__ */ t((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 && ae(i, a) && (t++, V(i, a, ne));
+		}
+		return t;
+	}, "resolveHandleConflicts"), H = /* @__PURE__ */ new Map(), U = /* @__PURE__ */ t((e) => {
+		if (H.has(e)) return H.get(e);
+		let t = g[e];
+		if (t.length === 0) {
+			let t = {
+				dest: 0,
+				deviation: 0,
+				base: 0,
+				delta: 0
+			};
+			return H.set(e, t), t;
+		}
+		let n = h[t[0]].pipe.coord, r = n;
+		for (let e = 1; e < t.length; e++) {
+			let i = h[t[e]];
+			if (i.orientation === "horizontal") {
+				let e = i.from, t = i.to;
+				r = Math.abs(e - n) > Math.abs(t - n) ? e : t;
+				break;
+			}
+		}
+		let i = Math.abs(r - n), a = {
+			dest: r,
+			deviation: i,
+			base: n,
+			delta: r - n
+		};
+		return H.set(e, a), a;
+	}, "getDestInfo"), W = /* @__PURE__ */ t(() => {
+		let e = 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__ */ t((e) => {
+			let t = a[e];
+			if (!t.start || !t.end) return 0;
+			let n = o.get(t.start), r = o.get(t.end);
+			if (!n || !r) return 0;
+			let i = (r.x ?? 0) - (n.x ?? 0), s = (r.y ?? 0) - (n.y ?? 0);
+			return Math.abs(i) + Math.abs(s);
+		}, "getEdgeDistance");
+		for (let t of n.values()) {
+			t.sort((e, 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);
+				if (Math.abs(a - o) > 1) return o - a;
+				let s = g[e].length, c = g[t].length;
+				if (s !== c) return s - c;
+				if (s === 1) {
+					let n = g[e][0], r = g[t][0];
+					if (h[n] && h[r]) {
+						let e = h[n], t = h[r], i = Math.abs(e.to - e.from), a = Math.abs(t.to - t.from);
+						if (Math.abs(i - a) > 1) return i - a;
+					}
+				}
+				return 0;
+			});
+			let n = t.map((e) => h[g[e][0]]);
+			e += oe(n);
+		}
+		return e;
+	}, "fixSourceHandleCrossings"), G = /* @__PURE__ */ t(() => {
+		let e = 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()) {
+			r.sort((e, n) => {
+				let r = /* @__PURE__ */ t((e) => {
+					let t = g[e];
+					if (t.length < 2) return 0;
+					let n = h[t[t.length - 2]];
+					return Math.abs(n.to - n.from);
+				}, "getDist"), i = r(e), a = r(n);
+				return Math.abs(i - a) > .1 ? i - a : e - n;
+			});
+			let n = r.map((e) => h[g[e][g[e].length - 1]]);
+			e += oe(n);
+		}
+		return e;
+	}, "fixTargetHandleCrossings"), K = /* @__PURE__ */ t(() => {
+		let e = 0;
+		for (let t of c) {
+			let n = [];
+			for (let e of t.tracks) for (let t of e.segments) {
+				let e = g[t.edgeIndex].find((e) => h[e].segmentIndex === t.segmentIndex);
+				e !== void 0 && n.push(h[e]);
+			}
+			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];
+				ae(i, a) && (e++, V(i, a, te));
+			}
+		}
+		return e;
+	}, "fixPipeCrossings"), se = 0;
+	for (; se < 10;) {
+		let e = 0;
+		if (e += W(), e += G(), e += K(), e === 0) break;
+		se++;
+	}
+	let ce = /* @__PURE__ */ new Map();
+	for (let e of c) {
+		let n = [];
+		e.tracks.forEach((e) => {
+			e.segments.forEach((t) => {
+				n.push({
+					edgeIndex: t.edgeIndex,
+					segmentIndex: t.segmentIndex,
+					trackIndex: e.index,
+					from: t.from,
+					to: t.to
+				});
+			});
+		}), n.sort((e, t) => e.from - t.from);
+		let r = [];
+		if (n.length > 0) {
+			let e = [n[0]], t = n[0].to;
+			for (let i = 1; i < n.length; i++) {
+				let a = n[i];
+				a.from < t ? (e.push(a), t = Math.max(t, a.to)) : (r.push(e), e = [a], t = a.to);
+			}
+			r.push(e);
+		}
+		for (let n of r) {
+			let r = /* @__PURE__ */ new Set();
+			n.forEach((e) => r.add(e.trackIndex));
+			let i = /* @__PURE__ */ new Map();
+			n.forEach((e) => {
+				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);
+			a.sort((e, t) => (i.get(t) ?? 0) - (i.get(e) ?? 0)), o.sort((e, t) => (i.get(e) ?? 0) - (i.get(t) ?? 0));
+			let c = /* @__PURE__ */ t((t, r) => {
+				n.filter((e) => e.trackIndex === t).forEach((t) => {
+					let n = _.has(t.edgeIndex) ? e.coord : r;
+					ce.set(`${t.edgeIndex}-${t.segmentIndex}`, n);
+				});
+			}, "assignCoord"), l = 0;
+			for (let t of a) l++, c(t, e.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);
+				let n = o.indexOf(e);
+				n !== -1 && o.splice(n, 1), s.push(e);
+			}
+			let u = 0;
+			for (let t of s) {
+				if (u === 0) c(t, e.coord);
+				else {
+					let n = u % 2 == 1 ? 1 : -1, r = Math.ceil(u / 2);
+					c(t, e.coord + n * r * Pn * .5);
+				}
+				u++;
+			}
+			let d = 0;
+			for (let t of o) d++, c(t, e.coord + d * Pn);
+		}
+	}
+	for (let [e, t] of a.entries()) {
+		let n = g[e] ?? [];
+		if (n.length === 0) continue;
+		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,
+				coord: n,
+				from: t.from,
+				to: t.to
+			};
+		});
+		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(Ln(t, i)), c && o.orient === t.orient) {
+				if (Math.abs(t.coord - 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(Ln(t, e));
+			}
+		}
+		let c = r[r.length - 1];
+		(Math.abs(c.x - a.x) > $ || Math.abs(c.y - a.y) > $) && r.push(a);
+		let l = [];
+		r.length > 0 && l.push(r[0]);
+		for (let e = 1; e < r.length; e++) {
+			let t = r[e], n = l[l.length - 1];
+			(Math.abs(t.x - n.x) > $ || Math.abs(t.y - n.y) > $) && l.push(t);
+		}
+		t.points = l;
+	}
+	for (let e of a) {
+		let t = e.__originalEdge;
+		t && e.points && (t.points = e.points);
+	}
+	e.edges = (e.edges ?? []).filter((e) => !e.isLayoutOnly);
+	let le = /* @__PURE__ */ t((e, t) => {
+		let n = t.x ?? 0, r = t.y ?? 0, i = t.width ?? 0, a = t.height ?? 0;
+		if (i <= 0 || a <= 0) return e;
+		let o = n - i / 2, s = n + i / 2, c = r - a / 2, l = r + a / 2;
+		if (e.x < o || e.x > s || e.y < c || e.y > l) return e;
+		let u = e.x - o, d = s - e.x, f = e.y - c, p = l - e.y, m = Math.min(u, d, f, p);
+		return m === u ? {
+			x: o,
+			y: e.y
+		} : m === d ? {
+			x: s,
+			y: e.y
+		} : m === f ? {
+			x: e.x,
+			y: c
+		} : {
+			x: e.x,
+			y: l
+		};
+	}, "nodeBoundaryClamp");
+	for (let t of e.edges) {
+		let e = t.points;
+		if (!e || e.length < 2) continue;
+		let n = t.start, r = t.end, i = n ? o.get(n) : void 0, a = r ? o.get(r) : void 0;
+		i && (e[0] = le(e[0], i)), a && (e[e.length - 1] = le(e[e.length - 1], a));
+	}
+	return e;
+}
+t(Rn, "routeEdgesOrthogonal");
+function zn(e) {
+	return e.direction ?? "TB";
+}
+t(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,
+		optimizeRanksByCrossings: a,
+		automaticLaneOrdering: o,
+		direction: s
+	});
+	f(t, c, l, {
+		nodeGap: n,
+		layerGap: r
+	});
+	for (let t of e.edges ?? []) delete t.points;
+	Rn(e, s);
+	for (let t of e.edges ?? []) (!t.curve || t.curve === "basis") && (t.curve = "rounded");
+	return vt(e, s), _t(e), s;
+}
+t(Bn, "runSwimlaneLayoutCore");
+function Vn(e) {
+	u(e);
+	let t = m(e);
+	e.nodes = t.nodes, e.edges = t.edges;
+}
+t(Vn, "prepareSwimlaneLayout");
+var Hn = n({
+	prepareLayout: Vn,
+	runLayoutCore: Bn,
+	afterPaint: i
+});
+//#endregion
+export { Hn as render };