org.jgrapht.traverse.GraphIterator Maven / Gradle / Ivy
Go to download
JGraphT is a free Java graph library
that provides mathematical graph-theory objects and algorithms
The newest version!
/* ==========================================
* JGraphT : a free Java graph-theory library
* ==========================================
*
* Project Info: http://jgrapht.sourceforge.net/
* Project Creator: Barak Naveh ([email protected])
*
* (C) Copyright 2003-2007, 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.
*/
/* ------------------
* GraphIterator.java
* ------------------
* (C) Copyright 2003-2007, by Barak Naveh and Contributors.
*
* Original Author: Barak Naveh
* Contributor(s): Christian Hammer
*
* $Id: GraphIterator.java 568 2007-09-30 00:12:18Z perfecthash $
*
* Changes
* -------
* 31-Jul-2003 : Initial revision (BN);
* 11-Aug-2003 : Adaptation to new event model (BN);
* 04-May-2004 : Made generic (CH)
*
*/
package org.jgrapht.traverse;
import java.util.*;
import org.jgrapht.event.*;
/**
* A graph iterator.
*
* @author Barak Naveh
* @since Jul 31, 2003
*/
public interface GraphIterator
extends Iterator
{
//~ Methods ----------------------------------------------------------------
/**
* Test whether this iterator is set to traverse the grpah across connected
* components.
*
* @return true if traverses across connected components,
* otherwise false.
*/
public boolean isCrossComponentTraversal();
/**
* Sets a value the reuseEvents flag. If the
* reuseEvents flag is set to true this class will reuse
* previously fired events and will not create a new object for each event.
* This option increases performance but should be used with care,
* especially in multithreaded environment.
*
* @param reuseEvents whether to reuse previously fired event objects
* instead of creating a new event object for each event.
*/
public void setReuseEvents(boolean reuseEvents);
/**
* Tests whether the reuseEvents flag is set. If the flag is
* set to true this class will reuse previously fired events
* and will not create a new object for each event. This option increases
* performance but should be used with care, especially in multithreaded
* environment.
*
* @return the value of the reuseEvents flag.
*/
public boolean isReuseEvents();
/**
* Adds the specified traversal listener to this iterator.
*
* @param l the traversal listener to be added.
*/
public void addTraversalListener(TraversalListener l);
/**
* Unsupported.
*
* @throws UnsupportedOperationException
*/
public void remove();
/**
* Removes the specified traversal listener from this iterator.
*
* @param l the traversal listener to be removed.
*/
public void removeTraversalListener(TraversalListener l);
}
// End GraphIterator.java