We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Below an algorithm to remove all unconnected boundary nodes for every cell, once we have a CellID assignment over every level:
CellID
l
NodeID
node
target
witness
backward
<= l
/cc @oxidase
The text was updated successfully, but these errors were encountered:
Landed with #3826
Sorry, something went wrong.
No branches or pull requests
Below an algorithm to remove all unconnected boundary nodes for every cell, once we have a
CellID
assignment over every level:l
: For every partition array (NodeID
->CellID
translation) on the edge-based-graph:node
in the graph:target
nodes:target
is in a different cell, savetarget
aswitness
thatnode
is a boundary node.target
is from the same cell: Check if it is a forward/backward edge. If forward,node
is a source node, ifbackward
thennode
is a target node.node
on levell
that is a boundary node, but not marked as source or target:node
to the same cells as thewitness
on all levels<= l
/cc @oxidase
The text was updated successfully, but these errors were encountered: