TriadicCensus.Result (flink 1.4-SNAPSHOT API)

java.lang.Object
- org.apache.flink.graph.library.clustering.directed.TriadicCensus.Result

All Implemented Interfaces:

PrintableResult

Enclosing class:

TriadicCensus<K extends Comparable<K> & CopyableValue<K>,VV,EV>
```
public static class TriadicCensus.Result
extends Object
implements PrintableResult
```
Wraps triadic census metrics.

Constructor Summary

Constructors
Constructor and Description

Result(BigInteger... counts)

Result(long... counts)

Constructors
Constructor and Description
`Result(BigInteger... counts)`
`Result(long... counts)`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`equals(Object obj)`
`BigInteger`	`getCount003()` Get the count of "003" triads which have zero connecting vertices.
`BigInteger`	`getCount012()` Get the count of "012" triads which have one unidirectional edge among the vertices.
`BigInteger`	`getCount021c()` Get the count of "021c" triads which have two unidirectional edges among the vertices, forming an open triplet; one edge sources and one edge targets the center vertex.
`BigInteger`	`getCount021d()` Get the count of "021d" triads which have two unidirectional edges among the vertices, forming an open triplet; both edges source the center vertex.
`BigInteger`	`getCount021u()` Get the count of "021u" triads which have two unidirectional edges among the vertices, forming an open triplet; both edges target the center vertex.
`BigInteger`	`getCount030c()` Get the count of "030c" triads which have three unidirectional edges among the vertices, forming a closed triplet, a triangle; the three unidirectional edges both source and target different vertices.
`BigInteger`	`getCount030t()` Get the count of "030t" triads which have three unidirectional edges among the vertices, forming a closed triplet, a triangle; two of the unidirectional edges source/target the same vertex.
`BigInteger`	`getCount102()` Get the count of "102" triads which have one bidirectional edge among the vertices.
`BigInteger`	`getCount111d()` Get the count of "111d" triads which have one unidirectional and one bidirectional edge among the vertices, forming an open triplet; the unidirectional edge targets the center vertex.
`BigInteger`	`getCount111u()` Get the count of "111u" triads which have one unidirectional and one bidirectional edge among the vertices, forming an open triplet; the unidirectional edge sources the center vertex.
`BigInteger`	`getCount120c()` Get the count of "120c" triads which have two unidirectional edges and one bidirectional edge among the vertices, forming a closed triplet, a triangle; one vertex is sourced by and targeted by the unidirectional edges.
`BigInteger`	`getCount120d()` Get the count of "120d" triads which have two unidirectional edges and one bidirectional edge among the vertices, forming a closed triplet, a triangle; both unidirectional edges source the same vertex.
`BigInteger`	`getCount120u()` Get the count of "120u" triads which have two unidirectional and one bidirectional edges among the vertices, forming a closed triplet, a triangle; both unidirectional edges target the same vertex.
`BigInteger`	`getCount201()` Get the count of "201" triads which have two unidirectional edges among the vertices, forming an open triplet.
`BigInteger`	`getCount210()` Get the count of "210" triads which have one unidirectional edge and two bidirectional edges among the vertices, forming a closed triplet, a triangle.
`BigInteger`	`getCount300()` Get the count of "300" triads which have three bidirectional edges among the vertices, forming a closed triplet, a triangle.
`BigInteger[]`	`getCounts()` Get the array of counts.
`int`	`hashCode()`
`String`	`toPrintableString()` A human-readable representation of this value.
`String`	`toString()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - Result
```
public Result(BigInteger... counts)
```
  - Result
```
public Result(long... counts)
```
- Method Detail
  - getCount003
```
public BigInteger getCount003()
```
    Get the count of "003" triads which have zero connecting vertices.
    
    Returns:
    
    count of "003" triads
  - getCount012
```
public BigInteger getCount012()
```
    Get the count of "012" triads which have one unidirectional edge among the vertices.
    
    Returns:
    
    count of "012" triads
  - getCount102
```
public BigInteger getCount102()
```
    Get the count of "102" triads which have one bidirectional edge among the vertices.
    
    Returns:
    
    count of "102" triads
  - getCount021d
```
public BigInteger getCount021d()
```
    Get the count of "021d" triads which have two unidirectional edges among the vertices, forming an open triplet; both edges source the center vertex.
    
    Returns:
    
    count of "021d" triads
  - getCount021u
```
public BigInteger getCount021u()
```
    Get the count of "021u" triads which have two unidirectional edges among the vertices, forming an open triplet; both edges target the center vertex.
    
    Returns:
    
    count of "021u" triads
  - getCount021c
```
public BigInteger getCount021c()
```
    Get the count of "021c" triads which have two unidirectional edges among the vertices, forming an open triplet; one edge sources and one edge targets the center vertex.
    
    Returns:
    
    count of "021c" triads
  - getCount111d
```
public BigInteger getCount111d()
```
    Get the count of "111d" triads which have one unidirectional and one bidirectional edge among the vertices, forming an open triplet; the unidirectional edge targets the center vertex.
    
    Returns:
    
    count of "111d" triads
  - getCount111u
```
public BigInteger getCount111u()
```
    Get the count of "111u" triads which have one unidirectional and one bidirectional edge among the vertices, forming an open triplet; the unidirectional edge sources the center vertex.
    
    Returns:
    
    count of "111u" triads
  - getCount030t
```
public BigInteger getCount030t()
```
    Get the count of "030t" triads which have three unidirectional edges among the vertices, forming a closed triplet, a triangle; two of the unidirectional edges source/target the same vertex.
    
    Returns:
    
    count of "030t" triads
  - getCount030c
```
public BigInteger getCount030c()
```
    Get the count of "030c" triads which have three unidirectional edges among the vertices, forming a closed triplet, a triangle; the three unidirectional edges both source and target different vertices.
    
    Returns:
    
    count of "030c" triads
  - getCount201
```
public BigInteger getCount201()
```
    Get the count of "201" triads which have two unidirectional edges among the vertices, forming an open triplet.
    
    Returns:
    
    count of "201" triads
  - getCount120d
```
public BigInteger getCount120d()
```
    Get the count of "120d" triads which have two unidirectional edges and one bidirectional edge among the vertices, forming a closed triplet, a triangle; both unidirectional edges source the same vertex.
    
    Returns:
    
    count of "120d" triads
  - getCount120u
```
public BigInteger getCount120u()
```
    Get the count of "120u" triads which have two unidirectional and one bidirectional edges among the vertices, forming a closed triplet, a triangle; both unidirectional edges target the same vertex.
    
    Returns:
    
    count of "120u" triads
  - getCount120c
```
public BigInteger getCount120c()
```
    Get the count of "120c" triads which have two unidirectional edges and one bidirectional edge among the vertices, forming a closed triplet, a triangle; one vertex is sourced by and targeted by the unidirectional edges.
    
    Returns:
    
    count of "120c" triads
  - getCount210
```
public BigInteger getCount210()
```
    Get the count of "210" triads which have one unidirectional edge and two bidirectional edges among the vertices, forming a closed triplet, a triangle.
    
    Returns:
    
    count of "210" triads
  - getCount300
```
public BigInteger getCount300()
```
    Get the count of "300" triads which have three bidirectional edges among the vertices, forming a closed triplet, a triangle.
    
    Returns:
    
    count of "300" triads
  - getCounts
```
public BigInteger[] getCounts()
```
    Get the array of counts.
    The order of the counts is from least to most connected: 003, 012, 102, 021d, 021u, 021c, 111d, 111u, 030t, 030c, 201, 120d, 120u, 120c, 210, 300
    
    Returns:
    
    array of counts
  - toString
```
public String toString()
```
    Overrides:
    
    toString in class Object
  - toPrintableString
```
public String toPrintableString()
```
    Description copied from interface: PrintableResult
    
    A human-readable representation of this value.
    
    Specified by:
    
    toPrintableString in interface PrintableResult
    
    Returns:
    
    printable string
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class Object
  - equals
```
public boolean equals(Object obj)
```
    Overrides:
    
    equals in class Object

Back to Flink Website

Class TriadicCensus.Result

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

Result

Result

Method Detail

getCount003

getCount012

getCount102

getCount021d

getCount021u

getCount021c

getCount111d

getCount111u

getCount030t

getCount030c

getCount201

getCount120d

getCount120u

getCount120c

getCount210

getCount300

getCounts

toString

toPrintableString

hashCode

equals

Back to Flink Website