Package | Description |
---|---|
org.apache.flink.graph | |
org.apache.flink.graph.library | |
org.apache.flink.graph.scala |
Modifier and Type | Method and Description |
---|---|
<T> T |
Graph.run(GraphAlgorithm<K,VV,EV,T> algorithm) |
Modifier and Type | Class and Description |
---|---|
class |
CommunityDetection<K>
Community Detection Algorithm.
|
class |
ConnectedComponents<K,EV>
A scatter-gather implementation of the Weakly Connected Components algorithm.
|
class |
GSAConnectedComponents<K,EV>
This is an implementation of the Connected Components algorithm, using a gather-sum-apply iteration.
|
class |
GSAPageRank<K>
This is an implementation of a simple PageRank algorithm, using a gather-sum-apply iteration.
|
class |
GSASingleSourceShortestPaths<K>
This is an implementation of the Single Source Shortest Paths algorithm, using a gather-sum-apply iteration
|
class |
GSATriangleCount<K extends Comparable<K>,VV,EV>
Triangle Count Algorithm.
|
class |
LabelPropagation<K,VV extends Comparable<VV>,EV>
An implementation of the label propagation algorithm.
|
class |
PageRank<K>
This is an implementation of a simple PageRank algorithm, using a scatter-gather iteration.
|
class |
SingleSourceShortestPaths<K>
This is an implementation of the Single-Source-Shortest Paths algorithm, using a scatter-gather 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 | Method and Description |
---|---|
<T> T |
Graph.run(GraphAlgorithm<K,VV,EV,T> algorithm,
TypeInformation<T> evidence$91,
scala.reflect.ClassTag<T> evidence$92) |
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.