Floyd-Warshall算法--求任意两点最短距离

Floyd-Warshall算法

要求

思路

代码

#include <stdio.h>

#define N 5
#define M 5

#define X 99999999

int a
[M] = {
{ 0,  0,  0,  0,  0},
{ 0,  0,  2,  6,  4},
{ 0,  X,  0,  3,  X},
{ 0,  7,  X,  0,  1},
{ 0,  5,  X, 12,  0}
};

void print_a() {
for (int i = 0; i < N; ++i)
{
for (int j = 0; j < M; ++j)
{
printf("%3d ", a[i][j]);
}
printf("\n");
}
printf("\n");
}

int main() {

for (int k = 1; k < M; ++k)
{
for (int i = 1; i < N; ++i)
{
for (int j = 1; j < M; ++j)
{
if (a[i][k] + a[k][j] < a[i][j]) {
a[i][j] = a[i][k] + a[k][j];
print_a();
}
}
}
}
return 0;
}

时间复杂度