Crate cugraph_sys 

Raw FFI bindings to the cuGraph C API.

Published as an Algeon implementation dependency. Applications use algeon-datafusion; workspace code uses this crate for its component contracts. See the API documentation boundary.

This crate provides checked-in bindings generated with bindgen. Safe APIs are exposed by the cugraph crate.

Re-exports

pub use self::cugraph_error_code_ as cugraph_error_code_t;

pub use self::cugraph_allocation_source_ as cugraph_allocation_source_t;

pub use self::cugraph_error_failure_source_ as cugraph_error_failure_source_t;

pub use self::bool_ as bool_t;

pub use self::data_type_id_ as cugraph_data_type_id_t;

Structs

bool_

cugraph_allocation_source_

cugraph_bfs_predicate_result_t

@brief Opaque BFS predicate result type

cugraph_centrality_result_t

@brief Opaque centrality result type

cugraph_clustering_result_t

@brief Opaque clustering output

cugraph_coo_list_t

@brief Opaque COO list definition

cugraph_coo_t

@brief Opaque COO definition

cugraph_core_result_t

@brief Opaque core number result type

cugraph_data_mask_t

cugraph_degrees_result_t

@brief Opaque degree result type

cugraph_edge_centrality_result_t

@brief Opaque edge centrality result type

cugraph_edge_property_t

cugraph_edge_property_view_t

cugraph_edgelist_t

@brief Opaque edgelist type

cugraph_error_

cugraph_error_code_

cugraph_error_failure_source_

@brief Provenance of an allocation failure, when the allocation owner can distinguish a logical reservation limit from physical device memory pressure.

cugraph_extract_paths_result_t

@brief Opaque extract_paths result type

cugraph_graph_properties_t

cugraph_graph_t

cugraph_hierarchical_clustering_result_t

@brief Opaque hierarchical clustering output

cugraph_hits_result_t

@brief Opaque hits result type

cugraph_induced_subgraph_result_t

@brief Opaque induced subgraph type

cugraph_k_core_result_t

@brief Opaque k-core result type

cugraph_labeling_result_t

@brief Opaque labeling result type

cugraph_layout_result_t

@brief Opaque layout output

cugraph_lookup_container_t

@brief Opaque src-dst lookup container type

cugraph_lookup_result_t

@brief Opaque src-dst lookup result type

cugraph_paths_result_t

@brief Opaque paths result type

cugraph_random_walk_result_t

@brief Opaque random walk result type

cugraph_resource_handle_

cugraph_rng_state_t

cugraph_sample_result_t

@brief Opaque neighborhood sampling result type

cugraph_sampling_options_t

@brief Opaque sampling options type

cugraph_similarity_result_t

@brief Opaque similarity result type

cugraph_triangle_count_result_t

@brief Opaque triangle counting result type

cugraph_type_erased_device_array_t

cugraph_type_erased_device_array_view_t

cugraph_type_erased_host_array_t

cugraph_type_erased_host_array_view_t

cugraph_vertex_pairs_t

@brief Opaque vertex pair type

cugraph_vertex_property_t

cugraph_vertex_property_view_t

data_type_id_

Constants

cugraph_compression_type_t_COO

cugraph_compression_type_t_CSC

Compresses in CSR format. This means the row (src) column is compressed into a row pointer.

cugraph_compression_type_t_CSR

Outputs in COO format. Default.

cugraph_compression_type_t_DCSC

Compresses in DCSR format. This outputs an additional index that avoids empty entries in the row pointer.

cugraph_compression_type_t_DCSR

Compresses in CSC format. This means the col (dst) column is compressed into a column pointer.

cugraph_generator_distribution_t_POWER_LAW

cugraph_generator_distribution_t_UNIFORM

cugraph_k_core_degree_type_t_K_CORE_DEGREE_TYPE_IN

cugraph_k_core_degree_type_t_K_CORE_DEGREE_TYPE_INOUT

Compute core_number using outgoing edges

cugraph_k_core_degree_type_t_K_CORE_DEGREE_TYPE_OUT

Compute core_number using incoming edges

cugraph_prior_sources_behavior_t_CARRY_OVER

Construct sources for hop k from destination vertices from hop k-1

cugraph_prior_sources_behavior_t_DEFAULT

cugraph_prior_sources_behavior_t_EXCLUDE

