This is a primitive for implementing graph algorithms.
We can use this function to compute the in-degree of each vertex
val g: GraphFrame = Graph.textFile("twittergraph") val inDeg: DataFrame = g.aggregateMessages().sendToDst(lit(1)).agg(sum(AggregateMessagesBuilder.msg))
Breadth-first search (BFS)
Connected components algorithm.
Run static Label Propagation for detecting communities in networks.
PageRank algorithm implementation.
Parallel Personalized PageRank algorithm implementation.
Implement SVD++ based on "Factorization Meets the Neighborhood: a Multifaceted Collaborative Filtering Model", available at https://movie-datamining.googlecode.com/svn/trunk/kdd08koren.pdf.
Computes shortest paths from every vertex to the given set of landmark vertices.
Compute the strongly connected component (SCC) of each vertex and return a DataFrame with each vertex assigned to the SCC containing that vertex.
Computes the number of triangles passing through each vertex.