K
- graph ID typeVV
- vertex value typeEV
- edge value typepublic class HITS<K,VV,EV> extends GraphAlgorithmDelegatingDataSet<K,VV,EV,HITS.Result<K>>
Modifier and Type | Class and Description |
---|---|
static class |
HITS.Result<T>
Wraps the vertex type to encapsulate results from the HITS algorithm.
|
Constructor and Description |
---|
HITS(double convergenceThreshold)
Hyperlink-Induced Topic Search with a convergence threshold.
|
HITS(int iterations)
Hyperlink-Induced Topic Search with a fixed number of iterations.
|
HITS(int maxIterations,
double convergenceThreshold)
Hyperlink-Induced Topic Search with a convergence threshold and a maximum
iteration count.
|
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<HITS.Result<K>> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph) . |
HITS<K,VV,EV> |
setParallelism(int parallelism)
Override the operator parallelism.
|
equals, hashCode, run
public HITS(int iterations)
iterations
- fixed number of iterationspublic HITS(double convergenceThreshold)
convergenceThreshold
- convergence threshold for sum of scorespublic HITS(int maxIterations, double convergenceThreshold)
maxIterations
- maximum number of iterationsconvergenceThreshold
- convergence threshold for sum of scorespublic HITS<K,VV,EV> setParallelism(int parallelism)
parallelism
- operator parallelismprotected String getAlgorithmName()
GraphAlgorithmDelegatingDataSet
getAlgorithmName
in class GraphAlgorithmDelegatingDataSet<K,VV,EV,HITS.Result<K>>
protected boolean mergeConfiguration(GraphAlgorithmDelegatingDataSet other)
GraphAlgorithmDelegatingDataSet
mergeConfiguration
in class GraphAlgorithmDelegatingDataSet<K,VV,EV,HITS.Result<K>>
other
- the algorithm with which to compare and mergepublic DataSet<HITS.Result<K>> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmDelegatingDataSet
GraphAlgorithm.run(Graph)
.runInternal
in class GraphAlgorithmDelegatingDataSet<K,VV,EV,HITS.Result<K>>
input
- the input graphException
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.