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;