CopyFaceFactoryTest.java

/*
 * This file is part of the Trickl Open Source Libraries.
 *
 * Trickl Open Source Libraries - http://open.trickl.com/
 *
 * Copyright (C) 2011 Tim Gee.
 *
 * Trickl Open Source Libraries are free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Trickl Open Source Libraries are distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this project.  If not, see <http://www.gnu.org/licenses/>.
 */
package com.trickl.graph.planar;

import com.trickl.graph.edges.IntegerEdgeFactory;
import com.trickl.graph.edges.UndirectedIdEdge;
import com.trickl.graph.edges.UndirectedIdEdgeFactory;
import com.trickl.graph.planar.generate.PlanarCircleGraphGenerator;
import com.trickl.graph.planar.faces.IdFace;
import com.trickl.graph.planar.faces.IdFaceFactory;
import com.trickl.graph.vertices.IntegerVertexFactory;
import org.junit.*;

public class CopyFaceFactoryTest {

   @Test
   public void testCopyStructureOnly() throws Exception {
      // Create a graph with face ids >= 100
      IdFaceFactory<Integer> faceFactory = new IdFaceFactory<Integer>();
      faceFactory.setNextId(100);

      PlanarFaceGraph<Integer, Integer, IdFace> graph =
              new DoublyConnectedEdgeList<Integer, Integer, IdFace>(new IntegerEdgeFactory(), faceFactory);

      IntegerVertexFactory vertexFactory = new IntegerVertexFactory();
      PlanarCircleGraphGenerator generator =
              new PlanarCircleGraphGenerator<Integer, Integer>(7);

      generator.generateGraph(graph, vertexFactory, null);

      // Copy the graph
      PlanarFaceGraph<Integer, Integer, IdFace> copyGraph =
              new DoublyConnectedEdgeList<Integer, Integer, IdFace>(new IntegerEdgeFactory(), new CopyFaceFactory(graph));
      PlanarGraphs.copy(graph, copyGraph, null, null);

      Assert.assertEquals(7, copyGraph.faceSet().size());

      // Check that the new graph has the same faces as the old graph
      // TODO: Think of a better way of validating the copied faces
      int minId = Integer.MAX_VALUE;
      int maxId = Integer.MIN_VALUE;
      for (IdFace copyFace : graph.faceSet()) {
         minId = Math.min(minId, copyFace.getId());
         maxId = Math.max(maxId, copyFace.getId());
      }

      Assert.assertEquals(100, minId);
      Assert.assertEquals(106, maxId);
   }
}