class_docstr: Summary representation of a graph.
  
  The summary representation includes a header line and the list of
  edges. The header line consists of C{IGRAPH}, followed by a
  four-character long code, the number of vertices, the number of
  edges, two dashes (C{--}) and the name of the graph (i.e.
  the contents of the C{name} attribute, if any). For instance,
  a header line may look like this::
  
      IGRAPH U--- 4 5 --
  
  The four-character code describes some basic properties of the
  graph. The first character is C{U} if the graph is undirected,
  C{D} if it is directed. The second letter is C{N} if the graph
  has a vertex attribute called C{name}, or a dash otherwise. The
  third letter is C{W} if the graph is weighted (i.e. it has an
  edge attribute called C{weight}), or a dash otherwise. The
  fourth letter is C{B} if the graph has a vertex attribute called
  C{type}; this is usually used for bipartite graphs.
  
  Edges may be presented as an ordinary edge list or an adjacency
  list. By default, this depends on the number of edges; however,
  you can control it with the appropriate constructor arguments.
docstr: Constructs the part in the summary that prints the edge list in a
  compressed format suitable for graphs with mostly small degrees.
docstr_tok: ["Constructs","the","part","in","the","summary","that","prints","the","edge","list","in","a","compressed","format","suitable","for","graphs","with","mostly","small","degrees","."]
code: 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
  
imports: import sys
  from igraph.statistics import median
  from itertools import islice
  from math import ceil
  from texttable import Texttable
  from textwrap import TextWrapper
label_desc: Use image node_id 3 for calling the GraphSummary obj's underlying member method code with example usage: obj._construct_edgelist_compressed() and returns: result