Class  Description 

CommunityDetection<K> 
Community Detection Algorithm.

CommunityDetection.AddScoreToVertexValuesMapper<K>  
CommunityDetection.LabelMessenger<K>  
CommunityDetection.RemoveScoreFromVertexValuesMapper<K>  
CommunityDetection.VertexLabelUpdater<K>  
ConnectedComponents<K,EV> 
A scattergather implementation of the Weakly Connected Components algorithm.

ConnectedComponents.CCMessenger<K> 
Distributes the minimum ID associated with a given vertex among all the target vertices.

ConnectedComponents.CCUpdater<K> 
Updates the value of a vertex by picking the minimum neighbor ID out of all the incoming messages.

GSAConnectedComponents<K,EV> 
This is an implementation of the Connected Components algorithm, using a gathersumapply iteration.

GSAPageRank<K> 
This is an implementation of a simple PageRank algorithm, using a gathersumapply iteration.

GSASingleSourceShortestPaths<K> 
This is an implementation of the Single Source Shortest Paths algorithm, using a gathersumapply iteration

GSASingleSourceShortestPaths.InitVerticesMapper<K>  
GSATriangleCount<K extends Comparable<K>,VV,EV> 
Triangle Count Algorithm.

LabelPropagation<K,VV extends Comparable<VV>,EV> 
An implementation of the label propagation algorithm.

LabelPropagation.SendNewLabelToNeighbors<K,VV extends Comparable<VV>> 
Sends the vertex label to all outneighbors

LabelPropagation.UpdateVertexLabel<K,VV extends Comparable<VV>> 
Function that updates the value of a vertex by adopting the most frequent
label among its inneighbors

PageRank<K> 
This is an implementation of a simple PageRank algorithm, using a scattergather iteration.

PageRank.RankMessenger<K> 
Distributes the rank of a vertex among all target vertices according to
the transition probability, which is associated with an edge as the edge
value.

PageRank.VertexRankUpdater<K> 
Function that updates the rank of a vertex by summing up the partial
ranks from all incoming messages and then applying the dampening formula.

SingleSourceShortestPaths<K> 
This is an implementation of the SingleSourceShortest Paths algorithm, using a scattergather iteration.

SingleSourceShortestPaths.InitVerticesMapper<K>  
SingleSourceShortestPaths.MinDistanceMessenger<K> 
Distributes the minimum distance associated with a given vertex among all
the target vertices summed up with the edge's value.

SingleSourceShortestPaths.VertexDistanceUpdater<K> 
Function that updates the value of a vertex by picking the minimum
distance from all incoming messages.

Summarization<K,VV,EV> 
The summarization algorithm computes a condensed version of the input graph
by grouping vertices and edges based on their values. 
Summarization.EdgeValue<EV> 
Value that is stored at a summarized edge.

Summarization.VertexGroupItem<K,VGV> 
Represents a single vertex in a vertex group.

Summarization.VertexValue<VV> 
Value that is stored at a summarized vertex.

Summarization.VertexWithRepresentative<K> 
Represents a vertex identifier and its corresponding vertex group identifier.

TriangleEnumerator<K extends Comparable<K>,VV,EV> 
This library method enumerates unique triangles present in the input graph.

TriangleEnumerator.EdgeWithDegrees<K>  
TriangleEnumerator.Triad<K> 
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.