12.3. General-Purpose Routing
In Section 12.2.1, we modeled the routing resources by the global- and detailed-routing graphs. For global and detailed routing, we can perform a graph-search technique on these routing models. In the following, we introduce three popular graph-searching techniques, the maze, line-search, and A*-search routing algorithms. Note that these algorithms are general-purpose routing algorithms, because they can be applied to both global and detailed routing problems on the general routing structure.
Get Electronic Design Automation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
