parameters: (self, other)
return_statement: return GraphSet(self._ss.non_supersets(other._ss))
docstring: Returns a new GraphSet with graphs that aren't supergraphs of any graph in `other`.
  
          The `self` is not changed.
  
          The non_supersets are defined by,
            gs1.non_supersets(gs2) = {a \\in gs1 | b \\in gs2 -> a \\not\\superseteq b}.
          D. Knuth, Exercise 236, The art of computer programming,
          Sect.7.1.4.
  
          Examples:
            >>> graph1 = [(1, 2), (2, 3)]
            >>> graph2 = [(1, 4), (2, 3)]
            >>> graph3 = [(1, 2)]
            >>> graph4 = [(1, 2), (1, 4)]
            >>> gs1 = GraphSet([graph1, graph2])
            >>> gs2 = GraphSet([graph3, graph4])
            >>> gs1.non_supergraphs(gs2)
            GraphSet([[(1, 4), (2, 3)]])
  
          Returns:
            A new GraphSet object.
  
          See Also:
            non_subsets(), supersets()
docstring_summary: Returns a new GraphSet with graphs that aren't supergraphs of any graph in `other`.
docstring_tokens: Returns a new GraphSet with graphs that aren t supergraphs of any graph in other .
function: def non_supergraphs(self, other):
          """Returns a new GraphSet with graphs that aren't supergraphs of any graph in `other`.
  
          The `self` is not changed.
  
          The non_supersets are defined by,
            gs1.non_supersets(gs2) = {a \\in gs1 | b \\in gs2 -> a \\not\\superseteq b}.
          D. Knuth, Exercise 236, The art of computer programming,
          Sect.7.1.4.
  
          Examples:
            >>> graph1 = [(1, 2), (2, 3)]
            >>> graph2 = [(1, 4), (2, 3)]
            >>> graph3 = [(1, 2)]
            >>> graph4 = [(1, 2), (1, 4)]
            >>> gs1 = GraphSet([graph1, graph2])
            >>> gs2 = GraphSet([graph3, graph4])
            >>> gs1.non_supergraphs(gs2)
            GraphSet([[(1, 4), (2, 3)]])
  
          Returns:
            A new GraphSet object.
  
          See Also:
            non_subsets(), supersets()
          """
          return GraphSet(self._ss.non_supersets(other._ss))
function_tokens: def non_supergraphs ( self , other ) : return GraphSet ( self . _ss . non_supersets ( other . _ss ) )