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