@ankhorage/zora 21.0.8 → 21.0.9

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # Changelog
 
+## 21.0.9
+
+### Patch Changes
+
+- 0d84538: Compact GraphView spacing around renderer-measured label readability bounds while preserving compound group separation.
+
 ## 21.0.8
 
 ### Patch Changes

package/README.md

@@ -3,7 +3,7 @@
 
 # @ankhorage/zora
 
-![license: MIT](././paradox/badges/license.svg) ![npm: v21.0.8](././paradox/badges/npm.svg) ![runtime: bun](././paradox/badges/runtime.svg) ![typescript: strict](././paradox/badges/typescript.svg) ![eslint: checked](././paradox/badges/eslint.svg) ![prettier: checked](././paradox/badges/prettier.svg) ![build: checked](././paradox/badges/build.svg) ![tests: checked](././paradox/badges/tests.svg) ![docs: paradox](././paradox/badges/docs.svg)
+![license: MIT](././paradox/badges/license.svg) ![npm: v21.0.9](././paradox/badges/npm.svg) ![runtime: bun](././paradox/badges/runtime.svg) ![typescript: strict](././paradox/badges/typescript.svg) ![eslint: checked](././paradox/badges/eslint.svg) ![prettier: checked](././paradox/badges/prettier.svg) ![build: checked](././paradox/badges/build.svg) ![tests: checked](././paradox/badges/tests.svg) ![docs: paradox](././paradox/badges/docs.svg)
 
 Opinionated React Native and React Native Web UI kit built on @ankhorage/surface.
 

package/dist/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.d.ts

@@ -1,10 +1,9 @@
 import type { Core } from 'cytoscape';
 /***
- * Optimize settled layout spacing uniformly until measured node and label bounds clear.
- * Compound containment is intentional; sibling and unrelated compound intersections are not.
- * @performance At most eight synchronous trials and 200,000 pair checks per trial. No layout
- * algorithm reruns, no work on zoom, and no intermediate frame is painted. Large, locked, or
- * non-uniformly overlapping views retain their original positions.
+ * Optimize settled layout spacing around readable label bounds instead of full node clearance.
+ * Compound containment stays intentional while sibling groups retain non-overlapping boundaries.
+ * @performance Cytoscape geometry is measured once, then bounded pure numeric trials reuse the
+ * immutable snapshot. No layout reruns, zoom work, or intermediate frames are painted.
  */
 export declare function compactGraphSpacing(cy: Core, spacingFactor: number): number;
 //# sourceMappingURL=compactGraphSpacing.d.ts.map

package/dist/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compactGraphSpacing.d.ts","sourceRoot":"","sources":["../../../../../../src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEtC;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CAa3E"}
+{"version":3,"file":"compactGraphSpacing.d.ts","sourceRoot":"","sources":["../../../../../../src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAgB,MAAM,WAAW,CAAC;AAQpD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CAiC3E"}

package/dist/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.js

@@ -1,68 +1,185 @@
+import { findMinimumAcceptedNumber } from '@ankhorage/utility/algorithms';
+const LABEL_OVERLAP_RATIO = 0.12;
+const MAX_EXPANSION_ATTEMPTS = 8;
+const MAX_NODE_COUNT = 2000;
+const MAX_PAIR_CHECKS = 200000;
+const SEARCH_ITERATIONS = 8;
 /***
- * Optimize settled layout spacing uniformly until measured node and label bounds clear.
- * Compound containment is intentional; sibling and unrelated compound intersections are not.
- * @performance At most eight synchronous trials and 200,000 pair checks per trial. No layout
- * algorithm reruns, no work on zoom, and no intermediate frame is painted. Large, locked, or
- * non-uniformly overlapping views retain their original positions.
+ * Optimize settled layout spacing around readable label bounds instead of full node clearance.
+ * Compound containment stays intentional while sibling groups retain non-overlapping boundaries.
+ * @performance Cytoscape geometry is measured once, then bounded pure numeric trials reuse the
+ * immutable snapshot. No layout reruns, zoom work, or intermediate frames are painted.
  */
 export function compactGraphSpacing(cy, spacingFactor) {
     const leaves = cy.nodes(':childless');
-    if (leaves.length < 2 || cy.nodes().length > 2000 || leaves.filter(':locked').length > 0)
+    if (leaves.length < 2 || cy.nodes().length > MAX_NODE_COUNT || cy.nodes(':locked').length > 0)
         return spacingFactor;
-    const ancestors = new Map(cy.nodes().map((node) => [node.id(), new Set(node.ancestors().map((parent) => parent.id()))]));
-    const positions = new Map(leaves.map((node) => [node.id(), { ...node.position() }]));
     const bounds = leaves.boundingBox();
     const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };
-    if (hasCollisions(cy, ancestors))
-        return expandGraphSpacing(cy, ancestors, center, positions, spacingFactor);
-    return compressGraphSpacing(cy, ancestors, center, positions, spacingFactor);
+    const leafGeometry = leaves.map(readLeafGeometry);
+    const groups = cy.nodes(':parent').map((node) => readGroupGeometry(node.id(), node.ancestors().map((parent) => parent.id()), node.boundingBox(), leafGeometry));
+    const accepts = (factor) => !hasUnsafeCollisions(resolveCollisionBoxes(leafGeometry, groups, center, factor));
+    const currentAccepted = accepts(1);
+    const minimum = currentAccepted ? Math.min(1, 0.1 / spacingFactor) : 1;
+    const maximum = currentAccepted ? 1 : findExpansionMaximum(accepts);
+    if (maximum === undefined)
+        return spacingFactor;
+    const factor = findMinimumAcceptedNumber({
+        minimum,
+        maximum,
+        iterations: SEARCH_ITERATIONS,
+        accepts,
+    });
+    if (factor === undefined)
+        return spacingFactor;
+    applyScale(cy, leafGeometry, center, factor);
+    return spacingFactor * factor;
 }
