1/*2 * Licensed to the Apache Software Foundation (ASF) under one3 * or more contributor license agreements. See the NOTICE file4 * distributed with this work for additional information5 * regarding copyright ownership. The ASF licenses this file6 * to you under the Apache License, Version 2.0 (the7 * "License"); you may not use this file except in compliance8 * with the License. You may obtain a copy of the License at9 *10 * http://www.apache.org/licenses/LICENSE-2.011 *12 * Unless required by applicable law or agreed to in writing, software13 * distributed under the License is distributed on an "AS IS" BASIS,14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.15 * See the License for the specific language governing permissions and16 * limitations under the License.17 */18package org.apache.giraph.block_app.test_setup.graphs;
1920import org.apache.giraph.block_app.test_setup.NumericTestGraph;
21import org.apache.giraph.block_app.test_setup.TestGraphModifier;
22import org.apache.giraph.function.Supplier;
23import org.apache.hadoop.io.Writable;
24import org.apache.hadoop.io.WritableComparable;
252627/**28 * Create a network that looks like:29 * 1 530 * / \ / \ 631 * 0---2--3---432 *33 * where 6 is disconnected from the rest of the network.34 *35 * @param <I> Vertex id type36 * @param <V> Vertex value type37 * @param <E> Edge value type38 */39publicclass Small1GraphInit<I extends WritableComparable,
40 V extends Writable, E extends Writable>
41implements TestGraphModifier<I, V, E> {
4243privatefinal Supplier<E> edgeSupplier;
4445publicSmall1GraphInit() {
46this(null);
47 }
4849publicSmall1GraphInit(Supplier<E> edgeSupplier) {
50this.edgeSupplier = edgeSupplier;
51 }
5253 @Override
54publicvoid modifyGraph(NumericTestGraph<I, V, E> graph) {
55 graph.addSymmetricEdge(0, 1, createEdgeValue());
56 graph.addSymmetricEdge(0, 2, createEdgeValue());
57 graph.addSymmetricEdge(1, 2, createEdgeValue());
58 graph.addSymmetricEdge(2, 3, createEdgeValue());
59 graph.addSymmetricEdge(3, 4, createEdgeValue());
60 graph.addSymmetricEdge(3, 5, createEdgeValue());
61 graph.addSymmetricEdge(4, 5, createEdgeValue());
6263 graph.addVertex(6);
64 }
6566private E createEdgeValue() {
67return edgeSupplier != null ? edgeSupplier.get() : null;
68 }
69 }