listedges.java

Dijkstra algorithm in Java.

/*
 * ListEdges.java
 *
 * Created on May 29, 2007, 11:00 PM
 *
 * To change this template, choose Tools | Template Manager
 * and open the template in the editor.
 */

package termproject_dijkstra;

public class  ListEdges 
{
    ListEdgesElement head;
    ListEdgesElement travPointer;        // For traversing list
    
    /** Creates a new instance of  ListEdges */
    public ListEdges() 
    {
        head = null;
      //  tail = null;
        travPointer = null;
    }
    
    public void PushByWeight(Node node, int iWeight)
    {
        // Our first time :)
        if (head==null)
        {
            head = new ListEdgesElement(node,iWeight);
        }
        else
            head.PushByWeight(node,iWeight);
        
    }
    
   
    public void InitTraversing()
    {
        travPointer = head;
    }

    public ListEdgesElement GetAndMove()
    {
        ListEdgesElement retVal;
        
        if (travPointer != null)
        {
            retVal = travPointer;
            travPointer = travPointer.next;
        }
        else
            retVal = null;
      
        
        return retVal;
    }
    
    public void ClearList()
    {
        head = null;       
    }
    
    public boolean IsEmpty()
    {
        return (head == null);
    }
    
}