A vertex is part of a triangle when it has two adjacent vertices with an edge between them.
GraphX implements a triangle counting algorithm in the [TriangleCount object][TriangleCount]
that determines the number of triangles passing through each vertex,
providing a measure of clustering.
We compute the triangle count of the social network dataset.
Note that TriangleCount requires the edges to be in canonical orientation (srcId < dstId)
and the graph to be partitioned using [Graph.partitionBy][Graph.partitionBy].
A vertex is part of a triangle when it has two adjacent vertices with an edge between them. GraphX implements a triangle counting algorithm in the [
TriangleCountobject][TriangleCount] that determines the number of triangles passing through each vertex, providing a measure of clustering. We compute the triangle count of the social network dataset.Note that
TriangleCountrequires the edges to be in canonical orientation (srcId < dstId) and the graph to be partitioned using [Graph.partitionBy][Graph.partitionBy].Run with