@diagrammo/dgmo 0.47.0 → 0.48.1

package/src/boxes-and-lines/layout-search.ts

@@ -1,1678 +0,0 @@
-// ============================================================
-// Boxes and Lines — experimental "search" layout (behind a flag)
-// ============================================================
-//
-// dagre placement + spline routing, with a multi-seed search over node
-// orderings, scored on the actual spline geometry (curveBasis, sampled
-// headlessly — no DOM) plus an optional stability term (drift from the
-// previous layout). Picks the lowest combined-score ordering.
-//
-// Rationale: dagre placement reads better than orthogonal routing; crossings
-// come from within-layer ordering, so we search orderings rather than reroute.
-// Sync (dagre) — no ELK, no async.
-
-import dagre from '@dagrejs/dagre';
-import { line as d3line, curveBasis } from 'd3-shape';
-import type { ParsedBoxesAndLines, BLGroup } from './types';
-import {
-  computeNodeSize,
-  NODE_WIDTH,
-  NODE_HEIGHT,
-  type BLLayoutResult,
-  type BLLayoutEdge,
-} from './layout';
-import { layeredCandidates } from './layout-layered';
-import { groupedTierCandidates } from './layout-grouped';
-import { measureEdgeLabel, EDGE_LABEL_FONT_SIZE } from './label-placement';
-
-type Pt = { x: number; y: number };
-
-// Default stability weight: combined = crossings + lambda · (meanDriftPx / 100).
-// Only applies when previousPositions is supplied (re-layout on edit/collapse).
-const DEFAULT_LAMBDA = 4;
-
-// Adaptive escalation thresholds (see layoutBoxesAndLinesSearch). Only graphs
-// whose base-budget badness is at least ESCALATE_THRESHOLD spend an extra seed
-// batch; ESCALATE_MAX_N bounds it so huge graphs don't blow the time budget.
-const ESCALATE_THRESHOLD = 4;
-const ESCALATE_MAX_N = 45;
-const ESCALATE_SEEDS = 18;
-const ESCALATE_REFINE = 10;
-
-function rng(s: number) {
-  return () => {
-    s |= 0;
-    s = (s + 0x6d2b79f5) | 0;
-    let t = Math.imul(s ^ (s >>> 15), 1 | s);
-    t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
-    return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
-  };
-}
-function shuffle<T>(a: readonly T[], r: () => number): T[] {
-  const x = a.slice();
-  for (let i = x.length - 1; i > 0; i--) {
-    const j = Math.floor(r() * (i + 1));
-    [x[i], x[j]] = [x[j]!, x[i]!];
-  }
-  return x;
-}
-
-const splineGen = d3line<Pt>()
-  .x((d) => d.x)
-  .y((d) => d.y)
-  .curve(curveBasis);
-
-// Path tokenizer for `flatten` — module-scope so it isn't recompiled per call.
-// String.match with a /g regex is stateless (ignores lastIndex), so a shared
-// instance is safe to reuse.
-const PATH_TOKEN_RE = /[MLQC]|-?\d*\.?\d+(?:e-?\d+)?/gi;
-// flatten an SVG path "d" (M/L/Q/C) into a polyline for crossing detection
-function flatten(d: string): Pt[] {
-  const toks = d.match(PATH_TOKEN_RE) ?? [];
-  const pts: Pt[] = [];
-  let i = 0,
-    cx = 0,
-    cy = 0,
-    cmd = '';
-  const num = () => parseFloat(toks[i++]!);
-  const samp = (p0: Pt, c1: Pt, c2: Pt | null, p1: Pt) => {
-    for (let t = 0; t <= 1; t += 0.12) {
-      const u = 1 - t;
-      if (c2)
-        pts.push({
-          x:
-            u * u * u * p0.x +
-            3 * u * u * t * c1.x +
-            3 * u * t * t * c2.x +
-            t * t * t * p1.x,
-          y:
-            u * u * u * p0.y +
-            3 * u * u * t * c1.y +
-            3 * u * t * t * c2.y +
-            t * t * t * p1.y,
-        });
-      else
-        pts.push({
-          x: u * u * p0.x + 2 * u * t * c1.x + t * t * p1.x,
-          y: u * u * p0.y + 2 * u * t * c1.y + t * t * p1.y,
-        });
-    }
-  };
-  while (i < toks.length) {
-    const tk = toks[i]!;
-    if (/[MLQC]/i.test(tk)) {
-      cmd = tk;
-      i++;
-    }
-    if (cmd === 'M' || cmd === 'L') {
-      const x = num(),
-        y = num();
-      pts.push({ x, y });
-      cx = x;
-      cy = y;
-    } else if (cmd === 'Q') {
-      const c1 = { x: num(), y: num() },
-        p1 = { x: num(), y: num() };
-      samp({ x: cx, y: cy }, c1, null, p1);
-      cx = p1.x;
-      cy = p1.y;
-    } else if (cmd === 'C') {
-      const c1 = { x: num(), y: num() },
-        c2 = { x: num(), y: num() },
-        p1 = { x: num(), y: num() };
-      samp({ x: cx, y: cy }, c1, c2, p1);
-      cx = p1.x;
-      cy = p1.y;
-    } else i++;
-  }
-  return pts;
-}
-// Flattened edge polyline + its bbox. Building it requires an SVG-string
-// round-trip (d3 spline → regex parse), so it's memoized per layout: every
-// candidate is scored by countSplineCrossings + countEdgeOverlaps +
-// countEdgeNodePierces, which would otherwise each re-flatten all edges.
-type FlatPoly = { pts: Pt[]; x0: number; y0: number; x1: number; y1: number };
-const FLAT_CACHE = new WeakMap<object, FlatPoly[]>();
-function flatPolys(layout: BLLayoutResult): FlatPoly[] {
-  const key = layout.edges as unknown as object;
-  const hit = FLAT_CACHE.get(key);
-  if (hit) return hit;
-  const polys = layout.edges.map((e) => {
-    const pts =
-      e.points.length >= 2 ? flatten(splineGen(e.points as Pt[]) ?? '') : [];
-    let x0 = Infinity,
-      y0 = Infinity,
-      x1 = -Infinity,
-      y1 = -Infinity;
-    for (const p of pts) {
-      if (p.x < x0) x0 = p.x;
-      if (p.x > x1) x1 = p.x;
-      if (p.y < y0) y0 = p.y;
-      if (p.y > y1) y1 = p.y;
-    }
-    return { pts, x0, y0, x1, y1 };
-  });
-  FLAT_CACHE.set(key, polys);
-  return polys;
-}
-function segPoint(p1: Pt, p2: Pt, p3: Pt, p4: Pt): Pt | null {
-  const den = (p2.x - p1.x) * (p4.y - p3.y) - (p2.y - p1.y) * (p4.x - p3.x);
-  if (Math.abs(den) < 1e-9) return null;
-  const t =
-      ((p3.x - p1.x) * (p4.y - p3.y) - (p3.y - p1.y) * (p4.x - p3.x)) / den,
-    u = ((p3.x - p1.x) * (p2.y - p1.y) - (p3.y - p1.y) * (p2.x - p1.x)) / den;
-  return t > 0 && t < 1 && u > 0 && u < 1
-    ? { x: p1.x + t * (p2.x - p1.x), y: p1.y + t * (p2.y - p1.y) }
-    : null;
-}
-
-// trustworthy crossing count on the spline geometry: exclude intersections
-// near a genuinely shared endpoint node; cluster near-duplicate hits.
-// Exported so the playground + benchmark score with the SAME counter the
-// engine optimizes against.
-export function countSplineCrossings(
-  layout: BLLayoutResult,
-  /** Abort early once the running total exceeds this (the caller only needs to
-   *  know X has passed the best-so-far badness — the exact value no longer
-   *  matters). Returns a value > floor in that case; identical otherwise. */
-  floor = Infinity
-): number {
-  const center = new Map<string, Pt>();
-  for (const n of layout.nodes) center.set(n.label, { x: n.x, y: n.y });
-  // collapsed group boxes are edge endpoints too (`__group_<label>`); without
-  // them, edges meeting AT a collapsed box are miscounted as crossings.
-  for (const g of layout.groups)
-    if (g.collapsed) center.set('__group_' + g.label, { x: g.x, y: g.y });
-  const polys = flatPolys(layout);
-  const edges = layout.edges;
-  const R = 34;
-  let total = 0;
-  for (let a = 0; a < polys.length; a++)
-    for (let b = a + 1; b < polys.length; b++) {
-      const A = polys[a]!,
-        B = polys[b]!;
-      if (A.pts.length < 2 || B.pts.length < 2) continue;
-      if (A.x1 < B.x0 || B.x1 < A.x0 || A.y1 < B.y0 || B.y1 < A.y0) continue; // bbox disjoint
-      const ea = edges[a]!,
-        eb = edges[b]!;
-      // Shared-endpoint centres (≤2) — inlined to avoid allocating a filter/map
-      // array on every one of the O(E²) edge pairs.
-      let sh0: Pt | undefined, sh1: Pt | undefined;
-      if (ea.source === eb.source || ea.source === eb.target)
-        sh0 = center.get(ea.source);
-      if (ea.target === eb.source || ea.target === eb.target)
-        sh1 = center.get(ea.target);
-      const hits: Pt[] = [];
-      const ap = A.pts,
-        bp = B.pts;
-      for (let i = 1; i < ap.length; i++) {
-        const a0 = ap[i - 1]!,
-          a1 = ap[i]!;
-        const axMin = a0.x < a1.x ? a0.x : a1.x,
-          axMax = a0.x > a1.x ? a0.x : a1.x,
-          ayMin = a0.y < a1.y ? a0.y : a1.y,
-          ayMax = a0.y > a1.y ? a0.y : a1.y;
-        for (let j = 1; j < bp.length; j++) {
-          const b0 = bp[j - 1]!,
-            b1 = bp[j]!;
-          // per-segment bbox reject — disjoint segments can't cross
-          if (axMax < (b0.x < b1.x ? b0.x : b1.x)) continue;
-          if ((b0.x > b1.x ? b0.x : b1.x) < axMin) continue;
-          if (ayMax < (b0.y < b1.y ? b0.y : b1.y)) continue;
-          if ((b0.y > b1.y ? b0.y : b1.y) < ayMin) continue;
-          const p = segPoint(a0, a1, b0, b1);
-          if (!p) continue;
-          if (sh0 && Math.hypot(p.x - sh0.x, p.y - sh0.y) < R) continue;
-          if (sh1 && Math.hypot(p.x - sh1.x, p.y - sh1.y) < R) continue;
-          if (!hits.some((h) => Math.hypot(h.x - p.x, h.y - p.y) < 6))
-            hits.push(p);
-        }
-      }
-      total += hits.length;
-      if (total > floor) return total; // can't win — stop counting
-    }
-  return total;
-}
-
-// distance from point p to segment a–b
-function pointSegDist(p: Pt, a: Pt, b: Pt): number {
-  const dx = b.x - a.x,
-    dy = b.y - a.y;
-  const len2 = dx * dx + dy * dy;
-  if (len2 < 1e-9) return Math.hypot(p.x - a.x, p.y - a.y);
-  let t = ((p.x - a.x) * dx + (p.y - a.y) * dy) / len2;
-  t = Math.max(0, Math.min(1, t));
-  return Math.hypot(p.x - (a.x + t * dx), p.y - (a.y + t * dy));
-}
-function distToPoly(p: Pt, poly: readonly Pt[]): number {
-  let m = Infinity;
-  for (let i = 1; i < poly.length; i++)
-    m = Math.min(m, pointSegDist(p, poly[i - 1]!, poly[i]!));
-  return m;
-}
-type Rect = { x: number; y: number; w: number; h: number };
-// distance from point p to an axis-aligned rectangle (0 if inside)
-function pointRectDist(p: Pt, r: Rect): number {
-  const dx = Math.max(r.x - r.w / 2 - p.x, 0, p.x - (r.x + r.w / 2));
-  const dy = Math.max(r.y - r.h / 2 - p.y, 0, p.y - (r.y + r.h / 2));
-  return Math.hypot(dx, dy);
-}
-
-/** A stretch where one edge runs ALONG another (within `dist`, for at least
- *  `minLen` of length) — i.e. two lines "stepping on" each other. Distinct from
- *  a true X-crossing (which is a momentary touch, not a sustained run). */
-export interface OverlapRun {
-  mid: Pt;
-  length: number;
-  pts: Pt[];
-}
-
-/**
- * Detect edge-overlap runs on the rendered spline geometry. Two edges sharing
- * an endpoint legitimately CONVERGE at that node's port — runs within `nodeClear`
- * of a shared node centre are excluded; only overlap along the open path counts.
- */
-export function detectEdgeOverlaps(
-  layout: BLLayoutResult,
-  opts?: { dist?: number; minLen?: number; nodeClear?: number }
-): OverlapRun[] {
-  const dist = opts?.dist ?? 8;
-  const minLen = opts?.minLen ?? 16;
-  // Margin BEYOND the shared node's box that still counts as "converging to the
-  // port" (excluded). Edges legitimately meet at a node — only overlap out in
-  // the open, away from any shared node, is a real "stepping on another line".
-  const nodeClear = opts?.nodeClear ?? 12;
-
-  const rect = new Map<string, Rect>();
-  for (const n of layout.nodes)
-    rect.set(n.label, { x: n.x, y: n.y, w: n.width, h: n.height });
-  for (const g of layout.groups)
-    if (g.collapsed)
-      rect.set('__group_' + g.label, {
-        x: g.x,
-        y: g.y,
-        w: g.width,
-        h: g.height,
-      });
-
-  const polys = flatPolys(layout);
-  const edges = layout.edges;
-
-  const runs: OverlapRun[] = [];
-  for (let a = 0; a < polys.length; a++)
-    for (let b = a + 1; b < polys.length; b++) {
-      const A = polys[a]!,
-        B = polys[b]!;
-      if (A.pts.length < 2 || B.pts.length < 2) continue;
-      if (
-        A.x1 + dist < B.x0 ||
-        B.x1 + dist < A.x0 ||
-        A.y1 + dist < B.y0 ||
-        B.y1 + dist < A.y0
-      )
-        continue;
-      const ea = edges[a]!,
-        eb = edges[b]!;
-      // Shared-endpoint rects (≤2) — inlined to avoid a per-pair filter/map array.
-      let shr0: Rect | undefined, shr1: Rect | undefined;
-      if (ea.source === eb.source || ea.source === eb.target)
-        shr0 = rect.get(ea.source);
-      if (ea.target === eb.source || ea.target === eb.target)
-        shr1 = rect.get(ea.target);
-      // Walk A; accumulate contiguous "covered" runs (close to B, off any shared
-      // node). A run counts once if it reaches minLen.
-      let run: Pt[] = [];
-      let runLen = 0;
-      const flush = (): void => {
-        if (runLen >= minLen && run.length >= 2)
-          runs.push({
-            mid: run[Math.floor(run.length / 2)]!,
-            length: runLen,
-            pts: run.slice(),
-          });
-        run = [];
-        runLen = 0;
-      };
-      for (const p of A.pts) {
-        const nearShared =
-          (shr0 !== undefined && pointRectDist(p, shr0) < nodeClear) ||
-          (shr1 !== undefined && pointRectDist(p, shr1) < nodeClear);
-        const covered = !nearShared && distToPoly(p, B.pts) < dist;
-        if (covered) {
-          if (run.length)
-            runLen += Math.hypot(
-              p.x - run[run.length - 1]!.x,
-              p.y - run[run.length - 1]!.y
-            );
-          run.push(p);
-        } else flush();
-      }
-      flush();
-    }
-  return runs;
-}
-
-/** Count of edge-overlap runs — the "stepping on another line" metric. */
-export function countEdgeOverlaps(
-  layout: BLLayoutResult,
-  opts?: { dist?: number; minLen?: number; nodeClear?: number }
-): number {
-  return detectEdgeOverlaps(layout, opts).length;
-}
-
-/** An edge routing THROUGH a node box it doesn't connect to. Counts as a
- *  crossing — the line is where it shouldn't be. */
-export interface NodePierce {
-  edgeIdx: number;
-  node: string;
-  pts: Pt[];
-}
-
-/**
- * Detect edges that pass through (substantially inside, by `inset`) the box of a
- * node that is NOT one of their endpoints. Endpoints — including collapsed group
- * boxes (`__group_<label>`) — are excluded; an edge legitimately meets those.
- */
-export function detectEdgeNodePierces(
-  layout: BLLayoutResult,
-  opts?: { inset?: number; minPts?: number }
-): NodePierce[] {
-  const inset = opts?.inset ?? 6;
-  const minPts = opts?.minPts ?? 2;
-  const rects: (Rect & { key: string })[] = [];
-  for (const n of layout.nodes)
-    rects.push({ key: n.label, x: n.x, y: n.y, w: n.width, h: n.height });
-  for (const g of layout.groups)
-    if (g.collapsed)
-      rects.push({
-        key: '__group_' + g.label,
-        x: g.x,
-        y: g.y,
-        w: g.width,
-        h: g.height,
-      });
-  const inside = (p: Pt, r: Rect): boolean =>
-    Math.abs(p.x - r.x) < r.w / 2 - inset &&
-    Math.abs(p.y - r.y) < r.h / 2 - inset;
-  const out: NodePierce[] = [];
-  const polys = flatPolys(layout);
-  layout.edges.forEach((e, idx) => {
-    if (e.points.length < 2) return;
-    const poly = polys[idx]!.pts;
-    for (const r of rects) {
-      if (
-        r.key === e.source ||
-        r.key === e.target ||
-        '__group_' + r.key === e.source ||
-        '__group_' + r.key === e.target
-      )
-        continue;
-      const hits = poly.filter((p) => inside(p, r));
-      if (hits.length >= minPts)
-        out.push({ edgeIdx: idx, node: r.key, pts: hits });
-    }
-  });
-  return out;
-}
-
-/** Count of edges routing through unrelated node boxes — the "line going through
- *  a node" metric. */
-export function countEdgeNodePierces(
-  layout: BLLayoutResult,
-  opts?: { inset?: number; minPts?: number }
-): number {
-  return detectEdgeNodePierces(layout, opts).length;
-}
-
-/**
- * Re-routed copy of a layout that bends edges AROUND any node box they pierce:
- * for each pierced (edge, node) it inserts a waypoint pushing the edge out past
- * the node, perpendicular to the edge, on the side it's already leaning. The
- * curveBasis spline then bows around the node instead of through it. Returned as
- * an ALTERNATIVE candidate — the caller keeps it only if total badness drops, so
- * a detour that trades a pierce for a crossing is simply rejected.
- */
-export function deroutePierces(layout: BLLayoutResult): BLLayoutResult {
-  const pierces = detectEdgeNodePierces(layout);
-  if (!pierces.length) return layout;
-  const rect = new Map<string, Rect>();
-  for (const n of layout.nodes)
-    rect.set(n.label, { x: n.x, y: n.y, w: n.width, h: n.height });
-  for (const g of layout.groups)
-    if (g.collapsed)
-      rect.set('__group_' + g.label, {
-        x: g.x,
-        y: g.y,
-        w: g.width,
-        h: g.height,
-      });
-  const byEdge = new Map<number, string[]>();
-  for (const p of pierces) {
-    const arr = byEdge.get(p.edgeIdx);
-    if (arr) arr.push(p.node);
-    else byEdge.set(p.edgeIdx, [p.node]);
-  }
-  const edges = layout.edges.map((e, idx) => {
-    const nodes = byEdge.get(idx);
-    if (!nodes) return e;
-    let pts: Pt[] = e.points.map((p) => ({ x: p.x, y: p.y }));
-    for (const label of nodes) {
-      const r = rect.get(label);
-      if (r) pts = detourAround(pts, r);
-    }
-    return { ...e, points: pts };
-  });
-  return { ...layout, edges };
-}
-
-// Bend a waypoint polyline around a rectangle it passes through: find the
-// segment whose closest point to the rect centre is nearest, and insert a
-// waypoint there pushed out past the rect corner (+margin) on the leaning side.
-function detourAround(pts: Pt[], r: Rect): Pt[] {
-  if (pts.length < 2) return pts;
-  const c = { x: r.x, y: r.y };
-  let bestSeg = -1;
-  let bestT = 0;
-  let bestD = Infinity;
-  let bestPt: Pt = pts[0]!;
-  for (let i = 0; i < pts.length - 1; i++) {
-    const a = pts[i]!,
-      b = pts[i + 1]!;
-    const dx = b.x - a.x,
-      dy = b.y - a.y;
-    const len2 = dx * dx + dy * dy || 1e-9;
-    let t = ((c.x - a.x) * dx + (c.y - a.y) * dy) / len2;
-    t = Math.max(0, Math.min(1, t));
-    const q = { x: a.x + t * dx, y: a.y + t * dy };
-    const d = Math.hypot(q.x - c.x, q.y - c.y);
-    if (d < bestD) {
-      bestD = d;
-      bestSeg = i;
-      bestT = t;
-      bestPt = q;
-    }
-  }
-  if (bestSeg < 0) return pts;
-  // push direction: away from rect centre, on the side the edge already leans;
-  // if the closest point is dead-centre, pick the box's shorter axis to exit.
-  let nx = bestPt.x - c.x;
-  let ny = bestPt.y - c.y;
-  if (Math.hypot(nx, ny) < 1) {
-    if (r.w <= r.h) {
-      nx = 1;
-      ny = 0;
-    } else {
-      nx = 0;
-      ny = 1;
-    }
-  }
-  const nlen = Math.hypot(nx, ny) || 1;
-  nx /= nlen;
-  ny /= nlen;
-  // Local edge direction (along the closest segment), for shaping a SMOOTH hump
-  // around the node instead of a single spike: ease out → peak → ease back in.
-  const a = pts[bestSeg]!,
-    b = pts[bestSeg + 1]!;
-  let ex = b.x - a.x,
-    ey = b.y - a.y;
-  const elen = Math.hypot(ex, ey) || 1;
-  ex /= elen;
-  ey /= elen;
-  const clear = Math.hypot(r.w, r.h) / 2 + 18;
-  const hw = Math.hypot(r.w, r.h) / 2; // hump half-width along the edge
-  void bestT;
-  const before = {
-    x: bestPt.x - ex * hw + nx * clear * 0.5,
-    y: bestPt.y - ey * hw + ny * clear * 0.5,
-  };
-  const peak = { x: c.x + nx * clear, y: c.y + ny * clear };
-  const after = {
-    x: bestPt.x + ex * hw + nx * clear * 0.5,
-    y: bestPt.y + ey * hw + ny * clear * 0.5,
-  };
-  const out = pts.slice(0, bestSeg + 1);
-  out.push(before, peak, after);
-  out.push(...pts.slice(bestSeg + 1));
-  return out;
-}
-/** Count of edges that come CLOSE to another edge without overlapping — lines
- *  that "almost touch". Runs within `near` px (but not already overlapping within
- *  `tight` px). Same shared-node exclusion as overlaps. */
-export function countEdgeNearMiss(
-  layout: BLLayoutResult,
-  opts?: { near?: number; tight?: number; minLen?: number }
-): number {
-  const near = opts?.near ?? 14;
-  const tight = opts?.tight ?? 8;
-  const minLen = opts?.minLen ?? 18;
-  const close = detectEdgeOverlaps(layout, { dist: near, minLen }).length;
-  const over = detectEdgeOverlaps(layout, { dist: tight, minLen }).length;
-  return Math.max(0, close - over);
-}
-
-// Renderer extends a parent group's box UPWARD by this label zone (mirrors
-// GROUP_LABEL_ZONE in renderer.ts) — so the collision metric must use the
-// RENDERED box, or near-touching parents read as fine when they actually overlap.
-const GROUP_LABEL_ZONE = 32;
-
-/** Labels of GROUP boxes that touch/overlap a non-nested sibling group. Proper
- *  nesting (one box fully inside another) is excluded; only sibling/unrelated
- *  collisions count. Uses the RENDERED box (parent groups grow up by the label
- *  zone, which is what actually makes near-touching parents collide). */
-export function detectGroupOverlaps(
-  layout: BLLayoutResult,
-  opts?: { margin?: number }
-): string[] {
-  const margin = opts?.margin ?? 4;
-  const raw = layout.groups.map((g) => ({
-    label: g.label,
-    l: g.x - g.width / 2,
-    r: g.x + g.width / 2,
-    t: g.y - g.height / 2,
-    b: g.y + g.height / 2,
-  }));
-  const contains = (
-    outer: (typeof raw)[number],
-    inner: (typeof raw)[number]
-  ): boolean =>
-    outer.l <= inner.l + margin &&
-    outer.r >= inner.r - margin &&
-    outer.t <= inner.t + margin &&
-    outer.b >= inner.b - margin;
-  const rend = raw.map((a, i) => {
-    const parent = raw.some((b, j) => j !== i && contains(a, b));
-    return parent ? { ...a, t: a.t - GROUP_LABEL_ZONE } : a;
-  });
-  const hit = new Set<string>();
-  for (let i = 0; i < raw.length; i++)
-    for (let j = i + 1; j < raw.length; j++) {
-      if (contains(raw[i]!, raw[j]!) || contains(raw[j]!, raw[i]!)) continue; // nesting
-      const a = rend[i]!,
-        b = rend[j]!;
-      const dx = Math.max(a.l - b.r, b.l - a.r);
-      const dy = Math.max(a.t - b.b, b.t - a.b);
-      if (Math.max(dx, dy) < margin) {
-        hit.add(raw[i]!.label);
-        hit.add(raw[j]!.label);
-      }
-    }
-  return [...hit];
-}
-
-/** Count of group-box collisions (pairs touching/overlapping). */
-export function countGroupOverlaps(
-  layout: BLLayoutResult,
-  opts?: { margin?: number }
-): number {
-  const margin = opts?.margin ?? 4;
-  const raw = layout.groups.map((g) => ({
-    l: g.x - g.width / 2,
-    r: g.x + g.width / 2,
-    t: g.y - g.height / 2,
-    b: g.y + g.height / 2,
-  }));
-  const contains = (
-    outer: (typeof raw)[number],
-    inner: (typeof raw)[number]
-  ): boolean =>
-    outer.l <= inner.l + margin &&
-    outer.r >= inner.r - margin &&
-    outer.t <= inner.t + margin &&
-    outer.b >= inner.b - margin;
-  const rend = raw.map((a, i) => {
-    const parent = raw.some((b, j) => j !== i && contains(a, b));
-    return parent ? { ...a, t: a.t - GROUP_LABEL_ZONE } : a;
-  });
-  let count = 0;
-  for (let i = 0; i < raw.length; i++)
-    for (let j = i + 1; j < raw.length; j++) {
-      if (contains(raw[i]!, raw[j]!) || contains(raw[j]!, raw[i]!)) continue;
-      const a = rend[i]!,
-        b = rend[j]!;
-      const dx = Math.max(a.l - b.r, b.l - a.r);
-      const dy = Math.max(a.t - b.b, b.t - a.b);
-      if (Math.max(dx, dy) < margin) count++;
-    }
-  return count;
-}
-/**
- * Separated copy of a layout that pushes overlapping TOP-LEVEL group bands apart
- * along the cross-axis. dagre's compound layout sometimes wedges a small group
- * into a too-tight channel between two others (the multi-cloud On-Prem box lands
- * in AWS's label zone). Translating each top-level group rigidly along the
- * cross-axis preserves every node's rank/column, so the only thing that changes
- * is the gap between bands. Member nodes + nested sub-group boxes move by their
- * band's delta; edge waypoints blend smoothly between their endpoints' deltas
- * (intra-band edges keep their shape exactly; cross-band edges ease across).
- *
- * Returned as an ALTERNATIVE candidate — the caller keeps it only if total
- * badness drops, so a separation that introduces a crossing/pierce is rejected.
- * Fully-expanded graphs only (skips when any group is collapsed).
- */
-export function separateGroupBands(
-  layout: BLLayoutResult,
-  parsed: ParsedBoxesAndLines
-): BLLayoutResult {
-  if (layout.groups.some((g) => g.collapsed)) return layout;
-  if (countGroupOverlaps(layout) === 0) return layout;
-
-  // Resolve each group label to its top-level ancestor (walk parentGroup).
-  const parentOf = new Map<string, string | undefined>();
-  for (const g of parsed.groups) parentOf.set(g.label, g.parentGroup);
-  const topOf = (label: string): string => {
-    let cur = label;
-    const seen = new Set<string>();
-    for (;;) {
-      const p = parentOf.get(cur);
-      if (!p || seen.has(p)) return cur;
-      seen.add(cur);
-      cur = p;
-    }
-  };
-  const topLabels = parsed.groups
-    .filter((g) => !g.parentGroup)
-    .map((g) => g.label);
-  if (topLabels.length < 2) return layout;
-
-  // Each node's top-level group (a node sits in exactly one leaf group).
-  const nodeTop = new Map<string, string>();
-  for (const g of parsed.groups)
-    for (const child of g.children)
-      if (!parsed.groups.some((gg) => gg.label === child))
-        nodeTop.set(child, topOf(g.label));
-
-  // Cross-axis: LR stacks bands vertically (Y); TB stacks them horizontally (X).
-  // The label zone always extends a parent's box upward (Y), so it only lands on
-  // the cross-axis for LR — for TB this pass can still separate plain X overlaps.
-  const axis: 'x' | 'y' = parsed.direction === 'TB' ? 'x' : 'y';
-  const boxByLabel = new Map(layout.groups.map((g) => [g.label, g]));
-
-  // Rendered cross-interval per top-level group (label zone folded in on Y).
-  type Band = { label: string; lo: number; hi: number; c: number };
-  const bands: Band[] = topLabels.map((label) => {
-    const g = boxByLabel.get(label)!;
-    const half = (axis === 'y' ? g.height : g.width) / 2;
-    let lo = (axis === 'y' ? g.y : g.x) - half;
-    const hi = (axis === 'y' ? g.y : g.x) + half;
-    // A top-level group with children is a parent → its rendered box grows up.
-    const isParent = parsed.groups.some((c) => c.parentGroup === label);
-    if (axis === 'y' && isParent) lo -= GROUP_LABEL_ZONE;
-    return { label, lo, hi, c: (lo + hi) / 2 };
-  });
-  bands.sort((a, b) => a.c - b.c);
-
-  // 1D block-merge (PAV) separation: keep each band's centre as close to where
-  // it is as possible, subject to a minimum gap between consecutive bands.
-  const GAP = 16;
-  const half = bands.map((b) => (b.hi - b.lo) / 2);
-  const off: number[] = [0];
-  for (let i = 1; i < bands.length; i++)
-    off[i] = off[i - 1]! + half[i - 1]! + GAP + half[i]!;
-  const desired = bands.map((b, i) => b.c - off[i]!);
-  type Blk = { pos: number; count: number; sum: number; first: number };
-  const blocks: Blk[] = [];
-  for (let i = 0; i < bands.length; i++) {
-    let blk: Blk = { pos: desired[i]!, count: 1, sum: desired[i]!, first: i };
-    while (blocks.length && blocks[blocks.length - 1]!.pos >= blk.pos) {
-      const prev = blocks.pop()!;
-      const count = prev.count + blk.count;
-      const sum = prev.sum + blk.sum;
-      blk = { pos: sum / count, count, sum, first: prev.first };
-    }
-    blocks.push(blk);
-  }
-  const newC = new Array<number>(bands.length);
-  for (const blk of blocks)
-    for (let k = 0; k < blk.count; k++)
-      newC[blk.first + k] = blk.pos + off[blk.first + k]!;
-
-  // Delta per top-level group; bail if nothing actually moves.
-  const delta = new Map<string, number>();
-  let moved = false;
-  bands.forEach((b, i) => {
-    const d = newC[i]! - b.c;
-    delta.set(b.label, d);
-    if (Math.abs(d) > 0.5) moved = true;
-  });
-  if (!moved) return layout;
-
-  const nodeDelta = (label: string): number => {
-    // Group-incident edge endpoints carry the group's gid, not a node label.
-    if (label.startsWith('__group_'))
-      return delta.get(topOf(label.slice('__group_'.length))) ?? 0;
-    const top = nodeTop.get(label);
-    return top ? (delta.get(top) ?? 0) : 0;
-  };
-  const shift = (p: Pt, d: number): Pt =>
-    axis === 'y' ? { x: p.x, y: p.y + d } : { x: p.x + d, y: p.y };
-
-  const nodes = layout.nodes.map((n) => {
-    const d = nodeDelta(n.label);
-    return d
-      ? { ...n, ...(axis === 'y' ? { y: n.y + d } : { x: n.x + d }) }
-      : n;
-  });
-  const groups = layout.groups.map((g) => {
-    const d = delta.get(topOf(g.label)) ?? 0;
-    return d
-      ? { ...g, ...(axis === 'y' ? { y: g.y + d } : { x: g.x + d }) }
-      : g;
-  });
-  const edges = layout.edges.map((e) => {
-    const ds = nodeDelta(e.source);
-    const dt = nodeDelta(e.target);
-    if (!ds && !dt) return e;
-    const N = e.points.length;
-    const points = e.points.map((p, i) => {
-      const f = N > 1 ? i / (N - 1) : 0;
-      return shift(p, ds * (1 - f) + dt * f);
-    });
-    return { ...e, points };
-  });
-
-  // Recompute canvas bbox (+ margin) over the shifted content.
-  let minX = Infinity,
-    minY = Infinity,
-    maxX = -Infinity,
-    maxY = -Infinity;
-  const acc = (x: number, y: number) => {
-    if (x < minX) minX = x;
-    if (x > maxX) maxX = x;
-    if (y < minY) minY = y;
-    if (y > maxY) maxY = y;
-  };
-  for (const n of nodes) {
-    acc(n.x - n.width / 2, n.y - n.height / 2);
-    acc(n.x + n.width / 2, n.y + n.height / 2);
-  }
-  for (const g of groups) {
-    acc(g.x - g.width / 2, g.y - g.height / 2 - GROUP_LABEL_ZONE);
-    acc(g.x + g.width / 2, g.y + g.height / 2);
-  }
-  for (const e of edges) for (const p of e.points) acc(p.x, p.y);
-  const M = 40;
-  const sx = M - minX,
-    sy = M - minY;
-  const reshift = sx !== 0 || sy !== 0;
-  return {
-    nodes: reshift
-      ? nodes.map((n) => ({ ...n, x: n.x + sx, y: n.y + sy }))
-      : nodes,
-    groups: reshift
-      ? groups.map((g) => ({ ...g, x: g.x + sx, y: g.y + sy }))
-      : groups,
-    edges: reshift
-      ? edges.map((e) => ({
-          ...e,
-          points: e.points.map((p) => ({ x: p.x + sx, y: p.y + sy })),
-        }))
-      : edges,
-    width: maxX - minX + 2 * M,
-    height: maxY - minY + 2 * M,
-  };
-}
-
-// Fast crossing estimate for RANKING candidates: straight segments on raw
-// waypoints (no curveBasis flatten) + bbox pruning + early-out per pair.
-// ~10× cheaper than countSplineCrossings; topology-equivalent for ranking.
-function segCross(p1: Pt, p2: Pt, p3: Pt, p4: Pt): boolean {
-  const d1x = p2.x - p1.x,
-    d1y = p2.y - p1.y,
-    d2x = p4.x - p3.x,
-    d2y = p4.y - p3.y;
-  const den = d1x * d2y - d1y * d2x;
-  if (Math.abs(den) < 1e-9) return false;
-  const t = ((p3.x - p1.x) * d2y - (p3.y - p1.y) * d2x) / den;
-  const s = ((p3.x - p1.x) * d1y - (p3.y - p1.y) * d1x) / den;
-  return t > 0.001 && t < 0.999 && s > 0.001 && s < 0.999;
-}
-function countCrossingsFast(layout: BLLayoutResult): number {
-  const E = layout.edges.filter((e) => e.points.length >= 2);
-  const bb = E.map((e) => {
-    let x0 = Infinity,
-      y0 = Infinity,
-      x1 = -Infinity,
-      y1 = -Infinity;
-    for (const p of e.points) {
-      if (p.x < x0) x0 = p.x;
-      if (p.x > x1) x1 = p.x;
-      if (p.y < y0) y0 = p.y;
-      if (p.y > y1) y1 = p.y;
-    }
-    return { x0, y0, x1, y1 };
-  });
-  let count = 0;
-  for (let i = 0; i < E.length; i++)
-    for (let j = i + 1; j < E.length; j++) {
-      const A = E[i]!,
-        B = E[j]!;
-      if (
-        A.source === B.source ||
-        A.source === B.target ||
-        A.target === B.source ||
-        A.target === B.target
-      )
-        continue;
-      const a = bb[i]!,
-        b = bb[j]!;
-      if (a.x1 < b.x0 || b.x1 < a.x0 || a.y1 < b.y0 || b.y1 < a.y0) continue;
-      const pa = A.points,
-        pb = B.points;
-      let hit = false;
-      for (let ai = 0; ai < pa.length - 1 && !hit; ai++)
-        for (let bi = 0; bi < pb.length - 1; bi++) {
-          if (segCross(pa[ai]!, pa[ai + 1]!, pb[bi]!, pb[bi + 1]!)) {
-            hit = true;
-            break;
-          }
-        }
-      if (hit) count++;
-    }
-  return count;
-}
-function meanDrift(
-  layout: BLLayoutResult,
-  prev: ReadonlyMap<string, Pt> | undefined
-): number {
-  if (!prev?.size) return 0;
-  let sum = 0,
-    n = 0;
-  for (const node of layout.nodes) {
-    const p = prev.get(node.label);
-    if (p) {
-      sum += Math.hypot(node.x - p.x, node.y - p.y);
-      n++;
-    }
-  }
-  return n ? sum / n : 0;
-}
-// total edge length — positioning tiebreaker (shorter/straighter reads better)
-function edgeLength(layout: BLLayoutResult): number {
-  let total = 0;
-  for (const e of layout.edges)
-    for (let i = 1; i < e.points.length; i++)
-      total += Math.hypot(
-        e.points[i]!.x - e.points[i - 1]!.x,
-        e.points[i]!.y - e.points[i - 1]!.y
-      );
-  return total;
-}
-
-export async function layoutBoxesAndLinesSearch(
-  parsed: ParsedBoxesAndLines,
-  collapseInfo?: {
-    collapsedChildCounts: Map<string, number>;
-    originalGroups: readonly BLGroup[];
-  },
-  opts?: {
-    hideDescriptions?: boolean;
-    previousPositions?: ReadonlyMap<string, Pt>;
-    /** Number of seed orderings to search (default: adaptive by node count). */
-    seeds?: number;
-    /** Stability weight (default 4). */
-    lambda?: number;
-    /** How many top candidates to re-rank with the exact counter (default 6). */
-    refineK?: number;
-    /** Progress hook for the interactive path. When provided, the search yields
-     *  to a macrotask after each candidate so the host UI can paint a progress
-     *  indicator. Omit it (CLI/export) and the search runs straight through with
-     *  no added latency. */
-    onProgress?: (done: number, total: number, phase: string) => void;
-    /** Last-resort label legibility: reserve dagre label space for every labeled
-     *  edge so the layout opens a gap wide enough for the (wrapped) label. Only
-     *  set by layout.ts when steps 1–2 left a label overlapping a node box. */
-    reserveEdgeLabels?: boolean;
-  }
-): Promise<BLLayoutResult> {
-  const hideDescriptions = opts?.hideDescriptions ?? false;
-  const reserveEdgeLabels = opts?.reserveEdgeLabels ?? false;
-  const onProgress = opts?.onProgress;
-  // Yield to a macrotask (lets the browser repaint between heavy placements);
-  // no-op when there's no progress observer so non-interactive callers pay
-  // nothing.
-  const tick = onProgress
-    ? (): Promise<void> => new Promise<void>((r) => setTimeout(r))
-    : (): undefined => undefined;
-  // Yielding is only worth its cost once a search is genuinely slow. A typical
-  // diagram finishes its whole candidate pool in tens of ms; yielding (a
-  // setTimeout, clamped to ~4ms/turn in browsers) after every one of ~90
-  // candidates would turn a 30ms layout into ~1s — all to flash a throbber that
-  // never shows (the app only reveals it after 150ms). So we suppress yields
-  // until the search has burned through a budget, then throttle them: fast
-  // diagrams run flat-out, only truly heavy ones cede the main thread to paint.
-  const YIELD_AFTER_MS = 150;
-  const YIELD_EVERY_MS = 30;
-  const searchStart = performance.now();
-  let lastYield = searchStart;
-
-  // collapsed group labels (shown as plain boxes) — mirrors the ELK path
-  const collapsedGroupLabels = new Set<string>();
-  if (collapseInfo) {
-    const missing = new Set<string>();
-    for (const og of collapseInfo.originalGroups)
-      if (!parsed.groups.some((g) => g.label === og.label))
-        missing.add(og.label);
-    for (const label of missing) {
-      const og = collapseInfo.originalGroups.find((g) => g.label === label);
-      const parent = og?.parentGroup;
-      if (!parent || !missing.has(parent)) collapsedGroupLabels.add(label);
-    }
-  }
-
-  // node sizes (computeNodeSize + uniform-height pass) — identical to ELK path
-  const sizes = new Map<string, { width: number; height: number }>();
-  let maxDescH = 0;
-  for (const node of parsed.nodes) {
-    const s = hideDescriptions
-      ? { width: NODE_WIDTH, height: NODE_HEIGHT }
-      : computeNodeSize(node, parsed.showValues === true);
-    sizes.set(node.label, s);
-    if (!hideDescriptions && node.description && node.description.length > 0)
-      maxDescH = Math.max(maxDescH, s.height);
-  }
-  if (maxDescH > 0)
-    for (const node of parsed.nodes)
-      if (node.description && node.description.length > 0) {
-        const s = sizes.get(node.label)!;
-        sizes.set(node.label, { width: s.width, height: maxDescH });
-      }
-
-  const gid = (label: string) => `__group_${label}`;
-  const rankdir = parsed.direction === 'TB' ? 'TB' : 'LR';
-
-  // Group-incident edges: dagre cannot attach edges to a compound cluster node
-  // (it throws while ranking). So for any edge whose endpoint is an EXPANDED
-  // group, we route the dagre edge through a representative descendant node and
-  // later clip the polyline back to the group's boundary rect. Collapsed groups
-  // are already plain (childless) nodes, so their edges need no redirect.
-  const nodeLabelSet = new Set(parsed.nodes.map((n) => n.label));
-  const directNodeChildren = new Map<string, string[]>();
-  const childGroupsOf = new Map<string, string[]>();
-  for (const grp of parsed.groups) {
-    directNodeChildren.set(
-      grp.label,
-      grp.children.filter((c) => nodeLabelSet.has(c))
-    );
-    if (grp.parentGroup) {
-      const arr = childGroupsOf.get(grp.parentGroup) ?? [];
-      arr.push(grp.label);
-      childGroupsOf.set(grp.parentGroup, arr);
-    }
-  }
-  // All descendant node labels of a group (direct children + nested subgroups).
-  const membersCache = new Map<string, string[]>();
-  const membersOf = (label: string): string[] => {
-    const cached = membersCache.get(label);
-    if (cached) return cached;
-    membersCache.set(label, []); // cycle guard
-    const out = [...(directNodeChildren.get(label) ?? [])];
-    for (const sub of childGroupsOf.get(label) ?? [])
-      out.push(...membersOf(sub));
-    membersCache.set(label, out);
-    return out;
-  };
-
-  // For a group used as an edge SOURCE the connector should leave from the
-  // group's internal exit (the member at the deepest rank); used as a TARGET it
-  // should enter at the group's entry (a member with no internal predecessor).
-  // Picking by internal-DAG depth keeps the group a contiguous block and the
-  // overall flow monotonic, instead of stretching it across the target's rank.
-  const gidSourceRep = new Map<string, string>(); // gid -> deepest member
-  const gidTargetRep = new Map<string, string>(); // gid -> shallowest member
-  for (const grp of parsed.groups) {
-    const members = membersOf(grp.label);
-    if (members.length === 0) continue;
-    const memberSet = new Set(members);
-    // Internal predecessors (node->node edges fully inside the group). A
-    // member's rank = longest predecessor chain, so entry members rank 0 and
-    // exit members rank highest — matching how dagre lays the members out.
-    const preds = new Map<string, string[]>();
-    for (const e of parsed.edges)
-      if (memberSet.has(e.source) && memberSet.has(e.target)) {
-        const arr = preds.get(e.target) ?? [];
-        arr.push(e.source);
-        preds.set(e.target, arr);
-      }
-    const rankCache = new Map<string, number>();
-    const onPath = new Set<string>();
-    const rankOf = (n: string): number => {
-      const c = rankCache.get(n);
-      if (c !== undefined) return c;
-      if (onPath.has(n)) return 0; // cycle: treat as root
-      onPath.add(n);
-      let r = 0;
-      for (const p of preds.get(n) ?? []) r = Math.max(r, rankOf(p) + 1);
-      onPath.delete(n);
-      rankCache.set(n, r);
-      return r;
-    };
-    let exit = members[0]!;
-    let entry = members[0]!;
-    for (const mem of members) {
-      if (rankOf(mem) > rankOf(exit)) exit = mem;
-      if (rankOf(mem) < rankOf(entry)) entry = mem;
-    }
-    gidSourceRep.set(gid(grp.label), exit);
-    gidTargetRep.set(gid(grp.label), entry);
-  }
-  const srcRep = (label: string) => gidSourceRep.get(label) ?? label;
-  const tgtRep = (label: string) => gidTargetRep.get(label) ?? label;
-  const edgeKey = (e: { source: string; target: string; lineNumber: number }) =>
-    `${e.source}->${e.target}#${e.lineNumber}`;
-
-  // Clip a polyline endpoint to a group's boundary rect. `rect` is centre-based.
-  // Returns the point where the ray from the rect centre toward `toward` exits
-  // the rect.
-  const rectBorderPoint = (
-    rect: { x: number; y: number; w: number; h: number },
-    toward: Pt
-  ): Pt => {
-    const dx = toward.x - rect.x;
-    const dy = toward.y - rect.y;
-    const sx = dx === 0 ? Infinity : rect.w / 2 / Math.abs(dx);
-    const sy = dy === 0 ? Infinity : rect.h / 2 / Math.abs(dy);
-    const s = Math.min(sx, sy);
-    if (!Number.isFinite(s)) return { x: rect.x, y: rect.y };
-    return { x: rect.x + dx * s, y: rect.y + dy * s };
-  };
-  const isInsideRect = (
-    p: Pt,
-    rect: { x: number; y: number; w: number; h: number }
-  ) =>
-    Math.abs(p.x - rect.x) <= rect.w / 2 &&
-    Math.abs(p.y - rect.y) <= rect.h / 2;
-
-  // ── Pinned-layout bypass (Canvas Editor spike, Decisions 3/7) ──
-  // When a `layout` block positions EVERY node, place nodes directly from the
-  // stored coordinates and skip the whole dagre search. Edges become
-  // border-clipped straight connectors (no obstacle avoidance — honest-but-ugly).
-  // FLAT, EXPANDED groups are honored: each group's container rect is computed
-  // from its members' pinned positions (canvas group editing). A FLAT group can
-  // also be COLLAPSED while pinned — it renders as a plain box at its members'
-  // bbox-centre (so collapse no longer forces a full dagre reflow). Nested groups
-  // still fall back to dagre (deferred).
-  const pinned = parsed.nodePositions;
-  const groupLabelSet = new Set(parsed.groups.map((g) => g.label));
-  const groupsAreFlat = parsed.groups.every(
-    (g) => !g.parentGroup && !g.children.some((c) => groupLabelSet.has(c))
-  );
-  // A collapsed group can stay pinned only when it's FLAT (top-level, no
-  // sub-groups) and every one of its members has a pinned coord — otherwise we
-  // can't place its box without a search, so fall back to dagre.
-  const allOriginalGroupLabels = new Set(
-    (collapseInfo?.originalGroups ?? parsed.groups).map((g) => g.label)
-  );
-  const collapsedAreFlatPinned =
-    collapsedGroupLabels.size === 0 ||
-    (pinned !== undefined &&
-      collapseInfo !== undefined &&
-      [...collapsedGroupLabels].every((label) => {
-        const og = collapseInfo.originalGroups.find((g) => g.label === label);
-        if (!og || og.parentGroup) return false;
-        return og.children.every(
-          (c) => pinned.has(c) && !allOriginalGroupLabels.has(c)
-        );
-      }));
-  const allPinned =
-    pinned !== undefined &&
-    (parsed.nodes.length > 0 || collapsedGroupLabels.size > 0) &&
-    parsed.nodes.every((n) => pinned.has(n.label)) &&
-    groupsAreFlat &&
-    collapsedAreFlatPinned;
-  function placePinned(pins: ReadonlyMap<string, Pt>): BLLayoutResult {
-    // Collapsed flat groups → a plain NODE-sized box at the bbox-centre of the
-    // group's (now-hidden) members' pinned coords. The collapse transform
-    // redirected their incident edges to `__group_<label>`, so register that id
-    // in the position/rect lookups too.
-    const collapsedPosByGid = new Map<string, Pt>();
-    const collapsedBoxes: Array<{
-      label: string;
-      lineNumber: number;
-      childCount: number;
-      x: number;
-      y: number;
-    }> = [];
-    if (collapseInfo)
-      for (const label of collapsedGroupLabels) {
-        const og = collapseInfo.originalGroups.find((g) => g.label === label);
-        if (!og) continue;
-        let cx0 = Infinity,
-          cy0 = Infinity,
-          cx1 = -Infinity,
-          cy1 = -Infinity;
-        for (const c of og.children) {
-          const p = pins.get(c);
-          if (!p) continue;
-          cx0 = Math.min(cx0, p.x);
-          cx1 = Math.max(cx1, p.x);
-          cy0 = Math.min(cy0, p.y);
-          cy1 = Math.max(cy1, p.y);
-        }
-        if (!Number.isFinite(cx0)) continue;
-        const cx = (cx0 + cx1) / 2;
-        const cy = (cy0 + cy1) / 2;
-        collapsedPosByGid.set(`__group_${label}`, { x: cx, y: cy });
-        collapsedBoxes.push({
-          label,
-          lineNumber: og.lineNumber,
-          childCount:
-            collapseInfo.collapsedChildCounts.get(label) ?? og.children.length,
-          x: cx,
-          y: cy,
-        });
-      }
-    const posOf = (label: string): Pt | undefined =>
-      pins.get(label) ?? collapsedPosByGid.get(label);
-    const rectOf = (label: string) => {
-      const p = posOf(label)!;
-      const s = sizes.get(label) ?? { width: NODE_WIDTH, height: NODE_HEIGHT };
-      return { x: p.x, y: p.y, w: s.width, h: s.height };
-    };
-    const nodes = parsed.nodes.map((n) => {
-      const r = rectOf(n.label);
-      return { label: n.label, x: r.x, y: r.y, width: r.w, height: r.h };
-    });
-    const edges: BLLayoutEdge[] = parsed.edges.flatMap((e) => {
-      const sp = posOf(e.source);
-      const tp = posOf(e.target);
-      if (!sp || !tp) return [];
-      const srcRect = rectOf(e.source);
-      const tgtRect = rectOf(e.target);
-      const p0 = rectBorderPoint(srcRect, tp);
-      const p1 = rectBorderPoint(tgtRect, sp);
-      return [
-        {
-          source: e.source,
-          target: e.target,
-          ...(e.label !== undefined && { label: e.label }),
-          bidirectional: e.bidirectional,
-          lineNumber: e.lineNumber,
-          points: [p0, p1],
-          yOffset: 0,
-          parallelCount: 1,
-          metadata: e.metadata,
-          straight: true,
-        },
-      ];
-    });
-    // Fit the canvas around the pinned content with a uniform margin on every
-    // side. Crucially, content must never fall off the TOP/LEFT (the viewBox
-    // origin is 0,0): if a node was dragged past the margin we shift everything
-    // back on-canvas by `max(0, M - min)` — clamped so in-bounds diagrams keep
-    // their exact pinned coords (shift 0) and only off-canvas ones are nudged.
-    // Flat-group container rects: bbox of the group's members + side/bottom
-    // padding, with a label zone reserved at the top (mirrors the renderer).
-    const GROUP_PAD = 16;
-    const nodeByLabel = new Map(nodes.map((n) => [n.label, n]));
-    const groups: BLLayoutResult['groups'][number][] = [];
-    for (const grp of parsed.groups) {
-      let gx0 = Infinity,
-        gy0 = Infinity,
-        gx1 = -Infinity,
-        gy1 = -Infinity;
-      for (const c of grp.children) {
-        const n = nodeByLabel.get(c);
-        if (!n) continue;
-        gx0 = Math.min(gx0, n.x - n.width / 2);
-        gx1 = Math.max(gx1, n.x + n.width / 2);
-        gy0 = Math.min(gy0, n.y - n.height / 2);
-        gy1 = Math.max(gy1, n.y + n.height / 2);
-      }
-      if (!Number.isFinite(gx0)) continue; // members not pinned / empty group
-      const x0 = gx0 - GROUP_PAD;
-      const x1 = gx1 + GROUP_PAD;
-      const y0 = gy0 - GROUP_LABEL_ZONE;
-      const y1 = gy1 + GROUP_PAD;
-      groups.push({
-        label: grp.label,
-        lineNumber: grp.lineNumber,
-        x: (x0 + x1) / 2,
-        y: (y0 + y1) / 2,
-        width: x1 - x0,
-        height: y1 - y0,
-        collapsed: false,
-        childCount: grp.children.length,
-      });
-    }
-    // Collapsed flat groups: a plain box at the members' centre.
-    for (const cb of collapsedBoxes) {
-      groups.push({
-        label: cb.label,
-        lineNumber: cb.lineNumber,
-        x: cb.x,
-        y: cb.y,
-        width: NODE_WIDTH,
-        height: NODE_HEIGHT,
-        collapsed: true,
-        childCount: cb.childCount,
-      });
-    }
-
-    const M = 40;
-    let minX = Infinity,
-      minY = Infinity,
-      maxX = -Infinity,
-      maxY = -Infinity;
-    const acc = (x: number, y: number) => {
-      if (x < minX) minX = x;
-      if (x > maxX) maxX = x;
-      if (y < minY) minY = y;
-      if (y > maxY) maxY = y;
-    };
-    for (const n of nodes) {
-      acc(n.x - n.width / 2, n.y - n.height / 2);
-      acc(n.x + n.width / 2, n.y + n.height / 2);
-    }
-    for (const e of edges) for (const p of e.points) acc(p.x, p.y);
-    for (const gr of groups) {
-      acc(gr.x - gr.width / 2, gr.y - gr.height / 2);
-      acc(gr.x + gr.width / 2, gr.y + gr.height / 2);
-    }
-    // Only correct genuinely off-canvas content — a small tolerance ignores the
-    // sub-pixel jitter from rounding coords near the margin, so an already
-    // on-canvas diagram keeps its exact pinned positions (no creeping drift).
-    const TOL = 2;
-    const sx = minX < M - TOL ? M - minX : 0;
-    const sy = minY < M - TOL ? M - minY : 0;
-    const shifted = sx !== 0 || sy !== 0;
-    return {
-      nodes: shifted
-        ? nodes.map((n) => ({ ...n, x: n.x + sx, y: n.y + sy }))
-        : nodes,
-      edges: shifted
-        ? edges.map((e) => ({
-            ...e,
-            points: e.points.map((p) => ({ x: p.x + sx, y: p.y + sy })),
-          }))
-        : edges,
-      groups: shifted
-        ? groups.map((gr) => ({ ...gr, x: gr.x + sx, y: gr.y + sy }))
-        : groups,
-      width: maxX + sx + M,
-      height: maxY + sy + M,
-    };
-  }
-
-  function place(cfg: {
-    ranker: string;
-    nodesep: number;
-    ranksep: number;
-    seed?: number;
-  }): BLLayoutResult {
-    const r = cfg.seed === undefined ? null : rng(cfg.seed + 1);
-    const ord = <T>(a: readonly T[]): T[] => (r ? shuffle(a, r) : a.slice());
-    const g = new dagre.graphlib.Graph({ compound: true, multigraph: true });
-    g.setGraph({
-      rankdir,
-      ranker: cfg.ranker,
-      nodesep: cfg.nodesep,
-      ranksep: cfg.ranksep,
-      edgesep: 20,
-      marginx: 40,
-      marginy: 40,
-    });
-    g.setDefaultEdgeLabel(() => ({}));
-    for (const grp of ord(parsed.groups))
-      g.setNode(gid(grp.label), { label: grp.label });
-    for (const node of ord(parsed.nodes)) {
-      const s = sizes.get(node.label)!;
-      g.setNode(node.label, { width: s.width, height: s.height });
-    }
-    for (const label of collapsedGroupLabels)
-      g.setNode(gid(label), { width: NODE_WIDTH, height: NODE_HEIGHT });
-    for (const grp of parsed.groups) {
-      if (grp.parentGroup && g.hasNode(gid(grp.parentGroup)))
-        g.setParent(gid(grp.label), gid(grp.parentGroup));
-      for (const c of ord(grp.children)) {
-        if (g.hasNode(c)) g.setParent(c, gid(grp.label));
-      }
-    }
-    if (collapseInfo)
-      for (const label of collapsedGroupLabels) {
-        const og = collapseInfo.originalGroups.find((x) => x.label === label);
-        if (
-          og?.parentGroup &&
-          !collapsedGroupLabels.has(og.parentGroup) &&
-          g.hasNode(gid(og.parentGroup))
-        )
-          g.setParent(gid(label), gid(og.parentGroup));
-      }
-    for (const e of ord(parsed.edges)) {
-      const s = srcRep(e.source);
-      const t = tgtRep(e.target);
-      if (s !== t && g.hasNode(s) && g.hasNode(t)) {
-        // Last-resort label legibility: reserve a virtual label node on the edge
-        // so dagre widens the rank gap to fit the (wrapped) label.
-        let edgeLabel: object = {};
-        if (reserveEdgeLabels && e.label) {
-          const m = measureEdgeLabel(e.label, EDGE_LABEL_FONT_SIZE);
-          edgeLabel = { width: m.width, height: m.height, labelpos: 'c' };
-        }
-        g.setEdge(s, t, edgeLabel, edgeKey(e));
-      }
-    }
-    dagre.layout(g);
-
-    const nodes = parsed.nodes.map((n) => {
-      const p = g.node(n.label);
-      return {
-        label: n.label,
-        x: p.x,
-        y: p.y,
-        width: p.width,
-        height: p.height,
-      };
-    });
-    const groups: BLLayoutResult['groups'][number][] = parsed.groups.map(
-      (grp) => {
-        const p = g.node(gid(grp.label));
-        return {
-          label: grp.label,
-          lineNumber: grp.lineNumber,
-          x: p.x,
-          y: p.y,
-          width: p.width,
-          height: p.height,
-          collapsed: false,
-          childCount: grp.children.length,
-        };
-      }
-    );
-    for (const label of collapsedGroupLabels) {
-      const p = g.node(gid(label));
-      groups.push({
-        label,
-        lineNumber: 0,
-        x: p.x,
-        y: p.y,
-        width: p.width,
-        height: p.height,
-        collapsed: true,
-        childCount: collapseInfo?.collapsedChildCounts.get(label) ?? 0,
-      });
-    }
-    // Boundary rects for expanded groups — used to clip group-incident edges.
-    const groupRectByGid = new Map<
-      string,
-      { x: number; y: number; w: number; h: number }
-    >();
-    for (const grp of parsed.groups) {
-      const p = g.node(gid(grp.label));
-      if (p)
-        groupRectByGid.set(gid(grp.label), {
-          x: p.x,
-          y: p.y,
-          w: p.width,
-          h: p.height,
-        });
-    }
-    const clipPointsToGroups = (
-      pts: Pt[],
-      source: string,
-      target: string
-    ): Pt[] => {
-      if (pts.length < 2) return pts;
-      let out = pts;
-      const srcRect = groupRectByGid.get(source);
-      if (srcRect) {
-        let k = 0;
-        while (k < out.length - 1 && isInsideRect(out[k]!, srcRect)) k++;
-        out = [rectBorderPoint(srcRect, out[k]!), ...out.slice(k)];
-      }
-      const tgtRect = groupRectByGid.get(target);
-      if (tgtRect) {
-        let k = out.length - 1;
-        while (k > 0 && isInsideRect(out[k]!, tgtRect)) k--;
-        out = [...out.slice(0, k + 1), rectBorderPoint(tgtRect, out[k]!)];
-      }
-      return out;
-    };
-    const edges: BLLayoutEdge[] = parsed.edges.flatMap((e) => {
-      const s = srcRep(e.source);
-      const t = tgtRep(e.target);
-      const key = edgeKey(e);
-      if (s === t || !g.hasEdge(s, t, key)) return [];
-      const ed = g.edge(s, t, key) as { points?: Pt[] };
-      const points = clipPointsToGroups(ed?.points ?? [], e.source, e.target);
-      return [
-        {
-          source: e.source,
-          target: e.target,
-          ...(e.label !== undefined && { label: e.label }),
-          bidirectional: e.bidirectional,
-          lineNumber: e.lineNumber,
-          points,
-          yOffset: 0,
-          parallelCount: 1,
-          metadata: e.metadata,
-        },
-      ];
-    });
-    const gg = g.graph() as { width?: number; height?: number };
-    return {
-      nodes,
-      edges,
-      groups,
-      width: gg.width ?? 800,
-      height: gg.height ?? 600,
-    } as BLLayoutResult;
-  }
-
-  // Pinned mode short-circuits the entire search.
-  if (allPinned) return placePinned(pinned!);
-
-  const n = parsed.nodes.length;
-  // ~500ms budget: search a larger pool, then refine the top few exactly.
-  const seedCount =
-    opts?.seeds ?? (n <= 12 ? 80 : n <= 22 ? 40 : n <= 35 ? 22 : 10);
-  const REFINE_K = opts?.refineK ?? 6;
-  const lambda = opts?.lambda ?? DEFAULT_LAMBDA;
-  const prev = opts?.previousPositions;
-
-  // Candidate configs: every (ranker × spacing) combo + seed-shuffles of the
-  // default. Diverse candidates lower the crossing floor; seed-shuffles vary
-  // dagre's within-layer ordering.
-  const RANKERS = ['network-simplex', 'tight-tree', 'longest-path'];
-  const SPACINGS = [
-    { nodesep: 50, ranksep: 60 },
-    { nodesep: 34, ranksep: 46 },
-    { nodesep: 66, ranksep: 82 },
-  ];
-  const configs: {
-    ranker: string;
-    nodesep: number;
-    ranksep: number;
-    seed?: number;
-  }[] = [];
-  for (const ranker of RANKERS)
-    for (const sp of SPACINGS) configs.push({ ranker, ...sp });
-  for (let s = 0; s < seedCount; s++)
-    configs.push({
-      ranker: 'network-simplex',
-      nodesep: 50,
-      ranksep: 60,
-      seed: s,
-    });
-
-  // Honest "badness" — every kind of line-in-the-wrong-place counts equally:
-  //   X true crossings + O overlap runs (lines stepping on each other)
-  //     + P edges piercing unrelated node boxes.
-  // (A line through a node and two lines sharing a path are crossings too.)
-  // `floor` lets callers skip the expensive O/P passes once X alone already
-  // exceeds the best badness found so far (it can't win, return Infinity).
-  const badness = (lay: BLLayoutResult, floor: number): number => {
-    const x = countSplineCrossings(lay, floor);
-    if (x > floor) return Infinity;
-    return (
-      x +
-      countEdgeOverlaps(lay) +
-      countEdgeNodePierces(lay) +
-      countGroupOverlaps(lay)
-    );
-  };
-
-  // Objective: badness dominates (×1e6, strictly fewer wins); ties broken by
-  // total edge length (positioning) + stability drift (only when prev given).
-  const objective = (lay: BLLayoutResult, viol: number) =>
-    viol * 1e6 + edgeLength(lay) + lambda * meanDrift(lay, prev) * 10;
-
-  // Progress is reported over the two dominant phases: building the dagre
-  // candidate pool, then exact-scoring the top few. `refineK` is clamped below,
-  // so estimate the total here for a smooth bar.
-  const progressTotal =
-    configs.length + Math.min(opts?.refineK ?? 6, configs.length);
-  let progressDone = 0;
-  const step = async (phase: string): Promise<void> => {
-    if (!onProgress) return;
-    onProgress(++progressDone, progressTotal, phase);
-    const now = performance.now();
-    if (
-      now - searchStart > YIELD_AFTER_MS &&
-      now - lastYield > YIELD_EVERY_MS
-    ) {
-      lastYield = now;
-      await tick();
-    }
-  };
-
-  // Build the candidate pool.
-  const pool: BLLayoutResult[] = [];
-  for (const cfg of configs) {
-    try {
-      pool.push(place(cfg));
-    } catch {
-      /* some rankers choke on odd graphs */
-    }
-    await step('Optimizing layout');
-  }
-  if (!pool.length)
-    return place({ ranker: 'network-simplex', nodesep: 50, ranksep: 60 });
-
-  // Home-grown layered candidates (flat graphs only). These own the
-  // crossing-minimization stage AND route back-edges around the periphery, so
-  // they can reach layouts below dagre's ordering+routing floor (e.g. the
-  // pirate-fleet K2,2). Their peripheral back-edges are curved loops that the
-  // cheap straight-segment ranker mis-scores, so they bypass stage-1 and are
-  // ALWAYS exact-scored in stage 2. Best-effort: never block the dagre pool.
-  let layered: BLLayoutResult[] = [];
-  try {
-    layered = layeredCandidates(parsed, sizes);
-  } catch {
-    /* ignore */
-  }
-
-  // Tier-banded grouped candidates. The dagre path treats `[Group]` containers
-  // as compound clusters with no tier ORDER and no cycle-aware routing, so
-  // tiered architecture diagrams collide bands side-by-side and balloon on
-  // back-edges. This generator orders the groups into disjoint rank bands and
-  // routes against-tier edges around the periphery. Additive — kept only on a
-  // strict badness win. Skipped when any group is collapsed (the generator
-  // models fully-expanded groups only).
-  if (parsed.groups.length > 0 && collapsedGroupLabels.size === 0) {
-    try {
-      layered = layered.concat(groupedTierCandidates(parsed, sizes));
-    } catch {
-      /* ignore */
-    }
-  }
-
-  // Stage 1: rank the dagre pool with the cheap straight-segment counter — a
-  // cheap proxy to pick which candidates are worth the expensive exact scoring.
-  // Widen REFINE_K a little since the proxy only sees crossings, not O/P.
-  // Pre-score each candidate ONCE (countCrossingsFast is O(E²)) into a key map,
-  // then sort by the stored key — the comparator otherwise recomputes the score
-  // for both operands on every comparison (O(C log C) calls vs C). The score is a
-  // pure function of the layout, so the resulting order is identical.
-  const fastKey = new Map<BLLayoutResult, number>();
-  for (const lay of pool)
-    fastKey.set(lay, objective(lay, countCrossingsFast(lay)));
-  pool.sort((a, b) => fastKey.get(a)! - fastKey.get(b)!);
-  const refineK = Math.min(REFINE_K, pool.length);
-
-  // Stage 2: exact-score the top-K dagre candidates on the FULL badness (X+O+P)
-  // and pick the best — so the placement search avoids overlaps and node-pierces,
-  // not just crossings.
-  let best = pool[0]!;
-  let bestObj = Infinity;
-  let bestBad = Infinity;
-  const consider = (lay: BLLayoutResult): void => {
-    const bad = badness(lay, bestBad);
-    if (bad === Infinity) return;
-    const sc = objective(lay, bad);
-    if (sc < bestObj) {
-      bestObj = sc;
-      bestBad = bad;
-      best = lay;
-    }
-  };
-  for (const lay of pool.slice(0, refineK)) {
-    consider(lay);
-    await step('Refining layout');
-  }
-
-  // Adaptive escalation: a still-high badness after the base seed budget means
-  // the graph is genuinely hard — dense layouts (e.g. the marketplace) need many
-  // more random restarts to stumble onto a low-crossing layer ordering, and the
-  // good ordering is rare enough that refining the existing pool can't find it
-  // (only generating fresh seeds can). Spend an extra seed batch — but ONLY when
-  // the result is actually bad, so the easy 0-badness majority of the corpus
-  // never pays the latency. Bounded by node count to keep the worst case ~1s.
-  if (bestBad >= ESCALATE_THRESHOLD && n <= ESCALATE_MAX_N) {
-    const extra: BLLayoutResult[] = [];
-    for (let s = seedCount; s < seedCount + ESCALATE_SEEDS; s++) {
-      try {
-        extra.push(
-          place({
-            ranker: 'network-simplex',
-            nodesep: 50,
-            ranksep: 60,
-            seed: s,
-          })
-        );
-      } catch {
-        /* ignore choking rankers */
-      }
-    }
-    const extraKey = new Map<BLLayoutResult, number>();
-    for (const lay of extra)
-      extraKey.set(lay, objective(lay, countCrossingsFast(lay)));
-    extra.sort((a, b) => extraKey.get(a)! - extraKey.get(b)!);
-    for (const lay of extra.slice(0, ESCALATE_REFINE)) consider(lay);
-  }
-
-  // Layered candidates (and their better-routed, de-pierced variants) replace
-  // the dagre winner ONLY on a STRICT total-badness reduction — never on an
-  // edge-length tiebreak. They're few, so de-piercing each is cheap.
-  for (const lay of layered) {
-    const variants = [lay];
-    const dp = deroutePierces(lay);
-    if (dp !== lay) variants.push(dp);
-    for (const v of variants) {
-      const bad = badness(v, bestBad - 1);
-      if (bad < bestBad) {
-        bestBad = bad;
-        best = v;
-      }
-    }
-  }
-
-  // Feed the objective one more BETTER-ROUTED alternative: bend the current
-  // winner's edges around any node they still pierce. Kept only if it strictly
-  // lowers total badness (a detour that trades a pierce for a crossing/overlap
-  // is rejected).
-  if (bestBad > 0) {
-    const rerouted = deroutePierces(best);
-    if (rerouted !== best && badness(rerouted, bestBad - 1) < bestBad)
-      best = rerouted;
-  }
-
-  // Better-placed alternative: if the winner still has overlapping group bands
-  // (dagre wedged a small group into a tight channel), push the bands apart along
-  // the cross-axis. Kept only on strict total-badness drop.
-  if (bestBad > 0 && countGroupOverlaps(best) > 0) {
-    const separated = separateGroupBands(best, parsed);
-    if (separated !== best && badness(separated, bestBad - 1) < bestBad)
-      best = separated;
-  }
-  return best;
-}