cugraph.dask.cores.core_number.core_number#
- cugraph.dask.cores.core_number.core_number(input_graph, degree_type='bidirectional')[source]#
Compute the core numbers for the nodes of the graph G. A k-core of a graph is a maximal subgraph that contains nodes of degree k or more. A node has a core number of k if it belongs a k-core but not to k+1-core. This call does not support a graph with self-loops and parallel edges.
- Parameters:
- input_graphcugraph.graph
The current implementation only supports undirected graphs. The graph can contain edge weights, but they don’t participate in the calculation of the core numbers.
- degree_type: str, (default=”bidirectional”)
This option is currently ignored. This option may eventually determine if the core number computation should be based on input, output, or both directed edges, with valid values being “incoming”, “outgoing”, and “bidirectional” respectively.
- Returns:
- resultdask_cudf.DataFrame
GPU distributed data frame containing 2 dask_cudf.Series
- ddf[‘vertex’]: dask_cudf.Series
Contains the core number vertices
- ddf[‘core_number’]: dask_cudf.Series
Contains the core number of vertices