www.pudn.com > campusleader.rar > VertexInterface.java, change:2012-01-04,size:865b


package GraphPackage; 
 
import java.util.Iterator; 
 
public interface VertexInterface <T>{ 
	public T getLabel(); 
	public void visit(); 
	public void unVisit(); 
	public boolean isVisited(); 
	public boolean connect(VertexInterface<T> endVertex,double edgeWeight,int edgeFlag); 
	public boolean connect(VertexInterface<T>endVertex); 
	public Iterator<VertexInterface<T>>getNeighborIterator(); 
	public Iterator <Double> getWeightIterator(); 
	public boolean hasNeighbor(); 
	public VertexInterface<T>getUnvisitedNeighbor(); 
	public void setPredecessor(VertexInterface<T> predecessor); 
	public VertexInterface<T> getPredecessor(); 
	public boolean hasPredecessor(); 
	public void setCost(double newCost); 
	public double getCost(); 
	public int getNeighborFlag(VertexInterface<T> endVertex); 
	public double getNeighborWeight(VertexInterface<T> endVertex); 
}