/*

     This file is part of Combean.

     Combean is 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 2 of the License, or

     (at your option) any later version.

     Combean is 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 Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 10.02.2005

  *

  */

 package net.sourceforge.combean.test.samples.simplegraphs;

 import junit.framework.TestCase;

 import net.sourceforge.combean.graph.NumberNode;

 import net.sourceforge.combean.interfaces.graph.Edge;

 import net.sourceforge.combean.interfaces.graph.EdgeIterator;

 import net.sourceforge.combean.interfaces.graph.Node;

 import net.sourceforge.combean.interfaces.graph.NodeIterator;

 import net.sourceforge.combean.samples.simplegraphs.DirectedCircle;

 /**

  * @author schickin

  *

  */

 public class TestDirectedCircle extends TestCase {

     private static final int CIRCLESIZE = 5;

     private DirectedCircle circle = null;

     public static void main(String[] args) {

         junit.textui.TestRunner.run(TestDirectedCircle.class);

     }

     /*

      * @see TestCase#setUp()

      */

     protected void setUp() throws Exception {

         super.setUp();

         this.circle = new DirectedCircle(CIRCLESIZE);

     }

     /*

      * @see TestCase#tearDown()

      */

     protected void tearDown() throws Exception {

         super.tearDown();

     }

     /**

      * Constructor for TestDirectedCircle.

      * @param name

      */

     public TestDirectedCircle(String name) {

         super(name);

     }

         public final void testGetNeighbors() {

                 EdgeIterator it = null;

                 Edge e = null;

                 Node v = null;

                 int i = 0;

                 NodeIterator allNodesIt = this.circle.getAllNodesIterator();

                 while (allNodesIt.hasNext()) {

                     Node w = allNodesIt.next();

                         it = this.circle.getIncidentEdges(w);

                         assertTrue("every node has one neighbor", it.hasNext());

                         e = it.next();

                         v = this.circle.getOtherNode(e, w);

                         assertEquals((i+1)%CIRCLESIZE, ((NumberNode)v).getNodeNum());

                         assertFalse(it.hasNext());

                         i++;

                 }

         }

 }