Package  Description 

org.apache.flink.graph  
org.apache.flink.graph.library.clustering.directed  
org.apache.flink.graph.library.metric  
org.apache.flink.graph.library.metric.directed 
Modifier and Type  Class and Description 

class 
GraphAnalyticBase<K,VV,EV,T>
Base class for
GraphAnalytic . 
Modifier and Type  Method and Description 

GraphAnalytic<K,VV,EV,T> 
GraphAnalytic.run(Graph<K,VV,EV> input)
All
GraphAnalytic processing must be terminated by an
OutputFormat . 
GraphAnalytic<K,VV,EV,T> 
GraphAnalyticBase.run(Graph<K,VV,EV> input) 
<T> GraphAnalytic<K,VV,EV,T> 
Graph.run(GraphAnalytic<K,VV,EV,T> analytic)
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
Modifier and Type  Method and Description 

<T> GraphAnalytic<K,VV,EV,T> 
Graph.run(GraphAnalytic<K,VV,EV,T> analytic)
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
Modifier and Type  Class and Description 

class 
AverageClusteringCoefficient<K extends Comparable<K> & CopyableValue<K>,VV,EV>
The average clustering coefficient measures the mean connectedness of a
graph.

class 
GlobalClusteringCoefficient<K extends Comparable<K> & CopyableValue<K>,VV,EV>
The global clustering coefficient measures the connectedness of a graph.

class 
TriadicCensus<K extends Comparable<K> & CopyableValue<K>,VV,EV>
A triad is formed by three connected or unconnected vertices in a graph.

Modifier and Type  Class and Description 

class 
ChecksumHashCode<K,VV,EV>
Convenience method to get the count (number of elements) of a Graph
as well as the checksum (sum over element hashes).

Modifier and Type  Class and Description 

class 
EdgeMetrics<K extends Comparable<K>,VV,EV>
Compute the following edge metrics in a directed graph.

class 
VertexMetrics<K extends Comparable<K>,VV,EV>
Compute the following vertex metrics in a directed graph.

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