BreadthFirstIteratorTest


1   /* ==========================================
2    * JGraphT : a free Java graph-theory library
3    * ==========================================
4    *
5    * Project Info:  http://jgrapht.sourceforge.net/
6    * Project Creator:  Barak Naveh (http://sourceforge.net/users/barak_naveh)
7    *
8    * (C) Copyright 2003-2006, by Barak Naveh and Contributors.
9    *
10   * This library is free software; you can redistribute it and/or modify it
11   * under the terms of the GNU Lesser General Public License as published by
12   * the Free Software Foundation; either version 2.1 of the License, or
13   * (at your option) any later version.
14   *
15   * This library is distributed in the hope that it will be useful, but
16   * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17   * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
18   * License for more details.
19   *
20   * You should have received a copy of the GNU Lesser General Public License
21   * along with this library; if not, write to the Free Software Foundation,
22   * Inc.,
23   * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
24   */
25  /* -----------------------------
26   * BreadthFirstIteratorTest.java
27   * -----------------------------
28   * (C) Copyright 2003-2006, by Liviu Rau and Contributors.
29   *
30   * Original Author:  Liviu Rau
31   * Contributor(s):   Barak Naveh
32   *
33   * $Id: BreadthFirstIteratorTest.java 504 2006-07-03 02:37:26Z perfecthash $
34   *
35   * Changes
36   * -------
37   * 30-Jul-2003 : Initial revision (LR);
38   * 06-Aug-2003 : Test traversal listener & extract a shared superclass (BN);
39   *
40   */
41  package org.jgrapht.traverse;
42  
43  import org.jgrapht.*;
44  import org.jgrapht.graph.*;
45  
46  
47  /**
48   * Tests for the {@link BreadthFirstIterator} class.
49   *
50   * <p>NOTE: This test uses hard-coded expected ordering isn't really guaranteed
51   * by the specification of the algorithm. This could cause false failures if the
52   * traversal implementation changes.</p>
53   *
54   * @author Liviu Rau
55   * @since Jul 30, 2003
56   */
57  public class BreadthFirstIteratorTest
58      extends AbstractGraphIteratorTest
59  {
60  
61      //~ Methods ---------------------------------------------------------------
62  
63      String   getExpectedStr1()
64      {
65          return "1,2,3,4,5,6,7,8,9";
66      }
67  
68      String   getExpectedStr2()
69      {
70          return "1,2,3,4,5,6,7,8,9,orphan";
71      }
72  
73      AbstractGraphIterator<String  , DefaultEdge> createIterator(
74          DirectedGraph<String  , DefaultEdge> g,
75          String   vertex)
76      {
77          AbstractGraphIterator<String  , DefaultEdge> i =
78              new BreadthFirstIterator<String  , DefaultEdge>(g, vertex);
79          i.setCrossComponentTraversal(true);
80  
81          return i;
82      }
83  }
84
A to Z: JavaDoc & Examples Daily Java News & Articles Open Source Projects Open Source Codes Free Computer Books Remove Frame
Popular Tags