(self)
return [
            membership[v1] != membership[v2] for v1, v2 in self.graph.get_edgelist()
        ]
Returns a boolean vector where element M{i} is C{True} iff edge
        M{i} lies between clusters, C{False} otherwise.
Returns a boolean vector where element M{i} is C{True} iff edge
        M{i} lies between clusters, C{False} otherwise.
Returns a boolean vector where element M { i } is C { True } iff edge M { i } lies between clusters C { False } otherwise .
def crossing(self):
        """Returns a boolean vector where element M{i} is C{True} iff edge
        M{i} lies between clusters, C{False} otherwise."""
        membership = self.membership
        return [
            membership[v1] != membership[v2] for v1, v2 in self.graph.get_edgelist()
        ]
def crossing ( self ) : membership = self . membership return [ membership [ v1 ] != membership [ v2 ] for v1 , v2 in self . graph . get_edgelist ( ) ]