K
- ID typeVV
- vertex value typeEV
- edge value typepublic class EdgeDegreePair<K,VV,EV> extends GraphAlgorithmDelegatingDataSet<K,VV,EV,Edge<K,Tuple3<EV,LongValue,LongValue>>>
Constructor and Description |
---|
EdgeDegreePair() |
Modifier and Type | Method and Description |
---|---|
protected String |
getAlgorithmName()
Algorithms are identified by name rather than by class to allow subclassing.
|
protected boolean |
mergeConfiguration(GraphAlgorithmDelegatingDataSet other)
An algorithm must first test whether the configurations can be merged
before merging individual fields.
|
DataSet<Edge<K,Tuple3<EV,LongValue,LongValue>>> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph) . |
EdgeDegreePair<K,VV,EV> |
setParallelism(int parallelism)
Override the operator parallelism.
|
EdgeDegreePair<K,VV,EV> |
setReduceOnTargetId(boolean reduceOnTargetId)
The degree can be counted from either the edge source or target IDs.
|
equals, hashCode, run
public EdgeDegreePair<K,VV,EV> setReduceOnTargetId(boolean reduceOnTargetId)
reduceOnTargetId
- set to true
if the input edge list
is sorted by target IDpublic EdgeDegreePair<K,VV,EV> setParallelism(int parallelism)
parallelism
- operator parallelismprotected String getAlgorithmName()
GraphAlgorithmDelegatingDataSet
protected boolean mergeConfiguration(GraphAlgorithmDelegatingDataSet other)
GraphAlgorithmDelegatingDataSet
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.