class_docstr: Really simple unweighted directed graph data structure to track dependencies.
  
  The API is pretty much the same as networkx so if you add something just
  copy their API.
class_docstr_tok: ["Really","simple","unweighted","directed","graph","data","structure","to","track","dependencies",".","The","API","is","pretty","much","the","same","as","networkx","so","if","you","add","something","just","copy","their","API","."]
docstr: Returns a set of nodes that are reachable from src
docstr_tok: ["Returns","a","set","of","nodes","that","are","reachable","from","src"]
code: def forward_transitive_closure(self, src: str) -> Set[str]:
      """Returns a set of nodes that are reachable from src"""
  
      result = set(src)
      working_set = deque(src)
      while len(working_set) > 0:
          cur = working_set.popleft()
          for n in self.successors(cur):
              if n not in result:
                  result.add(n)
                  working_set.append(n)
      return result
  
file_path: pytorch/torch/package/_digraph.py
imports: from collections import deque
  from typing import List, Set
label_desc: Use image node_id 10 for calling the DiGraph obj's underlying member method code with example usage: obj.forward_transitive_closure(src) and returns: result