Class  Description 

ConnectedComponents 
An implementation of the connected components algorithm, using a delta iteration.

ConnectedComponents.ComponentIdFilter 
Emit the candidate (VertexID, ComponentID) pair if and only if the candidate component ID
is less than the vertex's current component ID.

ConnectedComponents.DuplicateValue<T> 
Function that turns a value into a 2tuple where both fields are that value.

ConnectedComponents.NeighborWithComponentIDJoin 
UDF that joins a (VertexID, ComponentID) pair that represents the current component that a
vertex is associated with, with a (SourceVertexID, TargetVertexID) edge.

ConnectedComponents.UndirectEdge 
Undirected edges by emitting for each input edge the input edges itself and an inverted
version.

EnumTriangles 
Triangle enumeration is a preprocessing step to find closely connected parts in graphs.

EnumTriangles.TupleEdgeConverter 
Converts a Tuple2 into an Edge.

PageRank 
A basic implementation of the Page Rank algorithm using a bulk iteration.

PageRank.BuildOutgoingEdgeList 
A reduce function that takes a sequence of edges and builds the adjacency list for the vertex
where the edges originate.

PageRank.Dampener 
The function that applies the page rank dampening formula.

PageRank.EpsilonFilter 
Filter that filters vertices where the rank difference is below a threshold.

PageRank.JoinVertexWithEdgesMatch 
Join function that distributes a fraction of a vertex's rank to all neighbors.

PageRank.RankAssigner 
A map function that assigns an initial rank to all pages.

TransitiveClosureNaive 
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–2022 The Apache Software Foundation. All rights reserved.