parameters: (self)
docstring: Iterates over graphs.
  
          This is the fastest iterator among Graphset iterators, such as
          rand_iter() and max_iter().
  
          Examples:
            >>> graph1 = [(1, 2)]
            >>> graph2 = [(1, 2), (1, 4)]
            >>> gs = GraphSet([graph1, graph2])
            >>> for g in gs:
            ...   g
            [(1, 2), (1, 4)]
            [(1, 2)]
  
          Returns:
            A generator.
  
          Yields:
            A graph.
  
          See Also:
            rand_iter(), max_iter(), min_iter()
docstring_summary: Iterates over graphs.
docstring_tokens: Iterates over graphs .
function: def __iter__(self):
          """Iterates over graphs.
  
          This is the fastest iterator among Graphset iterators, such as
          rand_iter() and max_iter().
  
          Examples:
            >>> graph1 = [(1, 2)]
            >>> graph2 = [(1, 2), (1, 4)]
            >>> gs = GraphSet([graph1, graph2])
            >>> for g in gs:
            ...   g
            [(1, 2), (1, 4)]
            [(1, 2)]
  
          Returns:
            A generator.
  
          Yields:
            A graph.
  
          See Also:
            rand_iter(), max_iter(), min_iter()
          """
          for g in self._ss.__iter__():
              try:
                  yield GraphSet._conv_ret(g)
              except StopIteration:
                  return
function_tokens: def __iter__ ( self ) : for g in self . _ss . __iter__ ( ) : try : yield GraphSet . _conv_ret ( g ) except StopIteration : return