Components#

Functions

cugraph_error_code_t cugraph_weakly_connected_components(
const cugraph_resource_handle_t *handle,
cugraph_graph_t *graph,
bool_t do_expensive_check,
cugraph_labeling_result_t **result,
cugraph_error_t **error
)#

Labels each vertex in the input graph with its (weakly-connected-)component ID.

The input graph must be symmetric. Component IDs can be arbitrary integers (they can be non-consecutive and are not ordered by component size or any other criterion).

Parameters:
  • handle[in] Handle for accessing resources

  • graph[in] Pointer to graph

  • do_expensive_check[in] A flag to run expensive checks for input arguments (if set to true).

  • result[out] Opaque pointer to labeling results

  • error[out] Pointer to an error object storing details of any error. Will be populated if error code is not CUGRAPH_SUCCESS

cugraph_error_code_t cugraph_strongly_connected_components(
const cugraph_resource_handle_t *handle,
cugraph_graph_t *graph,
bool_t do_expensive_check,
cugraph_labeling_result_t **result,
cugraph_error_t **error
)#

Labels each vertex in the input graph with its (strongly-connected-)component ID.

The input graph may be asymmetric. Component IDs can be arbitrary integers (they can be non-consecutive and are not ordered by component size or any other criterion).

Parameters:
  • handle[in] Handle for accessing resources

  • graph[in] Pointer to graph

  • do_expensive_check[in] A flag to run expensive checks for input arguments (if set to true).

  • result[out] Opaque pointer to labeling results

  • error[out] Pointer to an error object storing details of any error. Will be populated if error code is not CUGRAPH_SUCCESS

struct cugraph_labeling_result_t#
#include <labeling_algorithms.h>

Opaque labeling result type.

Public Members

int32_t align_#