Java

public ArrayList <Integer> dijkstra (int start, int end) // start = 0 & end = 999
 {
   int N = adj.length;  
   HashMap <Integer,Double> Q = new HashMap <Integer,Double>();  // key,value

 ArrayList <Integer> [] paths = new ArrayList [N];   // paths[] 1000
 //System.out.println( "paths.Length" + paths.length); 

 for (int i=0;i<N;i++) // end = 999
 { 
    Q.put(i,Double.POSITIVE_INFINITY); // blank i = 0 to 999(keys/vertex)
   //System.out.println("Q @ [0]" +Q.get(999));

    paths[i]=new ArrayList <Integer>();

    paths[i] = new ArrayList<Integer>(start); // blank  distances
    
 } 
 
  HashSet <Integer> S= new HashSet();  // contains unique elements
  S.add(start); // blank 
  Q.put(start,Q.get(start));  //blank 
  

  while (!Q.isEmpty())
 {
  int v = findSmallest(Q);  // blank
  //System.out.println("key of Q " + v)
  
  if (v==end && Q.get(v)!= Double.POSITIVE_INFINITY)  // blank Q ! map to v
  return paths[end]; // blank
  
  double w = Q.get(v); // blank

  S.add(v); // blank

 for(int u: neighbours(v))
  if (!S.contains(u))
 {
  double w1= adj[u][v] + w; // adj contains all the weigths of the graph
 
  
  if (w1 < Q.get(u))
  {
   Q.put(u,w1);
   paths[u]= addToEnd(v,paths[u]);
  }
 }
 Q.remove(v);
 }
  return new ArrayList <Integer> ();
 }