/**
 * @author Aditya Madan
 *
 */
public class PriorityNode<T> {
	private T dataItem;
	private PriorityNode<T> next;
	private PriorityNode<T> previous;
	private double priority;

	/**
	 *
	 */
	public PriorityNode(T data, double prio) {
		next = previous = null;
		dataItem = data;
		priority = prio;
	}
	public PriorityNode() {
		next = previous = null;
		dataItem = null;
		priority = 0;
	}
	public double getPriority() {
		return priority;
	}
	public T getDataItem() {
		return dataItem;
	}
	public PriorityNode<T> getNext() {
		return next;
	}
	public PriorityNode<T> getPrevious() {
		return previous;
	}
	public void setDataItem(T data) {
		dataItem = data;
	}
	public void setNext(PriorityNode<T> node) {
		next = node;
	}
	public void setPrevious(PriorityNode<T> node) {
		previous = node;
	}
	public void setPriority(double prio) {
		priority = prio;
	}

}