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
This method is to iteratively search for the parent node of the node in z. If the node is not in the current parent node, continue to search for its parent node. If it cannot be found until the queue is empty, then the node is not the ancestor node of the node in z.
In line 127 of the GraphUtils.py, how come the
node
is determined to be an ancestor once it is inz
?The text was updated successfully, but these errors were encountered: