docstr: Initializes the distributed graph from the dask_cudf.DataFrame
  edgelist. Undirected Graphs are not currently supported.
  By default, renumbering is enabled to map the source and destination
  vertices into an index in the range [0, V) where V is the number
  of vertices.  If the input vertices are a single column of integers
  in the range [0, V), renumbering can be disabled and the original
  external vertex ids will be used.
  Note that the graph object will store a reference to the
  dask_cudf.DataFrame provided.
  
  Parameters
  ----------
  input_ddf : dask_cudf.DataFrame
      The edgelist as a dask_cudf.DataFrame
  
  source : str or array-like, optional (default='source')
      Source column name or array of column names
  
  destination : str, optional (default='destination')
      Destination column name or array of column names
  
  edge_attr : str, optional (default=None)
      Weights column name.
  
  renumber : bool, optional (default=True)
      If source and destination indices are not in range 0 to V where V
      is number of vertices, renumber argument should be True.
  
  store_transposed : bool, optional (default=False)
      If True, stores the transpose of the adjacency matrix.  Required
      for certain algorithms.
  
  legacy_renum_only : bool, optional (default=False)
      If True, skips the C++ renumbering step.  Must be true for
      pylibcugraph algorithms.  Must be false for algorithms
      not yet converted to the pylibcugraph C API.
  
      This parameter is deprecated and will be removed.
docstr_tok: ["Initializes","the","distributed","graph","from","the","dask_cudf.DataFrame","edgelist",".","Undirected","Graphs","are","not","currently","supported",".","By","default",",","renumbering","is","enabled","to","map","the","source","and","destination","vertices","into","an","index","in","the","range","[","0",",","V",")","where","V","is","the","number","of","vertices",".","If","the","input","vertices","are","a","single","column","of","integers","in","the","range","[","0",",","V",")",",","renumbering","can","be","disabled","and","the","original","external","vertex","ids","will","be","used",".","Note","that","the","graph","object","will","store","a","reference","to","the","dask_cudf.DataFrame","provided",".","Parameters","--","--","--","--","--","input_ddf",":","dask_cudf.DataFrame","The","edgelist","as","a","dask_cudf.DataFrame","source",":","str","or","array-like",",","optional","(","default='source","'",")","Source","column","name","or","array","of","column","names","destination",":","str",",","optional","(","default='destination","'",")","Destination","column","name","or","array","of","column","names","edge_attr",":","str",",","optional","(","default=None",")","Weights","column","name",".","renumber",":","bool",",","optional","(","default=True",")","If","source","and","destination","indices","are","not","in","range","0","to","V","where","V","is","number","of","vertices",",","renumber","argument","should","be","True",".","store_transposed",":","bool",",","optional","(","default=False",")","If","True",",","stores","the","transpose","of","the","adjacency","matrix",".","Required","for","certain","algorithms",".","legacy_renum_only",":","bool",",","optional","(","default=False",")","If","True",",","skips","the","C++","renumbering","step",".","Must","be","true","for","pylibcugraph","algorithms",".","Must","be","false","for","algorithms","not","yet","converted","to","the","pylibcugraph","C","API",".","This","parameter","is","deprecated","and","will","be","removed","."]
code: def from_dask_cudf_edgelist(
      self,
      input_ddf,
      source="source",
      destination="destination",
      edge_attr=None,
      renumber=True,
      store_transposed=False,
      legacy_renum_only=False,
  ):
      """
      Initializes the distributed graph from the dask_cudf.DataFrame
      edgelist. Undirected Graphs are not currently supported.
      By default, renumbering is enabled to map the source and destination
      vertices into an index in the range [0, V) where V is the number
      of vertices.  If the input vertices are a single column of integers
      in the range [0, V), renumbering can be disabled and the original
      external vertex ids will be used.
      Note that the graph object will store a reference to the
      dask_cudf.DataFrame provided.
  
      Parameters
      ----------
      input_ddf : dask_cudf.DataFrame
          The edgelist as a dask_cudf.DataFrame
  
      source : str or array-like, optional (default='source')
          Source column name or array of column names
  
      destination : str, optional (default='destination')
          Destination column name or array of column names
  
      edge_attr : str, optional (default=None)
          Weights column name.
  
      renumber : bool, optional (default=True)
          If source and destination indices are not in range 0 to V where V
          is number of vertices, renumber argument should be True.
  
      store_transposed : bool, optional (default=False)
          If True, stores the transpose of the adjacency matrix.  Required
          for certain algorithms.
  
      legacy_renum_only : bool, optional (default=False)
          If True, skips the C++ renumbering step.  Must be true for
          pylibcugraph algorithms.  Must be false for algorithms
          not yet converted to the pylibcugraph C API.
  
          This parameter is deprecated and will be removed.
      """
      raise TypeError("Distributed N-partite graph not supported")
  
imports: import numpy
  from .graph_implementation import simpleGraphImpl, simpleDistributedGraphImpl, npartiteGraphImpl
  import cudf
  import dask_cudf
  from cugraph.utilities.utils import import_optional
label_desc: Use image node_id 3 for calling the NPartiteGraph obj's underlying member method code with example usage: obj.from_dask_cudf_edgelist(input_ddf, source, destination, edge_attr, renumber, store_transposed, legacy_renum_only) without return types