9b87b92eec
In order to accurately find the rectangles (Components) causing a short circuit, we need to aggregate the equipotentials as soon as we starts to merge the tiles. Because tiles being a union set, the tree compression forbid to know which tile overlap which one afterwards. So the equipotentials are created early on the fly. We also add an accounting of all the net's components (Plug excluded) to know if it is fully included in the equipotential. If not, we have an open. This is an impacting change from the previous version in which we build the equipotentials *after* aggregating the tiles only. The added cost comes from the number of equipotential merging that we have to perform when we merge tiles. Almost two times slower. May need to have a deep look on how to optimize it later (efficient merge or keeping the order tiles where merged). |
||
|---|---|---|
| .. | ||
| src | ||
| CMakeLists.txt | ||