code: def _unitgraph_less_than_int32(g):
      """Check if a graph with only one edge type has more than 2 ** 31 - 1
      nodes or edges.
      """
      num_edges = g.num_edges()
      num_nodes = max(
          g.num_nodes(g.ntypes[0]), g.num_nodes(g.ntypes[-1])
      )
      return max(num_nodes, num_edges) <= (1 << 31) - 1
  
imports: import copy
  from collections.abc import Iterable, Mapping
  import numpy
  import scipy.sparse
  import scipy.sparse.linalg
  from ..utils import version
  from ..None import backend, batch, convert, function, ndarray, subgraph, utils
  from .._ffi.function import _init_api
  from ..base import dgl_warning, DGLError, EID, NID
  from ..frame import Frame
  from ..heterograph import DGLGraph
  from ..heterograph_index import create_heterograph_from_relations, create_metagraph_index
  from ..partition import metis_partition, metis_partition_assignment, partition_graph_with_halo
  from ..sampling.neighbor import sample_neighbors
label_desc: Use image node_id 26 for calling a global function with example usage: _unitgraph_less_than_int32(g) and returns: unknown