code: def _get_biadjacency(graph, types="type", *args, **kwds):
      """Returns the bipartite adjacency matrix of a bipartite graph. The
      bipartite adjacency matrix is an M{n} times M{m} matrix, where M{n} and
      M{m} are the number of vertices in the two vertex classes.
  
      @param types: an igraph vector containing the vertex types, or an
        attribute name. Anything that evalulates to C{False} corresponds to
        vertices of the first kind, everything else to the second kind.
      @return: the bipartite adjacency matrix and two lists in a triplet. The
        first list defines the mapping between row indices of the matrix and the
        original vertex IDs. The second list is the same for the column indices.
      """
      # Deferred import to avoid cycles
      from igraph import Graph
  
      return super(Graph, graph).get_biadjacency(types, *args, **kwds)
  
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 4 for calling a global function with example usage: _get_biadjacency(graph, types) and returns: super