Description Usage Arguments Examples
This algorithm ignores edge direction; i.e., all edges are treated as undirected. In a multigraph, duplicate edges will be counted only once.
1 | gf_triangle_count(x, ...)
|
x |
An object coercable to a GraphFrame (typically, a
|
... |
Optional arguments, currently not used. |
1 2 3 4 5 | ## Not run:
g <- gf_friends(sc)
gf_triangle_count(g)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.