T - ID typepublic static class LocalClusteringCoefficient.Result<T> extends UnaryResultBase<T> implements PrintableResult
| Modifier and Type | Field and Description |
|---|---|
static int |
HASH_SEED |
| Constructor and Description |
|---|
Result() |
| Modifier and Type | Method and Description |
|---|---|
org.apache.flink.types.LongValue |
getDegree()
Get the vertex degree.
|
double |
getLocalClusteringCoefficientScore()
Get the local clustering coefficient score.
|
org.apache.flink.types.LongValue |
getTriangleCount()
Get the number of triangles containing this vertex; equivalently,
this is the number of edges between neighbors of this vertex.
|
int |
hashCode() |
void |
setDegree(org.apache.flink.types.LongValue degree)
Set the vertex degree.
|
void |
setTriangleCount(org.apache.flink.types.LongValue triangleCount)
Set the number of triangles containing this vertex; equivalently,
this is the number of edges between neighbors of this vertex.
|
String |
toPrintableString()
Format values into a human-readable string.
|
String |
toString()
Object.toString() must be overridden to write POJO values in the
same form as Tuple. |
getVertexId0, setVertexId0, translatepublic static final int HASH_SEED
public org.apache.flink.types.LongValue getDegree()
public void setDegree(org.apache.flink.types.LongValue degree)
degree - vertex degreepublic org.apache.flink.types.LongValue getTriangleCount()
public void setTriangleCount(org.apache.flink.types.LongValue triangleCount)
triangleCount - triangle countpublic double getLocalClusteringCoefficientScore()
A score of Double.NaN is returned for a vertex with degree 1
for which both the triangle count and number of neighbors are zero.
public String toString()
ResultBaseObject.toString() must be overridden to write POJO values in the
same form as Tuple. Values are
comma-separated and enclosed in parenthesis, e.g. "(f0,f1)".toString in class ResultBasepublic String toPrintableString()
toPrintableString in interface PrintableResultCopyright © 2014–2019 The Apache Software Foundation. All rights reserved.