tests

src/Graph.java

@@ -86,7 +86,7 @@ class Graph {
     }
 
     public Edge getShortestPathALT(int startNumber, int destinationNumber) throws Exception {
-        PriorityQueue<Edge> priorityQueue = new PriorityQueue<>(new Comparators.AltComparator(Utils.fileToArray("testOslo.txt",adjacencyList.size()),3430400));
+        PriorityQueue<Edge> priorityQueue = new PriorityQueue<>(new Comparators.AltComparator(Utils.fileToArray("testOsloNew.txt",adjacencyList.size()),3430400));
         int nodeSize = adjacencyList.size();
         int[] pathWeight = new int[nodeSize];
         Arrays.fill(pathWeight, Integer.MAX_VALUE);

src/Main.java

@@ -6,21 +6,13 @@ public class Main {
     try {
       Graph g = new Graph("noder.txt");
       g.loadEdges("kanter.txt");
-      g.loadNodes("nodes.txt");
-      Edge lastEdge= g.getShortestPath(4247796,232073);
+      Edge lastEdge= g.getShortestPathALT(4247796,232073);
       int sum = 0;
-      List<Integer> destinations = new ArrayList<>();
       while (lastEdge!=null) {
-        destinations.add(lastEdge.getDestination());
+        System.out.println(lastEdge.getDestination());
         sum += lastEdge.drivingTime;
         lastEdge = lastEdge.previousEdge;
       }
-      List<Node> nodes = g.getNodes();
-      for (Integer destination: destinations) {
-        Node node  = nodes.get(destination);
-        System.out.println(node.getLatitude() +","+node.getLongitude());
-      }
-      System.out.println(nodes.get(4247796).getLatitude()+","+nodes.get(4247796).getLongitude());
       System.out.println(4247796);
       System.out.println("-------------------------------------------");
       System.out.println(Utils.formatTime(sum));