Java example source code file (ElementOrderTest.java)

This example Java source code file (ElementOrderTest.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

elementordertest, exception, graphbuilder, mutablegraph, mutablenetwork, networkbuilder, string, test

The ElementOrderTest.java Java example source code

/*
 * Copyright (C) 2016 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.graph.ElementOrder.insertion;
import static com.google.common.graph.ElementOrder.unordered;
import static com.google.common.truth.Truth.assertThat;

import com.google.common.collect.Ordering;

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

/**
 * Tests for ordering the elements of graphs.
 */
@RunWith(JUnit4.class)
public final class ElementOrderTest {
  // Node order tests

  @Test
  public void nodeOrder_none() throws Exception {
    MutableGraph<Integer> graph = GraphBuilder
        .directed()
        .nodeOrder(unordered())
        .build();

    assertThat(graph.nodeOrder()).isEqualTo(unordered());
  }

  @Test
  public void nodeOrder_insertion() throws Exception {
    MutableGraph<Integer> graph = GraphBuilder
        .directed()
        .nodeOrder(insertion())
        .build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());
    assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder();
  }

  // The default ordering is INSERTION unless otherwise specified.
  @Test
  public void nodeOrder_default() throws Exception {
    MutableGraph<Integer> graph = GraphBuilder
        .directed()
        .build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(insertion());
    assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder();
  }

  @Test
  public void nodeOrder_natural() throws Exception {
    MutableGraph<Integer> graph = GraphBuilder
        .directed()
        .nodeOrder(ElementOrder.<Integer>natural())
        .build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(ElementOrder.sorted(Ordering.<Integer>natural()));
    assertThat(graph.nodes()).containsExactly(1, 3, 4).inOrder();
  }

  @Test
  public void nodeOrder_sorted() throws Exception {
    MutableGraph<Integer> graph = GraphBuilder
        .directed()
        .nodeOrder(ElementOrder.sorted(Ordering.<Integer>natural().reverse()))
        .build();

    addNodes(graph);

    assertThat(graph.nodeOrder()).isEqualTo(
        ElementOrder.sorted(Ordering.<Integer>natural().reverse()));
    assertThat(graph.nodes()).containsExactly(4, 3, 1).inOrder();
  }

  // Edge order tests

  @Test
  public void edgeOrder_none() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .edgeOrder(unordered())
        .build();

    assertThat(graph.edgeOrder()).isEqualTo(unordered());
    assertThat(graph.nodeOrder()).isEqualTo(insertion()); // default
  }

  @Test
  public void edgeOrder_insertion() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .edgeOrder(insertion())
        .build();

    addEdges(graph);

    assertThat(graph.edgeOrder()).isEqualTo(ElementOrder.insertion());
    assertThat(graph.edges()).containsExactly("i", "e", "p").inOrder();
    assertThat(graph.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default
  }

  // The default ordering is INSERTION unless otherwise specified.
  @Test
  public void edgeOrder_default() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .build();

    addEdges(graph);

    assertThat(graph.edgeOrder()).isEqualTo(ElementOrder.insertion());
    assertThat(graph.edges()).containsExactly("i", "e", "p").inOrder();
    assertThat(graph.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default
  }

  @Test
  public void edgeOrder_natural() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .edgeOrder(ElementOrder.<String>natural())
        .build();

    addEdges(graph);

    assertThat(graph.edgeOrder()).isEqualTo(ElementOrder.sorted(Ordering.<String>natural()));
    assertThat(graph.edges()).containsExactly("e", "i", "p").inOrder();
    assertThat(graph.nodeOrder()).isEqualTo(insertion()); // default
  }

  @Test
  public void edgeOrder_sorted() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .edgeOrder(ElementOrder.sorted(Ordering.<String>natural().reverse()))
        .build();

    addEdges(graph);

    assertThat(graph.edgeOrder()).isEqualTo(
        ElementOrder.sorted(Ordering.<String>natural().reverse()));
    assertThat(graph.edges()).containsExactly("p", "i", "e").inOrder();
    assertThat(graph.nodeOrder()).isEqualTo(ElementOrder.insertion()); // default
  }

  // Combined node and edge order tests
  @Test
  public void nodeOrderUnorderedandEdgesSorted() throws Exception {
    MutableNetwork<Integer, String> graph = NetworkBuilder
        .directed()
        .nodeOrder(unordered())
        .edgeOrder(ElementOrder.sorted(Ordering.<String>natural().reverse()))
        .build();

    addEdges(graph);

    assertThat(graph.edgeOrder()).isEqualTo(
        ElementOrder.sorted(Ordering.<String>natural().reverse()));
    assertThat(graph.edges()).containsExactly("p", "i", "e").inOrder();
    assertThat(graph.nodeOrder()).isEqualTo(unordered());
    assertThat(graph.nodes()).containsExactly(4, 1, 3);
  }

  private static void addNodes(MutableGraph<Integer> graph) {
    graph.addNode(3);
    graph.addNode(1);
    graph.addNode(4);
  }

  private static void addEdges(MutableNetwork<Integer, String> graph) {
    graph.addEdge("i", 3, 1);
    graph.addEdge("e", 1, 4);
    graph.addEdge("p", 4, 3);
  }
}