|
2 | 2 | import java.util.*; |
3 | 3 | public class dining { |
4 | 4 | static final int V=9; |
5 | | - static int minDistance(int dist[], boolean[] sptSet) { |
| 5 | + static int minDistance(int dist[], boolean[] set1) { |
6 | 6 | int min = Integer.MAX_VALUE, min_index=-1; // Computers are too stupid to understand infinite |
7 | | - |
8 | 7 | for (int v = 0; v < V; v++) |
9 | | - if (sptSet[v] == false && dist[v] <= min) |
10 | | - { |
| 8 | + if (set1[v] == false && dist[v] <= min) { |
11 | 9 | min = dist[v]; |
12 | 10 | min_index = v; |
13 | 11 | } |
14 | 12 | return min_index; |
15 | 13 | } |
16 | | - static void dijkstra(int graph[][], int src) { |
| 14 | + final int OFFSET = -1; // Offset by 1 for adjancey matirix because index begins at 0 |
| 15 | + static int dijkstra(int graph[][], int src) { |
17 | 16 | int dist[] = new int[V]; |
18 | | - boolean sptSet[] = new boolean[V]; |
| 17 | + boolean set1[] = new boolean[V]; |
19 | 18 | for (int i = 0; i < V; i++) { |
20 | 19 | dist[i] = Integer.MAX_VALUE; |
21 | | - sptSet[i] = false; |
| 20 | + set1[i] = false; |
22 | 21 | } |
23 | | - dist[src] = 0; |
| 22 | + dist[src] = 0; |
24 | 23 | for (int count = 0; count < V-1; count++) { |
25 | | - int u = minDistance(dist, sptSet); |
26 | | - sptSet[u] = true; |
| 24 | + int u = minDistance(dist, set1); |
| 25 | + set1[u] = true; |
27 | 26 | for (int v = 0; v < V; v++) |
28 | | - if (!sptSet[v] && graph[u][v]!=0 && |
29 | | - dist[u] != Integer.MAX_VALUE && |
30 | | - dist[u]+graph[u][v] < dist[v]) |
| 27 | + if (!set1[v] && graph[u][v]!=0 && dist[u] != Integer.MAX_VALUE && dist[u]+graph[u][v] < dist[v]){ |
31 | 28 | dist[v] = dist[u] + graph[u][v]; |
32 | | - } |
| 29 | + } |
| 30 | + } |
| 31 | + return dist; |
33 | 32 | } |
34 | 33 | public static void main(String[] args) throws IOException{ |
35 | 34 | BufferedReader f = new BufferedReader(new FileReader("dining.in")); |
36 | | - |
| 35 | + StringTokenizer st = new StringTokenizer(f.readLine()); |
| 36 | + int N = Integer.parseInt(st.nextToken()); |
| 37 | + int M = Integer.parseInt(st.nextToken()); |
| 38 | + int K = Integer.parseInt(st.nextToken()); |
| 39 | + |
37 | 40 | } |
38 | 41 | } |
0 commit comments