Construct sources for hop k from destination vertices from hop k-1 and sources from hop k-1

cugraph_temporal_sampling_comparison_t_LAST

Time monotonically decreasing (could have multiple edges with same time)

cugraph_temporal_sampling_comparison_t_MONOTONICALLY_DECREASING

Time strictly decreasing (each time is before the previous one)

cugraph_temporal_sampling_comparison_t_MONOTONICALLY_INCREASING

Time strictly increasing (each time is after the previous one)

cugraph_temporal_sampling_comparison_t_STRICTLY_DECREASING

Time monotonically increasing (could have multiple edges with same time)

cugraph_temporal_sampling_comparison_t_STRICTLY_INCREASING

Functions

cugraph_all_pairs_cosine_similarity_coefficients^⚠

@brief Perform All Pairs cosine similarity computation

cugraph_all_pairs_jaccard_coefficients^⚠

@brief Perform All-Pairs Jaccard similarity computation

cugraph_all_pairs_overlap_coefficients^⚠

@brief Perform All Pairs overlap similarity computation

cugraph_all_pairs_sorensen_coefficients^⚠

@brief Perform All Pairs Sorensen similarity computation

cugraph_allgather^⚠

@brief Gather edgelist

cugraph_analyze_clustering_edge_cut^⚠

@brief Compute edge cut of the specified clustering

cugraph_analyze_clustering_modularity^⚠

@brief Compute modularity of the specified clustering

cugraph_analyze_clustering_ratio_cut^⚠

@brief Compute ratio cut of the specified clustering

cugraph_balanced_cut_clustering^⚠

@brief Balanced cut clustering

cugraph_betweenness_centrality^⚠

@brief Compute betweenness centrality

cugraph_bfs^⚠

@brief Perform a breadth first search from a set of seed vertices.

cugraph_bfs_predicate_result_free^⚠

@ingroup traversal @brief Free BFS predicate result

cugraph_bfs_predicate_result_get_target_distance^⚠

@ingroup traversal @brief Return the BFS depth where a target was first discovered.

cugraph_bfs_predicate_result_get_target_found^⚠

@ingroup traversal @brief Return whether a target was discovered.

cugraph_bfs_with_predicates^⚠

@brief Perform a breadth first search with optional edge, vertex, and target predicates.

cugraph_biased_random_walks^⚠

@brief Compute biased random walks

cugraph_build_edge_id_and_type_to_src_dst_lookup_map^⚠

@brief Build map to lookup source and destination using edge id and type

cugraph_centrality_result_converged^⚠

@ingroup centrality @brief Returns true if the centrality algorithm converged

cugraph_centrality_result_free^⚠

@ingroup centrality @brief Free centrality result

cugraph_centrality_result_get_num_iterations^⚠

@ingroup centrality @brief Get the number of iterations executed from the algorithm metadata

cugraph_centrality_result_get_values^⚠

@ingroup centrality @brief Get the centrality values from a centrality algorithm result

cugraph_centrality_result_get_vertices^⚠

@ingroup centrality @brief Get the vertex ids from the centrality result

cugraph_clustering_result_free^⚠

@brief Free a clustering result

cugraph_clustering_result_get_clusters^⚠

@brief Get clustering clusters

cugraph_clustering_result_get_vertices^⚠

@brief Get clustering vertices

cugraph_coo_free^⚠

@brief Free coo object

cugraph_coo_get_destinations^⚠

@brief Get the destination vertex ids

cugraph_coo_get_edge_id^⚠

@brief Get the edge id

cugraph_coo_get_edge_type^⚠

@brief Get the edge type

cugraph_coo_get_edge_weights^⚠

@brief Get the edge weights

cugraph_coo_get_sources^⚠

@brief Get the source vertex ids

cugraph_coo_list_element^⚠

@brief Get a COO from the list

cugraph_coo_list_free^⚠

@brief Free coo list

cugraph_coo_list_size^⚠

@brief Get the number of coo object in the list

cugraph_core_number^⚠

@brief Perform core number.

cugraph_core_result_create^⚠

@ingroup core @brief Create a core_number result (in case it was previously extracted)

cugraph_core_result_free^⚠

@ingroup core @brief Free core result

cugraph_core_result_get_core_numbers^⚠

@ingroup core @brief Get the core numbers from the core result