-/*** Compress a collision-free settled layout to its smallest measured clearance. */
-function compressGraphSpacing(cy, ancestors, center, positions, spacingFactor) {
-    const search = { low: Math.min(1, 0.1 / spacingFactor), high: 1 };
-    for (const attempt of Array.from({ length: 8 }, (_, index) => index)) {
-        const factor = attempt === 0 ? search.low : (search.low + search.high) / 2;
-        applyScale(cy, positions, center, factor);
-        if (hasCollisions(cy, ancestors))
-            search.low = factor;
-        else
-            search.high = factor;
-        if (search.high === search.low)
-            break;
-    }
-    applyScale(cy, positions, center, search.high);
-    return spacingFactor * search.high;
+/*** Read one leaf's immutable position, hierarchy and renderer-measured label geometry. */
+function readLeafGeometry(node) {
+    const nodeBox = node.boundingBox({
+        includeLabels: true,
+        includeOverlays: false,
+        includeUnderlays: false,
+    });
+    const labelBox = node.boundingBox({
+        includeNodes: false,
+        includeEdges: false,
+        includeLabels: true,
+        includeOverlays: false,
+        includeUnderlays: false,
+    });
+    return {
+        id: node.id(),
+        ancestors: new Set(node.ancestors().map((parent) => parent.id())),
+        position: { ...node.position() },
+        labelBox: isUsableBox(labelBox) ? labelBox : nodeBox,
+        nodeBox,
+    };
 }
-/*** Expand a uniformly cramped layout until measured node and label bounds clear. */
-function expandGraphSpacing(cy, ancestors, center, positions, spacingFactor) {
-    let low = 1;
-    let high = 1;
-    let attempts = 0;
-    while (attempts < 8) {
-        high *= 2;
-        attempts += 1;
-        applyScale(cy, positions, center, high);
-        if (!hasCollisions(cy, ancestors))
-            break;
-        low = high;
-    }
-    if (hasCollisions(cy, ancestors)) {
-        applyScale(cy, positions, center, 1);
-        return spacingFactor;
-    }
-    for (const _attempt of Array.from({ length: 8 - attempts }, (_, index) => index)) {
-        const factor = (low + high) / 2;
-        applyScale(cy, positions, center, factor);
-        if (hasCollisions(cy, ancestors))
-            low = factor;
-        else
-            high = factor;
+/*** Capture one compound group's descendant geometry and constant renderer-owned outer insets. */
+function readGroupGeometry(id, ancestorIds, parentBox, leaves) {
+    const descendants = leaves.filter((leaf) => leaf.ancestors.has(id));
+    const descendantUnion = unionBounds(descendants.map((leaf) => leaf.nodeBox)) ?? parentBox;
+    return {
+        id,
+        ancestors: new Set(ancestorIds),
+        descendants,
+        insets: {
+            left: Math.max(0, descendantUnion.x1 - parentBox.x1),
+            right: Math.max(0, parentBox.x2 - descendantUnion.x2),
+            top: Math.max(0, descendantUnion.y1 - parentBox.y1),
+            bottom: Math.max(0, parentBox.y2 - descendantUnion.y2),
+        },
+    };
+}
+/*** Resolve immutable label and compound boxes for one candidate uniform spacing factor. */
+function resolveCollisionBoxes(leaves, groups, center, factor) {
+    const labels = leaves.map((leaf) => ({
+        id: leaf.id,
+        ancestors: leaf.ancestors,
+        kind: 'label',
+        box: shiftBounds(leaf.labelBox, leaf.position, center, factor),
+    }));
+    const compoundBoxes = groups.flatMap((group) => {
+        const descendants = group.descendants.map((leaf) => shiftBounds(leaf.nodeBox, leaf.position, center, factor));
+        const union = unionBounds(descendants);
+        if (!union)
+            return [];
+        return [
+            {
+                id: group.id,
+                ancestors: group.ancestors,
+                kind: 'group',
+                box: expandBounds(union, group.insets),
+            },
+        ];
+    });
+    return [...labels, ...compoundBoxes];
+}
+/*** Find the first bounded expansion factor that makes the pure geometry snapshot acceptable. */
+function findExpansionMaximum(accepts) {
+    return Array.from({ length: MAX_EXPANSION_ATTEMPTS }, (_, index) => 2 ** (index + 1)).find(accepts);
+}
+/***
+ * Sweep resolved boxes by x extent and stop conservatively if the pair-check budget is exhausted.
+ * Local loop counters are intentionally mutable on this performance-critical boundary.
+ */
+function hasUnsafeCollisions(boxes) {
+    const sorted = [...boxes].sort((first, second) => first.box.x1 - second.box.x1);
+    const budget = { remaining: MAX_PAIR_CHECKS };
+    for (const [index, first] of sorted.entries()) {
+        for (let next = index + 1; next < sorted.length; next += 1) {
+            const second = sorted.at(next);
+            if (!second)
+                break;
+            if (second.box.x1 >= first.box.x2)
+                break;
+            budget.remaining -= 1;
+            if (budget.remaining < 0)
+                return true;
+            if (isIntentionalContainment(first, second))
+                continue;
+            if (isUnsafeOverlap(first, second))
+                return true;
+        }
     }
-    applyScale(cy, positions, center, high);
-    return spacingFactor * high;
+    return false;
+}
+/*** Ignore intentional compound containment while retaining sibling and unrelated separation. */
+function isIntentionalContainment(first, second) {
+    return first.ancestors.has(second.id) || second.ancestors.has(first.id);
+}
+/*** Permit only a small bounded label-label overlap; every other intersection remains unsafe. */
+function isUnsafeOverlap(first, second) {
+    const overlapWidth = Math.min(first.box.x2, second.box.x2) - Math.max(first.box.x1, second.box.x1);
+    const overlapHeight = Math.min(first.box.y2, second.box.y2) - Math.max(first.box.y1, second.box.y1);
+    if (overlapWidth <= 0 || overlapHeight <= 0)
+        return false;
+    if (first.kind !== 'label' || second.kind !== 'label')
+        return true;
+    const widthRatio = overlapWidth / Math.min(first.box.w, second.box.w);
+    const heightRatio = overlapHeight / Math.min(first.box.h, second.box.h);
+    return widthRatio > LABEL_OVERLAP_RATIO && heightRatio > LABEL_OVERLAP_RATIO;
 }
-/*** Transform leaf centers, preserving ordering, dimensions, compound membership and edge data. */
-function applyScale(cy, positions, center, factor) {
+/*** Shift one fixed renderer box with its leaf center under uniform radial scaling. */
+function shiftBounds(box, position, center, factor) {
+    const dx = (position.x - center.x) * (factor - 1);
+    const dy = (position.y - center.y) * (factor - 1);
+    return {
+        x1: box.x1 + dx,
+        y1: box.y1 + dy,
+        x2: box.x2 + dx,
+        y2: box.y2 + dy,
+        w: box.w,
+        h: box.h,
+    };
+}
+/*** Expand a descendant union by the compound renderer's measured outer insets. */
+function expandBounds(box, insets) {
+    const x1 = box.x1 - insets.left;
+    const y1 = box.y1 - insets.top;
+    const x2 = box.x2 + insets.right;
+    const y2 = box.y2 + insets.bottom;
+    return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+/*** Return the immutable union of measured boxes, or undefined for an empty collection. */
+function unionBounds(boxes) {
+    if (boxes.length === 0)
+        return undefined;
+    const x1 = Math.min(...boxes.map((box) => box.x1));
+    const y1 = Math.min(...boxes.map((box) => box.y1));
+    const x2 = Math.max(...boxes.map((box) => box.x2));
+    const y2 = Math.max(...boxes.map((box) => box.y2));
+    return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+/*** Return whether renderer measurement produced a non-empty label box. */
+function isUsableBox(box) {
+    return box.w > 0 && box.h > 0;
+}
+/*** Apply the accepted factor once, preserving node dimensions, hierarchy, ordering and edge data. */
+function applyScale(cy, leaves, center, factor) {
+    const positions = new Map(leaves.map((leaf) => [leaf.id, leaf.position]));
     cy.batch(() => {
         cy.nodes()
             .not(':parent')
@@ -75,35 +192,4 @@ function applyScale(cy, positions, center, factor) {
         });
     });
 }
-/*** Sweep measured bounds, ignoring intentional containment and stopping conservatively at budget. */
-function hasCollisions(cy, ancestors) {
-    const boxes = cy
-        .nodes()
-        .map((node) => ({
-        id: node.id(),
-        box: node.boundingBox({
-            includeLabels: true,
-            includeOverlays: false,
-            includeUnderlays: false,
-        }),
-    }))
-        .sort((a, b) => a.box.x1 - b.box.x1);
-    const budget = { remaining: 200000 };
-    for (const [index, first] of boxes.entries()) {
-        for (let next = index + 1; next < boxes.length; next += 1) {
-            const second = boxes.at(next);
-            if (!second)
-                break;
-            if (second.box.x1 >= first.box.x2 + 8)
-                break;
-            if (--budget.remaining < 0)
-                return true;
-            if (ancestors.get(first.id)?.has(second.id) || ancestors.get(second.id)?.has(first.id))
-                continue;
-            if (first.box.y1 < second.box.y2 + 8 && second.box.y1 < first.box.y2 + 8)
-                return true;
-        }
-    }
-    return false;
-}
 //# sourceMappingURL=compactGraphSpacing.js.map

package/dist/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.js.map

@@ -1 +1 @@
-{"version":3,"file":"compactGraphSpacing.js","sourceRoot":"","sources":["../../../../../../src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAQ,EAAE,aAAqB;IACjE,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC;QACtF,OAAO,aAAa,CAAC;IACvB,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,EAAE,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAC9F,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACrF,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAClF,IAAI,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC;QAC9B,OAAO,kBAAkB,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAC7E,OAAO,oBAAoB,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;AAC/E,CAAC;AAED,oFAAoF;AACpF,SAAS,oBAAoB,CAC3B,EAAQ,EACR,SAAmD,EACnD,MAAgC,EAChC,SAAwD,EACxD,aAAqB;IAErB,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAClE,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACrE,MAAM,MAAM,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3E,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC1C,IAAI,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC;YAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC;;YACjD,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC;QAC1B,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,GAAG;YAAE,MAAM;IACxC,CAAC;IACD,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/C,OAAO,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC;AACrC,CAAC;AAED,qFAAqF;AACrF,SAAS,kBAAkB,CACzB,EAAQ,EACR,SAAmD,EACnD,MAAgC,EAChC,SAAwD,EACxD,aAAqB;IAErB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC;QACV,QAAQ,IAAI,CAAC,CAAC;QACd,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC;YAAE,MAAM;QACzC,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,IAAI,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC;QACjC,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QACrC,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACjF,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC1C,IAAI,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC;YAAE,GAAG,GAAG,MAAM,CAAC;;YAC1C,IAAI,GAAG,MAAM,CAAC;IACrB,CAAC;IACD,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACxC,OAAO,aAAa,GAAG,IAAI,CAAC;AAC9B,CAAC;AAED,mGAAmG;AACnG,SAAS,UAAU,CACjB,EAAQ,EACR,SAAwD,EACxD,MAAgC,EAChC,MAAc;IAEd,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE;QACZ,EAAE,CAAC,KAAK,EAAE;aACP,GAAG,CAAC,SAAS,CAAC;aACd,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YAClB,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7D,OAAO;gBACL,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;gBAC9C,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;aAC/C,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACL,CAAC;AAED,sGAAsG;AACtG,SAAS,aAAa,CAAC,EAAQ,EAAE,SAAmD;IAClF,MAAM,KAAK,GAAG,EAAE;SACb,KAAK,EAAE;SACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE;QACb,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC;YACpB,aAAa,EAAE,IAAI;YACnB,eAAe,EAAE,KAAK;YACtB,gBAAgB,EAAE,KAAK;SACxB,CAAC;KACH,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;YAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,MAAM;gBAAE,MAAM;YACnB,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBAAE,MAAM;YAC7C,IAAI,EAAE,MAAM,CAAC,SAAS,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;YACxC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpF,SAAS;YACX,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;QACxF,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["import type { Core } from 'cytoscape';\n\n/***\n * Optimize settled layout spacing uniformly until measured node and label bounds clear.\n * Compound containment is intentional; sibling and unrelated compound intersections are not.\n * @performance At most eight synchronous trials and 200,000 pair checks per trial. No layout\n * algorithm reruns, no work on zoom, and no intermediate frame is painted. Large, locked, or\n * non-uniformly overlapping views retain their original positions.\n */\nexport function compactGraphSpacing(cy: Core, spacingFactor: number): number {\n  const leaves = cy.nodes(':childless');\n  if (leaves.length < 2 || cy.nodes().length > 2000 || leaves.filter(':locked').length > 0)\n    return spacingFactor;\n  const ancestors = new Map(\n    cy.nodes().map((node) => [node.id(), new Set(node.ancestors().map((parent) => parent.id()))]),\n  );\n  const positions = new Map(leaves.map((node) => [node.id(), { ...node.position() }]));\n  const bounds = leaves.boundingBox();\n  const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };\n  if (hasCollisions(cy, ancestors))\n    return expandGraphSpacing(cy, ancestors, center, positions, spacingFactor);\n  return compressGraphSpacing(cy, ancestors, center, positions, spacingFactor);\n}\n\n/*** Compress a collision-free settled layout to its smallest measured clearance. */\nfunction compressGraphSpacing(\n  cy: Core,\n  ancestors: ReadonlyMap<string, ReadonlySet<string>>,\n  center: { x: number; y: number },\n  positions: ReadonlyMap<string, { x: number; y: number }>,\n  spacingFactor: number,\n): number {\n  const search = { low: Math.min(1, 0.1 / spacingFactor), high: 1 };\n  for (const attempt of Array.from({ length: 8 }, (_, index) => index)) {\n    const factor = attempt === 0 ? search.low : (search.low + search.high) / 2;\n    applyScale(cy, positions, center, factor);\n    if (hasCollisions(cy, ancestors)) search.low = factor;\n    else search.high = factor;\n    if (search.high === search.low) break;\n  }\n  applyScale(cy, positions, center, search.high);\n  return spacingFactor * search.high;\n}\n\n/*** Expand a uniformly cramped layout until measured node and label bounds clear. */\nfunction expandGraphSpacing(\n  cy: Core,\n  ancestors: ReadonlyMap<string, ReadonlySet<string>>,\n  center: { x: number; y: number },\n  positions: ReadonlyMap<string, { x: number; y: number }>,\n  spacingFactor: number,\n): number {\n  let low = 1;\n  let high = 1;\n  let attempts = 0;\n  while (attempts < 8) {\n    high *= 2;\n    attempts += 1;\n    applyScale(cy, positions, center, high);\n    if (!hasCollisions(cy, ancestors)) break;\n    low = high;\n  }\n  if (hasCollisions(cy, ancestors)) {\n    applyScale(cy, positions, center, 1);\n    return spacingFactor;\n  }\n  for (const _attempt of Array.from({ length: 8 - attempts }, (_, index) => index)) {\n    const factor = (low + high) / 2;\n    applyScale(cy, positions, center, factor);\n    if (hasCollisions(cy, ancestors)) low = factor;\n    else high = factor;\n  }\n  applyScale(cy, positions, center, high);\n  return spacingFactor * high;\n}\n\n/*** Transform leaf centers, preserving ordering, dimensions, compound membership and edge data. */\nfunction applyScale(\n  cy: Core,\n  positions: ReadonlyMap<string, { x: number; y: number }>,\n  center: { x: number; y: number },\n  factor: number,\n) {\n  cy.batch(() => {\n    cy.nodes()\n      .not(':parent')\n      .positions((node) => {\n        const original = positions.get(node.id()) ?? node.position();\n        return {\n          x: center.x + (original.x - center.x) * factor,\n          y: center.y + (original.y - center.y) * factor,\n        };\n      });\n  });\n}\n\n/*** Sweep measured bounds, ignoring intentional containment and stopping conservatively at budget. */\nfunction hasCollisions(cy: Core, ancestors: ReadonlyMap<string, ReadonlySet<string>>): boolean {\n  const boxes = cy\n    .nodes()\n    .map((node) => ({\n      id: node.id(),\n      box: node.boundingBox({\n        includeLabels: true,\n        includeOverlays: false,\n        includeUnderlays: false,\n      }),\n    }))\n    .sort((a, b) => a.box.x1 - b.box.x1);\n  const budget = { remaining: 200000 };\n  for (const [index, first] of boxes.entries()) {\n    for (let next = index + 1; next < boxes.length; next += 1) {\n      const second = boxes.at(next);\n      if (!second) break;\n      if (second.box.x1 >= first.box.x2 + 8) break;\n      if (--budget.remaining < 0) return true;\n      if (ancestors.get(first.id)?.has(second.id) || ancestors.get(second.id)?.has(first.id))\n        continue;\n      if (first.box.y1 < second.box.y2 + 8 && second.box.y1 < first.box.y2 + 8) return true;\n    }\n  }\n  return false;\n}\n"]}
+{"version":3,"file":"compactGraphSpacing.js","sourceRoot":"","sources":["../../../../../../src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,yBAAyB,EAAE,MAAM,+BAA+B,CAAC;AAG1E,MAAM,mBAAmB,GAAG,IAAI,CAAC;AACjC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACjC,MAAM,cAAc,GAAG,IAAI,CAAC;AAC5B,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAQ,EAAE,aAAqB;IACjE,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,cAAc,IAAI,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC;QAC3F,OAAO,aAAa,CAAC;IAEvB,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IAClF,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC9C,iBAAiB,CACf,IAAI,CAAC,EAAE,EAAE,EACT,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAC7C,IAAI,CAAC,WAAW,EAAE,EAClB,YAAY,CACb,CACF,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,EAAE,CACjC,CAAC,mBAAmB,CAAC,qBAAqB,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;IACpE,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,aAAa,CAAC;IAEhD,MAAM,MAAM,GAAG,yBAAyB,CAAC;QACvC,OAAO;QACP,OAAO;QACP,UAAU,EAAE,iBAAiB;QAC7B,OAAO;KACR,CAAC,CAAC;IACH,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,aAAa,CAAC;IAE/C,UAAU,CAAC,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,OAAO,aAAa,GAAG,MAAM,CAAC;AAChC,CAAC;AA6CD,2FAA2F;AAC3F,SAAS,gBAAgB,CAAC,IAAkB;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;QAC/B,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,KAAK;QACtB,gBAAgB,EAAE,KAAK;KACxB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAChC,YAAY,EAAE,KAAK;QACnB,YAAY,EAAE,KAAK;QACnB,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,KAAK;QACtB,gBAAgB,EAAE,KAAK;KACxB,CAAC,CAAC;IACH,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE;QACb,SAAS,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QACjE,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE;QAChC,QAAQ,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO;QACpD,OAAO;KACR,CAAC;AACJ,CAAC;AAED,kGAAkG;AAClG,SAAS,iBAAiB,CACxB,EAAU,EACV,WAA8B,EAC9B,SAAiB,EACjB,MAA+B;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,MAAM,eAAe,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,SAAS,CAAC;IAC1F,OAAO;QACL,EAAE;QACF,SAAS,EAAE,IAAI,GAAG,CAAC,WAAW,CAAC;QAC/B,WAAW;QACX,MAAM,EAAE;YACN,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;YACpD,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,eAAe,CAAC,EAAE,CAAC;YACrD,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC;YACnD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,eAAe,CAAC,EAAE,CAAC;SACvD;KACF,CAAC;AACJ,CAAC;AAED,4FAA4F;AAC5F,SAAS,qBAAqB,CAC5B,MAA+B,EAC/B,MAAgC,EAChC,MAAa,EACb,MAAc;IAEd,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnC,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,IAAI,EAAE,OAAgB;QACtB,GAAG,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC;KAC/D,CAAC,CAAC,CAAC;IACJ,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7C,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACjD,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,CACzD,CAAC;QACF,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,OAAO;YACL;gBACE,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,IAAI,EAAE,OAAgB;gBACtB,GAAG,EAAE,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC;aACvC;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,GAAG,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC;AACvC,CAAC;AAED,iGAAiG;AACjG,SAAS,oBAAoB,CAAC,OAAoC;IAChE,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,sBAAsB,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CACxF,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,KAA8B;IACzD,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,MAAM,GAAG,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;YAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM;gBAAE,MAAM;YACnB,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;gBAAE,MAAM;YACzC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;YACtB,IAAI,MAAM,CAAC,SAAS,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;YACtC,IAAI,wBAAwB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,SAAS;YACtD,IAAI,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iGAAiG;AACjG,SAAS,wBAAwB,CAAC,KAAmB,EAAE,MAAoB;IACzE,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,iGAAiG;AACjG,SAAS,eAAe,CAAC,KAAmB,EAAE,MAAoB;IAChE,MAAM,YAAY,GAChB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,aAAa,GACjB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChF,IAAI,YAAY,IAAI,CAAC,IAAI,aAAa,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1D,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IACnE,MAAM,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,WAAW,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,OAAO,UAAU,GAAG,mBAAmB,IAAI,WAAW,GAAG,mBAAmB,CAAC;AAC/E,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,GAAW,EAAE,QAAe,EAAE,MAAa,EAAE,MAAc;IAC9E,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClD,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE;QACf,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE;QACf,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE;QACf,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE;QACf,CAAC,EAAE,GAAG,CAAC,CAAC;QACR,CAAC,EAAE,GAAG,CAAC,CAAC;KACT,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,GAAW,EAAE,MAAc;IAC/C,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IAChC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC;IAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC;IACjC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;IAClC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;AACpD,CAAC;AAED,2FAA2F;AAC3F,SAAS,WAAW,CAAC,KAAwB;IAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;AACpD,CAAC;AAED,2EAA2E;AAC3E,SAAS,WAAW,CAAC,GAAW;IAC9B,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,sGAAsG;AACtG,SAAS,UAAU,CACjB,EAAQ,EACR,MAA+B,EAC/B,MAAa,EACb,MAAc;IAEd,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1E,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE;QACZ,EAAE,CAAC,KAAK,EAAE;aACP,GAAG,CAAC,SAAS,CAAC;aACd,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YAClB,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7D,OAAO;gBACL,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;gBAC9C,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;aAC/C,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { findMinimumAcceptedNumber } from '@ankhorage/utility/algorithms';\nimport type { Core, NodeSingular } from 'cytoscape';\n\nconst LABEL_OVERLAP_RATIO = 0.12;\nconst MAX_EXPANSION_ATTEMPTS = 8;\nconst MAX_NODE_COUNT = 2000;\nconst MAX_PAIR_CHECKS = 200000;\nconst SEARCH_ITERATIONS = 8;\n\n/***\n * Optimize settled layout spacing around readable label bounds instead of full node clearance.\n * Compound containment stays intentional while sibling groups retain non-overlapping boundaries.\n * @performance Cytoscape geometry is measured once, then bounded pure numeric trials reuse the\n * immutable snapshot. No layout reruns, zoom work, or intermediate frames are painted.\n */\nexport function compactGraphSpacing(cy: Core, spacingFactor: number): number {\n  const leaves = cy.nodes(':childless');\n  if (leaves.length < 2 || cy.nodes().length > MAX_NODE_COUNT || cy.nodes(':locked').length > 0)\n    return spacingFactor;\n\n  const bounds = leaves.boundingBox();\n  const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };\n  const leafGeometry = leaves.map(readLeafGeometry);\n  const groups = cy.nodes(':parent').map((node) =>\n    readGroupGeometry(\n      node.id(),\n      node.ancestors().map((parent) => parent.id()),\n      node.boundingBox(),\n      leafGeometry,\n    ),\n  );\n  const accepts = (factor: number) =>\n    !hasUnsafeCollisions(resolveCollisionBoxes(leafGeometry, groups, center, factor));\n  const currentAccepted = accepts(1);\n  const minimum = currentAccepted ? Math.min(1, 0.1 / spacingFactor) : 1;\n  const maximum = currentAccepted ? 1 : findExpansionMaximum(accepts);\n  if (maximum === undefined) return spacingFactor;\n\n  const factor = findMinimumAcceptedNumber({\n    minimum,\n    maximum,\n    iterations: SEARCH_ITERATIONS,\n    accepts,\n  });\n  if (factor === undefined) return spacingFactor;\n\n  applyScale(cy, leafGeometry, center, factor);\n  return spacingFactor * factor;\n}\n\ninterface Point {\n  readonly x: number;\n  readonly y: number;\n}\n\ninterface Bounds {\n  readonly x1: number;\n  readonly y1: number;\n  readonly x2: number;\n  readonly y2: number;\n  readonly w: number;\n  readonly h: number;\n}\n\ninterface Insets {\n  readonly left: number;\n  readonly right: number;\n  readonly top: number;\n  readonly bottom: number;\n}\n\ninterface LeafGeometry {\n  readonly id: string;\n  readonly ancestors: ReadonlySet<string>;\n  readonly position: Point;\n  readonly labelBox: Bounds;\n  readonly nodeBox: Bounds;\n}\n\ninterface GroupGeometry {\n  readonly id: string;\n  readonly ancestors: ReadonlySet<string>;\n  readonly descendants: readonly LeafGeometry[];\n  readonly insets: Insets;\n}\n\ninterface CollisionBox {\n  readonly id: string;\n  readonly ancestors: ReadonlySet<string>;\n  readonly kind: 'label' | 'group';\n  readonly box: Bounds;\n}\n\n/*** Read one leaf's immutable position, hierarchy and renderer-measured label geometry. */\nfunction readLeafGeometry(node: NodeSingular): LeafGeometry {\n  const nodeBox = node.boundingBox({\n    includeLabels: true,\n    includeOverlays: false,\n    includeUnderlays: false,\n  });\n  const labelBox = node.boundingBox({\n    includeNodes: false,\n    includeEdges: false,\n    includeLabels: true,\n    includeOverlays: false,\n    includeUnderlays: false,\n  });\n  return {\n    id: node.id(),\n    ancestors: new Set(node.ancestors().map((parent) => parent.id())),\n    position: { ...node.position() },\n    labelBox: isUsableBox(labelBox) ? labelBox : nodeBox,\n    nodeBox,\n  };\n}\n\n/*** Capture one compound group's descendant geometry and constant renderer-owned outer insets. */\nfunction readGroupGeometry(\n  id: string,\n  ancestorIds: readonly string[],\n  parentBox: Bounds,\n  leaves: readonly LeafGeometry[],\n): GroupGeometry {\n  const descendants = leaves.filter((leaf) => leaf.ancestors.has(id));\n  const descendantUnion = unionBounds(descendants.map((leaf) => leaf.nodeBox)) ?? parentBox;\n  return {\n    id,\n    ancestors: new Set(ancestorIds),\n    descendants,\n    insets: {\n      left: Math.max(0, descendantUnion.x1 - parentBox.x1),\n      right: Math.max(0, parentBox.x2 - descendantUnion.x2),\n      top: Math.max(0, descendantUnion.y1 - parentBox.y1),\n      bottom: Math.max(0, parentBox.y2 - descendantUnion.y2),\n    },\n  };\n}\n\n/*** Resolve immutable label and compound boxes for one candidate uniform spacing factor. */\nfunction resolveCollisionBoxes(\n  leaves: readonly LeafGeometry[],\n  groups: readonly GroupGeometry[],\n  center: Point,\n  factor: number,\n): readonly CollisionBox[] {\n  const labels = leaves.map((leaf) => ({\n    id: leaf.id,\n    ancestors: leaf.ancestors,\n    kind: 'label' as const,\n    box: shiftBounds(leaf.labelBox, leaf.position, center, factor),\n  }));\n  const compoundBoxes = groups.flatMap((group) => {\n    const descendants = group.descendants.map((leaf) =>\n      shiftBounds(leaf.nodeBox, leaf.position, center, factor),\n    );\n    const union = unionBounds(descendants);\n    if (!union) return [];\n    return [\n      {\n        id: group.id,\n        ancestors: group.ancestors,\n        kind: 'group' as const,\n        box: expandBounds(union, group.insets),\n      },\n    ];\n  });\n  return [...labels, ...compoundBoxes];\n}\n\n/*** Find the first bounded expansion factor that makes the pure geometry snapshot acceptable. */\nfunction findExpansionMaximum(accepts: (factor: number) => boolean): number | undefined {\n  return Array.from({ length: MAX_EXPANSION_ATTEMPTS }, (_, index) => 2 ** (index + 1)).find(\n    accepts,\n  );\n}\n\n/***\n * Sweep resolved boxes by x extent and stop conservatively if the pair-check budget is exhausted.\n * Local loop counters are intentionally mutable on this performance-critical boundary.\n */\nfunction hasUnsafeCollisions(boxes: readonly CollisionBox[]): boolean {\n  const sorted = [...boxes].sort((first, second) => first.box.x1 - second.box.x1);\n  const budget = { remaining: MAX_PAIR_CHECKS };\n  for (const [index, first] of sorted.entries()) {\n    for (let next = index + 1; next < sorted.length; next += 1) {\n      const second = sorted.at(next);\n      if (!second) break;\n      if (second.box.x1 >= first.box.x2) break;\n      budget.remaining -= 1;\n      if (budget.remaining < 0) return true;\n      if (isIntentionalContainment(first, second)) continue;\n      if (isUnsafeOverlap(first, second)) return true;\n    }\n  }\n  return false;\n}\n\n/*** Ignore intentional compound containment while retaining sibling and unrelated separation. */\nfunction isIntentionalContainment(first: CollisionBox, second: CollisionBox): boolean {\n  return first.ancestors.has(second.id) || second.ancestors.has(first.id);\n}\n\n/*** Permit only a small bounded label-label overlap; every other intersection remains unsafe. */\nfunction isUnsafeOverlap(first: CollisionBox, second: CollisionBox): boolean {\n  const overlapWidth =\n    Math.min(first.box.x2, second.box.x2) - Math.max(first.box.x1, second.box.x1);\n  const overlapHeight =\n    Math.min(first.box.y2, second.box.y2) - Math.max(first.box.y1, second.box.y1);\n  if (overlapWidth <= 0 || overlapHeight <= 0) return false;\n  if (first.kind !== 'label' || second.kind !== 'label') return true;\n  const widthRatio = overlapWidth / Math.min(first.box.w, second.box.w);\n  const heightRatio = overlapHeight / Math.min(first.box.h, second.box.h);\n  return widthRatio > LABEL_OVERLAP_RATIO && heightRatio > LABEL_OVERLAP_RATIO;\n}\n\n/*** Shift one fixed renderer box with its leaf center under uniform radial scaling. */\nfunction shiftBounds(box: Bounds, position: Point, center: Point, factor: number): Bounds {\n  const dx = (position.x - center.x) * (factor - 1);\n  const dy = (position.y - center.y) * (factor - 1);\n  return {\n    x1: box.x1 + dx,\n    y1: box.y1 + dy,\n    x2: box.x2 + dx,\n    y2: box.y2 + dy,\n    w: box.w,\n    h: box.h,\n  };\n}\n\n/*** Expand a descendant union by the compound renderer's measured outer insets. */\nfunction expandBounds(box: Bounds, insets: Insets): Bounds {\n  const x1 = box.x1 - insets.left;\n  const y1 = box.y1 - insets.top;\n  const x2 = box.x2 + insets.right;\n  const y2 = box.y2 + insets.bottom;\n  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };\n}\n\n/*** Return the immutable union of measured boxes, or undefined for an empty collection. */\nfunction unionBounds(boxes: readonly Bounds[]): Bounds | undefined {\n  if (boxes.length === 0) return undefined;\n  const x1 = Math.min(...boxes.map((box) => box.x1));\n  const y1 = Math.min(...boxes.map((box) => box.y1));\n  const x2 = Math.max(...boxes.map((box) => box.x2));\n  const y2 = Math.max(...boxes.map((box) => box.y2));\n  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };\n}\n\n/*** Return whether renderer measurement produced a non-empty label box. */\nfunction isUsableBox(box: Bounds): boolean {\n  return box.w > 0 && box.h > 0;\n}\n\n/*** Apply the accepted factor once, preserving node dimensions, hierarchy, ordering and edge data. */\nfunction applyScale(\n  cy: Core,\n  leaves: readonly LeafGeometry[],\n  center: Point,\n  factor: number,\n): void {\n  const positions = new Map(leaves.map((leaf) => [leaf.id, leaf.position]));\n  cy.batch(() => {\n    cy.nodes()\n      .not(':parent')\n      .positions((node) => {\n        const original = positions.get(node.id()) ?? node.position();\n        return {\n          x: center.x + (original.x - center.x) * factor,\n          y: center.y + (original.y - center.y) * factor,\n        };\n      });\n  });\n}\n"]}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@ankhorage/zora",
   "type": "module",
-  "version": "21.0.8",
+  "version": "21.0.9",
   "description": "Opinionated React Native and React Native Web UI kit built on @ankhorage/surface.",
   "homepage": "https://github.com/ankhorage/zora#readme",
   "bugs": {

package/src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.test.ts

@@ -1,59 +1,66 @@
 import { expect, test } from 'bun:test';
-import cytoscape from 'cytoscape';
+import cytoscape, { type NodeSingular } from 'cytoscape';
 
 import { compactGraphSpacing } from './compactGraphSpacing';
 
-test('compacts the settled layout up to measured clearance without changing node sizes or edges', () => {
+test('compacts around measured labels while allowing node backgrounds to overlap', () => {
   const cy = cytoscape({
     headless: true,
     styleEnabled: true,
     layout: { name: 'preset' },
     elements: [
       { data: { id: 'a' }, position: { x: 0, y: 0 } },
-      { data: { id: 'b' }, position: { x: 500, y: 0 } },
+      { data: { id: 'b' }, position: { x: 200, y: 0 } },
       { data: { id: 'e', source: 'a', target: 'b', weight: 7 } },
     ],
     style: [{ selector: 'node', style: { width: 100, height: 40, padding: '0px' } }],
   });
   try {
+    const a = cy.getElementById('a');
+    const b = cy.getElementById('b');
+    installMeasuredLabelBox(a, 40, 20);
+    installMeasuredLabelBox(b, 40, 20);
+
     const factor = compactGraphSpacing(cy, 1);
-    expect(factor).toBeLessThan(0.3);
-    expect(factor).toBeGreaterThan(0.2);
-    const a = cy.getElementById('a').boundingBox();
-    const b = cy.getElementById('b').boundingBox();
-    expect(b.x1 - a.x2).toBeGreaterThanOrEqual(8);
-    expect(cy.edges().length).toBe(1);
+    expect(factor).toBeGreaterThan(0.17);
+    expect(factor).toBeLessThan(0.19);
+    expect(b.boundingBox().x1 - a.boundingBox().x2).toBeLessThan(0);
+
+    const labelA = readLabelBox(a);
+    const labelB = readLabelBox(b);
+    const overlap = Math.min(labelA.x2, labelB.x2) - Math.max(labelA.x1, labelB.x1);
+    expect(overlap).toBeGreaterThan(0);
+    expect(overlap).toBeLessThanOrEqual(40 * 0.12 + 0.2);
     expect(cy.edges()[0].data('weight')).toBe(7);
-    expect(cy.getElementById('a').width()).toBe(100);
-    // A second bounded search may refine the first interval, but cannot cross the clearance.
-    const refined = compactGraphSpacing(cy, factor);
-    expect(factor - refined).toBeLessThan(1 / 128);
-    expect(
-      cy.getElementById('b').boundingBox().x1 - cy.getElementById('a').boundingBox().x2,
-    ).toBeGreaterThanOrEqual(8);
+    expect(a.width()).toBe(100);
   } finally {
     cy.destroy();
   }
 });
 
-test('expands a uniformly cramped layout to measured clearance', () => {
+test('expands a uniformly cramped layout only until measured labels are readable', () => {
   const cy = cytoscape({
     headless: true,
     styleEnabled: true,
     layout: { name: 'preset' },
     elements: [
       { data: { id: 'a' }, position: { x: 0, y: 0 } },
-      { data: { id: 'b' }, position: { x: 50, y: 0 } },
+      { data: { id: 'b' }, position: { x: 20, y: 0 } },
     ],
     style: [{ selector: 'node', style: { width: 100, height: 40, padding: '0px' } }],
   });
   try {
+    installMeasuredLabelBox(cy.getElementById('a'), 40, 20);
+    installMeasuredLabelBox(cy.getElementById('b'), 40, 20);
+
     const factor = compactGraphSpacing(cy, 0.1);
-    expect(factor).toBeGreaterThan(0.2);
-    expect(factor).toBeLessThan(0.3);
-    const a = cy.getElementById('a').boundingBox();
-    const b = cy.getElementById('b').boundingBox();
-    expect(b.x1 - a.x2).toBeGreaterThanOrEqual(8);
+    expect(factor).toBeGreaterThan(0.17);
+    expect(factor).toBeLessThan(0.19);
+    const labelA = readLabelBox(cy.getElementById('a'));
+    const labelB = readLabelBox(cy.getElementById('b'));
+    expect(Math.min(labelA.x2, labelB.x2) - Math.max(labelA.x1, labelB.x1)).toBeLessThanOrEqual(
+      40 * 0.12 + 0.2,
+    );
   } finally {
     cy.destroy();
   }
@@ -78,7 +85,7 @@ test('preserves locked or non-uniformly overlapping views', () => {
   }
 });
 
-test('allows parent-child containment but preserves separation between compound groups', () => {
+test('allows parent-child containment but keeps compound peer groups separated', () => {
   const cy = cytoscape({
     headless: true,
     styleEnabled: true,
@@ -94,9 +101,37 @@ test('allows parent-child containment but preserves separation between compound
     expect(compactGraphSpacing(cy, 1)).toBeLessThan(1);
     expect(
       cy.getElementById('q').boundingBox().x1 - cy.getElementById('p').boundingBox().x2,
-    ).toBeGreaterThanOrEqual(8);
+    ).toBeGreaterThanOrEqual(0);
     expect(cy.getElementById('p.a').data('parent')).toBe('p');
   } finally {
     cy.destroy();
   }
 });
+
+/*** Install a dynamic renderer-style label box for headless Cytoscape tests. */
+function installMeasuredLabelBox(node: NodeSingular, width: number, height: number): void {
+  const originalBoundingBox = node.boundingBox.bind(node);
+  node.boundingBox = (options) => {
+    if (options?.includeNodes !== false) return originalBoundingBox(options);
+    const position = node.position();
+    return {
+      x1: position.x - width / 2,
+      y1: position.y - height / 2,
+      x2: position.x + width / 2,
+      y2: position.y + height / 2,
+      w: width,
+      h: height,
+    };
+  };
+}
+
+/*** Read only the renderer-measured label box from one test node. */
+function readLabelBox(node: NodeSingular) {
+  return node.boundingBox({
+    includeNodes: false,
+    includeEdges: false,
+    includeLabels: true,
+    includeOverlays: false,
+    includeUnderlays: false,
+  });
+}

package/src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts

@@ -1,86 +1,264 @@
-import type { Core } from 'cytoscape';
+import { findMinimumAcceptedNumber } from '@ankhorage/utility/algorithms';
+import type { Core, NodeSingular } from 'cytoscape';
+
+const LABEL_OVERLAP_RATIO = 0.12;
+const MAX_EXPANSION_ATTEMPTS = 8;
+const MAX_NODE_COUNT = 2000;
+const MAX_PAIR_CHECKS = 200000;
+const SEARCH_ITERATIONS = 8;
 
 /***
- * Optimize settled layout spacing uniformly until measured node and label bounds clear.
- * Compound containment is intentional; sibling and unrelated compound intersections are not.
- * @performance At most eight synchronous trials and 200,000 pair checks per trial. No layout
- * algorithm reruns, no work on zoom, and no intermediate frame is painted. Large, locked, or
- * non-uniformly overlapping views retain their original positions.
+ * Optimize settled layout spacing around readable label bounds instead of full node clearance.
+ * Compound containment stays intentional while sibling groups retain non-overlapping boundaries.
+ * @performance Cytoscape geometry is measured once, then bounded pure numeric trials reuse the
+ * immutable snapshot. No layout reruns, zoom work, or intermediate frames are painted.
  */
 export function compactGraphSpacing(cy: Core, spacingFactor: number): number {
   const leaves = cy.nodes(':childless');
-  if (leaves.length < 2 || cy.nodes().length > 2000 || leaves.filter(':locked').length > 0)
+  if (leaves.length < 2 || cy.nodes().length > MAX_NODE_COUNT || cy.nodes(':locked').length > 0)
     return spacingFactor;
-  const ancestors = new Map(
-    cy.nodes().map((node) => [node.id(), new Set(node.ancestors().map((parent) => parent.id()))]),
-  );
-  const positions = new Map(leaves.map((node) => [node.id(), { ...node.position() }]));
+
   const bounds = leaves.boundingBox();
   const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };
-  if (hasCollisions(cy, ancestors))
-    return expandGraphSpacing(cy, ancestors, center, positions, spacingFactor);
-  return compressGraphSpacing(cy, ancestors, center, positions, spacingFactor);
+  const leafGeometry = leaves.map(readLeafGeometry);
+  const groups = cy.nodes(':parent').map((node) =>
+    readGroupGeometry(
+      node.id(),
+      node.ancestors().map((parent) => parent.id()),
+      node.boundingBox(),
+      leafGeometry,
+    ),
+  );
+  const accepts = (factor: number) =>
+    !hasUnsafeCollisions(resolveCollisionBoxes(leafGeometry, groups, center, factor));
+  const currentAccepted = accepts(1);
+  const minimum = currentAccepted ? Math.min(1, 0.1 / spacingFactor) : 1;
+  const maximum = currentAccepted ? 1 : findExpansionMaximum(accepts);
+  if (maximum === undefined) return spacingFactor;
+
+  const factor = findMinimumAcceptedNumber({
+    minimum,
+    maximum,
+    iterations: SEARCH_ITERATIONS,
+    accepts,
+  });
+  if (factor === undefined) return spacingFactor;
+
+  applyScale(cy, leafGeometry, center, factor);
+  return spacingFactor * factor;
 }
 
-/*** Compress a collision-free settled layout to its smallest measured clearance. */
-function compressGraphSpacing(
-  cy: Core,
-  ancestors: ReadonlyMap<string, ReadonlySet<string>>,
-  center: { x: number; y: number },
-  positions: ReadonlyMap<string, { x: number; y: number }>,
-  spacingFactor: number,
-): number {
-  const search = { low: Math.min(1, 0.1 / spacingFactor), high: 1 };
-  for (const attempt of Array.from({ length: 8 }, (_, index) => index)) {
-    const factor = attempt === 0 ? search.low : (search.low + search.high) / 2;
-    applyScale(cy, positions, center, factor);
-    if (hasCollisions(cy, ancestors)) search.low = factor;
-    else search.high = factor;
-    if (search.high === search.low) break;
-  }
-  applyScale(cy, positions, center, search.high);
-  return spacingFactor * search.high;
+interface Point {
+  readonly x: number;
+  readonly y: number;
 }
 
-/*** Expand a uniformly cramped layout until measured node and label bounds clear. */
-function expandGraphSpacing(
-  cy: Core,
-  ancestors: ReadonlyMap<string, ReadonlySet<string>>,
-  center: { x: number; y: number },
-  positions: ReadonlyMap<string, { x: number; y: number }>,
-  spacingFactor: number,
-): number {
-  let low = 1;
-  let high = 1;
-  let attempts = 0;
-  while (attempts < 8) {
-    high *= 2;
-    attempts += 1;
-    applyScale(cy, positions, center, high);
-    if (!hasCollisions(cy, ancestors)) break;
-    low = high;
-  }
-  if (hasCollisions(cy, ancestors)) {
-    applyScale(cy, positions, center, 1);
-    return spacingFactor;
-  }
-  for (const _attempt of Array.from({ length: 8 - attempts }, (_, index) => index)) {
-    const factor = (low + high) / 2;
-    applyScale(cy, positions, center, factor);
-    if (hasCollisions(cy, ancestors)) low = factor;
-    else high = factor;
+interface Bounds {
+  readonly x1: number;
+  readonly y1: number;
+  readonly x2: number;
+  readonly y2: number;
+  readonly w: number;
+  readonly h: number;
+}
+
+interface Insets {
+  readonly left: number;
+  readonly right: number;
+  readonly top: number;
+  readonly bottom: number;
+}
+
+interface LeafGeometry {
+  readonly id: string;
+  readonly ancestors: ReadonlySet<string>;
+  readonly position: Point;
+  readonly labelBox: Bounds;
+  readonly nodeBox: Bounds;
+}
+
+interface GroupGeometry {
+  readonly id: string;
+  readonly ancestors: ReadonlySet<string>;
+  readonly descendants: readonly LeafGeometry[];
+  readonly insets: Insets;
+}
+
+interface CollisionBox {
+  readonly id: string;
+  readonly ancestors: ReadonlySet<string>;
+  readonly kind: 'label' | 'group';
+  readonly box: Bounds;
+}
+
+/*** Read one leaf's immutable position, hierarchy and renderer-measured label geometry. */
+function readLeafGeometry(node: NodeSingular): LeafGeometry {
+  const nodeBox = node.boundingBox({
+    includeLabels: true,
+    includeOverlays: false,
+    includeUnderlays: false,
+  });
+  const labelBox = node.boundingBox({
+    includeNodes: false,
+    includeEdges: false,
+    includeLabels: true,
+    includeOverlays: false,
+    includeUnderlays: false,
+  });
+  return {
+    id: node.id(),
+    ancestors: new Set(node.ancestors().map((parent) => parent.id())),
+    position: { ...node.position() },
+    labelBox: isUsableBox(labelBox) ? labelBox : nodeBox,
+    nodeBox,
+  };
+}
+
+/*** Capture one compound group's descendant geometry and constant renderer-owned outer insets. */
+function readGroupGeometry(
+  id: string,
+  ancestorIds: readonly string[],
+  parentBox: Bounds,
+  leaves: readonly LeafGeometry[],
+): GroupGeometry {
+  const descendants = leaves.filter((leaf) => leaf.ancestors.has(id));
+  const descendantUnion = unionBounds(descendants.map((leaf) => leaf.nodeBox)) ?? parentBox;
+  return {
+    id,
+    ancestors: new Set(ancestorIds),
+    descendants,
+    insets: {
+      left: Math.max(0, descendantUnion.x1 - parentBox.x1),
+      right: Math.max(0, parentBox.x2 - descendantUnion.x2),
+      top: Math.max(0, descendantUnion.y1 - parentBox.y1),
+      bottom: Math.max(0, parentBox.y2 - descendantUnion.y2),
+    },
+  };
+}
+
+/*** Resolve immutable label and compound boxes for one candidate uniform spacing factor. */
+function resolveCollisionBoxes(
+  leaves: readonly LeafGeometry[],
+  groups: readonly GroupGeometry[],
+  center: Point,
+  factor: number,
+): readonly CollisionBox[] {
+  const labels = leaves.map((leaf) => ({
+    id: leaf.id,
+    ancestors: leaf.ancestors,
+    kind: 'label' as const,
+    box: shiftBounds(leaf.labelBox, leaf.position, center, factor),
+  }));
+  const compoundBoxes = groups.flatMap((group) => {
+    const descendants = group.descendants.map((leaf) =>
+      shiftBounds(leaf.nodeBox, leaf.position, center, factor),
+    );
+    const union = unionBounds(descendants);
+    if (!union) return [];
+    return [
+      {
+        id: group.id,
+        ancestors: group.ancestors,
+        kind: 'group' as const,
+        box: expandBounds(union, group.insets),
+      },
+    ];
+  });
+  return [...labels, ...compoundBoxes];
+}
+
+/*** Find the first bounded expansion factor that makes the pure geometry snapshot acceptable. */
+function findExpansionMaximum(accepts: (factor: number) => boolean): number | undefined {
+  return Array.from({ length: MAX_EXPANSION_ATTEMPTS }, (_, index) => 2 ** (index + 1)).find(
+    accepts,
+  );
+}
+
+/***
+ * Sweep resolved boxes by x extent and stop conservatively if the pair-check budget is exhausted.
+ * Local loop counters are intentionally mutable on this performance-critical boundary.
+ */
+function hasUnsafeCollisions(boxes: readonly CollisionBox[]): boolean {
+  const sorted = [...boxes].sort((first, second) => first.box.x1 - second.box.x1);
+  const budget = { remaining: MAX_PAIR_CHECKS };
+  for (const [index, first] of sorted.entries()) {
+    for (let next = index + 1; next < sorted.length; next += 1) {
+      const second = sorted.at(next);
+      if (!second) break;
+      if (second.box.x1 >= first.box.x2) break;
+      budget.remaining -= 1;
+      if (budget.remaining < 0) return true;
+      if (isIntentionalContainment(first, second)) continue;
+      if (isUnsafeOverlap(first, second)) return true;
+    }
   }
-  applyScale(cy, positions, center, high);
-  return spacingFactor * high;
+  return false;
+}
+
+/*** Ignore intentional compound containment while retaining sibling and unrelated separation. */
+function isIntentionalContainment(first: CollisionBox, second: CollisionBox): boolean {
+  return first.ancestors.has(second.id) || second.ancestors.has(first.id);
+}
+
+/*** Permit only a small bounded label-label overlap; every other intersection remains unsafe. */
+function isUnsafeOverlap(first: CollisionBox, second: CollisionBox): boolean {
+  const overlapWidth =
+    Math.min(first.box.x2, second.box.x2) - Math.max(first.box.x1, second.box.x1);
+  const overlapHeight =
+    Math.min(first.box.y2, second.box.y2) - Math.max(first.box.y1, second.box.y1);
+  if (overlapWidth <= 0 || overlapHeight <= 0) return false;
+  if (first.kind !== 'label' || second.kind !== 'label') return true;
+  const widthRatio = overlapWidth / Math.min(first.box.w, second.box.w);
+  const heightRatio = overlapHeight / Math.min(first.box.h, second.box.h);
+  return widthRatio > LABEL_OVERLAP_RATIO && heightRatio > LABEL_OVERLAP_RATIO;
 }
 
-/*** Transform leaf centers, preserving ordering, dimensions, compound membership and edge data. */
+/*** Shift one fixed renderer box with its leaf center under uniform radial scaling. */
+function shiftBounds(box: Bounds, position: Point, center: Point, factor: number): Bounds {
+  const dx = (position.x - center.x) * (factor - 1);
+  const dy = (position.y - center.y) * (factor - 1);
+  return {
+    x1: box.x1 + dx,
+    y1: box.y1 + dy,
+    x2: box.x2 + dx,
+    y2: box.y2 + dy,
+    w: box.w,
+    h: box.h,
+  };
+}
+
+/*** Expand a descendant union by the compound renderer's measured outer insets. */
+function expandBounds(box: Bounds, insets: Insets): Bounds {
+  const x1 = box.x1 - insets.left;
+  const y1 = box.y1 - insets.top;
+  const x2 = box.x2 + insets.right;
+  const y2 = box.y2 + insets.bottom;
+  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+
+/*** Return the immutable union of measured boxes, or undefined for an empty collection. */
+function unionBounds(boxes: readonly Bounds[]): Bounds | undefined {
+  if (boxes.length === 0) return undefined;
+  const x1 = Math.min(...boxes.map((box) => box.x1));
+  const y1 = Math.min(...boxes.map((box) => box.y1));
+  const x2 = Math.max(...boxes.map((box) => box.x2));
+  const y2 = Math.max(...boxes.map((box) => box.y2));
+  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+
+/*** Return whether renderer measurement produced a non-empty label box. */
+function isUsableBox(box: Bounds): boolean {
+  return box.w > 0 && box.h > 0;
+}
+
+/*** Apply the accepted factor once, preserving node dimensions, hierarchy, ordering and edge data. */
 function applyScale(
   cy: Core,
-  positions: ReadonlyMap<string, { x: number; y: number }>,
-  center: { x: number; y: number },
+  leaves: readonly LeafGeometry[],
+  center: Point,
   factor: number,
-) {
+): void {
+  const positions = new Map(leaves.map((leaf) => [leaf.id, leaf.position]));
   cy.batch(() => {
     cy.nodes()
       .not(':parent')
@@ -93,31 +271,3 @@ function applyScale(
       });
   });
 }
-
-/*** Sweep measured bounds, ignoring intentional containment and stopping conservatively at budget. */
-function hasCollisions(cy: Core, ancestors: ReadonlyMap<string, ReadonlySet<string>>): boolean {
-  const boxes = cy
-    .nodes()
-    .map((node) => ({
-      id: node.id(),
-      box: node.boundingBox({
-        includeLabels: true,
-        includeOverlays: false,
-        includeUnderlays: false,
-      }),
-    }))
-    .sort((a, b) => a.box.x1 - b.box.x1);
-  const budget = { remaining: 200000 };
-  for (const [index, first] of boxes.entries()) {
-    for (let next = index + 1; next < boxes.length; next += 1) {
-      const second = boxes.at(next);
-      if (!second) break;
-      if (second.box.x1 >= first.box.x2 + 8) break;
-      if (--budget.remaining < 0) return true;
-      if (ancestors.get(first.id)?.has(second.id) || ancestors.get(second.id)?.has(first.id))
-        continue;
-      if (first.box.y1 < second.box.y2 + 8 && second.box.y1 < first.box.y2 + 8) return true;
-    }
-  }
-  return false;
-}

package/web-dist/components/graph-view/GraphView.js

@@ -122375,99 +122375,216 @@ var EVENT_TYPES = [
   ["mouseout", "pointer-leave"]
 ];
 
-// src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts
-function compactGraphSpacing(cy, spacingFactor) {
-  const leaves = cy.nodes(":childless");
-  if (leaves.length < 2 || cy.nodes().length > 2000 || leaves.filter(":locked").length > 0)
-    return spacingFactor;
-  const ancestors = new Map(cy.nodes().map((node) => [node.id(), new Set(node.ancestors().map((parent) => parent.id()))]));
-  const positions = new Map(leaves.map((node) => [node.id(), { ...node.position() }]));
-  const bounds = leaves.boundingBox();
-  const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };
-  if (hasCollisions(cy, ancestors))
-    return expandGraphSpacing(cy, ancestors, center, positions, spacingFactor);
-  return compressGraphSpacing(cy, ancestors, center, positions, spacingFactor);
+// node_modules/@ankhorage/utility/dist/algorithms/findMinimumAcceptedNumber.js
+var DEFAULT_ITERATIONS = 16;
+var MAX_ITERATIONS = 64;
+function findMinimumAcceptedNumber(input) {
+  validateInput(input);
+  const { accepts, maximum, minimum } = input;
+  const iterations = input.iterations ?? DEFAULT_ITERATIONS;
+  if (accepts(minimum))
+    return minimum;
+  if (!accepts(maximum))
+    return;
+  return searchAcceptedBoundary(minimum, maximum, iterations, accepts);
 }
-function compressGraphSpacing(cy, ancestors, center, positions, spacingFactor) {
-  const search = { low: Math.min(1, 0.1 / spacingFactor), high: 1 };
-  for (const attempt of Array.from({ length: 8 }, (_, index) => index)) {
-    const factor = attempt === 0 ? search.low : (search.low + search.high) / 2;
-    applyScale(cy, positions, center, factor);
-    if (hasCollisions(cy, ancestors))
-      search.low = factor;
-    else
-      search.high = factor;
-    if (search.high === search.low)
+function searchAcceptedBoundary(minimum, maximum, iterations, accepts) {
+  let lower = minimum;
+  let upper = maximum;
+  for (let iteration = 0;iteration < iterations; iteration += 1) {
+    const midpoint = lower + (upper - lower) / 2;
+    if (midpoint === lower || midpoint === upper)
       break;
+    if (accepts(midpoint))
+      upper = midpoint;
+    else
+      lower = midpoint;
   }
-  applyScale(cy, positions, center, search.high);
-  return spacingFactor * search.high;
+  return upper;
 }
-function expandGraphSpacing(cy, ancestors, center, positions, spacingFactor) {
-  let low = 1;
-  let high = 1;
-  let attempts = 0;
-  while (attempts < 8) {
-    high *= 2;
-    attempts += 1;
-    applyScale(cy, positions, center, high);
-    if (!hasCollisions(cy, ancestors))
-      break;
-    low = high;
+function validateInput(input) {
+  const iterations = input.iterations ?? DEFAULT_ITERATIONS;
+  if (!Number.isFinite(input.minimum) || !Number.isFinite(input.maximum)) {
+    throw new RangeError("Search bounds must be finite numbers.");
   }
-  if (hasCollisions(cy, ancestors)) {
-    applyScale(cy, positions, center, 1);
-    return spacingFactor;
+  if (input.minimum > input.maximum) {
+    throw new RangeError("Search minimum must not exceed maximum.");
   }
-  for (const _attempt of Array.from({ length: 8 - attempts }, (_, index) => index)) {
-    const factor = (low + high) / 2;
-    applyScale(cy, positions, center, factor);
-    if (hasCollisions(cy, ancestors))
-      low = factor;
-    else
-      high = factor;
+  if (!Number.isInteger(iterations) || iterations < 0 || iterations > MAX_ITERATIONS) {
+    throw new RangeError(`Search iterations must be an integer from 0 to ${MAX_ITERATIONS}.`);
   }
-  applyScale(cy, positions, center, high);
-  return spacingFactor * high;
 }
-function applyScale(cy, positions, center, factor) {
-  cy.batch(() => {
-    cy.nodes().not(":parent").positions((node) => {
-      const original = positions.get(node.id()) ?? node.position();
-      return {
-        x: center.x + (original.x - center.x) * factor,
-        y: center.y + (original.y - center.y) * factor
-      };
-    });
+// src/features/graph-view/adapters/inbound/web-artifact/compactGraphSpacing.ts
+var LABEL_OVERLAP_RATIO = 0.12;
+var MAX_EXPANSION_ATTEMPTS = 8;
+var MAX_NODE_COUNT = 2000;
+var MAX_PAIR_CHECKS = 200000;
+var SEARCH_ITERATIONS = 8;
+function compactGraphSpacing(cy, spacingFactor) {
+  const leaves = cy.nodes(":childless");
+  if (leaves.length < 2 || cy.nodes().length > MAX_NODE_COUNT || cy.nodes(":locked").length > 0)
+    return spacingFactor;
+  const bounds = leaves.boundingBox();
+  const center = { x: (bounds.x1 + bounds.x2) / 2, y: (bounds.y1 + bounds.y2) / 2 };
+  const leafGeometry = leaves.map(readLeafGeometry);
+  const groups = cy.nodes(":parent").map((node) => readGroupGeometry(node.id(), node.ancestors().map((parent) => parent.id()), node.boundingBox(), leafGeometry));
+  const accepts = (factor) => !hasUnsafeCollisions(resolveCollisionBoxes(leafGeometry, groups, center, factor));
+  const currentAccepted = accepts(1);
+  const minimum = currentAccepted ? Math.min(1, 0.1 / spacingFactor) : 1;
+  const maximum = currentAccepted ? 1 : findExpansionMaximum(accepts);
+  if (maximum === undefined)
+    return spacingFactor;
+  const factor = findMinimumAcceptedNumber({
+    minimum,
+    maximum,
+    iterations: SEARCH_ITERATIONS,
+    accepts
   });
+  if (factor === undefined)
+    return spacingFactor;
+  applyScale(cy, leafGeometry, center, factor);
+  return spacingFactor * factor;
 }
-function hasCollisions(cy, ancestors) {
-  const boxes = cy.nodes().map((node) => ({
+function readLeafGeometry(node) {
+  const nodeBox = node.boundingBox({
+    includeLabels: true,
+    includeOverlays: false,
+    includeUnderlays: false
+  });
+  const labelBox = node.boundingBox({
+    includeNodes: false,
+    includeEdges: false,
+    includeLabels: true,
+    includeOverlays: false,
+    includeUnderlays: false
+  });
+  return {
     id: node.id(),
-    box: node.boundingBox({
-      includeLabels: true,
-      includeOverlays: false,
-      includeUnderlays: false
-    })
-  })).sort((a, b) => a.box.x1 - b.box.x1);
-  const budget = { remaining: 200000 };
-  for (const [index, first] of boxes.entries()) {
-    for (let next = index + 1;next < boxes.length; next += 1) {
-      const second = boxes.at(next);
+    ancestors: new Set(node.ancestors().map((parent) => parent.id())),
+    position: { ...node.position() },
+    labelBox: isUsableBox(labelBox) ? labelBox : nodeBox,
+    nodeBox
+  };
+}
+function readGroupGeometry(id, ancestorIds, parentBox, leaves) {
+  const descendants = leaves.filter((leaf) => leaf.ancestors.has(id));
+  const descendantUnion = unionBounds(descendants.map((leaf) => leaf.nodeBox)) ?? parentBox;
+  return {
+    id,
+    ancestors: new Set(ancestorIds),
+    descendants,
+    insets: {
+      left: Math.max(0, descendantUnion.x1 - parentBox.x1),
+      right: Math.max(0, parentBox.x2 - descendantUnion.x2),
+      top: Math.max(0, descendantUnion.y1 - parentBox.y1),
+      bottom: Math.max(0, parentBox.y2 - descendantUnion.y2)
+    }
+  };
+}
+function resolveCollisionBoxes(leaves, groups, center, factor) {
+  const labels = leaves.map((leaf) => ({
+    id: leaf.id,
+    ancestors: leaf.ancestors,
+    kind: "label",
+    box: shiftBounds(leaf.labelBox, leaf.position, center, factor)
+  }));
+  const compoundBoxes = groups.flatMap((group) => {
+    const descendants = group.descendants.map((leaf) => shiftBounds(leaf.nodeBox, leaf.position, center, factor));
+    const union = unionBounds(descendants);
+    if (!union)
+      return [];
+    return [
+      {
+        id: group.id,
+        ancestors: group.ancestors,
+        kind: "group",
+        box: expandBounds(union, group.insets)
+      }
+    ];
+  });
+  return [...labels, ...compoundBoxes];
+}
+function findExpansionMaximum(accepts) {
+  return Array.from({ length: MAX_EXPANSION_ATTEMPTS }, (_, index) => 2 ** (index + 1)).find(accepts);
+}
+function hasUnsafeCollisions(boxes) {
+  const sorted = [...boxes].sort((first, second) => first.box.x1 - second.box.x1);
+  const budget = { remaining: MAX_PAIR_CHECKS };
+  for (const [index, first] of sorted.entries()) {
+    for (let next = index + 1;next < sorted.length; next += 1) {
+      const second = sorted.at(next);
       if (!second)
         break;
-      if (second.box.x1 >= first.box.x2 + 8)
+      if (second.box.x1 >= first.box.x2)
         break;
-      if (--budget.remaining < 0)
+      budget.remaining -= 1;
+      if (budget.remaining < 0)
         return true;
-      if (ancestors.get(first.id)?.has(second.id) || ancestors.get(second.id)?.has(first.id))
+      if (isIntentionalContainment(first, second))
         continue;
-      if (first.box.y1 < second.box.y2 + 8 && second.box.y1 < first.box.y2 + 8)
+      if (isUnsafeOverlap(first, second))
         return true;
     }
   }
   return false;
 }
+function isIntentionalContainment(first, second) {
+  return first.ancestors.has(second.id) || second.ancestors.has(first.id);
+}
+function isUnsafeOverlap(first, second) {
+  const overlapWidth = Math.min(first.box.x2, second.box.x2) - Math.max(first.box.x1, second.box.x1);
+  const overlapHeight = Math.min(first.box.y2, second.box.y2) - Math.max(first.box.y1, second.box.y1);
+  if (overlapWidth <= 0 || overlapHeight <= 0)
+    return false;
+  if (first.kind !== "label" || second.kind !== "label")
+    return true;
+  const widthRatio = overlapWidth / Math.min(first.box.w, second.box.w);
+  const heightRatio = overlapHeight / Math.min(first.box.h, second.box.h);
+  return widthRatio > LABEL_OVERLAP_RATIO && heightRatio > LABEL_OVERLAP_RATIO;
+}
+function shiftBounds(box, position, center, factor) {
+  const dx = (position.x - center.x) * (factor - 1);
+  const dy = (position.y - center.y) * (factor - 1);
+  return {
+    x1: box.x1 + dx,
+    y1: box.y1 + dy,
+    x2: box.x2 + dx,
+    y2: box.y2 + dy,
+    w: box.w,
+    h: box.h
+  };
+}
+function expandBounds(box, insets) {
+  const x1 = box.x1 - insets.left;
+  const y1 = box.y1 - insets.top;
+  const x2 = box.x2 + insets.right;
+  const y2 = box.y2 + insets.bottom;
+  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+function unionBounds(boxes) {
+  if (boxes.length === 0)
+    return;
+  const x1 = Math.min(...boxes.map((box) => box.x1));
+  const y1 = Math.min(...boxes.map((box) => box.y1));
+  const x2 = Math.max(...boxes.map((box) => box.x2));
+  const y2 = Math.max(...boxes.map((box) => box.y2));
+  return { x1, y1, x2, y2, w: x2 - x1, h: y2 - y1 };
+}
+function isUsableBox(box) {
+  return box.w > 0 && box.h > 0;
+}
+function applyScale(cy, leaves, center, factor) {
+  const positions = new Map(leaves.map((leaf) => [leaf.id, leaf.position]));
+  cy.batch(() => {
+    cy.nodes().not(":parent").positions((node) => {
+      const original = positions.get(node.id()) ?? node.position();
+      return {
+        x: center.x + (original.x - center.x) * factor,
+        y: center.y + (original.y - center.y) * factor
+      };
+    });
+  });
+}
 
 // src/features/graph-view/adapters/inbound/web-artifact/fitGraphViewport.ts
 function fitGraphViewport(cy, options = {}, maxZoom = Infinity) {