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

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

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