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

Commit 2d558da

Browse files
committed
Java went weird
1 parent dd20141 commit 2d558da

File tree

2 files changed

+10
-3
lines changed

2 files changed

+10
-3
lines changed

.classpath

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<classpath>
3+
<classpathentry kind="src" path=""/>
4+
<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
5+
<classpathentry kind="output" path="bin"/>
6+
</classpath>

src/dining.java

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,10 @@
1-
import java.util.*;
21
import java.io.*;
2+
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[] sptSet) {
66
int min = Integer.MAX_VALUE, min_index=-1; // Computers are too stupid to understand infinite
7+
78
for (int v = 0; v < V; v++)
89
if (sptSet[v] == false && dist[v] <= min)
910
{
@@ -14,7 +15,7 @@ static int minDistance(int dist[], Boolean sptSet[]) {
1415
}
1516
static void dijkstra(int graph[][], int src) {
1617
int dist[] = new int[V];
17-
Boolean sptSet[] = new Boolean[V];
18+
boolean sptSet[] = new boolean[V];
1819
for (int i = 0; i < V; i++) {
1920
dist[i] = Integer.MAX_VALUE;
2021
sptSet[i] = false;

0 commit comments

Comments
 (0)