cugraph_core_result_get_vertices^⚠

@ingroup core @brief Get the vertex ids from the core result

cugraph_cosine_similarity_coefficients^⚠

@brief Perform cosine similarity computation

cugraph_count_multi_edges^⚠

@brief Count multi_edges

cugraph_create_resource_handle^⚠

@brief Construct a resource handle

cugraph_create_vertex_pairs^⚠

@brief Create vertex_pairs

cugraph_data_mask_create^⚠

@brief Create a data mask

cugraph_data_mask_destroy^⚠

@brief Destroy a data mask

cugraph_decompress_to_edgelist^⚠

@brief Construct the edge list from the graph view object.

cugraph_degrees^⚠

@brief Compute degrees

cugraph_degrees_result_free^⚠

@brief Free degree result

cugraph_degrees_result_get_in_degrees^⚠

@brief Get the in degrees

cugraph_degrees_result_get_out_degrees^⚠

@brief Get the out degrees

cugraph_degrees_result_get_vertices^⚠

@brief Get the vertex ids

cugraph_ecg^⚠

@brief Compute ECG clustering

cugraph_edge_betweenness_centrality^⚠

@brief Compute edge betweenness centrality

cugraph_edge_centrality_result_free^⚠

@ingroup centrality @brief Free centrality result

cugraph_edge_centrality_result_get_dst_vertices^⚠

@ingroup centrality @brief Get the dst vertex ids from an edge centrality result

cugraph_edge_centrality_result_get_edge_ids^⚠

@ingroup centrality @brief Get the edge ids from an edge centrality result

cugraph_edge_centrality_result_get_src_vertices^⚠

@ingroup centrality @brief Get the src vertex ids from an edge centrality result

cugraph_edge_centrality_result_get_values^⚠

@ingroup centrality @brief Get the centrality values from an edge centrality algorithm result

cugraph_edgelist_free^⚠

@brief Free edgelist

cugraph_edgelist_get_destinations^⚠

@brief Get the destination vertex ids

cugraph_edgelist_get_edge_ids^⚠

@brief Get the edge ids

cugraph_edgelist_get_edge_offsets^⚠

@brief Get the edge offsets

cugraph_edgelist_get_edge_type_ids^⚠

@brief Get the edge types

cugraph_edgelist_get_edge_weights^⚠

@brief Get the edge weights

cugraph_edgelist_get_sources^⚠

@brief Get the source vertex ids

cugraph_eigenvector_centrality^⚠

@brief Compute eigenvector centrality

cugraph_eigenvector_centrality_allow_nonconvergence^⚠

cugraph_error_alignment^⚠

cugraph_error_allocation_source^⚠

cugraph_error_cuda_error^⚠

cugraph_error_domain_id^⚠

cugraph_error_failure_source^⚠

cugraph_error_free^⚠

@brief Destroy an error message

cugraph_error_generation^⚠

cugraph_error_member_id^⚠

cugraph_error_message^⚠

@brief Return an error message

cugraph_error_requested_bytes^⚠

cugraph_extract_ego^⚠

@brief Extract ego graphs

cugraph_extract_induced_subgraph^⚠

@brief Extract induced subgraph(s)

cugraph_extract_paths^⚠

@brief Extract BFS or SSSP paths from a cugraph_paths_result_t

cugraph_extract_paths_result_free^⚠

@ingroup traversal @brief Free extract_paths result

cugraph_extract_paths_result_get_max_path_length^⚠

@brief Get the max path length from extract_paths result

cugraph_extract_paths_result_get_paths^⚠

@ingroup traversal @brief Get the matrix (row major order) of paths

cugraph_extract_vertex_list^⚠

@brief Extract the vertex list from the graph view object.

cugraph_force_atlas2^⚠

cugraph_free_resource_handle^⚠

@brief Free resources in the resource handle

cugraph_generate_edge_ids^⚠

@brief Add edge ids to an COO

cugraph_generate_edge_types^⚠

@brief Generate random edge types, add them to an COO

cugraph_generate_edge_weights^⚠

@brief Generate edge weights and add to an rmat edge list

cugraph_generate_rmat_edgelist^⚠

@brief Generate RMAT edge list

cugraph_generate_rmat_edgelists^⚠

@brief Generate RMAT edge lists

cugraph_graph_add_data_mask^⚠

