This algorithm ignores edge direction; i.e., all edges are treated as undirected. In a multigraph, duplicate edges will be counted only once.
gf_triangle_count(x, ...)
An object coercable to a GraphFrame (typically, a gf_graphframe).
gf_graphframe
Optional arguments, currently not used.
# NOT RUN { g <- gf_friends(sc) gf_triangle_count(g) # }
Run the code above in your browser using DataLab