Functions

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

The live catalog contains 27 SQL-visible cuGraph functions.

Function	Family	Description	Official API
Betweenness Centrality	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	Visit reachable vertices in increasing unweighted hop distance from one or more sources, returning distances and optional predecessors.	C API
Core Number	Structure	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	Compare the neighbor vectors of explicit vertex pairs using cosine similarity, with optional edge-weight contributions.	Python API
Degrees All	Structure	Count both incoming and outgoing edges for every vertex in the graph.	Python API
ECG	Community Detection	Stabilize community assignments by combining an ensemble of randomized Louvain partitions into a final consensus clustering.	C API
Edge Betweenness Centrality	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	Score vertices by connections to other high-scoring vertices, using power iteration to find the dominant eigenvector.	C API
ForceAtlas2	Layout	Place vertices in two dimensions with a force-directed simulation that attracts connected vertices and repels vertices from one another.	Python API
HITS	Centrality	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	Count incoming edges for every vertex in the graph.	Python API
Jaccard	Similarity	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	Return the edges of the maximal subgraph whose vertices each have degree at least k within that subgraph.	C API
Katz Centrality	Centrality	Score vertices from the number of walks that reach them, attenuating longer walks and adding a baseline contribution.	C API
Leiden	Community Detection	Find modularity-based communities with refinement steps that improve the internal connectedness of the partitions.	C API
Louvain	Community Detection	Build a hierarchy of communities by greedily moving vertices and aggregating partitions to maximize modularity.	C API
Minimum Spanning Tree	Connectivity	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	Count outgoing edges for every vertex in the graph.	Python API
Overlap	Similarity	Compare explicit vertex pairs by dividing their shared-neighbor count by the smaller of their two neighbor counts.	C API
PageRank	Centrality	Rank vertices by the stationary probability of a damped random walk that follows outgoing edges.	C API
Personalized PageRank	Centrality	Rank vertices with PageRank while biasing random-walk restarts toward explicitly weighted personalization vertices.	C API
Sorensen	Similarity	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	Partition vertices by embedding the graph with leading modularity eigenvectors and clustering that embedding with k-means.	C API
SSSP	Traversal & Paths	Compute minimum path distances and predecessors from one source vertex, using edges.weight or unit cost 1 when that field is omitted.	C API
Strongly Connected Components	Connectivity	Label maximal directed subgraphs in which every vertex is reachable from every other vertex.	C API
Triangle Count All	Structure	Count the number of three-vertex cycles incident to every vertex in the graph.	C API
Weakly Connected Components	Connectivity	Label maximal connected subgraphs after treating directed edges as undirected.	C API