/*

     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 19.03.2005

  *

  */

 package net.sourceforge.combean.test.graph.util;

 import junit.framework.TestCase;

 import net.sourceforge.combean.graph.NumberNode;

 import net.sourceforge.combean.graph.iterators.IncidentEdgeAsOutgoingEdgeIterator;

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

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

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

 import net.sourceforge.combean.test.helpers.checks.CheckGraph;

 /**

  * @author schickin

  *

  */

 public class TestIncidentEdgeAsOutgoingEdgeIterator extends TestCase {

     private static final int GRAPHSIZE = 5;

     private Clique clique = null;

     private NumberNode firstNode = null;

     private NumberNode secondNode = null;

     private EdgeIterator itEdgeFirst = null;

     public static void main(String[] args) {

         junit.textui.TestRunner

                 .run(TestIncidentEdgeAsOutgoingEdgeIterator.class);

     }

     /*

      * @see TestCase#setUp()

      */

     protected void setUp() throws Exception {

         super.setUp();

         this.clique = new Clique(GRAPHSIZE);

         this.firstNode = new NumberNode(NumberGraph.FIRSTNODE); 

         this.secondNode = new NumberNode(NumberGraph.FIRSTNODE+1); 

         this.itEdgeFirst = this.clique.getIncidentEdges(this.firstNode);

     }

     /*

      * @see TestCase#tearDown()

      */

     protected void tearDown() throws Exception {

         super.tearDown();

     }

     /**

      * Constructor for TestIncidentEdgeAsOutgoingEdgeIterator.

      * @param name

      */

     public TestIncidentEdgeAsOutgoingEdgeIterator(String name) {

         super(name);

     }

     public final void testIterationThroughFilteredNeighborsAtSource() {

         EdgeIterator itFiltered =

             new IncidentEdgeAsOutgoingEdgeIterator(this.clique,

                     this.firstNode, this.itEdgeFirst);

         CheckGraph.checkNumIterations(itFiltered, GRAPHSIZE-1);

     }

     public final void testIterationThroughFilteredNeighborsNotAtSource() {

         EdgeIterator itFiltered =

             new IncidentEdgeAsOutgoingEdgeIterator(this.clique,

                     this.secondNode, this.itEdgeFirst);

         CheckGraph.checkNumIterations(itFiltered, 0);

     }

 }