图的创建、遍历及应用.docVIP

结点类 package ch06; public class Node { private Object data; // 存放结点值 private Node next; // 后继结点的引用 // 无参数时的构造函数 public Node() { this(null, null); } //带一个参数时的构造函数 public Node(Object data) { // 构造值为data的结点 this(data, null); } //带两个参数时的构造函数 public Node(Object data, Node next) { this.data = data; this.next = next; } public Object getData() { return data; } public void setData(Object data) { this.data = data; } public Node getNext() { return next; } public void setNext(Node next) { this.next = next; } } 栈的抽象接口类 package ch06; public interface IStack { public void clear(); public boolean isEmpty(); public int length(); public Object peek(); public void push(Object x) throws Exception; public Object pop(); } 链栈类 package ch06; import ch06.Node; public class LinkStack implements IStack{ private Node top; //栈顶元素的应用 //将栈置空 public void clear(){ top=null; } //判断栈是否为空 public boolean isEmpty(){ return top == null; } //求链栈的长度 public int length(){ Node p = top; //初始化，p指向栈顶元素，length为计数器 int length = 0; while (p!=null){ //从栈顶元素开始向后查找，直到p指向空 p=p.getNext(); // p指向后继结点 ++length; //长度增加1 } return length; } //取栈顶元素并返回其值 public Object peek(){ if(!isEmpty()) //栈非空 return top.getData(); //返回栈顶元素的值 else return null; } //入栈 public void push(Object x){ Node p = new Node(x); //构造一个新结点 p.setNext(top); top = p; //新结点成为当前的首结点 } //出栈 public Object pop(){ if(isEmpty()){ return null; } else{ Node p = top; //p指向被删除的结点（栈顶结点） top = top.getNext(); //修改链指针，使栈顶结点从链栈中移去 return p.getData(); //返回栈顶结点的数据域的值 } } //输出栈中所有数据元素（从栈顶元素到栈底元素） public void display(){ Node p = top; //初始化，p指向栈顶元素 while (p!= null){ /