K
- graph ID typeVV
- vertex value typeEV
- edge value typepublic class TriangleListing<K extends Comparable<K> & CopyableValue<K>,VV,EV> extends GraphAlgorithmDelegatingDataSet<K,VV,EV,Tuple3<K,K,K>>
Constructor and Description |
---|
TriangleListing() |
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<Tuple3<K,K,K>> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph) . |
TriangleListing<K,VV,EV> |
setLittleParallelism(int littleParallelism)
Override the parallelism of operators processing small amounts of data.
|
TriangleListing<K,VV,EV> |
setSortTriangleVertices(boolean sortTriangleVertices)
Normalize the triangle listing such that for each result (K0, K1, K2)
the vertex IDs are sorted K0 < K1 < K2.
|
equals, hashCode, run
public TriangleListing<K,VV,EV> setSortTriangleVertices(boolean sortTriangleVertices)
sortTriangleVertices
- whether to output each triangle's vertices in sorted orderpublic TriangleListing<K,VV,EV> setLittleParallelism(int littleParallelism)
littleParallelism
- operator parallelismprotected String getAlgorithmName()
GraphAlgorithmDelegatingDataSet
getAlgorithmName
in class GraphAlgorithmDelegatingDataSet<K extends Comparable<K> & CopyableValue<K>,VV,EV,Tuple3<K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>>>
protected boolean mergeConfiguration(GraphAlgorithmDelegatingDataSet other)
GraphAlgorithmDelegatingDataSet
mergeConfiguration
in class GraphAlgorithmDelegatingDataSet<K extends Comparable<K> & CopyableValue<K>,VV,EV,Tuple3<K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>>>
other
- the algorithm with which to compare and mergepublic DataSet<Tuple3<K,K,K>> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmDelegatingDataSet
GraphAlgorithm.run(Graph)
.runInternal
in class GraphAlgorithmDelegatingDataSet<K extends Comparable<K> & CopyableValue<K>,VV,EV,Tuple3<K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>,K extends Comparable<K> & CopyableValue<K>>>
input
- the input graphException
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.