Hello, I have a question on this new kind of subgraph.
I’d like something like what is presented (did not have the time to download this version yet, just read the description), but with a slightly different behaviour.
As long as the node would be only partially over the limit of the subgraph, snap it inside of the subgraph, just as described. But when the node becomes totally out of the subgraph, remove the node from the subgraph, and add it to the external container. A little bit like what happens un SugGraphApp when you Shift-Drag a node, but determined by how far the node is moved, not by a special key.
Do you think this behaviour would be easy to implement, starting from GoLimitingSubgraph ?