@tscircuit/hypergraph 0.0.20 → 0.0.21

package/dist/index.d.ts

@@ -349,6 +349,23 @@ declare class HyperGraphSolver<RegionType extends Region = Region, RegionPortTyp
      * redundant.
      */
     selectCandidatesForEnteringRegion(candidates: Candidate[]): Candidate[];
+    /**
+     * OPTIONALLY OVERRIDE THIS
+     *
+     * Compute the full set of solved routes that must be ripped to accept
+     * `newlySolvedRoute`. By default this returns all conflicting routes
+     * (always-rip behavior)
+     *
+     * Override this to implement partial ripping, where only a subset of
+     * conflicting routes are removed.
+     */
+    computeRoutesToRip(newlySolvedRoute: SolvedRoute): Set<SolvedRoute>;
+    /**
+     * Returns solved routes that overlap ports with the newly solved route.
+     * Use this in computeRoutesToRip overrides to include port reuse rips.
+     */
+    computePortOverlapRoutes(newlySolvedRoute: SolvedRoute): Set<SolvedRoute>;
+    computeCrossingRoutes(newlySolvedRoute: SolvedRoute): Set<SolvedRoute>;
     getNextCandidates(currentCandidate: CandidateType): CandidateType[];
     processSolvedRoute(finalCandidate: CandidateType): void;
     /**

package/dist/index.js

@@ -1915,6 +1915,52 @@ var HyperGraphSolver = class extends BaseSolver {
   selectCandidatesForEnteringRegion(candidates) {
     return candidates;
   }
+  /**
+   * OPTIONALLY OVERRIDE THIS
+   *
+   * Compute the full set of solved routes that must be ripped to accept
+   * `newlySolvedRoute`. By default this returns all conflicting routes
+   * (always-rip behavior)
+   *
+   * Override this to implement partial ripping, where only a subset of
+   * conflicting routes are removed.
+   */
+  computeRoutesToRip(newlySolvedRoute) {
+    const crossingRoutesToRip = this.computeCrossingRoutes(newlySolvedRoute);
+    const portReuseRoutesToRip = this.computePortOverlapRoutes(newlySolvedRoute);
+    return /* @__PURE__ */ new Set([
+      ...crossingRoutesToRip,
+      ...portReuseRoutesToRip
+    ]);
+  }
+  /**
+   * Returns solved routes that overlap ports with the newly solved route.
+   * Use this in computeRoutesToRip overrides to include port reuse rips.
+   */
+  computePortOverlapRoutes(newlySolvedRoute) {
+    const portReuseRoutesToRip = /* @__PURE__ */ new Set();
+    for (const candidate of newlySolvedRoute.path) {
+      if (candidate.port.assignment && candidate.port.assignment.connection.mutuallyConnectedNetworkId !== newlySolvedRoute.connection.mutuallyConnectedNetworkId) {
+        portReuseRoutesToRip.add(candidate.port.assignment.solvedRoute);
+      }
+    }
+    return portReuseRoutesToRip;
+  }
+  computeCrossingRoutes(newlySolvedRoute) {
+    const crossingRoutesToRip = /* @__PURE__ */ new Set();
+    for (const candidate of newlySolvedRoute.path) {
+      if (!candidate.lastPort || !candidate.lastRegion) continue;
+      const ripsRequired = this.getRipsRequiredForPortUsage(
+        candidate.lastRegion,
+        candidate.lastPort,
+        candidate.port
+      );
+      for (const assignment of ripsRequired) {
+        crossingRoutesToRip.add(assignment.solvedRoute);
+      }
+    }
+    return crossingRoutesToRip;
+  }
   getNextCandidates(currentCandidate) {
     const currentRegion = currentCandidate.nextRegion;
     const currentPort = currentCandidate.port;
@@ -1966,29 +2012,13 @@ var HyperGraphSolver = class extends BaseSolver {
       solvedRoute.path.unshift(cursorCandidate);
       cursorCandidate = cursorCandidate.parent;
     }
-    const routesToRip = /* @__PURE__ */ new Set();
     if (anyRipsRequired) {
       solvedRoute.requiredRip = true;
-      for (const candidate of solvedRoute.path) {
-        if (candidate.port.assignment && candidate.port.assignment.connection.mutuallyConnectedNetworkId !== this.currentConnection.mutuallyConnectedNetworkId) {
-          routesToRip.add(candidate.port.assignment.solvedRoute);
-        }
-      }
-    }
-    for (const candidate of solvedRoute.path) {
-      if (!candidate.lastPort || !candidate.lastRegion) continue;
-      const ripsRequired = this.getRipsRequiredForPortUsage(
-        candidate.lastRegion,
-        candidate.lastPort,
-        candidate.port
-      );
-      for (const assignment of ripsRequired) {
-        routesToRip.add(assignment.solvedRoute);
-      }
     }
-    if (routesToRip.size > 0) {
+    const allRoutesToRip = this.computeRoutesToRip(solvedRoute);
+    if (allRoutesToRip.size > 0) {
       solvedRoute.requiredRip = true;
-      for (const route of routesToRip) {
+      for (const route of allRoutesToRip) {
         this.ripSolvedRoute(route);
       }
     }

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tscircuit/hypergraph",
   "main": "dist/index.js",
-  "version": "0.0.20",
+  "version": "0.0.21",
   "type": "module",
   "scripts": {
     "start": "cosmos",