def triangles(G):
"""
Compute the triangle (number of cycles of length three) count of the
input graph.
Parameters
----------
G : cugraph.graph
cuGraph graph descriptor, should contain the connectivity information,
(edge weights are not used in this algorithm)
Returns
-------
count : int64
A 64 bit integer whose value gives the number of triangles in the
graph.
Examples
--------
>>> M = cudf.read_csv('datasets/karate.csv', delimiter=' ',
>>> dtype=['int32', 'int32', 'float32'], header=None)
>>> sources = cudf.Series(M['0'])
>>> destinations = cudf.Series(M['1'])
>>> G = cugraph.Graph()
>>> G.add_edge_list(sources, destinations, None)
>>> count = cugraph.triangles(G)
"""
result = triangle_count_wrapper.triangles(G.graph_ptr)
return result
def triangles(G):
"""
Compute the number of triangles (cycles of length three) in the
input graph.
Parameters
----------
G : cugraph.graph
cuGraph graph descriptor, should contain the connectivity information,
(edge weights are not used in this algorithm)
Returns
-------
count : int64
A 64 bit integer whose value gives the number of triangles in the
graph.
Examples
--------
>>> gdf = cudf.read_csv('datasets/karate.csv',
delimiter = ' ',
dtype=['int32', 'int32', 'float32'],
header=None)
>>> G = cugraph.Graph()
>>> G.from_cudf_edgelist(gdf, source='0', destination='1')
>>> count = cugraph.triangles(G)
"""
if type(G) is not Graph:
raise Exception("input graph must be undirected")
result = triangle_count_wrapper.triangles(G)
return result
def triangles(G):
"""
Compute the number of triangles (cycles of length three) in the
input graph.
Unlike NetworkX, this algorithm simply returns the total number of
triangle and not the number per vertex.
Parameters
----------
G : cugraph.graph or networkx.Graph
cuGraph graph descriptor, should contain the connectivity information,
(edge weights are not used in this algorithm)
Returns
-------
count : int64
A 64 bit integer whose value gives the number of triangles in the
graph.
Examples
--------
>>> gdf = cudf.read_csv(datasets_path / 'karate.csv',
... delimiter = ' ',
... dtype=['int32', 'int32', 'float32'],
... header=None)
>>> G = cugraph.Graph()
>>> G.from_cudf_edgelist(gdf, source='0', destination='1')
>>> count = cugraph.triangles(G)
"""
G, _ = ensure_cugraph_obj_for_nx(G)
if type(G) is not Graph:
raise Exception("input graph must be undirected")
result = triangle_count_wrapper.triangles(G)
return result