Floyed的框架（最短路）

shadowcase

已于 2024-06-28 12:37:23 修改

阅读量330

点赞数 9

文章标签： c语言图搜索算法

于 2024-06-28 12:36:43 首次发布

本文链接：https://blog.csdn.net/2301_80279904/article/details/140040017

版权

时间复杂度为O( $eq?n%5E%7B3%7D$ )

#define maxn 101
#define edgetype int
#define inf INT_MAX


void initedges(edgetype graph[maxn][maxn], int n)
{
    int i, j;
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < n; j++)
        {
            graph[i][j] = (i == j ? 0 : inf);
        }
    }
}

void addedges(edgetype graph[maxn][maxn], int u, int v, edgetype w)
{
    if (graph[u][v] == inf || w < graph[u][v])
    {
        graph[u][v] = w;
    }
}

void floyedwarshall(edgetype graph[maxn][maxn], int n)
{
    int i, j, k;
    for (k = 0; k < n; k++)
    {
        for (i = 0; i < n; i++)
        {
            if (k == i)
            {
                continue;
            }
            for (j = 0; j < n; j++)
            {
                if (k == j)
                {
                    continue;
                }
                if (graph[i][k] == inf || graph[k][j] == inf)
                {
                    continue;
                }
                if (graph[i][k] + graph[k][j] < graph[i][j])
                {
                    graph[i][j] = graph[i][k] + graph[k][j];
                }
            }
        }
    }
}