You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I just tested the code with a .kicad file, the circuit is simple, it contains 12 nets and 2 layers. It used a lot of memory (more than 60G) and my computer can not finish running on testcase because it has no enough memory and the program is killed. So is that normal?
Here is a screenshot of the results:
The text was updated successfully, but these errors were encountered:
Hi - unfortunately the original authors of the routing algorithm have graduated several years ago. The router is memory intensive, but one possible remedy is to coarsen the routing grid scale from the default. It should be the first top-level argument.
Hi,
I just tested the code with a .kicad file, the circuit is simple, it contains 12 nets and 2 layers. It used a lot of memory (more than 60G) and my computer can not finish running on testcase because it has no enough memory and the program is killed. So is that normal?
Here is a screenshot of the results:
The text was updated successfully, but these errors were encountered: