-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathcity.c
More file actions
executable file
·94 lines (74 loc) · 1.4 KB
/
Copy pathcity.c
File metadata and controls
executable file
·94 lines (74 loc) · 1.4 KB
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 1024
#define NAME_LENGTH 256
#define INFINITY 9999999
int matrix[MAX][MAX];
char name[MAX][NAME_LENGTH];
int vertex = 0;
int edge;
int getIndex(char *s) {
for (int i = 0; i < vertex; i++) {
if (strcmp(s, name[i]) == 0) {
return i;
}
}
strcpy(name[vertex++], s);
return vertex-1;
}
void buildMatrix() {
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX; j++) {
matrix[i][j] = INFINITY;
}
}
scanf("%d\n", &edge);
for (int i = 0; i < edge; i++) {
char s[NAME_LENGTH];
char t[NAME_LENGTH];
int cost;
scanf("%s %s %d\n", s, t, &cost);
int j = getIndex(s);
int k = getIndex(t);
if (j != -1 && k != -1) {
matrix[j][k] = cost;
matrix[k][j] = cost;
matrix[j][j] = 0;
matrix[k][k] = 0;
}
}
}
void printMatrix() {
for (int i = 0; i < vertex; i++) {
printf("\t%s", name[i]);
}
printf("\n");
for (int i = 0; i < vertex; i++) {
printf("%s\t", name[i]);
for (int j = 0; j < vertex; j++) {
printf("%d\t", matrix[i][j]);
}
printf("\n");
}
}
int min(int a, int b) {
if (a < b) return a;
return b;
}
void floyd() {
for (int t = 0; t < vertex; t++) {
for (int i = 0; i < vertex; i++) {
for (int j = 0; j < vertex; j++) {
matrix[i][j] = min(matrix[i][j], matrix[i][t] + matrix[t][j]);
}
}
}
}
int main() {
buildMatrix();
printMatrix();
floyd();
printMatrix();
}
//