Dijkstra with out arrayList

src/Task9.java

@@ -19,6 +19,7 @@ public class Task9 {
     assert g != null;
     g.loadEdges("kanter.txt");
     int startNumber = 0;
+    Dijkstra.getShortestPath(g,startNumber,3);
     /*List<Edge> edges = Dijkstra.getShortestPath(g,startNumber,3);
     Node node = g.getNode(startNumber);
     System.out.println(node.getLatitude() + "," +  node.getLongitude());
@@ -232,7 +233,7 @@ class Graph{
 
 
 class Dijkstra{
-  public static List<Edge> getShortestPath(Graph graph, int startNumber, int destinationNumber){
+  public static int getShortestPath(Graph graph, int startNumber, int destinationNumber){
     PriorityQueue<Edge> priorityQueue = new PriorityQueue<>();
     int[] pathWeight = new int[graph.getAdjacencyListSize()];
     Arrays.fill(pathWeight, Integer.MAX_VALUE);
@@ -246,12 +247,12 @@ class Dijkstra{
       int currentSum = pathWeight[nextEdge.start()] + nextEdge.drivingTime();
       if(currentSum<pathWeight[nextNode]){
         pathWeight[nextNode] = currentSum;
-        pathToNodes[nextNode] = new ArrayList<>(pathToNodes[nextEdge.start()]);
-        pathToNodes[nextNode].add(nextEdge);
-        priorityQueue.addAll(graph.getAllEdgesFromNode(nextNode));
+        //pathToNodes[nextNode] = new ArrayList<>(pathToNodes[nextEdge.start()]);
+        //pathToNodes[nextNode].add(nextEdge);
+        //priorityQueue.addAll(graph.getAllEdgesFromNode(nextNode));
       }
     }
-    return pathToNodes[destinationNumber];
+    return  pathWeight[destinationNumber];//pathToNodes[destinationNumber];
   }
 
   /*public static ListOfPlaces getListOfPlaces(Graph graph, int startNumber,int numberOfPlaces, short type){