Tree algorithms#

Functions

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

Minimum Spanning Tree.

NOTE: This currently wraps the legacy minimum implementation and is only available in Single GPU implementation.

Parameters:

  • handle – [in] Handle for accessing resources

  • graph – [in] Pointer to graph. NOTE: Graph might be modified if the storage needs to be transposed

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

  • result – [out] Opaque object containing the extracted subgraph

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

Returns:

error code

struct cugraph_layout_result_t
#include <layout_algorithms.h>