K
- graph ID typeVV
- vertex value typeEV
- edge value typepublic class LocalClusteringCoefficient<K extends Comparable<K> & CopyableValue<K>,VV,EV> extends GraphAlgorithmWrappingDataSet<K,VV,EV,LocalClusteringCoefficient.Result<K>>
An edge between a vertex's neighbors is a triangle. Counting edges between neighbors is equivalent to counting the number of triangles which include the vertex.
The input graph must be a simple graph containing no duplicate edges or self-loops.
Modifier and Type | Class and Description |
---|---|
static class |
LocalClusteringCoefficient.Result<T>
A result for the directed Local Clustering Coefficient algorithm.
|
parallelism
Constructor and Description |
---|
LocalClusteringCoefficient() |
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) . |
protected void |
mergeConfiguration(GraphAlgorithmWrappingBase other)
Merge the other configuration into this algorithm's after the call to
GraphAlgorithmWrappingBase.canMergeConfigurationWith(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase) has checked that the configurations can be merged. |
DataSet<LocalClusteringCoefficient.Result<K>> |
runInternal(Graph<K,VV,EV> input)
The implementation of the algorithm, renamed from
GraphAlgorithm.run(Graph) . |
LocalClusteringCoefficient<K,VV,EV> |
setIncludeZeroDegreeVertices(boolean includeZeroDegreeVertices)
By default the vertex set is checked for zero degree vertices.
|
equals, hashCode, run
getAlgorithmName, setParallelism
public LocalClusteringCoefficient<K,VV,EV> setIncludeZeroDegreeVertices(boolean includeZeroDegreeVertices)
includeZeroDegreeVertices
- whether to output scores for vertices with a degree of zeroprotected boolean canMergeConfigurationWith(GraphAlgorithmWrappingBase other)
GraphAlgorithmWrappingBase
GraphAlgorithmWrappingBase.mergeConfiguration(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase)
.canMergeConfigurationWith
in class GraphAlgorithmWrappingBase<K extends Comparable<K> & CopyableValue<K>,VV,EV,DataSet<LocalClusteringCoefficient.Result<K extends Comparable<K> & CopyableValue<K>>>>
other
- the algorithm with which to compare configurationGraphAlgorithmWrappingBase.mergeConfiguration(GraphAlgorithmWrappingBase)
protected void mergeConfiguration(GraphAlgorithmWrappingBase other)
GraphAlgorithmWrappingBase
GraphAlgorithmWrappingBase.canMergeConfigurationWith(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase)
has checked that the configurations can be merged.mergeConfiguration
in class GraphAlgorithmWrappingBase<K extends Comparable<K> & CopyableValue<K>,VV,EV,DataSet<LocalClusteringCoefficient.Result<K extends Comparable<K> & CopyableValue<K>>>>
other
- the algorithm from which to merge configurationGraphAlgorithmWrappingBase.canMergeConfigurationWith(GraphAlgorithmWrappingBase)
public DataSet<LocalClusteringCoefficient.Result<K>> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmWrappingDataSet
GraphAlgorithm.run(Graph)
.runInternal
in class GraphAlgorithmWrappingDataSet<K extends Comparable<K> & CopyableValue<K>,VV,EV,LocalClusteringCoefficient.Result<K extends Comparable<K> & CopyableValue<K>>>
input
- the input graphException
Copyright © 2014–2021 The Apache Software Foundation. All rights reserved.