@brief Associate a data mask with a graph

cugraph_graph_create_mg^⚠

@brief Construct an MG graph

cugraph_graph_create_sg^⚠

@brief Construct an SG graph

cugraph_graph_create_sg_from_csr^⚠

@brief Construct an SG graph from a CSR input

cugraph_graph_create_with_times_mg^⚠

@brief Construct an MG graph

cugraph_graph_create_with_times_sg^⚠

@brief Construct an SG graph

cugraph_graph_free^⚠

@brief Destroy an graph

cugraph_graph_get_data_mask^⚠

@brief Get the data mask currently associated with a graph

cugraph_graph_release_data_mask^⚠

@brief Release the data mask currently associated with a graph

cugraph_has_vertex^⚠

@brief Verify if a vertex exists in the graph

cugraph_heterogeneous_biased_neighbor_sample^⚠

@brief Heterogeneous Biased Neighborhood Sampling

cugraph_heterogeneous_biased_temporal_neighbor_sample^⚠

@brief Heterogeneous Biased Temporal Neighborhood Sampling

cugraph_heterogeneous_uniform_neighbor_sample^⚠

@brief Heterogeneous Uniform Neighborhood Sampling

cugraph_heterogeneous_uniform_temporal_neighbor_sample^⚠

@brief Heterogeneous Uniform Temporal Neighborhood Sampling

cugraph_hierarchical_clustering_result_free^⚠

@ingroup community @brief Free a hierarchical clustering result

cugraph_hierarchical_clustering_result_get_clusters^⚠

@ingroup community @brief Get hierarchical clustering clusters

cugraph_hierarchical_clustering_result_get_modularity^⚠

@ingroup community @brief Get modularity

cugraph_hierarchical_clustering_result_get_vertices^⚠

@ingroup community @brief Get hierarchical clustering vertices

cugraph_hits^⚠

@brief Compute hits

cugraph_hits_allow_nonconvergence^⚠

@brief Compute hits, reporting non-convergence in the result

cugraph_hits_result_converged^⚠

@ingroup centrality @brief Returns true if hits converged

cugraph_hits_result_free^⚠

@ingroup centrality @brief Free hits result

cugraph_hits_result_get_authorities^⚠

@ingroup centrality @brief Get the authorities values from the hits result

cugraph_hits_result_get_hub_score_differences^⚠

@ingroup centrality @brief Get the score differences between the last two iterations

cugraph_hits_result_get_hubs^⚠

@ingroup centrality @brief Get the hubs values from the hits result

cugraph_hits_result_get_number_of_iterations^⚠

@ingroup centrality @brief Get the actual number of iterations

cugraph_hits_result_get_vertices^⚠

@ingroup centrality @brief Get the vertex ids from the hits result

cugraph_homogeneous_biased_neighbor_sample^⚠

@brief Homogeneous Biased Neighborhood Sampling

cugraph_homogeneous_biased_temporal_neighbor_sample^⚠

@brief Homogeneous Biased Temporal Neighborhood Sampling

cugraph_homogeneous_uniform_neighbor_sample^⚠

@brief Homogeneous Uniform Neighborhood Sampling

cugraph_homogeneous_uniform_temporal_neighbor_sample^⚠

@brief Homogeneous Uniform Temporal Neighborhood Sampling

cugraph_in_degrees^⚠

@brief Compute in degrees

cugraph_induced_subgraph_get_destinations^⚠

@brief Get the destination vertex ids

cugraph_induced_subgraph_get_edge_ids^⚠

@brief Get the edge ids

cugraph_induced_subgraph_get_edge_type_ids^⚠

@brief Get the edge types

cugraph_induced_subgraph_get_edge_weights^⚠

@brief Get the edge weights

cugraph_induced_subgraph_get_sources^⚠

@brief Get the source vertex ids

cugraph_induced_subgraph_get_subgraph_offsets^⚠

@brief Get the subgraph offsets

cugraph_induced_subgraph_result_free^⚠

@brief Free induced subgraph

cugraph_jaccard_coefficients^⚠

@brief Perform Jaccard similarity computation

cugraph_k_core^⚠

@brief Perform k_core using output from core_number

cugraph_k_core_result_free^⚠

@ingroup core @brief Free k-core result

cugraph_k_core_result_get_dst_vertices^⚠

