-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmy_mat.c
61 lines (50 loc) · 1.23 KB
/
my_mat.c
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
55
56
57
58
59
60
61
#include <stdio.h>
#include <math.h>
#define SIZE 10
int mat[SIZE][SIZE];
void floydWarshallAlgorithm(){
for (int k = 0; k < SIZE; k++)
{
for (int i = 0; i < SIZE; i++)
{
for (int j = 0; j < SIZE; j++)
{
if (mat[i][k] != 0 && mat[k][j] != 0 && i != j)
{
if (mat[i][j] == 0)
mat[i][j] = mat[i][k] + mat[k][j];
else
mat[i][j] = fmin(mat[i][j], mat[i][k] + mat[k][j]);
}
}
}
}
}
void makeMat()
{
int i, j;
for (i = 0; i < SIZE; i++)
{
for (j = 0; j < SIZE; j++)
if(scanf("%d", &mat[i][j])!=EOF);
}
floydWarshallAlgorithm();
}
void isConnect()
{
int i, j;
if(scanf("%d %d", &i, &j)!=EOF);
if (mat[i][j] == 0)
printf("False\n");
else
printf("True\n");
}
void shortestPath()
{
int i, j;
if(scanf("%d %d", &i, &j)!=EOF);
if (mat[i][j] == 0)
printf("-1\n");
else
printf("%d\n", mat[i][j]);
}