title: Dijkstra algorithm for 3D array in Java
body: <p>I made <strong>three-dimensional array</strong> and I want to search the <strong>shortest way from point y to point x.</strong> I don't know what i should use algorithm (Dijkstra or A*). 
  Move can be - up down left right</p>
  
  <pre><code>public class Test {
      public static void main(String[] args) {
          String[][][] Station = new String[5][5][5];
          String[] p = {"I","II","III","IV","V"};
          String[] s = {"a","b","c","d","e"};
          String[] po = {"1","2","3","4","5"};
  
          fillArray(Station,p,s,po);
  
          String x = Station[3][0][2];
          String y = Station[3][0][2];
      }
  
      static void fillArray(String[][][] Station, String[] p,String[] s,String[] po) {
          for (int i = 0; i &lt; 5; i++) {
              for (int k = 0; k &lt; 5; k++) {
                  for (int g = 0; g &lt; 5; g++) {
                      Station[i][k][g] = p[i];
                      Station[i][k][g] += s[k];
                      Station[i][k][g] += po[g];
                  }
              }
          }
      }
  }
  </code></pre>
  
  <p>Summarizing I want to print in a console the shortest way(eg. IIIa2,IIa2)</p>