Java example source code file (ConfigurableUndirectedMultiNetworkTest.java)

This example Java source code file (ConfigurableUndirectedMultiNetworkTest.java) is included in the alvinalexander.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" ^TM.

Learn more about this Java project at its project page.

Java - Java tags/keywords

configurableundirectedmultinetworktest, configurableundirectednetworktest, e11_a, e12_a, e21, mutablenetwork, override, string, test

The ConfigurableUndirectedMultiNetworkTest.java Java example source code

/*
 * Copyright (C) 2014 The Guava Authors
 *
 * Licensed 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 com.google.common.graph;

import static com.google.common.truth.Truth.assertThat;
import static org.junit.Assert.assertTrue;

import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;

/**
 * Tests for an undirected {@link ConfigurableMutableNetwork} allowing parallel edges.
 */
@RunWith(JUnit4.class)
public class ConfigurableUndirectedMultiNetworkTest extends ConfigurableUndirectedNetworkTest {
  @Override
  public MutableNetwork<Integer, String> createGraph() {
    return NetworkBuilder.undirected().allowsParallelEdges(true).build();
  }

  @Test
  public void edgesConnecting_parallelEdges() {
    assertTrue(addEdge(E12, N1, N2));
    assertTrue(addEdge(E12_A, N1, N2));
    assertTrue(addEdge(E21, N2, N1));
    assertThat(graph.edgesConnecting(N1, N2)).containsExactly(E12, E12_A, E21);
    assertThat(graph.edgesConnecting(N2, N1)).containsExactly(E12, E12_A, E21);
  }

  @Test
  public void edgesConnecting_parallelSelfLoopEdges() {
    assertTrue(addEdge(E11, N1, N1));
    assertTrue(addEdge(E11_A, N1, N1));
    assertThat(graph.edgesConnecting(N1, N1)).containsExactly(E11, E11_A);
  }

  @Override
  @Test
  public void addEdge_parallelEdge() {
    assertTrue(addEdge(E12, N1, N2));
    assertTrue(addEdge(E12_A, N1, N2));
    assertTrue(addEdge(E21, N2, N1));
    assertThat(graph.edgesConnecting(N1, N2)).containsExactly(E12, E12_A, E21);
  }

  @Override
  @Test
  public void addEdge_parallelSelfLoopEdge() {
    assertTrue(addEdge(E11, N1, N1));
    assertTrue(addEdge(E11_A, N1, N1));
    assertThat(graph.edgesConnecting(N1, N1)).containsExactly(E11, E11_A);
  }

  @Test
  public void removeEdge_parallelEdge() {
    addEdge(E12, N1, N2);
    addEdge(E12_A, N1, N2);
    addEdge(E21, N2, N1);
    assertTrue(graph.removeEdge(E12_A));
    assertThat(graph.edgesConnecting(N1, N2)).containsExactly(E12, E21);
  }

  @Test
  public void removeEdge_parallelSelfLoopEdge() {
    addEdge(E11, N1, N1);
    addEdge(E11_A, N1, N1);
    addEdge(E12, N1, N2);
    assertTrue(graph.removeEdge(E11_A));
    assertThat(graph.edgesConnecting(N1, N1)).containsExactly(E11);
    assertThat(graph.edgesConnecting(N1, N2)).containsExactly(E12);
    assertTrue(graph.removeEdge(E11));
    assertThat(graph.edgesConnecting(N1, N1)).isEmpty();
    assertThat(graph.edgesConnecting(N1, N2)).containsExactly(E12);
  }
}