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

AbstractBaseGraph.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.
 */
/* ----------------------
 * AbstractBaseGraph.java
 * ----------------------
 * (C) Copyright 2003, by Barak Naveh and Contributors.
 *
 * Original Author:  Barak Naveh
 * Contributor(s):   John V. Sichi
 *
 * $Id: AbstractBaseGraph.java,v 1.17 2005/06/02 03:25:17 perfecthash Exp $
 *
 * Changes
 * -------
 * 24-Jul-2003 : Initial revision (BN);
 * 10-Aug-2003 : General edge refactoring (BN);
 * 06-Nov-2003 : Change edge sharing semantics (JVS);
 * 07-Feb-2004 : Enabled serialization (BN);
 * 01-Jun-2005 : Added EdgeListFactory (JVS);
 *
 */
package org._3pq.jgrapht.graph;

import java.io.Serializable;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

import org._3pq.jgrapht.DirectedGraph;
import org._3pq.jgrapht.Edge;
import org._3pq.jgrapht.EdgeFactory;
import org._3pq.jgrapht.Graph;
import org._3pq.jgrapht.GraphHelper;
import org._3pq.jgrapht.UndirectedGraph;

/**
 * The most general implementation of the {@link org._3pq.jgrapht.Graph}
 * interface. Its subclasses add various restrictions to get more specific
 * graphs. The decision whether it is directed or undirected is decided at
 * construction time and cannot be later modified (see constructor for
 * details).
 * 
 * <p>
 * This graph implementation guarantees deterministic vertex and edge set
 * ordering (via {@link LinkedHashMap} and {@link LinkedHashSet}).
 * </p>
 *
 * @author Barak Naveh
 *
 * @since Jul 24, 2003
 */
