Class  Description 

CommunityDetection<K> 
Community Detection Algorithm.

ConnectedComponents<K,VV extends Comparable<VV>,EV> 
A scattergather implementation of the Weakly Connected Components algorithm.

ConnectedComponents.CCMessenger<K,VV extends Comparable<VV>> 
Sends the current vertex value to all adjacent vertices.

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

GSAConnectedComponents<K,VV extends Comparable<VV>,EV> 
A gathersumapply implementation of the Weakly Connected Components algorithm.

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

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.

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

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> 
POJO storing two vertex IDs with degree.

TriangleEnumerator.Triad<K> 
Tuple storing three vertex IDs.

Copyright © 2014–2022 The Apache Software Foundation. All rights reserved.