Floyd算法（C++实现）

最新推荐文章于 2025-04-07 08:53:32 发布

原创最新推荐文章于 2025-04-07 08:53:32 发布 · 463 阅读

1 ·

CC 4.0 BY-SA版权

笔记专栏收录该内容

38 篇文章

订阅专栏

该程序实现了输入权重矩阵后，通过动态规划计算有向图中各顶点之间的最短路径。用户首先输入顶点数量，接着录入权重矩阵，程序会更新矩阵以找到最短路径，并最终输出结果。

#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;
}