graph.java

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

/**
 * 
 */
package digraph;

import java.util.List;

/**
 * @author zhangli
 *
 */
public interface Graph { //graph class ADT

	public int edgeNumber();// number of edges
	
	public int nodeNumber(); //number of nodes
	
	public void addEdge (Node node1, Node node2);// add edge
	public Node getNode (String nodeName);// get node, return null if cannot find.
	public Node addNode (String nodeName);
	
	public boolean hasEdge (Node node1, Node node2); // true if this is an edge
	public List getSuccessors(Node node);	
	public List getPredecessors(Node node);
	public List getShortestPath(Node src,Node dest);

}