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

ConnectivityInspectorTest.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.
 */
/* ------------------------------
 * ConnectivityInspectorTest.java
 * ------------------------------
 * (C) Copyright 2003-2005, by Barak Naveh and Contributors.
 *
 * Original Author:  Barak Naveh
 * Contributor(s):   John V. Sichi
 *
 * $Id: ConnectivityInspectorTest.java,v 1.11 2005/05/25 00:38:37 perfecthash Exp $
 *
 * Changes
 * -------
 * 07-Aug-2003 : Initial revision (BN);
 * 20-Apr-2005 : Added StrongConnectivityInspector test (JVS);
 *
 */
package org._3pq.jgrapht.alg;

import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;

import junit.framework.TestCase;

import org._3pq.jgrapht.DirectedGraph;
import org._3pq.jgrapht.Edge;
import org._3pq.jgrapht.graph.DefaultDirectedGraph;
import org._3pq.jgrapht.graph.DirectedSubgraph;
import org._3pq.jgrapht.graph.ListenableDirectedGraph;
import org._3pq.jgrapht.graph.Pseudograph;

/**
 * .
 *
 * @author Barak Naveh
 */
00061 public class ConnectivityInspectorTest extends TestCase {
    private static final String V1 = new String( "v1" );
    private static final String V2 = new String( "v2" );
    private static final String V3 = new String( "v3" );
    private static final String V4 = new String( "v4" );

    //
    Edge m_e1;
    Edge m_e2;
    Edge m_e3;
    Edge m_e3_b;
    Edge m_u;

    /**
     * .
     *
     * @return a graph
     */
00079     public Pseudograph create(  ) {
        Pseudograph g = new Pseudograph(  );

        assertEquals( 0, g.vertexSet(  ).size(  ) );
        g.addVertex( V1 );
        assertEquals( 1, g.vertexSet(  ).size(  ) );
        g.addVertex( V2 );
        assertEquals( 2, g.vertexSet(  ).size(  ) );
        g.addVertex( V3 );
        assertEquals( 3, g.vertexSet(  ).size(  ) );
        g.addVertex( V4 );
        assertEquals( 4, g.vertexSet(  ).size(  ) );

        assertEquals( 0, g.edgeSet(  ).size(  ) );

        m_e1 = g.addEdge( V1, V2 );
        assertEquals( 1, g.edgeSet(  ).size(  ) );

        m_e2 = g.addEdge( V2, V3 );
        assertEquals( 2, g.edgeSet(  ).size(  ) );

        m_e3 = g.addEdge( V3, V1 );
        assertEquals( 3, g.edgeSet(  ).size(  ) );

        m_e3_b = g.addEdge( V3, V1 );
        assertEquals( 4, g.edgeSet(  ).size(  ) );
        assertNotNull( m_e3_b );

        m_u = g.addEdge( V1, V1 );
        assertEquals( 5, g.edgeSet(  ).size(  ) );
        m_u = g.addEdge( V1, V1 );
        assertEquals( 6, g.edgeSet(  ).size(  ) );

        return g;
    }


    /**
     * .
     */
00119     public void testDirectedGraph(  ) {
        ListenableDirectedGraph g = new ListenableDirectedGraph(  );
        g.addVertex( V1 );
        g.addVertex( V2 );
        g.addVertex( V3 );

        g.addEdge( V1, V2 );

        ConnectivityInspector inspector = new ConnectivityInspector( g );
        g.addGraphListener( inspector );

        assertEquals( false, inspector.isGraphConnected(  ) );

        g.addEdge( V1, V3 );

        assertEquals( true, inspector.isGraphConnected(  ) );
    }


    /**
     * .
     */
00141     public void testIsGraphConnected(  ) {
        Pseudograph           g         = create(  );
        ConnectivityInspector inspector = new ConnectivityInspector( g );

        assertEquals( false, inspector.isGraphConnected(  ) );

        g.removeVertex( V4 );
        inspector = new ConnectivityInspector( g );
        assertEquals( true, inspector.isGraphConnected(  ) );

        g.removeVertex( V1 );
        assertEquals( 1, g.edgeSet(  ).size(  ) );

        g.removeEdge( m_e2 );
        g.addEdge( V2, V2 );
        assertEquals( 1, g.edgeSet(  ).size(  ) );

        inspector = new ConnectivityInspector( g );
        assertEquals( false, inspector.isGraphConnected(  ) );
    }


    /**
     * .
     */
00166     public void testStronglyConnected1(  ) {
        DirectedGraph g = new DefaultDirectedGraph(  );
        g.addVertex( V1 );
        g.addVertex( V2 );
        g.addVertex( V3 );
        g.addVertex( V4 );

        g.addEdge( V1, V2 );
        g.addEdge( V2, V1 ); // strongly connected

        g.addEdge( V3, V4 ); // only weakly connected

        StrongConnectivityInspector inspector =
            new StrongConnectivityInspector( g );

        // convert from List to Set because we need to ignore order
        // during comparison
        Set actualSets = new HashSet( inspector.stronglyConnectedSets(  ) );

        // construct the expected answer
        Set expectedSets = new HashSet(  );
        Set set = new HashSet(  );
        set.add( V1 );
        set.add( V2 );
        expectedSets.add( set );
        set = new HashSet(  );
        set.add( V3 );
        expectedSets.add( set );
        set = new HashSet(  );
        set.add( V4 );
        expectedSets.add( set );

        assertEquals( expectedSets, actualSets );

        actualSets.clear(  );

        List     subgraphs = inspector.stronglyConnectedSubgraphs(  );
        Iterator iter = subgraphs.iterator(  );

        while( iter.hasNext(  ) ) {
            DirectedSubgraph sg = (DirectedSubgraph) iter.next(  );
            actualSets.add( sg.vertexSet(  ) );

            StrongConnectivityInspector ci =
                new StrongConnectivityInspector( sg );
            assertTrue( ci.isStronglyConnected(  ) );
        }

        assertEquals( expectedSets, actualSets );
    }


    /**
     * .
     */
00221     public void testStronglyConnected2(  ) {
        DirectedGraph g = new DefaultDirectedGraph(  );
        g.addVertex( V1 );
        g.addVertex( V2 );
        g.addVertex( V3 );
        g.addVertex( V4 );

        g.addEdge( V1, V2 );
        g.addEdge( V2, V1 ); // strongly connected

        g.addEdge( V4, V3 ); // only weakly connected
        g.addEdge( V3, V2 ); // only weakly connected

        StrongConnectivityInspector inspector =
            new StrongConnectivityInspector( g );

        // convert from List to Set because we need to ignore order
        // during comparison
        Set actualSets = new HashSet( inspector.stronglyConnectedSets(  ) );

        // construct the expected answer
        Set expectedSets = new HashSet(  );
        Set set = new HashSet(  );
        set.add( V1 );
        set.add( V2 );
        expectedSets.add( set );
        set = new HashSet(  );
        set.add( V3 );
        expectedSets.add( set );
        set = new HashSet(  );
        set.add( V4 );
        expectedSets.add( set );

        assertEquals( expectedSets, actualSets );

        actualSets.clear(  );

        List     subgraphs = inspector.stronglyConnectedSubgraphs(  );
        Iterator iter = subgraphs.iterator(  );

        while( iter.hasNext(  ) ) {
            DirectedSubgraph sg = (DirectedSubgraph) iter.next(  );
            actualSets.add( sg.vertexSet(  ) );

            StrongConnectivityInspector ci =
                new StrongConnectivityInspector( sg );
            assertTrue( ci.isStronglyConnected(  ) );
        }

        assertEquals( expectedSets, actualSets );
    }


    /**
     * .
     */
00277     public void testStronglyConnected3(  ) {
        DirectedGraph g = new DefaultDirectedGraph(  );
        g.addVertex( V1 );
        g.addVertex( V2 );
        g.addVertex( V3 );
        g.addVertex( V4 );

        g.addEdge( V1, V2 );
        g.addEdge( V2, V3 );
        g.addEdge( V3, V1 ); // strongly connected

        g.addEdge( V1, V4 );
        g.addEdge( V2, V4 );
        g.addEdge( V3, V4 ); // weakly connected

        StrongConnectivityInspector inspector =
            new StrongConnectivityInspector( g );

        // convert from List to Set because we need to ignore order
        // during comparison
        Set actualSets = new HashSet( inspector.stronglyConnectedSets(  ) );

        // construct the expected answer
        Set expectedSets = new HashSet(  );
        Set set = new HashSet(  );
        set.add( V1 );
        set.add( V2 );
        set.add( V3 );
        expectedSets.add( set );
        set = new HashSet(  );
        set.add( V4 );
        expectedSets.add( set );

        assertEquals( expectedSets, actualSets );

        actualSets.clear(  );

        List     subgraphs = inspector.stronglyConnectedSubgraphs(  );
        Iterator iter = subgraphs.iterator(  );

        while( iter.hasNext(  ) ) {
            DirectedSubgraph sg = (DirectedSubgraph) iter.next(  );
            actualSets.add( sg.vertexSet(  ) );

            StrongConnectivityInspector ci =
                new StrongConnectivityInspector( sg );
            assertTrue( ci.isStronglyConnected(  ) );
        }

        assertEquals( expectedSets, actualSets );
    }
}

Generated by  Doxygen 1.6.0   Back to index