Floyd算法（C++实现）

#include<iostream>
using namespace std;
#define MaxNumber 100
int **Number = new int*[MaxNumber];
int main() {
cout << "有向图的顶点数量：";
int row;
cin >> row;
cout << endl;
cout << "输入权重矩阵(用10000表示两点无法直接到达)：" << endl;
for (int i = 0; i < row; i++)
{
Number[i] = new int[MaxNumber];
}
for (int i = 0; i < row; i++)
{
for (int j = 0; j < row; j++)
{
cin >> Number[i][j];
}
}
cout << "----------------------------" << endl;
cout << "
数据录入完毕
" << endl;
cout << "----------------------------" << endl;
for (int i = 0; i < row; i++)
{
for (int j = 0; j < row; j++)
{
if (Number[j][i] != 0&&Number[j][i]!=10000) {
for (int m = 0; m < row; m++)
{
if (Number[i][m] != 0 && Number[i][m] != 10000) {
Number[j][m]=Number[j][m]>(Number[i][m]+Number[j][i])? (Number[i][m] + Number[j][i]): Number[j][m];
}
}
}
}
}
cout << "输出" << endl;
for (int i = 0; i < row; i++)
{
for (int j = 0; j < row; j++)
{
cout<<Number[i][j]<<" ";
}
cout << endl;
}
return
0;
}

最后

以上就是繁荣胡萝卜为你收集整理的Floyd算法（C++实现）的全部内容，希望文章能够帮你解决Floyd算法（C++实现）所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。