dinode.java

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

/**
 * 
 */
package digraph;

import java.util.*;

/**
 * @author zhangli
 *
 */
public class DiNode implements Node {
	
	private int dist;
	private List<Node> successor;
	private List<Node> predecessor;
	private String nodeName;
	private List<Node> paths;
	private boolean visited;


	public DiNode(String nodeName)
	{
		successor = new ArrayList<Node>();
		predecessor = new ArrayList<Node>();
		paths = new ArrayList<Node>();
		this.nodeName = nodeName;
	}
	
	public void addPredecessors(Node node) {
		// TODO Auto-generated method stub
		predecessor.add(node);
	}

	public void addSuccessor(Node node) {
		// TODO Auto-generated method stub
		successor.add(node);
	}

	public List getPredecessors() {
		// TODO Auto-generated method stub
		return predecessor;
	}

	public List getSuccessors() {
		// TODO Auto-generated method stub
		return successor;
	}

	public String getName() {
		// TODO Auto-generated method stub
		return nodeName;
	}	
	
	public int getDistance() {
		return dist;
	}

	public void setDistance(int dist) {
		this.dist = dist;
	}

	public List<Node> getPaths() {
		return paths;
	}

	public boolean isVisited() {
		return visited;
	}

	public void setVisited(boolean visited) {
		this.visited = visited;
	}
}