Post #2058023
2026-04-19 12:28 UTC
@tnt @trcwm They each contain segments, i.e., they don't go all the way from the middle to the outer edge or all around. These are all edges in three subgraphs, each of which is by design planar.
The nodes connecting these edges are your analog switches. You get variable "corner nodes", i.e., degree-2 vertices that connect a radial to a concentric metal trace segment, and you get fixed "component nodes", which connect segments and nodes.
Armed with these three layers of edges, you Dijkstra
Replies (1)
-
@funkylab@mastodon.social 2026-04-19 12:32
@tnt @trcwm (yes, that's clearly a verb) from the input node to the first netlist entry connnected to it ("first" might mean: of type A, because that has no other rings to cross). You can at every variable node assume it's closed in your favor. Unless, of course, it's been marked uncloseable by a previous routing step in the current attempt to find a shortest path. Keep a copy of the distance-from-origin-marked graph around, but for the next step, just use the current assignments of variable