(self, node: NodeType, include_self=True)
Revisit a node in the future. As a result, the successors to this node will be revisited as well.

        :param node: The node to revisit in the future.
        :return:     None
Revisit a node in the future. As a result, the successors to this node will be revisited as well.
Revisit a node in the future . As a result the successors to this node will be revisited as well .
def revisit_successors(self, node: NodeType, include_self=True) -> None:
        """
        Revisit a node in the future. As a result, the successors to this node will be revisited as well.

        :param node: The node to revisit in the future.
        :return:     None
        """

        successors = self.successors(node) #, skip_reached_fixedpoint=True)

        if include_self:
            if node not in self._nodes_set:
                binary_insert(self._sorted_nodes, node, lambda elem: self._node_to_index[elem])
                self._nodes_set.add(node)

        for succ in successors:
            if succ not in self._nodes_set:
                binary_insert(self._sorted_nodes, succ, lambda elem: self._node_to_index[elem])
                self._nodes_set.add(succ)
def revisit_successors ( self , node : NodeType , include_self = True ) -> None : successors = self . successors ( node ) #, skip_reached_fixedpoint=True) if include_self : if node not in self . _nodes_set : binary_insert ( self . _sorted_nodes , node , lambda elem : self . _node_to_index [ elem ] ) self . _nodes_set . add ( node ) for succ in successors : if succ not in self . _nodes_set : binary_insert ( self . _sorted_nodes , succ , lambda elem : self . _node_to_index [ elem ] ) self . _nodes_set . add ( succ )