adjacencyiterator.java

来自「发布/订阅系统路由重配算法,可应用于ad hoc环境」· Java 代码 · 共 47 行

/*
 * project: RebecaSim
 * package: graph
 * file:    AdjacencyIterator.java
 * version: 0.1
 * date:    05.04.2005
 * 
 * This software is part of the diploma thesis "Ein adaptives Brokernetz 
 * für Publish/Subscribe Systeme".
 */
package graph;

import util.ResetableIterator;

/**
 * The <code>ResetableIterator</code> interface is extended to
 * serve as an iterator on an adjacency list, which is used to
 * store the neighbourhood of a vertex in a graph. <p> 
 * 
 * The <code>next</code> method always returns either an adjacent edge
 * or vertex as specified at iterator construction.
 * Use the newly introduced <code>edge</code> and <code>vertex</code>
 * methods to get the belonging edge or vertex, respectively, to the
 * last returned element.  
 *
 * @version 0.1 05.04.2005
 * @author  Helge Parzyjegla
 */
public interface AdjacencyIterator extends ResetableIterator {

	/**
	 * Gets the edge belonging to the last element returned by 
	 * the iterators <code>next</code> method.
	 *  
	 * @return the belonging edge.
	 */
	Edge edge();
	
	/**
	 * Gets the vertex belonging to the last element returned by 
	 * the iterators <code>next</code> method.
	 *  
	 * @return the belonging vertex.
	 */
	Vertex vertex();
}