node.java

使用Java实现的Graph的迭代加深的深度优先搜索

/**
 * 
 */
package digraph;

import java.util.List;

/**
 * @author zhangli
 *
 */
public interface Node {
	public List getSuccessors();	
	public List getPredecessors();
	
	public void addPredecessors(Node node);

	public void addSuccessor(Node node);
	
	public String getName();
	
	public int getDistance();

	public void setDistance(int dist);
	
	public List<Node> getPaths();
	
	public boolean isVisited();
	public void setVisited(boolean visited);

}