Logo Search packages:      
Sourcecode: libjgrapht-java version File versions  Download package

AsUndirectedGraphTest.java

/* ==========================================
 * JGraphT : a free Java graph-theory library
 * ==========================================
 *
 * Project Info:  http://jgrapht.sourceforge.net/
 * Project Lead:  Barak Naveh (http://sourceforge.net/users/barak_naveh)
 *
 * (C) Copyright 2003-2004, by Barak Naveh and Contributors.
 *
 * This library is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or
 * (at your option) any later version.
 *
 * This library 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 Lesser General Public
 * License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
 */
/* --------------------------
 * AsUndirectedGraphTest.java
 * --------------------------
 * (C) Copyright 2003, by John V. Sichi and Contributors.
 *
 * Original Author:  John V. Sichi
 * Contributor(s):   -
 *
 * $Id: AsUndirectedGraphTest.java,v 1.4 2004/05/01 12:24:01 barak_naveh Exp $
 *
 * Changes
 * -------
 * 14-Aug-2003 : Initial revision (JVS);
 *
 */
package org._3pq.jgrapht.graph;

import java.util.List;

import org._3pq.jgrapht.DirectedGraph;
import org._3pq.jgrapht.Edge;
import org._3pq.jgrapht.EnhancedTestCase;
import org._3pq.jgrapht.UndirectedGraph;

/**
 * A unit test for the AsDirectedGraph view.
 *
 * @author John V. Sichi
 */
00053 public class AsUndirectedGraphTest extends EnhancedTestCase {
    private DirectedGraph   m_directed;
    private Edge            m_loop;
    private String          m_v1         = "v1";
    private String          m_v2         = "v2";
    private String          m_v3         = "v3";
    private String          m_v4         = "v4";
    private UndirectedGraph m_undirected;

    /**
     * @see junit.framework.TestCase#TestCase(java.lang.String)
     */
00065     public AsUndirectedGraphTest( String name ) {
        super( name );
    }

    /**
     * .
     */
00072     public void testAddEdge(  ) {
        try {
            m_undirected.addEdge( m_v3, m_v4 );
            assertFalse(  );
        }
         catch( UnsupportedOperationException e ) {
            assertTrue(  );
        }
    }


    /**
     * .
     */
00086     public void testAddVertex(  ) {
        String v5 = "v5";

        m_undirected.addVertex( v5 );
        assertEquals( true, m_undirected.containsVertex( v5 ) );
        assertEquals( true, m_directed.containsVertex( v5 ) );
    }


    /**
     * .
     */
00098     public void testDegreeOf(  ) {
        assertEquals( 1, m_undirected.degreeOf( m_v1 ) );
        assertEquals( 3, m_undirected.degreeOf( m_v2 ) );
        assertEquals( 1, m_undirected.degreeOf( m_v3 ) );
        assertEquals( 3, m_undirected.degreeOf( m_v4 ) );
    }


    /**
     * .
     */
00109     public void testGetAllEdges(  ) {
        List edges = m_undirected.getAllEdges( m_v3, m_v2 );
        assertEquals( 1, edges.size(  ) );
        assertEquals( m_directed.getEdge( m_v2, m_v3 ),
            edges.iterator(  ).next(  ) );

        edges = m_undirected.getAllEdges( m_v4, m_v4 );
        assertEquals( 1, edges.size(  ) );
        assertEquals( m_loop, edges.iterator(  ).next(  ) );
    }


    /**
     * .
     */
00124     public void testGetEdge(  ) {
        assertEquals( m_directed.getEdge( m_v1, m_v2 ),
            m_undirected.getEdge( m_v1, m_v2 ) );
        assertEquals( m_directed.getEdge( m_v1, m_v2 ),
            m_undirected.getEdge( m_v2, m_v1 ) );

        assertEquals( m_directed.getEdge( m_v4, m_v4 ),
            m_undirected.getEdge( m_v4, m_v4 ) );
    }


    /**
     * .
     */
00138     public void testRemoveEdge(  ) {
        m_undirected.removeEdge( m_loop );
        assertEquals( false, m_undirected.containsEdge( m_loop ) );
        assertEquals( false, m_directed.containsEdge( m_loop ) );
    }


    /**
     * .
     */
00148     public void testRemoveVertex(  ) {
        m_undirected.removeVertex( m_v4 );
        assertEquals( false, m_undirected.containsVertex( m_v4 ) );
        assertEquals( false, m_directed.containsVertex( m_v4 ) );
    }


    /**
     * .
     */
00158     protected void setUp(  ) {
        m_directed       = new DefaultDirectedGraph(  );
        m_undirected     = new AsUndirectedGraph( m_directed );

        m_directed.addVertex( m_v1 );
        m_directed.addVertex( m_v2 );
        m_directed.addVertex( m_v3 );
        m_directed.addVertex( m_v4 );
        m_directed.addEdge( m_v1, m_v2 );
        m_directed.addEdge( m_v2, m_v3 );
        m_directed.addEdge( m_v2, m_v4 );
        m_loop = m_directed.addEdge( m_v4, m_v4 );
    }
}

Generated by  Doxygen 1.6.0   Back to index