请用C语言写一个弗洛伊德算法
时间: 2023-12-29 20:07:52 浏览: 22
#include <stdio.h>
#define INF 99999
#define MAX_VERTICES 100
void floyd(int graph[MAX_VERTICES][MAX_VERTICES], int n) {
int dist[MAX_VERTICES][MAX_VERTICES];
int i, j, k;
// 初始化距离矩阵
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
dist[i][j] = graph[i][j];
}
}
// Floyd算法核心
for (k = 0; k < n; k++) {
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
// 输出结果
printf("距离矩阵:\n");
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (dist[i][j] == INF) {
printf("INF ");
} else {
printf("%d ", dist[i][j]);
}
}
printf("\n");
}
}
int main() {
int graph[MAX_VERTICES][MAX_VERTICES] = {
{0, INF, 5, INF},
{50, 0, INF, 15},
{30, INF, 0, 5},
{INF, 20, INF, 0}
};
floyd(graph, 4);
return 0;
}