Warshall算法（C++实现）

#include<iostream>
using namespace std;
#define MaxNumber 100
int **Number = new int*[MaxNumber];
int main() {
	cout << "有向图的顶点数量：";
	int row;
	cin >> row;
	cout << endl;
	cout << "输入邻接矩阵："<<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] == 1) {
				for (int m = 0; m < row; m++)
				{	
					Number[j][m] += Number[i][m];
					if (Number[j][m] == 2) {
						Number[j][m] = 1;
					}
				}
			}
		}
	}
	cout << "输出传递闭包" << endl;
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < row; j++)
		{
			cout<<Number[i][j]<<" ";
		}
		cout << endl;
	}
	return  0;
}