(self, other, byname="auto")
return union([self] + other, byname=byname)
Creates the union of two (or more) graphs.

        @param other: graph or list of graphs to be united with the current one.
        @param byname: whether to use vertex names instead of ids. See
          L{igraph.union} for details.
        @return: the union graph
Creates the union of two (or more) graphs.
Creates the union of two ( or more ) graphs .
def union(self, other, byname="auto"):
        """Creates the union of two (or more) graphs.

        @param other: graph or list of graphs to be united with the current one.
        @param byname: whether to use vertex names instead of ids. See
          L{igraph.union} for details.
        @return: the union graph
        """
        if isinstance(other, GraphBase):
            other = [other]
        return union([self] + other, byname=byname)
def union ( self , other , byname = "auto" ) : if isinstance ( other , GraphBase ) : other = [ other ] return union ( [ self ] + other , byname = byname )