Modifier and Type  Method and Description 

<T> T 
Graph.run(GraphAlgorithm<K,VV,EV,T> algorithm) 
Modifier and Type  Class and Description 

class 
EdgeDegreesPair<K,VV,EV>
Annotates edges of a directed graph with the degree, outdegree, and
indegree of both the source and target vertices.

class 
EdgeSourceDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, outdegree, and
indegree of the source vertex.

class 
EdgeTargetDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, outdegree, and
indegree of the target vertex.

class 
VertexDegrees<K,VV,EV>
Annotates vertices of a directed graph with the degree, out, and indegree.

class 
VertexInDegree<K,VV,EV>
Annotates vertices of a directed graph with the indegree.

class 
VertexOutDegree<K,VV,EV>
Annotates vertices of a directed graph with the outdegree.

Modifier and Type  Class and Description 

class 
EdgeDegreePair<K,VV,EV>
Annotates edges of an undirected graph with the degree of both the source
and target degree vertices.

class 
EdgeSourceDegree<K,VV,EV>
Annotates edges of an undirected graph with degree of the source vertex.

class 
EdgeTargetDegree<K,VV,EV>
Annotates edges of an undirected graph with degree of the target vertex.

class 
VertexDegree<K,VV,EV>
Annotates vertices of an undirected graph with the degree.

Modifier and Type  Class and Description 

class 
MaximumDegree<K,VV,EV>
Removes vertices from a graph with degree greater than the given maximum.

Modifier and Type  Class and Description 

class 
Simplify<K extends Comparable<K>,VV,EV>
Remove selfloops and duplicate edges from a directed graph.

Modifier and Type  Class and Description 

class 
TranslateEdgeValues<K,VV,OLD,NEW>
Translate
Edge values using the given TranslateFunction . 
class 
TranslateGraphIds<OLD,NEW,VV,EV>

class 
TranslateVertexValues<K,OLD,NEW,EV>
Translate
Vertex values using the given TranslateFunction . 
Modifier and Type  Class and Description 

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

Modifier and Type  Class and Description 

class 
CommunityDetection<K>
Community Detection Algorithm.

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

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

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

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

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

class 
Summarization<K,VV,EV>
The summarization algorithm computes a condensed version of the input graph
by grouping vertices and edges based on their values. 
class 
TriangleEnumerator<K extends Comparable<K>,VV,EV>
This library method enumerates unique triangles present in the input graph.

Modifier and Type  Class and Description 

class 
LocalClusteringCoefficient<K extends Comparable<K> & CopyableValue<K>,VV,EV>
The local clustering coefficient measures the connectedness of each vertex's
neighborhood.

class 
TriangleListing<K extends Comparable<K> & CopyableValue<K>,VV,EV>
Generates a listing of distinct triangles from the input graph.

Modifier and Type  Class and Description 

class 
HITS<K,VV,EV>
HyperlinkInduced Topic Search computes two interdependent scores for every
vertex in a directed graph.

class 
PageRank<K,VV,EV>
PageRank computes a pervertex score which is the sum of PageRank scores
transmitted over inedges.

Modifier and Type  Class and Description 

class 
AdamicAdar<K extends CopyableValue<K>,VV,EV>
http://social.cs.uiuc.edu/class/cs591kgk/friendsadamic.pdf

class 
JaccardIndex<K extends CopyableValue<K>,VV,EV>
The Jaccard Index measures the similarity between vertex neighborhoods and
is computed as the number of shared neighbors divided by the number of
distinct neighbors.

Modifier and Type  Method and Description 

<T> T 
Graph.run(GraphAlgorithm<K,VV,EV,T> algorithm,
TypeInformation<T> evidence$103,
scala.reflect.ClassTag<T> evidence$104) 
Modifier and Type  Class and Description 

class 
GraphAlgorithmWrappingDataSet<K,VV,EV,T>

class 
GraphAlgorithmWrappingGraph<IN_K,IN_VV,IN_EV,OUT_K,OUT_VV,OUT_EV>

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