org.apache.flink.graph.library.clustering.undirected.TriadicCensus.Result Java Examples

@Override
public TriadicCensus<K, VV, EV> run(Graph<K, VV, EV> input)
		throws Exception {
	super.run(input);

	triangleCount = new Count<>();

	DataSet<TriangleListing.Result<K>> triangles = input
		.run(new TriangleListing<K, VV, EV>()
			.setSortTriangleVertices(false)
			.setParallelism(parallelism));

	triangleCount.run(triangles);

	vertexMetrics = new VertexMetrics<K, VV, EV>()
		.setParallelism(parallelism);

	input.run(vertexMetrics);

	return this;
}
 

@Override
public boolean equals(Object obj) {
	if (obj == null) {
		return false;
	}

	if (obj == this) {
		return true;
	}

	if (obj.getClass() != getClass()) {
		return false;
	}

	Result rhs = (Result) obj;

	return new EqualsBuilder()
		.append(counts, rhs.counts)
		.isEquals();
}
 

@Override
public boolean equals(Object obj) {
	if (obj == null) {
		return false;
	}

	if (obj == this) {
		return true;
	}

	if (obj.getClass() != getClass()) {
		return false;
	}

	Result rhs = (Result) obj;

	return new EqualsBuilder()
		.append(counts, rhs.counts)
		.isEquals();
}
 

@Override
public TriadicCensus<K, VV, EV> run(Graph<K, VV, EV> input)
		throws Exception {
	super.run(input);

	triangleCount = new Count<>();

	DataSet<TriangleListing.Result<K>> triangles = input
		.run(new TriangleListing<K, VV, EV>()
			.setSortTriangleVertices(false)
			.setParallelism(parallelism));

	triangleCount.run(triangles);

	vertexMetrics = new VertexMetrics<K, VV, EV>()
		.setParallelism(parallelism);

	input.run(vertexMetrics);

	return this;
}
 

@Override
public TriadicCensus<K, VV, EV> run(Graph<K, VV, EV> input)
		throws Exception {
	super.run(input);

	triangleCount = new Count<>();

	DataSet<TriangleListing.Result<K>> triangles = input
		.run(new TriangleListing<K, VV, EV>()
			.setSortTriangleVertices(false)
			.setParallelism(parallelism));

	triangleCount.run(triangles);

	vertexMetrics = new VertexMetrics<K, VV, EV>()
		.setParallelism(parallelism);

	input.run(vertexMetrics);

	return this;
}
 

@Override
public boolean equals(Object obj) {
	if (obj == null) {
		return false;
	}

	if (obj == this) {
		return true;
	}

	if (obj.getClass() != getClass()) {
		return false;
	}

	Result rhs = (Result) obj;

	return new EqualsBuilder()
		.append(counts, rhs.counts)
		.isEquals();
}
 

