void floyd() {
for (int k=1; k<=n; ++k) {
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j) {
if (i == j || i == k || j == k) continue; //避免不必要的判断 提高程序效率
else g[i][j] = min(g[i][j], g[i][k]+g[k][j]);
}
}
}
}
单源最短路径--floyd算法
猜你喜欢
转载自blog.csdn.net/ASJBFJSB/article/details/103284594
今日推荐
周排行