Post #2058025
2026-04-19 12:38 UTC
@tnt @trcwm nodes. Dijkstra guarantees you found a shortest route here, because the planar nature of your routing sub-grids doesn't allow for "I can take a shortcut if I take more turns".
Then, next component also directly connected to input.
Once all components of a type of the same depth in the netlist have been routed, check for same-ring (i.e., concentric) interconnects, and whether their length can be optimized by rotating "pizza slices" of your already embedded graph/slice permutations.
Replies (1)
-
@funkylab@mastodon.social 2026-04-19 12:41
@tnt @trcwm In a continued BFS manner, insert more components. If the component can't be inserted and connectivity to previously placed components established, backtrack, try again. (yes, that needs loadsa RAM, but with 126 switches you're not connecting more than 128 components.) You're effectively building a "higher order Dijkstra".