@Test
public void testWithEmptyGraphWithoutVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithoutVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithEmptyGraphWithVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithCompleteGraph() throws Exception {
	long expectedDegree = completeGraphVertexCount - 1;
	long expectedCount = completeGraphVertexCount * CombinatoricsUtils.binomialCoefficient((int) expectedDegree, 2) / 3;

	Result expectedResult = new Result(0, 0, 0, expectedCount);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(completeGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithSimpleGraph() throws Exception {
	Result expectedResult = new Result(3, 8, 7, 2);

	Result triadCensus = new TriadicCensus<IntValue, NullValue, NullValue>()
		.run(undirectedSimpleGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

public Result(long... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = new BigInteger[counts.length];

	for (int i = 0; i < counts.length; i++) {
		this.counts[i] = BigInteger.valueOf(counts[i]);
	}
}
 

@Test
public void testWithEmptyGraphWithoutVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithoutVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithEmptyGraphWithVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithCompleteGraph() throws Exception {
	long expectedDegree = completeGraphVertexCount - 1;
	long expectedCount = completeGraphVertexCount * CombinatoricsUtils.binomialCoefficient((int) expectedDegree, 2) / 3;

	Result expectedResult = new Result(0, 0, 0, expectedCount);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(completeGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithSimpleGraph() throws Exception {
	Result expectedResult = new Result(3, 8, 7, 2);

	Result triadCensus = new TriadicCensus<IntValue, NullValue, NullValue>()
		.run(undirectedSimpleGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

public Result(long... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = new BigInteger[counts.length];

	for (int i = 0; i < counts.length; i++) {
		this.counts[i] = BigInteger.valueOf(counts[i]);
	}
}
 

@Test
public void testWithEmptyGraphWithoutVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithoutVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithEmptyGraphWithVertices() throws Exception {
	Result expectedResult = new Result(0, 0, 0, 0);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(emptyGraphWithVertices)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithCompleteGraph() throws Exception {
	long expectedDegree = completeGraphVertexCount - 1;
	long expectedCount = completeGraphVertexCount * CombinatoricsUtils.binomialCoefficient((int) expectedDegree, 2) / 3;

	Result expectedResult = new Result(0, 0, 0, expectedCount);

	Result triadCensus = new TriadicCensus<LongValue, NullValue, NullValue>()
		.run(completeGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

@Test
public void testWithSimpleGraph() throws Exception {
	Result expectedResult = new Result(3, 8, 7, 2);

	Result triadCensus = new TriadicCensus<IntValue, NullValue, NullValue>()
		.run(undirectedSimpleGraph)
		.execute();

	assertEquals(expectedResult, triadCensus);
}
 

public Result(long... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = new BigInteger[counts.length];

	for (int i = 0; i < counts.length; i++) {
		this.counts[i] = BigInteger.valueOf(counts[i]);
	}
}
 

public Result(BigInteger... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = counts;
}
 

@Override
public Result getResult() {
	// vertex metrics
	BigInteger bigVertexCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfVertices());
	BigInteger bigEdgeCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfEdges());
	BigInteger bigTripletCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfTriplets());

	// triangle count
	BigInteger bigTriangleCount = BigInteger.valueOf(triangleCount.getResult());

	BigInteger one = BigInteger.ONE;
	BigInteger two = BigInteger.valueOf(2);
	BigInteger three = BigInteger.valueOf(3);
	BigInteger six = BigInteger.valueOf(6);

	// counts as ordered in TriadicCensus.Result
	BigInteger[] counts = new BigInteger[4];

	// triads with three connecting edges = closed triplet = triangle
	counts[3] = bigTriangleCount;

	// triads with two connecting edges = open triplet;
	// deduct each triplet having been counted three times per triangle
	counts[2] = bigTripletCount.subtract(bigTriangleCount.multiply(three));

	// triads with one connecting edge; each edge pairs with `vertex count - 2` vertices
	// then deduct twice for each open triplet and three times for each triangle
	counts[1] = bigEdgeCount
		.multiply(bigVertexCount.subtract(two))
		.subtract(counts[2].multiply(two))
		.subtract(counts[3].multiply(three));

	// triads with zero connecting edges;
	// (vertex count choose 3) minus earlier counts
	counts[0] = bigVertexCount
		.multiply(bigVertexCount.subtract(one))
		.multiply(bigVertexCount.subtract(two))
		.divide(six)
		.subtract(counts[1])
		.subtract(counts[2])
		.subtract(counts[3]);

	return new Result(counts);
}
 

@Override
public Result getResult() {
	// vertex metrics
	BigInteger bigVertexCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfVertices());
	BigInteger bigEdgeCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfEdges());
	BigInteger bigTripletCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfTriplets());

	// triangle count
	BigInteger bigTriangleCount = BigInteger.valueOf(triangleCount.getResult());

	BigInteger one = BigInteger.ONE;
	BigInteger two = BigInteger.valueOf(2);
	BigInteger three = BigInteger.valueOf(3);
	BigInteger six = BigInteger.valueOf(6);

	// counts as ordered in TriadicCensus.Result
	BigInteger[] counts = new BigInteger[4];

	// triads with three connecting edges = closed triplet = triangle
	counts[3] = bigTriangleCount;

	// triads with two connecting edges = open triplet;
	// deduct each triplet having been counted three times per triangle
	counts[2] = bigTripletCount.subtract(bigTriangleCount.multiply(three));

	// triads with one connecting edge; each edge pairs with `vertex count - 2` vertices
	// then deduct twice for each open triplet and three times for each triangle
	counts[1] = bigEdgeCount
		.multiply(bigVertexCount.subtract(two))
		.subtract(counts[2].multiply(two))
		.subtract(counts[3].multiply(three));

	// triads with zero connecting edges;
	// (vertex count choose 3) minus earlier counts
	counts[0] = bigVertexCount
		.multiply(bigVertexCount.subtract(one))
		.multiply(bigVertexCount.subtract(two))
		.divide(six)
		.subtract(counts[1])
		.subtract(counts[2])
		.subtract(counts[3]);

	return new Result(counts);
}
 

public Result(BigInteger... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = counts;
}
 

public Result(BigInteger... counts) {
	Preconditions.checkArgument(counts.length == 4,
		"Expected 4 counts but received " + counts.length);

	this.counts = counts;
}
 

@Override
public Result getResult() {
	// vertex metrics
	BigInteger bigVertexCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfVertices());
	BigInteger bigEdgeCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfEdges());
	BigInteger bigTripletCount = BigInteger.valueOf(vertexMetrics.getResult().getNumberOfTriplets());

	// triangle count
	BigInteger bigTriangleCount = BigInteger.valueOf(triangleCount.getResult());

	BigInteger one = BigInteger.ONE;
	BigInteger two = BigInteger.valueOf(2);
	BigInteger three = BigInteger.valueOf(3);
	BigInteger six = BigInteger.valueOf(6);

	// counts as ordered in TriadicCensus.Result
	BigInteger[] counts = new BigInteger[4];

	// triads with three connecting edges = closed triplet = triangle
	counts[3] = bigTriangleCount;

	// triads with two connecting edges = open triplet;
	// deduct each triplet having been counted three times per triangle
	counts[2] = bigTripletCount.subtract(bigTriangleCount.multiply(three));

	// triads with one connecting edge; each edge pairs with `vertex count - 2` vertices
	// then deduct twice for each open triplet and three times for each triangle
	counts[1] = bigEdgeCount
		.multiply(bigVertexCount.subtract(two))
		.subtract(counts[2].multiply(two))
		.subtract(counts[3].multiply(three));

	// triads with zero connecting edges;
	// (vertex count choose 3) minus earlier counts
	counts[0] = bigVertexCount
		.multiply(bigVertexCount.subtract(one))
		.multiply(bigVertexCount.subtract(two))
		.divide(six)
		.subtract(counts[1])
		.subtract(counts[2])
		.subtract(counts[3]);

	return new Result(counts);
}