code: def _get_adjlist(self, mode="out"):
      """Returns the adjacency list representation of the graph.
  
      The adjacency list representation is a list of lists. Each item of the
      outer list belongs to a single vertex of the graph. The inner list
      contains the neighbors of the given vertex.
  
      @param mode: if C{\"out\"}, returns the successors of the vertex. If
        C{\"in\"}, returns the predecessors of the vertex. If C{\"all"\"}, both
        the predecessors and the successors will be returned. Ignored
        for undirected graphs.
      """
      return [self.neighbors(idx, mode) for idx in range(self.vcount())]
  
imports: from igraph._igraph import GET_ADJACENCY_BOTH, GET_ADJACENCY_LOWER, GET_ADJACENCY_UPPER, GraphBase
  from igraph.datatypes import Matrix
label_desc: Use image node_id 3 for calling a global function with example usage: _get_adjlist(mode) and returns: unknown