(
        self,
        graph,
        verbosity=0,
        width=78,
        edge_list_format="auto",
        max_rows=99999,
        print_graph_attributes=False,
        print_vertex_attributes=False,
        print_edge_attributes=False,
        full=False,
    )
Constructs a summary representation of a graph.

        @param verbosity: the verbosity of the summary. If zero, only
          the header line will be returned. If one, the header line
          and the list of edges will both be returned.
        @param width: the maximal width of each line in the summary.
          C{None} means that no limit will be enforced.
        @param max_rows: the maximal number of rows to print in a single
          table (e.g., vertex attribute table or edge attribute table)
        @param edge_list_format: format of the edge list in the summary.
          Supported formats are: C{compressed}, C{adjlist}, C{edgelist},
          C{auto}, which selects automatically from the other three based
          on some simple criteria.
        @param print_graph_attributes: whether to print graph attributes
          if there are any.
        @param print_vertex_attributes: whether to print vertex attributes
          if there are any.
        @param print_edge_attributes: whether to print edge attributes
          if there are any.
        @param full: False has no effect; True turns on the attribute
          printing for graph, vertex and edge attributes with verbosity 1.
Constructs a summary representation of a graph.
Constructs a summary representation of a graph .
def __init__(
        self,
        graph,
        verbosity=0,
        width=78,
        edge_list_format="auto",
        max_rows=99999,
        print_graph_attributes=False,
        print_vertex_attributes=False,
        print_edge_attributes=False,
        full=False,
    ):
        """Constructs a summary representation of a graph.

        @param verbosity: the verbosity of the summary. If zero, only
          the header line will be returned. If one, the header line
          and the list of edges will both be returned.
        @param width: the maximal width of each line in the summary.
          C{None} means that no limit will be enforced.
        @param max_rows: the maximal number of rows to print in a single
          table (e.g., vertex attribute table or edge attribute table)
        @param edge_list_format: format of the edge list in the summary.
          Supported formats are: C{compressed}, C{adjlist}, C{edgelist},
          C{auto}, which selects automatically from the other three based
          on some simple criteria.
        @param print_graph_attributes: whether to print graph attributes
          if there are any.
        @param print_vertex_attributes: whether to print vertex attributes
          if there are any.
        @param print_edge_attributes: whether to print edge attributes
          if there are any.
        @param full: False has no effect; True turns on the attribute
          printing for graph, vertex and edge attributes with verbosity 1.
        """
        if full:
            print_graph_attributes = True
            print_vertex_attributes = True
            print_edge_attributes = True
            verbosity = max(verbosity, 1)

        self._graph = graph
        self.edge_list_format = edge_list_format.lower()
        self.max_rows = int(max_rows)
        self.print_graph_attributes = print_graph_attributes
        self.print_vertex_attributes = print_vertex_attributes
        self.print_edge_attributes = print_edge_attributes
        self.verbosity = verbosity
        self.width = width
        self.wrapper = _get_wrapper_for_width(self.width, break_on_hyphens=False)

        if self._graph.is_named():
            self._edges_header = "+ edges (vertex names):"
        else:
            self._edges_header = "+ edges:"
        self._arrow = ["--", "->"][self._graph.is_directed()]
        self._arrow_format = "%%s%s%%s" % self._arrow
def __init__ ( self , graph , verbosity = 0 , width = 78 , edge_list_format = "auto" , max_rows = 99999 , print_graph_attributes = False , print_vertex_attributes = False , print_edge_attributes = False , full = False , ) : if full : print_graph_attributes = True print_vertex_attributes = True print_edge_attributes = True verbosity = max ( verbosity , 1 ) self . _graph = graph self . edge_list_format = edge_list_format . lower ( ) self . max_rows = int ( max_rows ) self . print_graph_attributes = print_graph_attributes self . print_vertex_attributes = print_vertex_attributes self . print_edge_attributes = print_edge_attributes self . verbosity = verbosity self . width = width self . wrapper = _get_wrapper_for_width ( self . width , break_on_hyphens = False ) if self . _graph . is_named ( ) : self . _edges_header = "+ edges (vertex names):" else : self . _edges_header = "+ edges:" self . _arrow = [ "--" , "->" ] [ self . _graph . is_directed ( ) ] self . _arrow_format = "%%s%s%%s" % self . _arrow