Modifier and Type | Class and Description |
---|---|
class |
EdgeDegreesPair<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and
in-degree of both the source and target vertices.
|
class |
EdgeSourceDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and
in-degree of the source vertex.
|
class |
EdgeTargetDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and
in-degree of the target vertex.
|
class |
VertexDegrees<K,VV,EV>
Annotates vertices of a directed graph with the degree, out-, and in-degree.
|
class |
VertexInDegree<K,VV,EV>
Annotates vertices of a directed graph with the in-degree.
|
class |
VertexOutDegree<K,VV,EV>
Annotates vertices of a directed graph with the out-degree.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
VertexInDegree.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected boolean |
VertexDegrees.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected boolean |
VertexOutDegree.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
VertexInDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
VertexDegrees.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
VertexOutDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
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 | Method and Description |
---|---|
protected boolean |
VertexDegree.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
EdgeTargetDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
EdgeDegreePair.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
VertexDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
EdgeSourceDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
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 | Method and Description |
---|---|
protected boolean |
MaximumDegree.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
MaximumDegree.mergeConfiguration(GraphAlgorithmWrappingBase other) |
Modifier and Type | Class and Description |
---|---|
class |
Simplify<K extends Comparable<K>,VV,EV>
Remove self-loops and duplicate edges from a directed graph.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
Simplify.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
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 | Method and Description |
---|---|
protected boolean |
TranslateGraphIds.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected boolean |
TranslateVertexValues.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected boolean |
TranslateEdgeValues.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
Modifier and Type | Class and Description |
---|---|
class |
TriangleListingBase<K,VV,EV,R>
Common configuration for directed and undirected Triangle Listing algorithms.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
TriangleListingBase.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
TriangleListingBase.mergeConfiguration(GraphAlgorithmWrappingBase other) |
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 | Method and Description |
---|---|
protected boolean |
LocalClusteringCoefficient.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
LocalClusteringCoefficient.mergeConfiguration(GraphAlgorithmWrappingBase other) |
Modifier and Type | Method and Description |
---|---|
protected boolean |
LocalClusteringCoefficient.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
LocalClusteringCoefficient.mergeConfiguration(GraphAlgorithmWrappingBase other) |
Modifier and Type | Class and Description |
---|---|
class |
HITS<K,VV,EV>
Hyperlink-Induced Topic Search computes two interdependent scores for every
vertex in a directed graph.
|
class |
PageRank<K,VV,EV>
PageRank computes a per-vertex score which is the sum of PageRank scores
transmitted over in-edges.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
PageRank.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
HITS.mergeConfiguration(GraphAlgorithmWrappingBase other) |
protected void |
PageRank.mergeConfiguration(GraphAlgorithmWrappingBase other) |
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 |
---|---|
protected boolean |
JaccardIndex.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected boolean |
AdamicAdar.canMergeConfigurationWith(GraphAlgorithmWrappingBase other) |
protected void |
JaccardIndex.mergeConfiguration(GraphAlgorithmWrappingBase other) |
Modifier and Type | Class and Description |
---|---|
class |
GraphAlgorithmWrappingDataSet<K,VV,EV,T>
Base class for a mergeable
GraphAlgorithm which wraps and returns a
result DataSet . |
class |
GraphAlgorithmWrappingGraph<IN_K,IN_VV,IN_EV,OUT_K,OUT_VV,OUT_EV>
Base class for a mergeable
GraphAlgorithm which wraps and returns a
result Graph . |
Modifier and Type | Method and Description |
---|---|
GraphAlgorithmWrappingBase<K,VV,EV,R> |
GraphAlgorithmWrappingBase.setParallelism(int parallelism)
Set the parallelism for this algorithm's operators.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
GraphAlgorithmWrappingBase.canMergeConfigurationWith(GraphAlgorithmWrappingBase other)
First test whether the algorithm configurations can be merged before the
call to
mergeConfiguration(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase) . |
protected void |
GraphAlgorithmWrappingBase.mergeConfiguration(GraphAlgorithmWrappingBase other)
Merge the other configuration into this algorithm's after the call to
canMergeConfigurationWith(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase) has checked that the configurations
can be merged. |
Copyright © 2014–2020 The Apache Software Foundation. All rights reserved.