Git crashed so I had to redo some stuff

Author: javaarchive

.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>Java</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

src/dining.java

@@ -2,65 +2,36 @@
 import java.io.*;
 public class dining {
 	static final int V=9; 
-    int minDistance(int dist[], Boolean sptSet[]) 
-    { 
-        
-        int min = Integer.MAX_VALUE, min_index=-1; 
-  
+    static int minDistance(int dist[], Boolean sptSet[])  { 
+        int min = Integer.MAX_VALUE, min_index=-1; // Computers are too stupid to understand infinite
         for (int v = 0; v < V; v++) 
             if (sptSet[v] == false && dist[v] <= min) 
             { 
                 min = dist[v]; 
                 min_index = v; 
             } 
-  
         return min_index; 
     } 
-    void printSolution(int dist[], int n) 
-    { 
-        System.out.println("Vertex   Distance from Source"); 
-        for (int i = 0; i < V; i++) 
-            System.out.println(i+" tt "+dist[i]); 
-    } 
-  
-    void dijkstra(int graph[][], int src) 
-    { 
+    static void dijkstra(int graph[][], int src) { 
         int dist[] = new int[V]; 
-  
         Boolean sptSet[] = new Boolean[V]; 
-        for (int i = 0; i < V; i++) 
-        { 
+        for (int i = 0; i < V; i++) { 
             dist[i] = Integer.MAX_VALUE; 
             sptSet[i] = false; 
         } 
-  
-       
         dist[src] = 0; 
-        for (int count = 0; count < V-1; count++) 
-        { 
-           
-            int u = minDistance(dist, sptSet); 
-  
-           
-            sptSet[u] = true; 
-  
-           
-            for (int v = 0; v < V; v++) 
-  
-               
-                
+        for (int count = 0; count < V-1; count++) { 
+            int u = minDistance(dist, sptSet);          
+            sptSet[u] = true;            
+            for (int v = 0; v < V; v++)    
                 if (!sptSet[v] && graph[u][v]!=0 && 
                         dist[u] != Integer.MAX_VALUE && 
                         dist[u]+graph[u][v] < dist[v]) 
                     dist[v] = dist[u] + graph[u][v]; 
-        } 
-  
-        
-        printSolution(dist, V); 
+        }           
     } 
 	public static void main(String[] args) {
 		BufferedReader f = new BufferedReader();
 
 	}
-
 }