Functions

Every page below is generated from its unified GPU catalog descriptor.

The live catalog contains 27 SQL-visible cuGraph functions.

Function	Family	Signature	Summary	Official API
Betweenness Centrality	Centrality	cugraph_betweenness_centrality	Measure how often each vertex lies on shortest paths between other vertex pairs, exactly or from an explicit sample of source vertices.	C API
BFS	Traversal & Paths	cugraph_bfs	Visit reachable vertices in increasing unweighted hop distance from one or more sources, returning distances and optional predecessors.	C API
Core Number	Structure	cugraph_core_number	Assign each vertex the largest k for which it belongs to a k-core, where every vertex has degree at least k within that subgraph.	C API
Cosine	Similarity	cugraph_cosine	Compare the neighbor vectors of explicit vertex pairs using cosine similarity, with optional edge-weight contributions.	Python API
Degrees All	Structure	cugraph_degrees_all	Count both incoming and outgoing edges for every vertex in the graph.	Python API
ECG	Community Detection	cugraph_ecg	Stabilize community assignments by combining an ensemble of randomized Louvain partitions into a final consensus clustering.	C API
Edge Betweenness Centrality	Centrality	cugraph_edge_betweenness_centrality	Measure how often each edge lies on shortest paths between vertex pairs, exactly or from an explicit sample of source vertices.	C API
Eigenvector Centrality	Centrality	cugraph_eigenvector_centrality	Score vertices by connections to other high-scoring vertices, using power iteration to find the dominant eigenvector.	C API
ForceAtlas2	Layout	cugraph_force_atlas2	Place vertices in two dimensions with a force-directed simulation that attracts connected vertices and repels vertices from one another.	Python API
HITS	Centrality	cugraph_hits	Compute mutually reinforcing hub and authority scores: strong hubs point to strong authorities, and strong authorities are linked from strong hubs.	C API
In Degrees All	Structure	cugraph_in_degrees_all	Count incoming edges for every vertex in the graph.	Python API
Jaccard	Similarity	cugraph_jaccard	Compare explicit vertex pairs by dividing the size of their shared-neighbor intersection by the size of their neighbor union.	C API
K-Core	Structure	cugraph_k_core	Return the edges of the maximal subgraph whose vertices each have degree at least k within that subgraph.	C API
Katz Centrality	Centrality	cugraph_katz_centrality	Score vertices from the number of walks that reach them, attenuating longer walks and adding a baseline contribution.	C API
Leiden	Community Detection	cugraph_leiden	Find modularity-based communities with refinement steps that improve the internal connectedness of the partitions.	C API
Louvain	Community Detection	cugraph_louvain	Build a hierarchy of communities by greedily moving vertices and aggregating partitions to maximize modularity.	C API
Minimum Spanning Tree	Connectivity	cugraph_minimum_spanning_tree	Select a minimum-total-weight acyclic edge set, producing a spanning tree for a connected graph or a spanning forest otherwise.	Python API
Out Degrees All	Structure	cugraph_out_degrees_all	Count outgoing edges for every vertex in the graph.	Python API
Overlap	Similarity	cugraph_overlap	Compare explicit vertex pairs by dividing their shared-neighbor count by the smaller of their two neighbor counts.	C API
PageRank	Centrality	cugraph_pagerank	Rank vertices by the stationary probability of a damped random walk that follows outgoing edges.	C API
Personalized PageRank	Centrality	cugraph_personalized_pagerank	Rank vertices with PageRank while biasing random-walk restarts toward explicitly weighted personalization vertices.	C API
Sorensen	Similarity	cugraph_sorensen	Compare explicit vertex pairs as twice their shared-neighbor count divided by the sum of their neighbor counts.	C API
Spectral Modularity Maximization	Community Detection	cugraph_spectral_modularity_maximization	Partition vertices by embedding the graph with leading modularity eigenvectors and clustering that embedding with k-means.	C API
SSSP	Traversal & Paths	cugraph_sssp	Compute minimum weighted-path distances and predecessors from one source vertex to every reachable vertex.	C API
Strongly Connected Components	Connectivity	cugraph_strongly_connected_components	Label maximal directed subgraphs in which every vertex is reachable from every other vertex.	C API
Triangle Count All	Structure	cugraph_triangle_count_all	Count the number of three-vertex cycles incident to every vertex in the graph.	C API
Weakly Connected Components	Connectivity	cugraph_weakly_connected_components	Label maximal connected subgraphs after treating directed edges as undirected.	C API