K - ID typeVV - vertex value typeEV - edge value typepublic class Simplify<K extends Comparable<K>,VV,EV> extends GraphAlgorithmWrappingGraph<K,VV,EV,K,VV,EV>
parallelism| Constructor and Description |
|---|
Simplify(boolean clipAndFlip)
Simplifies an undirected graph by adding reverse edges and removing
self-loops and duplicate edges.
|
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
canMergeConfigurationWith(GraphAlgorithmWrappingBase other)
First test whether the algorithm configurations can be merged before the
call to
GraphAlgorithmWrappingBase.mergeConfiguration(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase). |
Graph<K,VV,EV> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph). |
equals, hashCode, rungetAlgorithmName, mergeConfiguration, setParallelismpublic Simplify(boolean clipAndFlip)
When clip-and-flip is set, edges where source < target are removed before symmetrizing the graph.
clipAndFlip - method for generating simple graphprotected boolean canMergeConfigurationWith(GraphAlgorithmWrappingBase other)
GraphAlgorithmWrappingBaseGraphAlgorithmWrappingBase.mergeConfiguration(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase).canMergeConfigurationWith in class GraphAlgorithmWrappingBase<K extends Comparable<K>,VV,EV,Graph<K extends Comparable<K>,VV,EV>>other - the algorithm with which to compare configurationGraphAlgorithmWrappingBase.mergeConfiguration(GraphAlgorithmWrappingBase)public Graph<K,VV,EV> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmWrappingGraphGraphAlgorithm.run(Graph).runInternal in class GraphAlgorithmWrappingGraph<K extends Comparable<K>,VV,EV,K extends Comparable<K>,VV,EV>input - the input graphExceptionCopyright © 2014–2019 The Apache Software Foundation. All rights reserved.