Dijkstra

package fred.ubs.test.src.algo;

public class DijkstraTest {
    public static void main(String[] args) {
        int n = 8;
        Node[] nodes = new Node[n];
        setupNodes(nodes);
        float[] d = new float[n];
        int[] p = new int[n];
        
        dijkstra(nodes, n, 0, d, p);
        
        for(int i = 0; i < n; i++){
            System.out.print(d[i] + " ");
        }

        for(int i = 0; i < n; i++){
            System.out.print(p[i] + " ");
        }
    }
    
    public static void dijkstra(Node[] nodes, int n, int u, float[] d, int[] p){
        float temp;
        int i, j, t;
        boolean[] s = new boolean[n];
        Node pNode;
        
        for(i = 0; i <n; i++){
            d[i] = Float.MAX_VALUE;
            s[i] =false;
            p[i] = -1;
        }
        
        if(null == (pNode = nodes[u].next)){
            return;
        }
        
        while(pNode != null){
            d[pNode.v_num] = pNode.len;
            p[pNode.v_num] = u;
            pNode = pNode.next;
        }
        
        d[u] = 0;
        s[u] = true;
        
        for(i = 1; i < n; i++){
            temp = Float.MAX_VALUE;
            t = u;
            for(j = 0; j <n; j++){
                if(!s[j] && d[j] < temp){
                    t = j;
                    temp = d[j];
                }
            }
            if(t == u){
                break;
            }
            s[t] = true;
            pNode = nodes[t].next;
            while(pNode != null){
                if(!s[pNode.v_num] && d[pNode.v_num] > d[t] + pNode.len){
                    d[pNode.v_num] = d[t] + pNode.len;
                    p[pNode.v_num] = t;
                }
                
                pNode = pNode.next;
            }
        }
    }

    private static void setupNodes(Node[] nodes){
        Node nodeA = new Node(0, 0, new Node(1, 1, new Node(4, 2, new Node(4, 3, null))));
        Node nodeB = new Node(0, 1, new Node(2, 2, new Node(9, 4, null)));
        Node nodeC = new Node(0, 2, new Node(3, 3, new Node(6, 4, new Node(3, 5, new Node(4, 6, null)))));
        Node nodeD = new Node(0, 3, new Node(7, 6, null));
        Node nodeE = new Node(0, 4, new Node(1, 7, null));
        Node nodeF = new Node(0, 5, new Node(2, 4, new Node(5, 7, null)));
        Node nodeG = new Node(0, 6, new Node(1, 5, new Node(3, 7, null)));
        Node nodeH = new Node(0, 7, null);
        
        nodes[0] = nodeA;
        nodes[1] = nodeB;
        nodes[2] = nodeC;
        nodes[3] = nodeD;
        nodes[4] = nodeE;
        nodes[5] = nodeF;
        nodes[6] = nodeG;
        nodes[7] = nodeH;
    }

    static class Node{

        public Node(float len, int v_num, Node next) {
            this.v_num = v_num;
            this.len = len;
            this.next = next;
        }

        public int v_num;
        public float len;
        public Node next;
    }
}