blob: 969c48a2e11f02662856ccd888eaa9f55ce84a02 [file] [log] [blame]
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.flink.graph.generator;
import org.apache.flink.api.java.io.DiscardingOutputFormat;
import org.apache.flink.graph.Graph;
import org.apache.flink.types.LongValue;
import org.apache.flink.types.NullValue;
import org.junit.Test;
import static org.junit.Assert.assertEquals;
/**
* Tests for {@link CompleteGraph}.
*/
public class CompleteGraphTest extends GraphGeneratorTestBase {
@Test
public void testGraph() throws Exception {
int vertexCount = 4;
Graph<LongValue, NullValue, NullValue> graph = new CompleteGraph(env, vertexCount)
.generate();
String vertices = "0; 1; 2; 3";
String edges = "0,1; 0,2; 0,3; 1,0; 1,2; 1,3; 2,0; 2,1; 2,3; 3,0; 3,1; 3,2";
TestUtils.compareGraph(graph, vertices, edges);
}
@Test
public void testGraphMetrics() throws Exception {
int vertexCount = 10;
Graph<LongValue, NullValue, NullValue> graph = new CompleteGraph(env, vertexCount)
.generate();
assertEquals(vertexCount, graph.numberOfVertices());
assertEquals(vertexCount * (vertexCount - 1), graph.numberOfEdges());
long minInDegree = graph.inDegrees().min(1).collect().get(0).f1.getValue();
long minOutDegree = graph.outDegrees().min(1).collect().get(0).f1.getValue();
long maxInDegree = graph.inDegrees().max(1).collect().get(0).f1.getValue();
long maxOutDegree = graph.outDegrees().max(1).collect().get(0).f1.getValue();
assertEquals(vertexCount - 1, minInDegree);
assertEquals(vertexCount - 1, minOutDegree);
assertEquals(vertexCount - 1, maxInDegree);
assertEquals(vertexCount - 1, maxOutDegree);
}
@Test
public void testParallelism() throws Exception {
int parallelism = 2;
Graph<LongValue, NullValue, NullValue> graph = new CompleteGraph(env, 10)
.setParallelism(parallelism)
.generate();
graph.getVertices().output(new DiscardingOutputFormat<>());
graph.getEdges().output(new DiscardingOutputFormat<>());
TestUtils.verifyParallelism(env, parallelism);
}
}