title: 最短路Floyd
categories:

  • ICPC
    tags:
  • null
    abbrlink: efc5e5e7
    date: 2023-03-21 00:00:00
void floyd()
{

    for (int k = 1; k <= n; k ++ )
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= n; j ++ )
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
init(){
 for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= n; j ++ )
            if (i == j) d[i][j] = 0;
            else d[i][j] = INF;
}
存边方式： d[a][b] = min(d[a][b], w);
# 如果是无向边需要加d[b][a]