(self)
return result
Constructs the part in the summary that prints the edge list in a
        compressed format suitable for graphs with mostly small degrees.
Constructs the part in the summary that prints the edge list in a
        compressed format suitable for graphs with mostly small degrees.
Constructs the part in the summary that prints the edge list in a compressed format suitable for graphs with mostly small degrees .
def _construct_edgelist_compressed(self):
        """Constructs the part in the summary that prints the edge list in a
        compressed format suitable for graphs with mostly small degrees."""
        result = [self._edges_header]
        arrow = self._arrow_format

        if self._graph.is_named():
            names = self._graph.vs["name"]
            edges = ", ".join(
                arrow % (names[edge.source], names[edge.target])
                for edge in self._graph.es
            )
        else:
            edges = " ".join(arrow % edge.tuple for edge in self._graph.es)

        result.append(edges)
        return result
def _construct_edgelist_compressed ( self ) : result = [ self . _edges_header ] arrow = self . _arrow_format if self . _graph . is_named ( ) : names = self . _graph . vs [ "name" ] edges = ", " . join ( arrow % ( names [ edge . source ] , names [ edge . target ] ) for edge in self . _graph . es ) else : edges = " " . join ( arrow % edge . tuple for edge in self . _graph . es ) result . append ( edges ) return result