Skip to content
This repository was archived by the owner on Feb 29, 2024. It is now read-only.

Commit 6b74ca7

Browse files
committed
change void to int[] wanted to return
1 parent 4087d56 commit 6b74ca7

File tree

1 file changed

+18
-15
lines changed

1 file changed

+18
-15
lines changed

dining.java

Lines changed: 18 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -2,37 +2,40 @@
22
import java.util.*;
33
public class dining {
44
static final int V=9;
5-
static int minDistance(int dist[], boolean[] sptSet) {
5+
static int minDistance(int dist[], boolean[] set1) {
66
int min = Integer.MAX_VALUE, min_index=-1; // Computers are too stupid to understand infinite
7-
87
for (int v = 0; v < V; v++)
9-
if (sptSet[v] == false && dist[v] <= min)
10-
{
8+
if (set1[v] == false && dist[v] <= min) {
119
min = dist[v];
1210
min_index = v;
1311
}
1412
return min_index;
1513
}
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) {
1716
int dist[] = new int[V];
18-
boolean sptSet[] = new boolean[V];
17+
boolean set1[] = new boolean[V];
1918
for (int i = 0; i < V; i++) {
2019
dist[i] = Integer.MAX_VALUE;
21-
sptSet[i] = false;
20+
set1[i] = false;
2221
}
23-
dist[src] = 0;
22+
dist[src] = 0;
2423
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;
2726
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]){
3128
dist[v] = dist[u] + graph[u][v];
32-
}
29+
}
30+
}
31+
return dist;
3332
}
3433
public static void main(String[] args) throws IOException{
3534
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+
3740
}
3841
}

0 commit comments

Comments
 (0)