(self, mode="out")
return [self.incident(idx, mode) for idx in range(self.vcount())]
Returns the incidence list representation of the graph.

        The incidence 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 IDs of the incident edges 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.
Returns the incidence list representation of the graph.
Returns the incidence list representation of the graph .
def get_inclist(self, mode="out"):
        """Returns the incidence list representation of the graph.

        The incidence 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 IDs of the incident edges 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.incident(idx, mode) for idx in range(self.vcount())]
def get_inclist ( self , mode = "out" ) : return [ self . incident ( idx , mode ) for idx in range ( self . vcount ( ) ) ]