-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFloydWarshall.java
54 lines (47 loc) · 1.25 KB
/
FloydWarshall.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
public class FloydWarshall {
final static int INF=99999;
int v=4;
void Floyd(int g[][]){
int d[][]=new int[v][v];
for (int i=0;i<v;i++)
{
for (int j=0;j<v;j++){
d[i][j]=g[i][j];
}
}
for (int k=0;k<v;k++){
for (int i=0;i<v;i++){
for (int j=0;j<v;j++){
if ((d[i][k]+d[k][j])<d[i][j]){
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
print(d);
}
void print(int d[][]){
for (int i=0;i<v;i++){
for (int j=0;j<v;j++){
if (d[i][j]==INF){
System.out.print("INF"+" ");
}else {
System.out.print(d[i][j]+" ");
}
}
System.out.println();
}
}
public static void main(String[] args) {
// int g[][]={ {0,5,INF,10},
// {INF,0,3,INF},
// {INF,INF,0,1},
// {INF,INF,INF,0}};
int g[][]={{0,3,INF,7},
{8,0,2,INF},
{5,INF,0,1},
{2,INF,INF,0}};
FloydWarshall fw=new FloydWarshall();
fw.Floyd(g);
}
}