@crazyhappyone/auto-graph 0.2.0 → 0.2.1

package/dist/cli/index.cjs

@@ -3381,15 +3381,25 @@ function isValidDimension(value) {
 }
 
 // src/routing/astar.ts
-function findObstacleFreePath(source, target, obstacles, options = {}) {
+function findObstacleFreePath(source, target, obstacles, options = {}, diagnostics) {
   const margin = options.margin ?? 0;
   const turnPenalty = options.turnPenalty ?? 50;
   const segmentPenalty = options.segmentPenalty ?? 1;
   const endpointObstacles = options.endpointObstacles ?? [];
-  const maxNodes = options.maxNodes ?? 4e3;
+  const maxNodes = options.maxNodes ?? (obstacles.length > 30 ? 16e3 : 4e3);
   const xs = collectXs(source, target, obstacles, margin);
   const ys = collectYs(source, target, obstacles, margin);
   if (xs.length * ys.length > maxNodes) {
+    diagnostics?.push({
+      severity: "warning",
+      code: "routing.astar.grid_overflow",
+      message: `A* grid overflow: ${xs.length * ys.length} nodes > ${maxNodes} limit. Falling back to heuristic routing.`,
+      detail: {
+        xsCount: xs.length,
+        ysCount: ys.length,
+        maxNodes
+      }
+    });
     return null;
   }
   const { nodes, nodeIndex } = buildGraph(xs, ys);
@@ -3407,24 +3417,41 @@ function findObstacleFreePath(source, target, obstacles, options = {}) {
   return simplifyRoute(path);
 }
 function collectXs(source, target, obstacles, margin) {
-  const set = /* @__PURE__ */ new Set();
-  set.add(source.x);
-  set.add(target.x);
+  const raw = [];
   for (const obs of obstacles) {
-    set.add(obs.x - margin - 2);
-    set.add(obs.x + obs.width + margin + 2);
+    raw.push(obs.x - margin - 2, obs.x + obs.width + margin + 2);
   }
-  return [...set].sort((a, b) => a - b);
+  const deduped = dedupSorted(raw);
+  for (const v of [source.x, target.x]) {
+    if (!deduped.includes(v)) {
+      deduped.push(v);
+    }
+  }
+  return deduped.sort((a, b) => a - b);
 }
 function collectYs(source, target, obstacles, margin) {
-  const set = /* @__PURE__ */ new Set();
-  set.add(source.y);
-  set.add(target.y);
+  const raw = [];
   for (const obs of obstacles) {
-    set.add(obs.y - margin - 2);
-    set.add(obs.y + obs.height + margin + 2);
+    raw.push(obs.y - margin - 2, obs.y + obs.height + margin + 2);
+  }
+  const deduped = dedupSorted(raw);
+  for (const v of [source.y, target.y]) {
+    if (!deduped.includes(v)) {
+      deduped.push(v);
+    }
   }
-  return [...set].sort((a, b) => a - b);
+  return deduped.sort((a, b) => a - b);
+}
+function dedupSorted(values) {
+  const sorted = [...values].sort((a, b) => a - b);
+  const result = [];
+  for (const v of sorted) {
+    const last = result[result.length - 1];
+    if (last === void 0 || v - last > 2) {
+      result.push(v);
+    }
+  }
+  return result;
 }
 function buildGraph(xs, ys) {
   const nodes = [];
@@ -3654,7 +3681,8 @@ function routeEdge(input) {
         [...softObstacles, ...hardObstacles],
         {
           endpointObstacles
-        }
+        },
+        diagnostics
       );
       if (path !== null && path.length >= 2) {
         const finalized = finalizeRoute(
@@ -4505,7 +4533,7 @@ function solveDiagram(diagram, options = {}) {
     direction: diagram.direction,
     overlapSpacing: options?.overlapSpacing ?? 40,
     ...options.minSiblingGap === void 0 ? {} : { minSiblingGap: options.minSiblingGap },
-    ...options.distributeContainedChildren === void 0 ? {} : { distributeContainedChildren: options.distributeContainedChildren },
+    distributeContainedChildren: options.distributeContainedChildren ?? true,
     boxes: initialNodeBoxes,
     nodes: styledNodes,
     constraints