doc update
This commit is contained in:
parent
7e0d96f987
commit
316eda090d
3 changed files with 6 additions and 3 deletions
|
|
@ -42,6 +42,7 @@ The search state is a snapped Manhattan `(x, y, r)` port. From each state the ro
|
|||
- The visibility subsystem keeps a lazy static corner index for default `tangent_corner` guidance and only builds the exact corner-to-corner graph on demand for `exact_corner` queries.
|
||||
- `use_tiered_strategy` can swap in a cheaper bend proxy on the first congestion iteration.
|
||||
- Negotiated congestion now re-verifies every reached-target path at the end of each iteration against the final installed dynamic geometry, and it stops early if the conflict graph stalls for consecutive iterations.
|
||||
- In the late all-reached low-edge regime, negotiated congestion reroutes only the current conflict set instead of all nets. The heaviest remaining late reroutes can be capped and carried forward by restoring their incumbent reached-target paths when more search would just churn before pair-local repair.
|
||||
- After best-snapshot restoration, the router runs a bounded pair-local scratch reroute on final two-net reached-target conflict pairs. That repair phase clones static obstacles from the live collision world, treats all outside-pair geometry as fixed blockers, tries both pair orders, and only keeps the result if whole-set reverify improves.
|
||||
- Final `RoutingResult` validity is determined by explicit post-route verification, not only by search-time pruning.
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue