-
Notifications
You must be signed in to change notification settings - Fork 256
Dev polygon graph #2050
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Dev polygon graph #2050
Conversation
…ce skipping the compression
…n#triangulate. Working on hm_decomposition (tests, bug fixes etc.)
|
@klayoutmatthias debugability of the |
|
@klayoutmatthias I've obtained a segmentation fault |
|
If I attach the Debugger, it seems that After |
|
@klayoutmatthias ok, I built a version where the iterator erasal is moved to the point where the variable is reused, |
|
Of course! good catch :) The change is pushed. Thanks! Matthias |
|
@klayoutmatthias Currently, I've added So, for a wire resistor beween nets |
|
Hi Martin, the idea is that you the node carries the port index. So you know which port was meant. In other words, you can maintain two arrays: one with the vertexes that form the ports and another one with your attributes (net name or any other data). When you investigate the node, you can get the port index and look up your attributes in the attribute array by this index. The same is available for polygon ports too, but as a separate index. Matthias |
…at UTF-8 encoding is maintained when returning such strings from C++


No description provided.