parameters: (self, roots, should_stop=lambda n: False)
return_statement: return self._ExploreFrom(
          roots, lambda n: (e.to_node for e in self.OutEdges(n)),
          should_stop=should_stop)
docstring: Returns a list of nodes from a set of root nodes.
  
      Args:
        roots: ([Node]) List of roots to start from.
        should_stop: (callable) Returns True when a node should stop the
                     exploration and be skipped.
docstring_summary: Returns a list of nodes from a set of root nodes.
docstring_tokens: Returns a list of nodes from a set of root nodes .
function: def ReachableNodes(self, roots, should_stop=lambda n: False):
      """Returns a list of nodes from a set of root nodes.
  
      Args:
        roots: ([Node]) List of roots to start from.
        should_stop: (callable) Returns True when a node should stop the
                     exploration and be skipped.
      """
      return self._ExploreFrom(
          roots, lambda n: (e.to_node for e in self.OutEdges(n)),
          should_stop=should_stop)
function_tokens: def ReachableNodes ( self , roots , should_stop = lambda n : False ) : return self . _ExploreFrom ( roots , lambda n : ( e . to_node for e in self . OutEdges ( n ) ) , should_stop = should_stop )