pointertoheap.java

This code implements the shortest path algorithm via the simple scheme and fibonacci heap data struc

public class PointerToHeap {
	// pointer from a fibonacci node to a distance value of the graph
	private int dist;
	private FibonacciNode Pointer;
	
	public PointerToHeap(){
		this.dist=0;
		this.Pointer=null;
	}
	
	public PointerToHeap(int d,FibonacciNode P){
		dist=d;
		Pointer=P;
	}
	public int getDist(){
		return this.dist;
	}
	
	public FibonacciNode getPointer(){
		return this.Pointer;
	}
	
	public void setDist(int dist){
		this.dist=dist;
	}
	public void setPointer(FibonacciNode Pointer){
		this.Pointer=Pointer;
	}
}