listedgeselement.java

Dijkstra algorithm in Java.

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

package termproject_dijkstra;

/**
 *
 * @author Peto
 */
public class ListEdgesElement 
{
    Node m_pNode;
    int  m_iWeight;        // Edge weight
    ListEdgesElement next;  
    
    /** Creates a new instance of ListElement */
    public ListEdgesElement(Node node,int iWeight) 
    {
        m_pNode = node;
        m_iWeight = Math.max(0,iWeight);
        next = null;
    }
    
    public int GetWeight()
    {
        return m_iWeight;
    }
    
    public Node GetNode()
    {
        return m_pNode;
    }
    
    // Sorted by weight ascendingly, allow same nodes with different weights
    public void PushByWeight(Node node, int iWeight)
    {
        if (iWeight < m_iWeight)
        {
            ListEdgesElement temp = new ListEdgesElement(m_pNode,m_iWeight);
            m_pNode = node;
            m_iWeight = iWeight;
            temp.next = next;
           // next.GetNode().PushNeighbor(m_pNode,iWeight);
        }
        else if (iWeight == m_iWeight)
        {
            if (node != m_pNode)
            {
                ListEdgesElement temp = new ListEdgesElement(m_pNode,m_iWeight);
                m_pNode = node;
                m_iWeight = iWeight;
                temp.next = next;
                next = temp;  
                //next.GetNode().PushNeighbor(m_pNode,iWeight);
            }
        }
        else if (next!=null)
            next.PushByWeight(node,iWeight);
        else
        {
            next = new ListEdgesElement(node,iWeight);
           // next.GetNode().PushNeighbor(m_pNode,iWeight);
        }
     }
    
    
}