@ingroup core @brief Get the dst vertex ids from the k-core result

cugraph_k_core_result_get_src_vertices^⚠

@ingroup core @brief Get the src vertex ids from the k-core result

cugraph_k_core_result_get_weights^⚠

@ingroup core @brief Get the weights from the k-core result

cugraph_k_truss_subgraph^⚠

@brief Extract k truss for a graph

cugraph_katz_centrality^⚠

@brief Compute katz centrality

cugraph_katz_centrality_allow_nonconvergence^⚠

@brief Compute katz centrality, reporting non-convergence in the result

cugraph_labeling_result_free^⚠

@ingroup labeling @brief Free labeling result

cugraph_labeling_result_get_labels^⚠

@ingroup labeling @brief Get the label values from the labeling result

cugraph_labeling_result_get_vertices^⚠

@ingroup labeling @brief Get the vertex ids from the labeling result

cugraph_layout_result_free^⚠

cugraph_layout_result_get_vertices^⚠

cugraph_layout_result_get_x_axis^⚠

cugraph_layout_result_get_y_axis^⚠

cugraph_leiden^⚠

@brief Compute Leiden

cugraph_lookup_container_free^⚠

@ingroup samplingC @brief Free a sampling lookup map

cugraph_lookup_endpoints_from_edge_ids_and_single_type^⚠

@brief Lookup edge sources and destinations using edge ids and a single edge type.

cugraph_lookup_endpoints_from_edge_ids_and_types^⚠

@brief Lookup edge sources and destinations using edge ids and edge types.

cugraph_lookup_result_free^⚠

@ingroup samplingC @brief Free a src-dst lookup result

cugraph_lookup_result_get_dsts^⚠

@ingroup samplingC @brief Get the edge destinations from the lookup result

cugraph_lookup_result_get_srcs^⚠

@ingroup samplingC @brief Get the edge sources from the lookup result

cugraph_louvain^⚠

@brief Compute Louvain

cugraph_minimum_spanning_tree^⚠

@brief Minimum Spanning Tree

cugraph_negative_sampling^⚠

@ingroup samplingC @brief Perform negative sampling

cugraph_node2vec_random_walks^⚠

@brief Compute random walks using the node2vec framework.

cugraph_out_degrees^⚠

@brief Compute out degrees

cugraph_overlap_coefficients^⚠

@brief Perform overlap similarity computation

cugraph_pagerank^⚠

@brief Compute pagerank

cugraph_pagerank_allow_nonconvergence^⚠

@brief Compute pagerank

cugraph_paths_result_free^⚠

@ingroup traversal @brief Free paths result

cugraph_paths_result_get_distances^⚠

@ingroup traversal @brief Get the distances from the paths result

cugraph_paths_result_get_predecessors^⚠

@ingroup traversal @brief Get the predecessors from the paths result

cugraph_paths_result_get_vertices^⚠

@ingroup traversal @brief Get the vertex ids from the paths result

cugraph_personalized_pagerank^⚠

@brief Compute personalized pagerank

cugraph_personalized_pagerank_allow_nonconvergence^⚠

@brief Compute personalized pagerank

cugraph_random_walk_result_free^⚠

@ingroup samplingC @brief Free random walks result

cugraph_random_walk_result_get_max_path_length^⚠

@ingroup samplingC @brief Get the max path length from random walk result

cugraph_random_walk_result_get_path_sizes^⚠

@ingroup samplingC @brief If the random walk result is compressed, get the path sizes @deprecated This call will no longer be relevant once the new node2vec are called

cugraph_random_walk_result_get_paths^⚠

@ingroup samplingC @brief Get the matrix (row major order) of vertices in the paths

cugraph_random_walk_result_get_weights^⚠

@ingroup samplingC @brief Get the matrix (row major order) of edge weights in the paths

cugraph_renumber_arbitrary_edgelist^⚠

@brief Renumber arbitrary edgelist

cugraph_resource_handle_get_comm_size^⚠

@brief get comm_size from resource handle

cugraph_resource_handle_get_rank^⚠

@brief get rank from resource handle

cugraph_rng_state_create^⚠

@brief Create a Random Number Generator State

cugraph_rng_state_free^⚠

@brief Destroy a Random Number Generator State

cugraph_sample_result_free^⚠

@ingroup samplingC @brief Free a sampling result

