compression.diff

--- input/input.java
+++ output/output.java
@@ -60,66 +60,8 @@
     public void go() {
         // shows distance to all vertices
         // Interactive run for understanding the
-        // class first time. Assumes source vertex is 0 and
-        try (Scanner sc = new Scanner(System.in)) {
-            int i;
-            int v;
-            int e;
-            int u;
-            int ve;
-            int w;
-            int j;
-            int neg = 0;
-            System.out.println("Enter no. of vertices and edges please");
-            v = sc.nextInt();
-            e = sc.nextInt();
-            Edge[] arr = new Edge[e]; // Array of edges
-            System.out.println("Input edges");
-            for (i = 0; i < e; i++) {
-                u = sc.nextInt();
-                ve = sc.nextInt();
-                w = sc.nextInt();
-                arr[i] = new Edge(u, ve, w);
-            }
-            int[] dist = new int[v]; // Distance array for holding the finalized shortest path distance
-                                     // between source
-            // and all vertices
-            int[] p = new int[v]; // Parent array for holding the paths
-            for (i = 0; i < v; i++) {
-                dist[i] = Integer.MAX_VALUE; // Initializing distance values
-            }
-            dist[0] = 0;
-            p[0] = -1;
-            for (i = 0; i < v - 1; i++) {
-                for (j = 0; j < e; j++) {
-                    if (dist[arr[j].u] != Integer.MAX_VALUE && dist[arr[j].v] > dist[arr[j].u] + arr[j].w) {
-                        dist[arr[j].v] = dist[arr[j].u] + arr[j].w; // Update
-                        p[arr[j].v] = arr[j].u;
-                    }
-                }
-            }
-            // Final cycle for negative checking
-            for (j = 0; j < e; j++) {
-                if (dist[arr[j].u] != Integer.MAX_VALUE && dist[arr[j].v] > dist[arr[j].u] + arr[j].w) {
-                    neg = 1;
-                    System.out.println("Negative cycle");
-                    break;
-                }
-            }
-            if (neg == 0) { // Go ahead and show results of computation
-                System.out.println("Distances are: ");
-                for (i = 0; i < v; i++) {
-                    System.out.println(i + " " + dist[i]);
-                }
-                System.out.println("Path followed:");
-                for (i = 0; i < v; i++) {
-                    System.out.print("0 ");
-                    printPath(p, i);
-                    System.out.println();
-                }
-            }
+        { … 58 line(s) … ⟦tj:d71d045ee7d9955563c90bbd81269834⟧ }
         }
-    }
 
     /**
      * @param source Starting vertex
@@ -130,44 +72,8 @@
         Edge[] arr) { // be created by using addEdge() method and passed by calling getEdgeArray()
                       // method // Just shows results of computation, if graph is passed to it. The
                       // graph should
-        int i;
-        int j;
-        int v = vertex;
-        int e = edge;
-        int neg = 0;
-        double[] dist = new double[v]; // Distance array for holding the finalized shortest path
-                                       // distance between source
-        // and all vertices
-        int[] p = new int[v]; // Parent array for holding the paths
-        for (i = 0; i < v; i++) {
-            dist[i] = Integer.MAX_VALUE; // Initializing distance values
+                      { … 36 line(s) … ⟦tj:393fa203f1efbb22cd2130cc6b6a4b8f⟧ }
         }
-        dist[source] = 0;
-        p[source] = -1;
-        for (i = 0; i < v - 1; i++) {
-            for (j = 0; j < e; j++) {
-                if ((int) dist[arr[j].u] != Integer.MAX_VALUE && dist[arr[j].v] > dist[arr[j].u] + arr[j].w) {
-                    dist[arr[j].v] = dist[arr[j].u] + arr[j].w; // Update
-                    p[arr[j].v] = arr[j].u;
-                }
-            }
-        }
-        // Final cycle for negative checking
-        for (j = 0; j < e; j++) {
-            if ((int) dist[arr[j].u] != Integer.MAX_VALUE && dist[arr[j].v] > dist[arr[j].u] + arr[j].w) {
-                neg = 1;
-                System.out.println("Negative cycle");
-                break;
-            }
-        }
-        if (neg == 0) { // Go ahead and show results of computation
-            System.out.println("Distance is: " + dist[end]);
-            System.out.println("Path followed:");
-            System.out.print(source + " ");
-            printPath(p, end);
-            System.out.println();
-        }
-    }
 
     /**
      * @param x Source Vertex
@@ -182,3 +88,6 @@
         return edges;
     }
 }
+[omitted blocks are individually retrievable: call tinyjuice_retrieve with the token inside an omission marker to expand just that block]
+
+[PARTIAL view — full original (6103 bytes): call tinyjuice_retrieve with token "9311b1cc15f9435d5f5e7dec82957066"]
\ No newline at end of file