Nodes as an array nodi of structs
Adjacencies and distances in 
      ArrayList[] archi = new ArrayList[MAXNODI];
      ArrayList[] d     = new ArrayList[MAXNODI];




      void Dijkstra(int s)
      {  int i,j,u=-1,Q,minQ;
         bool[] S = new bool[n];

         for(i=0;i<n;i++)
         {  nodi[i].d = INF;
            nodi[i].p = INF;
            S[i]=false;      // ---- S = \emptyset
         }
         nodi[s].d = 0;
         nodi[s].p = s;
	      
         Q = n;
         while (Q != 0)
         {  // --------------------- u = Extract-Min(Q)
            minQ=INF;
            for(i=0;i<n;i++)
               if(!S[i] && nodi[i].d<minQ)
               {  minQ=nodi[i].d;
                  u=i;
               }
            // ---------------------- S = S \bigcup {u}
            S[u]=true;
            Q--;

            for(i=0;i<archi[u].Count;i++)
            {  j=(int) archi[u][i];
               if (nodi[j].d > nodi[u].d + (int)d[u][i])
               {  nodi[j].d = nodi[u].d + (int)d[u][i];
                  nodi[j].p = u;
               }
            }
         }
      }