cugraph_sample_result_get_destinations^⚠

@deprecated This call should be replaced with cugraph_sample_result_get_minors @brief Get the destination vertices from the sampling algorithm result

cugraph_sample_result_get_edge_end_time^⚠

@ingroup samplingC @brief Get the edge_end_time from the sampling algorithm result

cugraph_sample_result_get_edge_id^⚠

@ingroup samplingC @brief Get the edge_id from the sampling algorithm result

cugraph_sample_result_get_edge_renumber_map^⚠

@ingroup samplingC @brief Get the edge renumber map

cugraph_sample_result_get_edge_renumber_map_offsets^⚠

@ingroup samplingC @brief Get the edge renumber map offets

cugraph_sample_result_get_edge_start_time^⚠

@ingroup samplingC @brief Get the edge_start_time from the sampling algorithm result

cugraph_sample_result_get_edge_type^⚠

@ingroup samplingC @brief Get the edge_type from the sampling algorithm result

cugraph_sample_result_get_edge_weight^⚠

@ingroup samplingC @brief Get the edge_weight from the sampling algorithm result

cugraph_sample_result_get_hop^⚠

@ingroup samplingC @brief Get the hop from the sampling algorithm result

cugraph_sample_result_get_index^⚠

@ingroup samplingC @brief Get the index from the sampling algorithm result

cugraph_sample_result_get_label_hop_offsets^⚠

@ingroup samplingC @brief Get the label-hop offsets from the sampling algorithm result

cugraph_sample_result_get_label_type_hop_offsets^⚠

@ingroup samplingC @brief Get the label-type-hop offsets from the sampling algorithm result

cugraph_sample_result_get_major_offsets^⚠

@ingroup samplingC @brief Get the major offsets from the sampling algorithm result

cugraph_sample_result_get_majors^⚠

@ingroup samplingC @brief Get the major vertices from the sampling algorithm result

cugraph_sample_result_get_minors^⚠

@ingroup samplingC @brief Get the minor vertices from the sampling algorithm result

cugraph_sample_result_get_offsets^⚠

@deprecated This call should be replaced with cugraph_sample_get_get_label_hop_offsets @brief Get the result offsets from the sampling algorithm result

cugraph_sample_result_get_renumber_map^⚠

@ingroup samplingC @brief Get the renumber map

cugraph_sample_result_get_renumber_map_offsets^⚠

@ingroup samplingC @brief Get the renumber map offsets

cugraph_sample_result_get_sources^⚠

@deprecated This call should be replaced with cugraph_sample_result_get_majors @brief Get the source vertices from the sampling algorithm result

cugraph_sample_result_get_start_labels^⚠

@ingroup samplingC @brief Get the start labels from the sampling algorithm result

cugraph_sampling_options_create^⚠

@ingroup samplingC @brief Create sampling options object

cugraph_sampling_options_free^⚠

@ingroup samplingC @brief Free sampling options object

cugraph_sampling_set_compress_per_hop^⚠

@ingroup samplingC @brief Set whether to compress per-hop (True) or globally (False)

cugraph_sampling_set_compression_type^⚠

@ingroup samplingC @brief Set compression type

cugraph_sampling_set_dedupe_sources^⚠

@ingroup samplingC @brief Set flag to sample dedupe_sources prior to sampling

cugraph_sampling_set_disjoint_sampling^⚠

@ingroup samplingC @brief Set flag to perform disjoint sampling

cugraph_sampling_set_prior_sources_behavior^⚠

@ingroup samplingC @brief Set prior sources behavior

cugraph_sampling_set_renumber_results^⚠

@ingroup samplingC @brief Set flag to renumber results

cugraph_sampling_set_retain_seeds^⚠

@ingroup samplingC @brief Set flag to retain seeds (original sources)

cugraph_sampling_set_return_hops^⚠

@ingroup samplingC @brief Set flag to sample return_hops

cugraph_sampling_set_temporal_sampling_comparison^⚠

@ingroup samplingC @brief Set temporal sampling to use associated comparision.

cugraph_sampling_set_with_replacement^⚠

@ingroup samplingC @brief Set flag to sample with_replacement

cugraph_select_random_vertices^⚠

@ingroup samplingC @brief Select random vertices from the graph

cugraph_similarity_result_free^⚠

@ingroup similarity @brief Free similarity result

