cugraph.dask.community.triangle_count.triangle_count

cugraph.dask.community.triangle_count.triangle_count(input_graph, start_list=None)

Computes the number of triangles (cycles of length three) and the number per vertex in the input graph.

Parameters:

input_graphcugraph.graph

cuGraph graph descriptor, should contain the connectivity information, (edge weights are not used in this algorithm). The current implementation only supports undirected graphs.

start_listlist or cudf.Series

list of vertices for triangle count. if None the entire set of vertices in the graph is processed

Returns:

resultdask_cudf.DataFrame

GPU distributed data frame containing 2 dask_cudf.Series

ddf[‘vertex’]: dask_cudf.Series

Contains the triangle counting vertices

ddf[‘counts’]: dask_cudf.Series

Contains the triangle counting counts