public static class TriadicCensus.Result extends Object implements PrintableResult
Constructor and Description 

Result(BigInteger... counts) 
Result(long... counts) 
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 humanreadable representation of this value.

public Result(BigInteger... counts)
public Result(long... counts)
public BigInteger getCount003()
public BigInteger getCount012()
public BigInteger getCount102()
public BigInteger getCount021d()
public BigInteger getCount021u()
public BigInteger getCount021c()
public BigInteger getCount111d()
public BigInteger getCount111u()
public BigInteger getCount030t()
public BigInteger getCount030c()
public BigInteger getCount201()
public BigInteger getCount120d()
public BigInteger getCount120u()
public BigInteger getCount120c()
public BigInteger getCount210()
public BigInteger getCount300()
public BigInteger[] getCounts()
public String toPrintableString()
PrintableResult
toPrintableString
in interface PrintableResult
Copyright © 2014–2018 The Apache Software Foundation. All rights reserved.