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).
      """
      # TODO: Verify Correctness
      if self.renumbered:
          src_col_name = self.renumber_map.renumbered_src_col_name
  
          tmp = cudf.DataFrame({src_col_name: [u, v]})
          tmp = tmp.astype({src_col_name: "int"})
          tmp = self.add_internal_vertex_id(
              tmp, "id", src_col_name, preserve_order=True
          )
  
          u = tmp["id"][0]
          v = tmp["id"][1]
  
      df = self.edgelist.edgelist_df
      return ((df["src"] == u) & (df["dst"] == v)).any().compute()
  
imports: import gc
  from typing import Union
  import warnings
  import cudf
  import cupy
  import dask
  import dask_cudf
  from dask import delayed
  from dask.distributed import wait, default_client
  import numpy
  from pylibcugraph import MGGraph, ResourceHandle, GraphProperties, get_two_hop_neighbors, select_random_vertices
  from cugraph.structure import graph_primtypes_wrapper
  from cugraph.structure.graph_primtypes_wrapper import Direction
  from cugraph.structure.number_map import NumberMap
  from cugraph.structure.symmetrize import symmetrize
  from cugraph.dask.common.part_utils import get_persisted_df_worker_map, persist_dask_df_equal_parts_per_worker
  from cugraph.dask.common.mg_utils import run_gc_on_dask_cluster
  from cugraph.dask import get_n_workers
  import cugraph.dask.comms.comms
label_desc: Use image node_id 21 for calling the simpleDistributedGraphImpl obj's underlying member method code with example usage: obj.has_edge(u, v) and returns: unknown