linklistnode.java

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

public class LinkListNode {
	// link list data structure
	private int weight;
	private int index;
	private LinkListNode nextlink;
	
	public LinkListNode(){
		weight = 0;
		index = 0;
		nextlink = null;
	}
	
	public LinkListNode(int w, int idx, LinkListNode nextvalue){
		weight = w;
		index = idx;
		nextlink = nextvalue;
	}
	
	public void setWeight(int w){
		weight = w;
	}
	
	public void setIndex(int idx){
		index = idx;
	}
	
	public void setLink(LinkListNode newLink){
		nextlink = newLink;
	}
	
	public int getWeights(){
		return weight;
	}
	
	public int getIndex(){
		return index;
	}
	
	public LinkListNode getLink(){
		return nextlink;
	}
}