/*

     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 20.02.2005

  *

  */

 package net.sourceforge.combean.test.graph.alg.traversal;

 import junit.framework.TestCase;

 import net.sourceforge.combean.graph.NumberNode;

 import net.sourceforge.combean.graph.alg.traversal.DFSNodeNumberingVisitor;

 import net.sourceforge.combean.graph.alg.traversal.RecursiveDFSImpl;

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

 import net.sourceforge.combean.interfaces.graph.alg.traverse.DepthFirstSearch;

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

 /**

  * @author schickin

  *

  */

 public class TestDFSNodeNumberingVisitor extends TestCase {

     private DFSNodeNumberingVisitor numberingVis = null;

     private DepthFirstSearch dfsAlg = null;

     private static final int CIRCLESIZE = 5;

     private Graph circle = null;

     public static void main(String[] args) {

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

     }

     /*

      * @see TestCase#setUp()

      */

     protected void setUp() throws Exception {

         super.setUp();

         this.circle = new DirectedCircle(CIRCLESIZE);

         this.dfsAlg = new RecursiveDFSImpl();

         this.dfsAlg.setGraph(this.circle);

         this.numberingVis = new DFSNodeNumberingVisitor();

         this.dfsAlg.setVisitor(this.numberingVis);

     }

     /*

      * @see TestCase#tearDown()

      */

     protected void tearDown() throws Exception {

         super.tearDown();

     }

     /**

      * Constructor for TestDFSNodeNumberingVisitor.

      * @param name

      */

     public TestDFSNodeNumberingVisitor(String name) {

         super(name);

     }

     public final void testGetDfsNum() {

         this.dfsAlg.setLocalStartNode(new NumberNode(0));

         this.dfsAlg.run();

         for (int i = 0; i < CIRCLESIZE; i++) {

             NumberNode v = new NumberNode(i);

             assertEquals("by construction dfs number must equal node number",

                     i+1, this.numberingVis.getDfsNum(v));

         }

     }

 }