node.java

检索无向图中的最短路径

package lab;
import java.util.*;

public class Node {
	private String name;
	private LinkedList p;//previous
	private LinkedList n;//next
	private LinkedList pa;//path
	private LinkedList reserve;//the next nodes remain
	private int Layer = -1;
	
	public Node(String name){
		this.name = name;
		p = new LinkedList();
		n = new LinkedList();
		pa = new LinkedList();
		reserve= new LinkedList();
	}
	
	public void setName(String name){
		this.name = name;
	}
	
	public void addPrev(String name){
		p.add(name);
	}
	
	public void addNext(String name){
		n.add(name);
	}
	
	public void addPaths(String path){
		pa.add(path);
	}
	
	public void clearPaths(){
		int len = pa.size();
		for(int i=0;i<len;i++){
			pa.removeFirst();
		}
	}
	public void clearReserve(){
		int len = reserve.size();
		for(int i=0;i<len;i++){
			reserve.removeFirst();
		}
	}
	
	public void printPrev(){
		int i = p.size();
		String rt="";
		for(int j=0;j<i;j++){
			rt += p.get(j).toString()+" ";
		}
		System.out.println(rt);
	}
	
	public void printNext(){
		int i = n.size();
		String rt = "";
		for(int j=0;j<i;j++){
			rt += n.get(j).toString()+" ";
		}
		System.out.println(rt);
	}
	
	public String getName(){
		return name;
	}
	
	public void setLayer(int level){
		Layer = level;
	}
	
	public int getLayer(){
		return Layer;
	}
	
	public LinkedList getPrev(){
		return p;
	}
	
	public LinkedList getNext(){
		return n;
	}
	
	public LinkedList getPaths(){
		return pa;
	}
	public void reserve(){  
		reserve=n;
	}
	public LinkedList getReserve(){
		return reserve;
	}
	public String popReserve(){
		return (String)reserve.removeFirst();
	}
	public static boolean hasEdge(Node A, Node B){
		boolean rt = false;
		LinkedList l = A.getNext();
		int len = l.size();
		for(int i=0;i<len;i++){
			if((l.get(i)).toString().equals(B.getName())){
				rt = true;
				break;
			}
		}
		return rt;
	}
}