fibonaccinode.java

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

public class FibonacciNode {
//fibonacci node structure	
    int dist;//distance from the source node
    int count; //the No. of node
    FibonacciNode   FirstChild;
    FibonacciNode   LeftSibling;
    FibonacciNode   RightSibling;
    FibonacciNode   Parent;
    int degree;
    public boolean ChildCut;
	
	public FibonacciNode(){}
	public FibonacciNode(int d,int n){
		dist=d;
		count=n;
		degree=0;
		FirstChild=null;
		LeftSibling=null;
		RightSibling=null;
		Parent=null;
	}


}