An implementation of the connected components algorithm, using a delta iteration.
Emit the candidate (Vertex-ID, Component-ID) pair if and only if the candidate component ID is less than the vertex's current component ID.
Function that turns a value into a 2-tuple where both fields are that value.
UDF that joins a (Vertex-ID, Component-ID) pair that represents the current component that a vertex is associated with, with a (Source-Vertex-ID, Target-VertexID) edge.
Undirected edges by emitting for each input edge the input edges itself and an inverted version.
Triangle enumeration is a pre-processing step to find closely connected parts in graphs.
Converts a Tuple2 into an Edge.
A basic implementation of the Page Rank algorithm using a bulk iteration.
A reduce function that takes a sequence of edges and builds the adjacency list for the vertex where the edges originate.
The function that applies the page rank dampening formula.
Filter that filters vertices where the rank difference is below a threshold.
Join function that distributes a fraction of a vertex's rank to all neighbors.
A map function that assigns an initial rank to all pages.
The transitive closure of a graph contains an edge for each pair of vertices which are endpoints of at least one path in the graph.
Copyright © 2014–2019 The Apache Software Foundation. All rights reserved.