parameters: (self)
return_statement: return self._domtree
docstring: return a dictionary of {node -> set(nodes)} mapping each node to
          the set of nodes it immediately dominates
  
          The domtree(B) is the closest strict set of nodes that B dominates
docstring_summary: return a dictionary of {node -> set(nodes)} mapping each node to
          the set of nodes it immediately dominates
docstring_tokens: return a dictionary of { node - > set ( nodes ) } mapping each node to the set of nodes it immediately dominates
function: def dominator_tree(self):
          """
          return a dictionary of {node -> set(nodes)} mapping each node to
          the set of nodes it immediately dominates
  
          The domtree(B) is the closest strict set of nodes that B dominates
          """
          return self._domtree
function_tokens: def dominator_tree ( self ) : return self . _domtree