node.java

检索无向图中的最短路径

package lab2;
import java.util.*;
/*
 * Created on 2007-11-5
 * @author SongYingying  [e-mail]
 */

public class Node {
	private String name;
	private LinkedList parent;
	private int layer;
	public boolean read;
	public Node(String s){
		name=s;
		parent=new LinkedList();
		//read=false;
	}
	//public void setRead(boolean t){
	//	read=t;
	//}
	//public boolean getRead(){
	//	return read;
	//}
	public void setName(String s){
		name=s;
	}
	public String getName(){
		return name;
	}
	public void addParent(Node s){
		parent.addLast(s);
	}
	public void setParent(LinkedList p){
		parent=p;
	}
	public void appendParent(LinkedList p){
		parent.addAll(p);
	}
	public LinkedList getParent(){
		return parent;
	}
	public void setLayer(int i){
		layer=i;
	}
	public int getLayer(){
		return layer;
	}
}