K
- ID typeVV
- vertex value typeEV
- edge value typepublic class EdgeSourceDegrees<K,VV,EV> extends GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>>
Constructor and Description |
---|
EdgeSourceDegrees() |
Modifier and Type | Method and Description |
---|---|
protected String |
getAlgorithmName()
Algorithms are identified by name rather than by class to allow subclassing.
|
protected boolean |
mergeConfiguration(GraphAlgorithmWrappingDataSet other)
An algorithm must first test whether the configurations can be merged
before merging individual fields.
|
DataSet<Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph) . |
EdgeSourceDegrees<K,VV,EV> |
setParallelism(int parallelism)
Override the operator parallelism.
|
equals, hashCode, run
public EdgeSourceDegrees<K,VV,EV> setParallelism(int parallelism)
parallelism
- operator parallelismprotected String getAlgorithmName()
GraphAlgorithmWrappingDataSet
getAlgorithmName
in class GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>>
protected boolean mergeConfiguration(GraphAlgorithmWrappingDataSet other)
GraphAlgorithmWrappingDataSet
mergeConfiguration
in class GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>>
other
- the algorithm with which to compare and mergepublic DataSet<Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmWrappingDataSet
GraphAlgorithm.run(Graph)
.runInternal
in class GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,org.apache.flink.api.java.tuple.Tuple2<EV,VertexDegrees.Degrees>>>
input
- the input graphException
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.