cugraph_similarity_result_get_similarity^⚠

@ingroup similarity @brief Get the similarity coefficient array

cugraph_similarity_result_get_vertex_pairs^⚠

@ingroup similarity @brief Get vertex pair from the similarity result.

cugraph_sorensen_coefficients^⚠

@brief Perform Sorensen similarity computation

cugraph_spectral_modularity_maximization^⚠

@brief Spectral clustering

cugraph_sssp^⚠

@brief Perform single-source shortest-path to compute the minimum distances (and predecessors) from the source vertex.

cugraph_strongly_connected_components^⚠

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

cugraph_test_sample_result_create^⚠

@ingroup samplingC @brief Create a sampling result (testing API)

cugraph_test_uniform_neighborhood_sample_result_create^⚠

@ingroup samplingC @brief Create a sampling result (testing API)

cugraph_triangle_count^⚠

@brief Triangle Counting

cugraph_triangle_count_result_free^⚠

@ingroup community @brief Free a triangle count result

cugraph_triangle_count_result_get_counts^⚠

@ingroup community @brief Get triangle counting counts

cugraph_triangle_count_result_get_vertices^⚠

@ingroup community @brief Get triangle counting vertices

cugraph_two_hop_neighbors^⚠

@brief Find all 2-hop neighbors in the graph

cugraph_type_erased_device_array_create^⚠

@brief Create a type erased device array

cugraph_type_erased_device_array_create_from_view^⚠

@brief Create a type erased device array from a view

cugraph_type_erased_device_array_free^⚠

@brief Destroy a type erased device array

cugraph_type_erased_device_array_view^⚠

@brief Create a type erased device array view from a type erased device array

cugraph_type_erased_device_array_view_as_type^⚠

@brief Create a type erased device array view with a different type

cugraph_type_erased_device_array_view_copy^⚠

@brief Copy data between two type erased device array views

cugraph_type_erased_device_array_view_copy_from_host^⚠

@brief Copy data from host to a type erased device array view

cugraph_type_erased_device_array_view_copy_to_host^⚠

@brief Copy data from device to a type erased host array

cugraph_type_erased_device_array_view_create^⚠

@brief Create a type erased device array view from a raw device pointer.

cugraph_type_erased_device_array_view_free^⚠

@brief Destroy a type erased device array view

cugraph_type_erased_device_array_view_pointer^⚠

@brief Get the raw pointer of the type erased device array view

cugraph_type_erased_device_array_view_size^⚠

@brief Get the size of a type erased device array view

cugraph_type_erased_device_array_view_type^⚠

@brief Get the type of a type erased device array view

cugraph_type_erased_host_array_create^⚠

@brief Create a type erased host array

cugraph_type_erased_host_array_free^⚠

@brief Destroy a type erased host array

cugraph_type_erased_host_array_pointer^⚠

@brief Get the raw pointer of the type erased host array view

cugraph_type_erased_host_array_size^⚠

@brief Get the size of a type erased host array view

cugraph_type_erased_host_array_type^⚠

@brief Get the type of a type erased host array view

cugraph_type_erased_host_array_view^⚠

@brief Create a type erased host array view from a type erased host array

cugraph_type_erased_host_array_view_copy^⚠

@brief Copy data between two type erased device array views

cugraph_type_erased_host_array_view_create^⚠

@brief Create a type erased host array view from a raw host pointer.

cugraph_type_erased_host_array_view_free^⚠

@brief Destroy a type erased host array view

cugraph_uniform_random_walks^⚠

@brief Compute uniform random walks

cugraph_vertex_pairs_free^⚠

@brief Free vertex pair

cugraph_vertex_pairs_get_first^⚠

@brief Get the first vertex id array

cugraph_vertex_pairs_get_second^⚠

@brief Get the second vertex id array

cugraph_weakly_connected_components^⚠

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

Type Aliases

byte_t

cugraph_compression_type_t

@brief Selects the type of compression to use for the output samples.

cugraph_error_t

cugraph_generator_distribution_t

cugraph_k_core_degree_type_t

@ingroup core @brief Enumeration for computing core number

cugraph_prior_sources_behavior_t

@brief Enumeration for prior sources behavior

cugraph_resource_handle_t

cugraph_temporal_sampling_comparison_t

@brief Enumeration for temporal comparison options