00079 public abstract class AbstractBaseGraph extends AbstractGraph implements Graph,
    Cloneable, Serializable {
    private static final String LOOPS_NOT_ALLOWED = "loops not allowed";

    // friendly (to improve performance)
    Map     m_vertexMap;
    boolean m_allowingLoops;

    // private
    private Class           m_factoryEdgeClass;
    private EdgeFactory     m_edgeFactory;
    private EdgeListFactory m_edgeListFactory;
    private Set             m_edgeSet;
    private transient Set   m_unmodifiableEdgeSet   = null;
    private transient Set   m_unmodifiableVertexSet = null;
    private Specifics       m_specifics;
    private boolean         m_allowingMultipleEdges;

    /**
     * Construct a new pseudograph. The pseudograph can either be directed or
     * undirected, depending on the specified edge factory. A sample edge is
     * created using the edge factory to see if the factory is compatible with
     * this class of  graph. For example, if this graph is a
     * <code>DirectedGraph</code> the edge factory must produce
     * <code>DirectedEdge</code>s. If this is not the case, an
     * <code>IllegalArgumentException</code> is thrown.
     *
     * @param ef the edge factory of the new graph.
     * @param allowMultipleEdges whether to allow multiple edges or not.
     * @param allowLoops whether to allow edges that are self-loops or not.
     *
     * @throws NullPointerException if the specified edge factory is
     *         <code>null</code>.
     */
00113     public AbstractBaseGraph( EdgeFactory ef, boolean allowMultipleEdges,
        boolean allowLoops ) {
        if( ef == null ) {
            throw new NullPointerException(  );
        }

        m_vertexMap                 = new LinkedHashMap(  );
        m_edgeSet                   = new LinkedHashSet(  );
        m_edgeFactory               = ef;
        m_allowingLoops             = allowLoops;
        m_allowingMultipleEdges     = allowMultipleEdges;

        m_specifics = createSpecifics(  );

        Edge e = ef.createEdge( new Object(  ), new Object(  ) );
        m_factoryEdgeClass     = e.getClass(  );

        m_edgeListFactory = new ArrayListFactory(  );
    }

    /**
     * @see Graph#getAllEdges(Object, Object)
     */
00136     public List getAllEdges( Object sourceVertex, Object targetVertex ) {
        return m_specifics.getAllEdges( sourceVertex, targetVertex );
    }


    /**
     * Returns <code>true</code> if and only if self-loops are allowed in this
     * graph. A self loop is an edge that its source and target vertices are
     * the same.
     *
     * @return <code>true</code> if and only if graph loops are allowed.
     */
00148     public boolean isAllowingLoops(  ) {
        return m_allowingLoops;
    }


    /**
     * Returns <code>true</code> if and only if multiple edges are allowed in
     * this graph. The meaning of multiple edges is that there can be many
     * edges going from vertex v1 to vertex v2.
     *
     * @return <code>true</code> if and only if multiple edges are allowed.
     */
00160     public boolean isAllowingMultipleEdges(  ) {
        return m_allowingMultipleEdges;
    }


    /**
     * @see Graph#getEdge(Object, Object)
     */
00168     public Edge getEdge( Object sourceVertex, Object targetVertex ) {
        return m_specifics.getEdge( sourceVertex, targetVertex );
    }


    /**
     * @see Graph#getEdgeFactory()
     */
00176     public EdgeFactory getEdgeFactory(  ) {
        return m_edgeFactory;
    }


    /**
     * Set the {@link EdgeListFactory} to use for this graph. Initially, a
     * graph is created with a default implementation which always supplies an
     * {@link java.util.ArrayList} with capacity 1.
     *
     * @param edgeListFactory factory to use for subsequently created edge
     *        lists (this call has no effect on existing edge lists)
     */
00189     public void setEdgeListFactory( EdgeListFactory edgeListFactory ) {
        m_edgeListFactory = edgeListFactory;
    }


    /**
     * @see Graph#addEdge(Object, Object)
     */
00197     public Edge addEdge( Object sourceVertex, Object targetVertex ) {
        assertVertexExist( sourceVertex );
        assertVertexExist( targetVertex );

        if( !m_allowingMultipleEdges
                && containsEdge( sourceVertex, targetVertex ) ) {
            return null;
        }

        if( !m_allowingLoops && sourceVertex.equals( targetVertex ) ) {
            throw new IllegalArgumentException( LOOPS_NOT_ALLOWED );
        }

        Edge e = m_edgeFactory.createEdge( sourceVertex, targetVertex );

        if( containsEdge( e ) ) { // this restriction should stay!

            return null;
        }
        else {
            m_edgeSet.add( e );
            m_specifics.addEdgeToTouchingVertices( e );

            return e;
        }
    }


    /**
     * @see Graph#addEdge(Edge)
     */
00228     public boolean addEdge( Edge e ) {
        if( e == null ) {
            throw new NullPointerException(  );
        }
        else if( containsEdge( e ) ) {
            return false;
        }

        Object sourceVertex = e.getSource(  );
        Object targetVertex = e.getTarget(  );

        assertVertexExist( sourceVertex );
        assertVertexExist( targetVertex );

        assertCompatibleWithEdgeFactory( e );

        if( !m_allowingMultipleEdges
                && containsEdge( sourceVertex, targetVertex ) ) {
            return false;
        }

        if( !m_allowingLoops && sourceVertex.equals( targetVertex ) ) {
            throw new IllegalArgumentException( LOOPS_NOT_ALLOWED );
        }

        m_edgeSet.add( e );
        m_specifics.addEdgeToTouchingVertices( e );

        return true;
    }


    /**
     * @see Graph#addVertex(Object)
     */
00263     public boolean addVertex( Object v ) {
        if( v == null ) {
            throw new NullPointerException(  );
        }
        else if( containsVertex( v ) ) {
            return false;
        }
        else {
            m_vertexMap.put( v, null ); // add with a lazy edge container entry

            return true;
        }
    }


    /**
     * Returns a shallow copy of this graph instance.  Neither edges nor
     * vertices are cloned.
     *
     * @return a shallow copy of this set.
     *
     * @throws RuntimeException
     *
     * @see java.lang.Object#clone()
     */
00288     public Object clone(  ) {
        try {
            AbstractBaseGraph newGraph = (AbstractBaseGraph) super.clone(  );

            newGraph.m_vertexMap                 = new LinkedHashMap(  );
            newGraph.m_edgeSet                   = new LinkedHashSet(  );
            newGraph.m_factoryEdgeClass          = this.m_factoryEdgeClass;
            newGraph.m_edgeFactory               = this.m_edgeFactory;
            newGraph.m_unmodifiableEdgeSet       = null;
            newGraph.m_unmodifiableVertexSet     = null;

            // NOTE:  it's important for this to happen in an object
            // method so that the new inner class instance gets associated with
            // the right outer class instance
            newGraph.m_specifics = newGraph.createSpecifics(  );

            GraphHelper.addGraph( newGraph, this );

            return newGraph;
        }
         catch( CloneNotSupportedException e ) {
            e.printStackTrace(  );
            throw new RuntimeException(  );
        }
    }


    /**
     * @see Graph#containsEdge(Edge)
     */
00318     public boolean containsEdge( Edge e ) {
        return m_edgeSet.contains( e );
    }


    /**
     * @see Graph#containsVertex(Object)
     */
00326     public boolean containsVertex( Object v ) {
        return m_vertexMap.containsKey( v );
    }


    /**
     * @see org._3pq.jgrapht.UndirectedGraph#degreeOf(java.lang.Object)
     */
00334     public int degreeOf( Object vertex ) {
        return m_specifics.degreeOf( vertex );
    }


    /**
     * @see Graph#edgeSet()
     */
00342     public Set edgeSet(  ) {
        if( m_unmodifiableEdgeSet == null ) {
            m_unmodifiableEdgeSet = Collections.unmodifiableSet( m_edgeSet );
        }

        return m_unmodifiableEdgeSet;
    }


    /**
     * @see Graph#edgesOf(Object)
     */
00354     public List edgesOf( Object vertex ) {
        return m_specifics.edgesOf( vertex );
    }


    /**
     * @see org._3pq.jgrapht.DirectedGraph#inDegreeOf(java.lang.Object)
     */
00362     public int inDegreeOf( Object vertex ) {
        return m_specifics.inDegreeOf( vertex );
    }


    /**
     * @see org._3pq.jgrapht.DirectedGraph#incomingEdgesOf(java.lang.Object)
     */
00370     public List incomingEdgesOf( Object vertex ) {
        return m_specifics.incomingEdgesOf( vertex );
    }


    /**
     * @see org._3pq.jgrapht.DirectedGraph#outDegreeOf(java.lang.Object)
     */
00378     public int outDegreeOf( Object vertex ) {
        return m_specifics.outDegreeOf( vertex );
    }


    /**
     * @see org._3pq.jgrapht.DirectedGraph#outgoingEdgesOf(java.lang.Object)
     */
00386     public List outgoingEdgesOf( Object vertex ) {
        return m_specifics.outgoingEdgesOf( vertex );
    }


    /**
     * @see Graph#removeEdge(Object, Object)
     */
00394     public Edge removeEdge( Object sourceVertex, Object targetVertex ) {
        Edge e = getEdge( sourceVertex, targetVertex );

        if( e != null ) {
            m_specifics.removeEdgeFromTouchingVertices( e );
            m_edgeSet.remove( e );
        }

        return e;
    }


    /**
     * @see Graph#removeEdge(Edge)
     */
00409     public boolean removeEdge( Edge e ) {
        if( containsEdge( e ) ) {
            m_specifics.removeEdgeFromTouchingVertices( e );
            m_edgeSet.remove( e );

            return true;
        }
        else {
            return false;
        }
    }


    /**
     * @see Graph#removeVertex(Object)
     */
00425     public boolean removeVertex( Object v ) {
        if( containsVertex( v ) ) {
            List touchingEdgesList = edgesOf( v );

            // cannot iterate over list - will cause ConcurrentModificationException
            Edge[] touchingEdges = new Edge[ touchingEdgesList.size(  ) ];
            touchingEdgesList.toArray( touchingEdges );

            removeAllEdges( touchingEdges );

            m_vertexMap.remove( v ); // remove the vertex itself

            return true;
        }
        else {
            return false;
        }
    }


    /**
     * @see Graph#vertexSet()
     */
00448     public Set vertexSet(  ) {
        if( m_unmodifiableVertexSet == null ) {
            m_unmodifiableVertexSet =
                Collections.unmodifiableSet( m_vertexMap.keySet(  ) );
        }

        return m_unmodifiableVertexSet;
    }


    private boolean assertCompatibleWithEdgeFactory( Edge e ) {
        if( e == null ) {
            throw new NullPointerException(  );
        }
        else if( !m_factoryEdgeClass.isInstance( e ) ) {
            throw new ClassCastException( "incompatible edge class" );
        }

        return true;
    }


    private Specifics createSpecifics(  ) {
        if( this instanceof DirectedGraph ) {
            return new DirectedSpecifics(  );
        }
        else if( this instanceof UndirectedGraph ) {
            return new UndirectedSpecifics(  );
        }
        else {
            throw new IllegalArgumentException( 
                "must be instance of either DirectedGraph or UndirectedGraph" );
        }
    }

    /**
     * .
     *
     * @author Barak Naveh
     */
00488     private abstract class Specifics implements Serializable {
        /**
         * .
         *
         * @param sourceVertex
         * @param targetVertex
         *
         * @return
         */
        public abstract List getAllEdges( Object sourceVertex,
            Object targetVertex );


        /**
         * .
         *
         * @param sourceVertex
         * @param targetVertex
         *
         * @return
         */
        public abstract Edge getEdge( Object sourceVertex, Object targetVertex );


        /**
         * Adds the specified edge to the edge containers of its source and
         * target vertices.
         *
         * @param e
         */
        public abstract void addEdgeToTouchingVertices( Edge e );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract int degreeOf( Object vertex );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract List edgesOf( Object vertex );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract int inDegreeOf( Object vertex );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract List incomingEdgesOf( Object vertex );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract int outDegreeOf( Object vertex );


        /**
         * .
         *
         * @param vertex
         *
         * @return
         */
        public abstract List outgoingEdgesOf( Object vertex );


        /**
         * Removes the specified edge from the edge containers of its source
         * and target vertices.
         *
         * @param e
         */
        public abstract void removeEdgeFromTouchingVertices( Edge e );
    }


    private static class ArrayListFactory implements EdgeListFactory {
        /**
         * @see EdgeListFactory.createEdgeList
         */
        public List createEdgeList( Object vertex ) {
            // NOTE:  use size 1 to keep memory usage under control
            // for the common case of vertices with low degree
            return new ArrayList( 1 );
        }
    }


    /**
     * A container of for vertex edges.
     * 
     * <p>
     * In this edge container we use array lists to minimize memory toll.
     * However, for high-degree vertices we replace the entire edge container
     * with a direct access subclass (to be implemented).
     * </p>
     *
     * @author Barak Naveh
     */
00614     private static class DirectedEdgeContainer implements Serializable {
        List                   m_incoming;
        List                   m_outgoing;
        private transient List m_unmodifiableIncoming = null;
        private transient List m_unmodifiableOutgoing = null;

        DirectedEdgeContainer( EdgeListFactory edgeListFactory, Object vertex ) {
            m_incoming     = edgeListFactory.createEdgeList( vertex );
            m_outgoing     = edgeListFactory.createEdgeList( vertex );
        }

        /**
         * A lazy build of unmodifiable incoming edge list.
         *
         * @return
         */
00630         public List getUnmodifiableIncomingEdges(  ) {
            if( m_unmodifiableIncoming == null ) {
                m_unmodifiableIncoming =
                    Collections.unmodifiableList( m_incoming );
            }

            return m_unmodifiableIncoming;
        }


        /**
         * A lazy build of unmodifiable outgoing edge list.
         *
         * @return
         */
00645         public List getUnmodifiableOutgoingEdges(  ) {
            if( m_unmodifiableOutgoing == null ) {
                m_unmodifiableOutgoing =
                    Collections.unmodifiableList( m_outgoing );
            }

            return m_unmodifiableOutgoing;
        }


        /**
         * .
         *
         * @param e
         */
00660         public void addIncomingEdge( Edge e ) {
            m_incoming.add( e );
        }


        /**
         * .
         *
         * @param e
         */
00670         public void addOutgoingEdge( Edge e ) {
            m_outgoing.add( e );
        }


        /**
         * .
         *
         * @param e
         */
00680         public void removeIncomingEdge( Edge e ) {
            m_incoming.remove( e );
        }


        /**
         * .
         *
         * @param e
         */
00690         public void removeOutgoingEdge( Edge e ) {
            m_outgoing.remove( e );
        }
    }


    /**
     * .
     *
     * @author Barak Naveh
     */
00701     private class DirectedSpecifics extends Specifics {
        private static final String NOT_IN_DIRECTED_GRAPH =
            "no such operation in a directed graph";

        /**
         * @see Graph#getAllEdges(Object, Object)
         */
00708         public List getAllEdges( Object sourceVertex, Object targetVertex ) {
            List edges = null;

            if( containsVertex( sourceVertex )
                    && containsVertex( targetVertex ) ) {
                edges = new ArrayList(  );

                DirectedEdgeContainer ec = getEdgeContainer( sourceVertex );

                Iterator              iter = ec.m_outgoing.iterator(  );

                while( iter.hasNext(  ) ) {
                    Edge e = (Edge) iter.next(  );

                    if( e.getTarget(  ).equals( targetVertex ) ) {
                        edges.add( e );
                    }
                }
            }

            return edges;
        }


        /**
         * @see Graph#getEdge(Object, Object)
         */
00735         public Edge getEdge( Object sourceVertex, Object targetVertex ) {
            if( containsVertex( sourceVertex )
                    && containsVertex( targetVertex ) ) {
                DirectedEdgeContainer ec = getEdgeContainer( sourceVertex );

                Iterator              iter = ec.m_outgoing.iterator(  );

                while( iter.hasNext(  ) ) {
                    Edge e = (Edge) iter.next(  );

                    if( e.getTarget(  ).equals( targetVertex ) ) {
                        return e;
                    }
                }
            }

            return null;
        }


        /**
         * @see AbstractBaseGraph#addEdgeToTouchingVertices(Edge)
         */
00758         public void addEdgeToTouchingVertices( Edge e ) {
            Object source = e.getSource(  );
            Object target = e.getTarget(  );

            getEdgeContainer( source ).addOutgoingEdge( e );
            getEdgeContainer( target ).addIncomingEdge( e );
        }


        /**
         * @see UndirectedGraph#degreeOf(Object)
         */
00770         public int degreeOf( Object vertex ) {
            throw new UnsupportedOperationException( NOT_IN_DIRECTED_GRAPH );
        }


        /**
         * @see Graph#edgesOf(Object)
         */
00778         public List edgesOf( Object vertex ) {
            ArrayList inAndOut =
                new ArrayList( getEdgeContainer( vertex ).m_incoming );
            inAndOut.addAll( getEdgeContainer( vertex ).m_outgoing );

            // we have two copies for each self-loop - remove one of them.
            if( m_allowingLoops ) {
                List loops = getAllEdges( vertex, vertex );

                for( int i = 0; i < inAndOut.size(  ); ) {
                    Object e = inAndOut.get( i );

                    if( loops.contains( e ) ) {
                        inAndOut.remove( i );
                        loops.remove( e ); // so we remove it only once
                    }
                    else {
                        i++;
                    }
                }
            }

            return inAndOut;
        }


        /**
         * @see DirectedGraph#inDegree(Object)
         */
00807         public int inDegreeOf( Object vertex ) {
            return getEdgeContainer( vertex ).m_incoming.size(  );
        }


        /**
         * @see DirectedGraph#incomingEdges(Object)
         */
00815         public List incomingEdgesOf( Object vertex ) {
            return getEdgeContainer( vertex ).getUnmodifiableIncomingEdges(  );
        }


        /**
         * @see DirectedGraph#outDegree(Object)
         */
00823         public int outDegreeOf( Object vertex ) {
            return getEdgeContainer( vertex ).m_outgoing.size(  );
        }


        /**
         * @see DirectedGraph#outgoingEdges(Object)
         */
00831         public List outgoingEdgesOf( Object vertex ) {
            return getEdgeContainer( vertex ).getUnmodifiableOutgoingEdges(  );
        }


        /**
         * @see AbstractBaseGraph#removeEdgeFromTouchingVertices(Edge)
         */
00839         public void removeEdgeFromTouchingVertices( Edge e ) {
            Object source = e.getSource(  );
            Object target = e.getTarget(  );

            getEdgeContainer( source ).removeOutgoingEdge( e );
            getEdgeContainer( target ).removeIncomingEdge( e );
        }


        /**
         * A lazy build of edge container for specified vertex.
         *
         * @param vertex a vertex in this graph.
         *
         * @return EdgeContainer
         */
00855         private DirectedEdgeContainer getEdgeContainer( Object vertex ) {
            assertVertexExist( vertex );

            DirectedEdgeContainer ec =
                (DirectedEdgeContainer) m_vertexMap.get( vertex );

            if( ec == null ) {
                ec = new DirectedEdgeContainer( m_edgeListFactory, vertex );
                m_vertexMap.put( vertex, ec );
            }

            return ec;
        }
    }


    /**
     * A container of for vertex edges.
     * 
     * <p>
     * In this edge container we use array lists to minimize memory toll.
     * However, for high-degree vertices we replace the entire edge container
     * with a direct access subclass (to be implemented).
     * </p>
     *
     * @author Barak Naveh
     */
00882     private static class UndirectedEdgeContainer implements Serializable {
        List                   m_vertexEdges;
        private transient List m_unmodifiableVertexEdges = null;

        UndirectedEdgeContainer( EdgeListFactory edgeListFactory, Object vertex ) {
            m_vertexEdges = edgeListFactory.createEdgeList( vertex );
        }

        /**
         * A lazy build of unmodifiable list of vertex edges
         *
         * @return
         */
00895         public List getUnmodifiableVertexEdges(  ) {
            if( m_unmodifiableVertexEdges == null ) {
                m_unmodifiableVertexEdges =
                    Collections.unmodifiableList( m_vertexEdges );
            }

            return m_unmodifiableVertexEdges;
        }


        /**
         * .
         *
         * @param e
         */
00910         public void addEdge( Edge e ) {
            m_vertexEdges.add( e );
        }


        /**
         * .
         *
         * @return
         */
00920         public int edgeCount(  ) {
            return m_vertexEdges.size(  );
        }


        /**
         * .
         *
         * @param e
         */
00930         public void removeEdge( Edge e ) {
            m_vertexEdges.remove( e );
        }
    }


    /**
     * .
     *
     * @author Barak Naveh
     */
00941     private class UndirectedSpecifics extends Specifics {
        private static final String NOT_IN_UNDIRECTED_GRAPH =
            "no such operation in an undirected graph";

        /**
         * @see Graph#getAllEdges(Object, Object)
         */
00948         public List getAllEdges( Object sourceVertex, Object targetVertex ) {
            List edges = null;

            if( containsVertex( sourceVertex )
                    && containsVertex( targetVertex ) ) {
                edges = new ArrayList(  );

                Iterator iter =
                    getEdgeContainer( sourceVertex ).m_vertexEdges.iterator(  );

                while( iter.hasNext(  ) ) {
                    Edge    e = (Edge) iter.next(  );

                    boolean equalStraight =
                        sourceVertex.equals( e.getSource(  ) )
                        && targetVertex.equals( e.getTarget(  ) );

                    boolean equalInverted =
                        sourceVertex.equals( e.getTarget(  ) )
                        && targetVertex.equals( e.getSource(  ) );

                    if( equalStraight || equalInverted ) {
                        edges.add( e );
                    }
                }
            }

            return edges;
        }


        /**
         * @see Graph#getEdge(Object, Object)
         */
00982         public Edge getEdge( Object sourceVertex, Object targetVertex ) {
            if( containsVertex( sourceVertex )
                    && containsVertex( targetVertex ) ) {
                Iterator iter =
                    getEdgeContainer( sourceVertex ).m_vertexEdges.iterator(  );

                while( iter.hasNext(  ) ) {
                    Edge    e = (Edge) iter.next(  );

                    boolean equalStraight =
                        sourceVertex.equals( e.getSource(  ) )
                        && targetVertex.equals( e.getTarget(  ) );

                    boolean equalInverted =
                        sourceVertex.equals( e.getTarget(  ) )
                        && targetVertex.equals( e.getSource(  ) );

                    if( equalStraight || equalInverted ) {
                        return e;
                    }
                }
            }

            return null;
        }


        /**
         * @see AbstractBaseGraph#addEdgeToTouchingVertices(Edge)
         */
01012         public void addEdgeToTouchingVertices( Edge e ) {
            Object source = e.getSource(  );
            Object target = e.getTarget(  );

            getEdgeContainer( source ).addEdge( e );

            if( source != target ) {
                getEdgeContainer( target ).addEdge( e );
            }
        }


        /**
         * @see UndirectedGraph#degree(Object)
         */
01027         public int degreeOf( Object vertex ) {
            if( m_allowingLoops ) { // then we must count, and add loops twice

                int  degree = 0;
                List edges = getEdgeContainer( vertex ).m_vertexEdges;

                for( Iterator iter = edges.iterator(  ); iter.hasNext(  ); ) {
                    Edge e = (Edge) iter.next(  );

                    if( e.getSource(  ).equals( e.getTarget(  ) ) ) {
                        degree += 2;
                    }
                    else {
                        degree += 1;
                    }
                }

                return degree;
            }
            else {
                return getEdgeContainer( vertex ).edgeCount(  );
            }
        }


        /**
         * @see Graph#edges(Object)
         */
01055         public List edgesOf( Object vertex ) {
            return getEdgeContainer( vertex ).getUnmodifiableVertexEdges(  );
        }


        /**
         * @see DirectedGraph#inDegreeOf(Object)
         */
01063         public int inDegreeOf( Object vertex ) {
            throw new UnsupportedOperationException( NOT_IN_UNDIRECTED_GRAPH );
        }


        /**
         * @see DirectedGraph#incomingEdgesOf(Object)
         */
01071         public List incomingEdgesOf( Object vertex ) {
            throw new UnsupportedOperationException( NOT_IN_UNDIRECTED_GRAPH );
        }


        /**
         * @see DirectedGraph#outDegreeOf(Object)
         */
01079         public int outDegreeOf( Object vertex ) {
            throw new UnsupportedOperationException( NOT_IN_UNDIRECTED_GRAPH );
        }


        /**
         * @see DirectedGraph#outgoingEdgesOf(Object)
         */
01087         public List outgoingEdgesOf( Object vertex ) {
            throw new UnsupportedOperationException( NOT_IN_UNDIRECTED_GRAPH );
        }


        /**
         * @see AbstractBaseGraph#removeEdgeFromTouchingVertices(Edge)
         */
01095         public void removeEdgeFromTouchingVertices( Edge e ) {
            Object source = e.getSource(  );
            Object target = e.getTarget(  );

            getEdgeContainer( source ).removeEdge( e );

            if( source != target ) {
                getEdgeContainer( target ).removeEdge( e );
            }
        }


        /**
         * A lazy build of edge container for specified vertex.
         *
         * @param vertex a vertex in this graph.
         *
         * @return EdgeContainer
         */
01114         private UndirectedEdgeContainer getEdgeContainer( Object vertex ) {
            assertVertexExist( vertex );

            UndirectedEdgeContainer ec =
                (UndirectedEdgeContainer) m_vertexMap.get( vertex );

            if( ec == null ) {
                ec = new UndirectedEdgeContainer( m_edgeListFactory, vertex );
                m_vertexMap.put( vertex, ec );
            }

            return ec;
        }
    }
}

Generated by  Doxygen 1.6.0   Back to index