docstr: Returns True if the graph contains the edge (u,v).
docstr_tok: ["Returns","True","if","the","graph","contains","the","edge","(","u",",","v",")","."]
code: def has_edge(self, u, v):
      """
      Returns True if the graph contains the edge (u,v).
      """
      if self.properties.renumbered:
          tmp = cudf.DataFrame({simpleGraphImpl.srcCol: [u, v]})
          tmp = tmp.astype({simpleGraphImpl.srcCol: "int"})
          tmp = self.renumber_map.add_internal_vertex_id(
              tmp, "id", simpleGraphImpl.srcCol, preserve_order=True
          )
  
          u = tmp["id"][0]
          v = tmp["id"][1]
  
      df = self.edgelist.edgelist_df
      return (
          (df[simpleGraphImpl.srcCol] == u)
          & (df[simpleGraphImpl.dstCol] == v)
      ).any()
  
imports: from cugraph.structure import graph_primtypes_wrapper
  from cugraph.structure.graph_primtypes_wrapper import Direction
  from cugraph.structure.symmetrize import symmetrize
  from cugraph.structure.number_map import NumberMap
  import cugraph.dask.common.mg_utils
  import cudf
  import dask_cudf
  import cugraph.dask.comms.comms
  import pandas
  import numpy
  import warnings
  from cugraph.dask.structure import replication
  from typing import Union, Dict
  from pylibcugraph import get_two_hop_neighbors, select_random_vertices
  from pylibcugraph import ResourceHandle, GraphProperties, SGGraph
label_desc: Use image node_id 31 for calling the simpleGraphImpl obj's underlying member method code with example usage: obj.has_edge(u, v) and returns: unknown