(
        self, node: UniqueId, max_depth: Optional[int] = None
    )
return des - {node}
Returns all nodes reachable from `node` in `graph`
Returns all nodes reachable from `node` in `graph`
Returns all nodes reachable from node in graph
def descendants(
        self, node: UniqueId, max_depth: Optional[int] = None
    ) -> Set[UniqueId]:
        """Returns all nodes reachable from `node` in `graph`"""
        if not self.graph.has_node(node):
            raise InternalException(f'Node {node} not found in the graph!')
        des = nx.single_source_shortest_path_length(G=self.graph,
                                                    source=node,
                                                    cutoff=max_depth)\
            .keys()
        return des - {node}
def descendants ( self , node : UniqueId , max_depth : Optional [ int ] = None ) -> Set [ UniqueId ] : if not self . graph . has_node ( node ) : raise InternalException ( f'Node {node} not found in the graph!' ) des = nx . single_source_shortest_path_length ( G = self . graph , source = node , cutoff = max_depth ) . keys ( ) return des - { node }