/* ==========================================
* JGraphT : a free Java graph-theory library
* ==========================================
*
* Project Info: http://jgrapht.sourceforge.net/
* Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
*
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* This program and the accompanying materials are dual-licensed under
* either
*
* (a) the terms of the GNU Lesser General Public License version 2.1
* as published by the Free Software Foundation, or (at your option) any
* later version.
*
* or (per the licensee's choosing)
*
* (b) the terms of the Eclipse Public License v1.0 as published by
* the Eclipse Foundation.
*/
/* ----------------------
* TraversalListener.java
* ----------------------
* (C) Copyright 2003-2008, by Barak Naveh and Contributors.
*
* Original Author: Barak Naveh
* Contributor(s): Christian Hammer
*
* $Id$
*
* Changes
* -------
* 24-Jul-2003 : Initial revision (BN);
* 11-Aug-2003 : Adaptation to new event model (BN);
* 11-Mar-2004 : Made generic (CH);
*
*/
package org.jgrapht.event;
/**
* A listener on graph iterator or on a graph traverser.
*
* @author Barak Naveh
* @since Jul 19, 2003
*/
public interface TraversalListener<V, E>
{
/**
* Called to inform listeners that the traversal of the current connected
* component has finished.
*
* @param e the traversal event.
*/
public void connectedComponentFinished(
ConnectedComponentTraversalEvent e);
/**
* Called to inform listeners that a traversal of a new connected component
* has started.
*
* @param e the traversal event.
*/
public void connectedComponentStarted(ConnectedComponentTraversalEvent e);
/**
* Called to inform the listener that the specified edge have been visited
* during the graph traversal. Depending on the traversal algorithm, edge
* might be visited more than once.
*
* @param e the edge traversal event.
*/
public void edgeTraversed(EdgeTraversalEvent<V, E> e);
/**
* Called to inform the listener that the specified vertex have been visited
* during the graph traversal. Depending on the traversal algorithm, vertex
* might be visited more than once.
*
* @param e the vertex traversal event.
*/
public void vertexTraversed(VertexTraversalEvent<V> e);
/**
* Called to inform the listener that the specified vertex have been
* finished during the graph traversal. Exact meaning of "finish" is
* algorithm-dependent; e.g. for DFS, it means that all vertices reachable
* via the vertex have been visited as well.
*
* @param e the vertex traversal event.
*/
public void vertexFinished(VertexTraversalEvent<V> e);
}
// End TraversalListener.java